let X, Y be non empty set ; :: thesis: for T being Function of X,Y
for S being SigmaField of X
for M being sigma_Measure of S st T is bijective & M is sigma_finite holds
CopyMeasure (T,M) is sigma_finite

let T be Function of X,Y; :: thesis: for S being SigmaField of X
for M being sigma_Measure of S st T is bijective & M is sigma_finite holds
CopyMeasure (T,M) is sigma_finite

let S be SigmaField of X; :: thesis: for M being sigma_Measure of S st T is bijective & M is sigma_finite holds
CopyMeasure (T,M) is sigma_finite

let M be sigma_Measure of S; :: thesis: ( T is bijective & M is sigma_finite implies CopyMeasure (T,M) is sigma_finite )
assume A1: ( T is bijective & M is sigma_finite ) ; :: thesis: CopyMeasure (T,M) is sigma_finite
then consider E being Set_Sequence of S such that
A2: ( ( for n being Nat holds M . (E . n) < +infty ) & Union E = X ) by MEASUR11:def 12;
set M1 = CopyMeasure (T,M);
set S1 = CopyField (T,S);
.: T is bijective by A1, MEASUR14:1;
then A3: ( .: T is one-to-one & .: T is onto ) ;
reconsider E1 = ((.: T) | S) * E as Set_Sequence of CopyField (T,S) by A1, Th82;
A4: for n being Nat holds (CopyMeasure (T,M)) . (E1 . n) < +infty
proof
let n be Nat; :: thesis: (CopyMeasure (T,M)) . (E1 . n) < +infty
A5: M . (E . n) < +infty by A2;
consider t being Element of S such that
A6: ( E1 . n = T .: t & (CopyMeasure (T,M)) . (E1 . n) = M . t ) by A1, MEASUR14:def 4;
n in NAT by ORDINAL1:def 12;
then n in dom E by FUNCT_2:def 1;
then E1 . n = ((.: T) | S) . (E . n) by FUNCT_1:13;
then A7: E1 . n = (.: T) . (E . n) by FUNCT_1:49;
A8: T .: t = (.: T) . t by A1, MEASUR14:1;
( t in bool X & E . n in bool X ) ;
then ( t in dom (.: T) & E . n in dom (.: T) ) by FUNCT_2:def 1;
hence (CopyMeasure (T,M)) . (E1 . n) < +infty by A3, A6, A7, A8, A5; :: thesis: verum
end;
for z being object holds
( z in Union E1 iff z in Y )
proof
let z be object ; :: thesis: ( z in Union E1 iff z in Y )
thus ( z in Union E1 implies z in Y ) ; :: thesis: ( z in Y implies z in Union E1 )
assume z in Y ; :: thesis: z in Union E1
then z in rng T by A1, FUNCT_2:def 3;
then consider t being object such that
A9: ( t in dom T & z = T . t ) by FUNCT_1:def 3;
t in X by A9;
then t in union (rng E) by A2, CARD_3:def 4;
then consider En being set such that
A10: ( t in En & En in rng E ) by TARSKI:def 4;
consider n being object such that
A11: ( n in dom E & En = E . n ) by A10, FUNCT_1:def 3;
A12: n in NAT by A11;
reconsider n = n as Nat by A11;
A13: z in T .: En by A9, A10, FUNCT_1:def 6;
T .: En = (.: T) . (E . n) by A11, A1, MEASUR14:1;
then T .: En = ((.: T) | S) . (E . n) by FUNCT_1:49;
then A14: T .: En = E1 . n by A11, FUNCT_1:13;
set E1n = E1 . n;
n in dom E1 by A12, FUNCT_2:def 1;
then E1 . n in rng E1 by FUNCT_1:3;
then z in union (rng E1) by A13, A14, TARSKI:def 4;
hence z in Union E1 by CARD_3:def 4; :: thesis: verum
end;
hence CopyMeasure (T,M) is sigma_finite by A4, MEASUR11:def 12, TARSKI:2; :: thesis: verum