let s be Nat; :: thesis: for w being Rational holds { f where f is s -element natural-valued non-decreasing positive FinSequence : Sum (f ") = w } is finite
let w be Rational; :: thesis: { f where f is s -element natural-valued non-decreasing positive FinSequence : Sum (f ") = w } is finite
deffunc H2( Nat, Rational) -> set = { f where f is $1 -element natural-valued non-decreasing positive FinSequence : Sum (f ") = $2 } ;
defpred S1[ Nat] means for q being Rational holds H2($1,q) is finite ;
A1: S1[ 0 ]
proof
let q be Rational; :: thesis: H2( 0 ,q) is finite
H2( 0 ,q) c= {{}}
proof
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in H2( 0 ,q) or a in {{}} )
assume a in H2( 0 ,q) ; :: thesis: a in {{}}
then ex f being 0 -element natural-valued non-decreasing positive FinSequence st
( a = f & Sum (f ") = q ) ;
hence a in {{}} by TARSKI:def 1; :: thesis: verum
end;
hence H2( 0 ,q) is finite ; :: thesis: verum
end;
A2: for s being Nat st S1[s] holds
S1[s + 1]
proof
let s be Nat; :: thesis: ( S1[s] implies S1[s + 1] )
assume A3: S1[s] ; :: thesis: S1[s + 1]
let u be Rational; :: thesis: H2(s + 1,u) is finite
set ONE = { <*(f . 1)*> where f is s + 1 -element natural-valued positive FinSequence : f in H2(s + 1,u) } ;
{ <*(f . 1)*> where f is s + 1 -element natural-valued positive FinSequence : f in H2(s + 1,u) } is FinSequence-membered
proof
let a be object ; :: according to FINSEQ_1:def 19 :: thesis: ( not a in { <*(f . 1)*> where f is s + 1 -element natural-valued positive FinSequence : f in H2(s + 1,u) } or a is set )
assume a in { <*(f . 1)*> where f is s + 1 -element natural-valued positive FinSequence : f in H2(s + 1,u) } ; :: thesis: a is set
then ex f being s + 1 -element natural-valued positive FinSequence st
( a = <*(f . 1)*> & f in H2(s + 1,u) ) ;
hence a is set ; :: thesis: verum
end;
then reconsider ONE = { <*(f . 1)*> where f is s + 1 -element natural-valued positive FinSequence : f in H2(s + 1,u) } as FinSequence-membered set ;
H2(s + 1,u) is FinSequence-membered
proof
let a be object ; :: according to FINSEQ_1:def 19 :: thesis: ( not a in H2(s + 1,u) or a is set )
assume a in H2(s + 1,u) ; :: thesis: a is set
then ex f being s + 1 -element natural-valued non-decreasing positive FinSequence st
( a = f & Sum (f ") = u ) ;
hence a is set ; :: thesis: verum
end;
then reconsider As1u = H2(s + 1,u) as FinSequence-membered set ;
As1u is NAT -FinSequence-membered
proof end;
then reconsider As1u = As1u as NAT -FinSequence-membered set ;
set DE = decomp As1u;
reconsider p1 = rng (OneFS (proj1 (decomp As1u))) as FinSequence-membered set ;
set p2 = proj2 (decomp As1u);
proj2 (decomp As1u) is FinSequence-membered
proof
let a be object ; :: according to FINSEQ_1:def 19 :: thesis: ( not a in proj2 (decomp As1u) or a is set )
assume a in proj2 (decomp As1u) ; :: thesis: a is set
then consider x being object such that
A4: [x,a] in decomp As1u by XTUPLE_0:def 13;
ex f being FinSequence of NAT st
( a = f & <*x*> ^ f in As1u ) by A4, Def10;
hence a is set ; :: thesis: verum
end;
then reconsider p2 = proj2 (decomp As1u) as FinSequence-membered set ;
A5: dom (OneFS (proj1 (decomp As1u))) = proj1 (decomp As1u) by PARTFUN1:def 2;
A6: H2(s + 1,u) c= p1 ^^ p2
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in H2(s + 1,u) or z in p1 ^^ p2 )
assume A7: z in H2(s + 1,u) ; :: thesis: z in p1 ^^ p2
then consider f being s + 1 -element natural-valued non-decreasing positive FinSequence such that
A8: z = f and
Sum (f ") = u ;
set p = f . 1;
set q = Del (f,1);
A9: f = <*(f . 1)*> ^ (Del (f,1)) by FINSEQ_5:86;
A10: f . 1 in NAT by ORDINAL1:def 12;
Del (f,1) is FinSequence of NAT by FINSEQ_1:103;
then A11: [(f . 1),(Del (f,1))] in decomp As1u by A7, A8, A9, A10, Def10;
then A12: f . 1 in proj1 (decomp As1u) by XTUPLE_0:def 12;
then (OneFS (proj1 (decomp As1u))) . (f . 1) = <*(f . 1)*> by Def11;
then A13: <*(f . 1)*> in p1 by A5, A12, FUNCT_1:def 3;
Del (f,1) in p2 by A11, XTUPLE_0:def 13;
hence z in p1 ^^ p2 by A8, A9, A13; :: thesis: verum
end;
defpred S2[ object ] means verum;
set XXX = { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } ;
A14: { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } is finite from XXREAL_2:sch 1();
A15: ONE c= { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) }
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in ONE or x in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } )
assume x in ONE ; :: thesis: x in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) }
then consider f being s + 1 -element natural-valued positive FinSequence such that
A16: x = <*(f . 1)*> and
A17: f in H2(s + 1,u) ;
A18: ex f1 being s + 1 -element natural-valued non-decreasing positive FinSequence st
( f = f1 & Sum (f1 ") = u ) by A17;
reconsider i = f . 1 as Element of INT by INT_1:def 2;
A19: f . 1 <= (s + 1) / u by A18, Th110;
((s + 1) / u) - 1 < [\((s + 1) / u)/] by INT_1:def 6;
then (((s + 1) / u) - 1) + 1 < [\((s + 1) / u)/] + 1 by XREAL_1:6;
then i <= [\((s + 1) / u)/] + 1 by A19, XXREAL_0:2;
hence x in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } by A16; :: thesis: verum
end;
A20: p1 c= { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) }
proof
let y be object ; :: according to TARSKI:def 3 :: thesis: ( not y in p1 or y in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } )
assume y in p1 ; :: thesis: y in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) }
then consider x being object such that
A21: x in dom (OneFS (proj1 (decomp As1u))) and
A22: (OneFS (proj1 (decomp As1u))) . x = y by FUNCT_1:def 3;
consider z being object such that
A23: [x,z] in decomp As1u by A21, XTUPLE_0:def 12;
consider f being FinSequence of NAT such that
z = f and
A24: <*x*> ^ f in As1u by A23, Def10;
consider g being s + 1 -element natural-valued non-decreasing positive FinSequence such that
A25: g = <*x*> ^ f and
A26: Sum (g ") = u by A24;
A27: <*x*> is NAT -valued by A25, BAGORD_2:7;
then reconsider x = x as Element of INT by Th3;
A28: 0 <= x by A27;
g . 1 = x by A25;
then A29: x <= (s + 1) / u by A26, Th110;
((s + 1) / u) - 1 < [\((s + 1) / u)/] by INT_1:def 6;
then (((s + 1) / u) - 1) + 1 < [\((s + 1) / u)/] + 1 by XREAL_1:6;
then x <= [\((s + 1) / u)/] + 1 by A29, XXREAL_0:2;
then H1(x) in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } by A28;
hence y in { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) } by A21, A22, Def11; :: thesis: verum
end;
defpred S3[ object , object ] means ex n being Nat st
( $1 = <*n*> & $2 = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } );
A30: for i being object st i in ONE holds
ex j being object st S3[i,j]
proof
let i be object ; :: thesis: ( i in ONE implies ex j being object st S3[i,j] )
assume i in ONE ; :: thesis: ex j being object st S3[i,j]
then consider f being s + 1 -element natural-valued positive FinSequence such that
A31: i = <*(f . 1)*> and
f in H2(s + 1,u) ;
take { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*(f . 1)*> ^ g) ") = u } ; :: thesis: S3[i, { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*(f . 1)*> ^ g) ") = u } ]
take n = f . 1; :: thesis: ( i = <*n*> & { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*(f . 1)*> ^ g) ") = u } = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } )
thus i = <*n*> by A31; :: thesis: { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*(f . 1)*> ^ g) ") = u } = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u }
thus { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*(f . 1)*> ^ g) ") = u } = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } ; :: thesis: verum
end;
consider FUN being ManySortedSet of ONE such that
A32: for x being object st x in ONE holds
S3[x,FUN . x] from PBOOLE:sch 3(A30);
A33: dom FUN = ONE by PARTFUN1:def 2;
A34: p2 c= union (rng FUN)
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in p2 or z in union (rng FUN) )
assume z in p2 ; :: thesis: z in union (rng FUN)
then consider x being object such that
A35: [x,z] in decomp As1u by XTUPLE_0:def 13;
consider f being FinSequence of NAT such that
A36: z = f and
A37: <*x*> ^ f in As1u by A35, Def10;
consider g being s + 1 -element natural-valued non-decreasing positive FinSequence such that
A38: g = <*x*> ^ f and
A39: Sum (g ") = u by A37;
<*x*> is NAT -valued by A38, BAGORD_2:7;
then reconsider x = x as Element of INT by Th3;
x = g . 1 by A38;
then A40: <*x*> in ONE by A37, A38;
then consider n being Nat such that
A41: <*x*> = <*n*> and
A42: FUN . <*x*> = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } by A32;
set Z = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } ;
reconsider f = f as natural-valued FinSequence ;
A43: len g = s + 1 by CARD_1:def 7;
A44: len g = 1 + (len f) by A38, FINSEQ_5:8;
A45: g = <*x*> ^ f by A38;
then reconsider f = f as s -element natural-valued positive FinSequence by A43, A44, CARD_1:def 7, NUMBER08:37;
f is non-decreasing by A45, Th37;
then A46: f in { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } by A38, A39, A41;
{ g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } in rng FUN by A33, A40, A42, FUNCT_1:def 3;
hence z in union (rng FUN) by A36, A46, TARSKI:def 4; :: thesis: verum
end;
FUN is finite-yielding
proof
let x be object ; :: according to FINSET_1:def 5 :: thesis: ( not x in ONE or FUN . x is finite )
assume x in ONE ; :: thesis: FUN . x is finite
then S3[x,FUN . x] by A32;
then consider n being Nat such that
A47: x = <*n*> and
A48: FUN . <*n*> = { g where g is s -element natural-valued non-decreasing positive FinSequence : Sum ((<*n*> ^ g) ") = u } ;
A49: H2(s,u - (n ")) is finite by A3;
FUN . <*n*> c= H2(s,u - (n "))
proof
let w be object ; :: according to TARSKI:def 3 :: thesis: ( not w in FUN . <*n*> or w in H2(s,u - (n ")) )
assume w in FUN . <*n*> ; :: thesis: w in H2(s,u - (n "))
then consider g being s -element natural-valued non-decreasing positive FinSequence such that
A50: w = g and
A51: Sum ((<*n*> ^ g) ") = u by A48;
A52: (<*n*> ^ g) " = (<*n*> ") ^ (g ") by NUMBER15:60;
<*n*> " = <*(n ")*> by NUMBER15:63;
then Sum ((<*n*> ") ^ (g ")) = (n ") + (Sum (g ")) by RVSUM_1:76;
hence w in H2(s,u - (n ")) by A50, A51, A52; :: thesis: verum
end;
hence FUN . x is finite by A47, A49; :: thesis: verum
end;
hence H2(s + 1,u) is finite by A6, A14, A15, A20, A34; :: thesis: verum
end;
for i being Nat holds S1[i] from NAT_1:sch 2(A1, A2);
hence { f where f is s -element natural-valued non-decreasing positive FinSequence : Sum (f ") = w } is finite ; :: thesis: verum