let X, Y be non empty set ; :: thesis: for S being SigmaField of X
for T being Function of X,Y
for F being Set_Sequence of S st T is bijective holds
((.: T) | S) * F is Set_Sequence of CopyField (T,S)

let S be SigmaField of X; :: thesis: for T being Function of X,Y
for F being Set_Sequence of S st T is bijective holds
((.: T) | S) * F is Set_Sequence of CopyField (T,S)

let T be Function of X,Y; :: thesis: for F being Set_Sequence of S st T is bijective holds
((.: T) | S) * F is Set_Sequence of CopyField (T,S)

let F be Set_Sequence of S; :: thesis: ( T is bijective implies ((.: T) | S) * F is Set_Sequence of CopyField (T,S) )
assume A1: T is bijective ; :: thesis: ((.: T) | S) * F is Set_Sequence of CopyField (T,S)
set H = (.: T) | S;
rng ((.: T) | S) = (.: T) .: S by RELAT_1:115;
then A2: rng ((.: T) | S) = CopyField (T,S) by A1, MEASUR14:def 2;
dom ((.: T) | S) = S by FUNCT_2:def 1;
then reconsider H = (.: T) | S as Function of S,(CopyField (T,S)) by A2, FUNCT_2:1;
rng F c= S
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in rng F or z in S )
assume z in rng F ; :: thesis: z in S
then consider t being object such that
A3: ( t in dom F & z = F . t ) by FUNCT_1:def 3;
reconsider t = t as Nat by A3;
F . t in S ;
hence z in S by A3; :: thesis: verum
end;
then rng F c= dom H by FUNCT_2:def 1;
then dom (H * F) = dom F by RELAT_1:27;
then A4: dom (H * F) = NAT by FUNCT_2:def 1;
rng (H * F) c= CopyField (T,S) ;
then reconsider HF = H * F as Function of NAT,(CopyField (T,S)) by A4, FUNCT_2:2;
rng HF c= bool Y ;
then reconsider HF = HF as SetSequence of Y by FUNCT_2:6;
for n being Nat holds HF . n in CopyField (T,S)
proof
let n be Nat; :: thesis: HF . n in CopyField (T,S)
HF . n = H . (F . n) by A4, FUNCT_1:12, ORDINAL1:def 12;
hence HF . n in CopyField (T,S) ; :: thesis: verum
end;
hence ((.: T) | S) * F is Set_Sequence of CopyField (T,S) by MEASURE8:def 2; :: thesis: verum