let s be positive Nat; :: thesis: ( s > 2 implies card (IncreasingSolutionsOfSumOfReciprocals s) < card (IncreasingSolutionsOfSumOfReciprocals (s + 1)) )
set S = IncreasingSolutionsOfSumOfReciprocals s;
set S1 = IncreasingSolutionsOfSumOfReciprocals (s + 1);
assume s > 2 ; :: thesis: card (IncreasingSolutionsOfSumOfReciprocals s) < card (IncreasingSolutionsOfSumOfReciprocals (s + 1))
then s >= 2 + 1 by NAT_1:13;
per cases then ( s = 3 or s > 3 ) by XXREAL_0:1;
suppose A1: s = 3 ; :: thesis: card (IncreasingSolutionsOfSumOfReciprocals s) < card (IncreasingSolutionsOfSumOfReciprocals (s + 1))
end;
suppose A4: s > 3 ; :: thesis: card (IncreasingSolutionsOfSumOfReciprocals s) < card (IncreasingSolutionsOfSumOfReciprocals (s + 1))
then A5: s - 1 > 3 - 1 by XREAL_1:9;
then reconsider t = s - 1 as positive Element of NAT by INT_1:3;
A6: 1 <= t + 1 by NAT_1:11;
consider f being t -element natural-valued increasing positive FinSequence such that
A7: f is with_sum_of_reciprocals_equal_1 by A5, Th121;
A8: len f = t by CARD_1:def 7;
A9: (Sierp162FS_2 f) . 2 = (2 * 1) + 1 by NUMBER14:21;
set X = (IncreasingSolutionsOfSumOfReciprocals s) \/ {f};
defpred S1[ object , object ] means ( ( $1 = f implies $2 = Sierp162FS_2 f ) & ( $1 <> f implies ex h being complex-valued FinSequence st
( $1 = h & $2 = Sierp162FS h ) ) );
A10: for x being object st x in (IncreasingSolutionsOfSumOfReciprocals s) \/ {f} holds
ex y being object st
( y in IncreasingSolutionsOfSumOfReciprocals (s + 1) & S1[x,y] )
proof end;
consider F being Function such that
A17: dom F = (IncreasingSolutionsOfSumOfReciprocals s) \/ {f} and
A18: rng F c= IncreasingSolutionsOfSumOfReciprocals (s + 1) and
A19: for x being object st x in (IncreasingSolutionsOfSumOfReciprocals s) \/ {f} holds
S1[x,F . x] from FUNCT_1:sch 6(A10);
F is one-to-one
proof
let x1, x2 be object ; :: according to FUNCT_1:def 4 :: thesis: ( not x1 in proj1 F or not x2 in proj1 F or not F . x1 = F . x2 or x1 = x2 )
assume that
A20: x1 in dom F and
A21: x2 in dom F and
A22: F . x1 = F . x2 ; :: thesis: x1 = x2
A23: S1[x1,F . x1] by A17, A19, A20;
A24: S1[x2,F . x2] by A17, A19, A21;
per cases ( x1 in IncreasingSolutionsOfSumOfReciprocals s or x1 = f ) by A17, A20, ZFMISC_1:136;
suppose x1 in IncreasingSolutionsOfSumOfReciprocals s ; :: thesis: x1 = x2
end;
suppose A31: x1 = f ; :: thesis: x1 = x2
end;
end;
end;
then Segm (card ((IncreasingSolutionsOfSumOfReciprocals s) \/ {f})) c= Segm (card (IncreasingSolutionsOfSumOfReciprocals (s + 1))) by A17, A18, CARD_1:10;
then A35: card ((IncreasingSolutionsOfSumOfReciprocals s) \/ {f}) <= card (IncreasingSolutionsOfSumOfReciprocals (s + 1)) by NAT_1:39;
IncreasingSolutionsOfSumOfReciprocals s misses {f} then card ((IncreasingSolutionsOfSumOfReciprocals s) \/ {f}) = (card (IncreasingSolutionsOfSumOfReciprocals s)) + (card {f}) by CARD_2:40
.= (card (IncreasingSolutionsOfSumOfReciprocals s)) + 1 by CARD_1:30 ;
hence card (IncreasingSolutionsOfSumOfReciprocals s) < card (IncreasingSolutionsOfSumOfReciprocals (s + 1)) by A35, NAT_1:13; :: thesis: verum
end;
end;