let s be Nat; 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; { 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 ]
A2:
for s being Nat st S1[s] holds
S1[s + 1]
proof
let s be
Nat;
( S1[s] implies S1[s + 1] )
assume A3:
S1[
s]
;
S1[s + 1]
let u be
Rational;
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
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
then reconsider As1u =
H2(
s + 1,
u) as
FinSequence-membered set ;
As1u is
NAT -FinSequence-membered
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
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 ;
TARSKI:def 3 ( not z in H2(s + 1,u) or z in p1 ^^ p2 )
assume A7:
z in H2(
s + 1,
u)
;
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;
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] ) }
A20:
p1 c= { H1(i) where i is Element of INT : ( 0 <= i & i <= [\((s + 1) / u)/] + 1 & S2[i] ) }
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]
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 ;
TARSKI:def 3 ( not z in p2 or z in union (rng FUN) )
assume
z in p2
;
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;
verum
end;
FUN is
finite-yielding
hence
H2(
s + 1,
u) is
finite
by A6, A14, A15, A20, A34;
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
; verum