let Omega be non empty finite set ; :: thesis: for M being sigma_Measure of (Trivial-SigmaField Omega)
for f being Function of Omega,REAL
for x being FinSequence of ExtREAL
for s being FinSequence of Omega st M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega holds
ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

let M be sigma_Measure of (Trivial-SigmaField Omega); :: thesis: for f being Function of Omega,REAL
for x being FinSequence of ExtREAL
for s being FinSequence of Omega st M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega holds
ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

let f be Function of Omega,REAL ; :: thesis: for x being FinSequence of ExtREAL
for s being FinSequence of Omega st M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega holds
ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

let x be FinSequence of ExtREAL ; :: thesis: for s being FinSequence of Omega st M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega holds
ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

let s be FinSequence of Omega; :: thesis: ( M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega implies ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) ) )

assume AS: ( M . Omega < +infty & s is one-to-one & rng s = Omega & len s = card Omega ) ; :: thesis: ex F being Finite_Sep_Sequence of Trivial-SigmaField Omega ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

set Sigma = Trivial-SigmaField Omega;
defpred S1[ Nat, set ] means $2 = {(s . $1)};
set L = len s;
P1: for k being Nat st k in Seg (len s) holds
ex x being Element of bool Omega st S1[k,x]
proof
let k be Nat; :: thesis: ( k in Seg (len s) implies ex x being Element of bool Omega st S1[k,x] )
assume k in Seg (len s) ; :: thesis: ex x being Element of bool Omega st S1[k,x]
then k in dom s by FINSEQ_1:def 3;
then PP1PP: s . k in rng s by FUNCT_1:12;
take {(s . k)} ; :: thesis: ( {(s . k)} is Element of bool Omega & S1[k,{(s . k)}] )
thus ( {(s . k)} is Element of bool Omega & S1[k,{(s . k)}] ) by PP1PP, ZFMISC_1:37; :: thesis: verum
end;
consider F being FinSequence of bool Omega such that
P2: ( dom F = Seg (len s) & ( for k being Nat st k in Seg (len s) holds
S1[k,F . k] ) ) from FINSEQ_1:sch 5(P1);
defpred S2[ Nat, set ] means $2 = f . (s . $1);
R1: for k being Nat st k in Seg (len s) holds
ex x being Element of REAL st S2[k,x] ;
consider a being FinSequence of REAL such that
Q2: ( dom a = Seg (len s) & ( for k being Nat st k in Seg (len s) holds
S2[k,a . k] ) ) from FINSEQ_1:sch 5(R1);
Q1: dom F = dom s by P2, FINSEQ_1:def 3;
now
let i, j be Nat; :: thesis: ( i in dom F & j in dom F & i <> j implies F . i misses F . j )
assume A1: ( i in dom F & j in dom F & i <> j ) ; :: thesis: F . i misses F . j
A4: ( i in dom s & j in dom s ) by FINSEQ_1:def 3, A1, P2;
PA3: s . i <> s . j by A1, A4, FUNCT_1:def 8, AS;
( F . i = {(s . i)} & F . j = {(s . j)} ) by A1, P2;
hence F . i misses F . j by ZFMISC_1:17, PA3; :: thesis: verum
end;
then reconsider F = F as Finite_Sep_Sequence of Trivial-SigmaField Omega by MESFUNC3:4;
take F ; :: thesis: ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) )

union (rng F) = rng s
proof
now
let x be set ; :: thesis: ( x in union (rng F) implies x in rng s )
assume x in union (rng F) ; :: thesis: x in rng s
then consider y being set such that
A2: ( x in y & y in rng F ) by TARSKI:def 4;
consider n being set such that
A3: ( n in dom F & y = F . n ) by A2, FUNCT_1:def 5;
F . n = {(s . n)} by A3, P2;
then A5: x = s . n by A2, A3, TARSKI:def 1;
n in dom s by P2, A3, FINSEQ_1:def 3;
hence x in rng s by FUNCT_1:def 5, A5; :: thesis: verum
end;
hence union (rng F) c= rng s by TARSKI:def 3; :: according to XBOOLE_0:def 10 :: thesis: rng s c= union (rng F)
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in rng s or x in union (rng F) )
assume x in rng s ; :: thesis: x in union (rng F)
then consider n being set such that
A5: ( n in dom s & x = s . n ) by FUNCT_1:def 5;
A4: n in Seg (len s) by A5, FINSEQ_1:def 3;
reconsider n = n as Element of NAT by A5;
A3: n in dom F by P2, A5, FINSEQ_1:def 3;
x in {(s . n)} by A5, TARSKI:def 1;
then A2: x in F . n by P2, A4;
F . n in rng F by A3, FUNCT_1:def 5;
hence x in union (rng F) by A2, TARSKI:def 4; :: thesis: verum
end;
then P3: dom f = union (rng F) by AS, FUNCT_2:def 1;
for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y
proof
let n be Nat; :: thesis: for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y

let x, y be Element of Omega; :: thesis: ( n in dom F & x in F . n & y in F . n implies f . x = f . y )
assume AS1: ( n in dom F & x in F . n & y in F . n ) ; :: thesis: f . x = f . y
P41: F . n = {(s . n)} by P2, AS1;
thus f . x = f . (s . n) by P41, AS1, TARSKI:def 1
.= f . y by P41, AS1, TARSKI:def 1 ; :: thesis: verum
end;
hence ex a being FinSequence of REAL st
( dom f = union (rng F) & dom a = dom s & dom F = dom s & ( for k being Nat st k in dom F holds
F . k = {(s . k)} ) & ( for n being Nat
for x, y being Element of Omega st n in dom F & x in F . n & y in F . n holds
f . x = f . y ) ) by Q1, P2, P3, Q2; :: thesis: verum