let X, Y be non empty set ; :: thesis: for F being Function of X,Y
for S being Subset-Family of X st F is bijective holds
(.: F) .: (sigma S) = sigma ((.: F) .: S)

let F be Function of X,Y; :: thesis: for S being Subset-Family of X st F is bijective holds
(.: F) .: (sigma S) = sigma ((.: F) .: S)

let S be Subset-Family of X; :: thesis: ( F is bijective implies (.: F) .: (sigma S) = sigma ((.: F) .: S) )
assume A1: F is bijective ; :: thesis: (.: F) .: (sigma S) = sigma ((.: F) .: S)
then reconsider G = (.: F) .: (sigma S) as SigmaField of Y by Th16;
set K = (.: F) .: S;
A2: S c= sigma S by PROB_1:def 9;
for Z being set st (.: F) .: S c= Z & Z is SigmaField of Y holds
G c= Z
proof
let Z be set ; :: thesis: ( (.: F) .: S c= Z & Z is SigmaField of Y implies G c= Z )
assume that
A3: (.: F) .: S c= Z and
A4: Z is SigmaField of Y ; :: thesis: G c= Z
A5: Z c= bool Y by A4;
A6: ( F is one-to-one & rng F = Y ) by A1, FUNCT_2:def 3;
then reconsider H = F " as Function of Y,X by FUNCT_2:25;
rng H = dom F by A1, FUNCT_1:33;
then A7: H is onto by FUNCT_2:def 1;
A8: dom F = X by FUNCT_2:def 1;
A9: (.: F) .: ((.: H) .: Z) = ((.: F) * (.: H)) .: Z by RELAT_1:126
.= (.: (F * H)) .: Z by FUNCT_3:18
.= (.: (id Y)) .: Z by A6, FUNCT_1:39
.= (id (bool Y)) .: Z by Th15
.= Z by A4, FUNCT_1:92 ;
( Z <> {} & Z c= dom (.: H) ) by A4, A5, FUNCT_2:def 1;
then reconsider L = (.: H) .: Z as non empty set ;
A10: (.: H) .: ((.: F) .: S) c= (.: H) .: Z by A3, RELAT_1:123;
(.: H) .: ((.: F) .: S) = ((.: H) * (.: F)) .: S by RELAT_1:126
.= (.: (H * F)) .: S by FUNCT_3:18
.= (.: (id X)) .: S by A8, A1, FUNCT_1:39
.= (id (bool X)) .: S by Th15 ;
then A11: S c= L by A10, FUNCT_1:92;
L is SigmaField of X by A1, A4, A7, Th16;
then sigma S c= L by A11, PROB_1:def 9;
hence G c= Z by A9, RELAT_1:123; :: thesis: verum
end;
hence (.: F) .: (sigma S) = sigma ((.: F) .: S) by A2, RELAT_1:123, PROB_1:def 9; :: thesis: verum