let X, Y be set ; :: thesis: for f being Function st rng f c= Funcs X,Y holds
for i, A being set st i in X holds
((commute f) . i) .: A = pi (f .: A),i
let f be Function; :: thesis: ( rng f c= Funcs X,Y implies for i, A being set st i in X holds
((commute f) . i) .: A = pi (f .: A),i )
assume A1:
rng f c= Funcs X,Y
; :: thesis: for i, A being set st i in X holds
((commute f) . i) .: A = pi (f .: A),i
A2:
f is Function-yielding
A3:
f in Funcs (dom f),(Funcs X,Y)
by A1, FUNCT_2:def 2;
let i, A be set ; :: thesis: ( i in X implies ((commute f) . i) .: A = pi (f .: A),i )
assume A4:
i in X
; :: thesis: ((commute f) . i) .: A = pi (f .: A),i
per cases
( dom f = {} or dom f <> {} )
;
suppose
dom f <> {}
;
:: thesis: ((commute f) . i) .: A = pi (f .: A),ithen
commute f in Funcs X,
(Funcs (dom f),Y)
by A3, A4, FUNCT_6:85;
then
ex
g being
Function st
(
commute f = g &
dom g = X &
rng g c= Funcs (dom f),
Y )
by FUNCT_2:def 2;
hence
((commute f) . i) .: A c= pi (f .: A),
i
by A2, A4, Th6;
:: according to XBOOLE_0:def 10 :: thesis: pi (f .: A),i c= ((commute f) . i) .: Ahence
pi (f .: A),
i c= ((commute f) . i) .: A
by A2, Th7;
:: thesis: verum end; end;