defpred S1[ Nat] means ex f being $1 + 1 -element natural-valued positive FinSequence st f is a_solution_of_Sierp169 ;
defpred S2[ Nat] means ( $1 >= 3 implies S1[$1] );
A2: for k being Nat holds
( S2[2 * k] & S2[(2 * k) + 1] )
proof
let k be Nat; :: thesis: ( S2[2 * k] & S2[(2 * k) + 1] )
thus S2[2 * k] :: thesis: S2[(2 * k) + 1]
proof
assume A3: 2 * k >= 3 ; :: thesis: S1[2 * k]
defpred S3[ Nat] means ( 2 * $1 >= 3 implies S2[2 * $1] );
A4: S3[ 0 ] ;
A5: for m being Nat st S3[m] holds
S3[m + 1]
proof
let m be Nat; :: thesis: ( S3[m] implies S3[m + 1] )
assume A6: S3[m] ; :: thesis: S3[m + 1]
assume 2 * (m + 1) >= 3 ; :: thesis: S2[2 * (m + 1)]
assume 2 * (m + 1) >= 3 ; :: thesis: S1[2 * (m + 1)]
per cases then ( 2 * (m + 1) = 3 or 2 * (m + 1) > 3 ) by XXREAL_0:1;
suppose 2 * (m + 1) = 3 ; :: thesis: S1[2 * (m + 1)]
hence S1[2 * (m + 1)] by Th143; :: thesis: verum
end;
suppose 2 * (m + 1) > 3 ; :: thesis: S1[2 * (m + 1)]
then ((2 * m) + 2) - 2 > 3 - 2 by XREAL_1:8;
then A7: 2 * m >= 1 + 1 by NAT_1:13;
then reconsider m = m as positive Nat ;
per cases ( 2 * m = 2 * 1 or 2 * m > 2 ) by A7, XXREAL_0:1;
suppose 2 * m = 2 * 1 ; :: thesis: S1[2 * (m + 1)]
hence S1[2 * (m + 1)] by Th144; :: thesis: verum
end;
end;
end;
end;
end;
for m being Nat holds S3[m] from NAT_1:sch 2(A4, A5);
hence S1[2 * k] by A3; :: thesis: verum
end;
thus S2[(2 * k) + 1] :: thesis: verum
proof
assume A8: (2 * k) + 1 >= 3 ; :: thesis: S1[(2 * k) + 1]
defpred S3[ Nat] means ( (2 * $1) + 1 >= 3 implies S2[(2 * $1) + 1] );
A9: S3[ 0 ] ;
A10: for m being Nat st S3[m] holds
S3[m + 1]
proof
let m be Nat; :: thesis: ( S3[m] implies S3[m + 1] )
assume A11: S3[m] ; :: thesis: S3[m + 1]
assume (2 * (m + 1)) + 1 >= 3 ; :: thesis: S2[(2 * (m + 1)) + 1]
per cases then ( (2 * (m + 1)) + 1 = 3 or (2 * (m + 1)) + 1 > 3 ) by XXREAL_0:1;
suppose (2 * (m + 1)) + 1 = 3 ; :: thesis: S2[(2 * (m + 1)) + 1]
hence S2[(2 * (m + 1)) + 1] by Th143; :: thesis: verum
end;
suppose A12: (2 * (m + 1)) + 1 > 3 ; :: thesis: S2[(2 * (m + 1)) + 1]
A13: now :: thesis: not m < 1end;
then reconsider m = m as positive Nat ;
per cases ( m = 1 or m > 1 ) by A13, XXREAL_0:1;
suppose m = 1 ; :: thesis: S2[(2 * (m + 1)) + 1]
hence S2[(2 * (m + 1)) + 1] by Th143, Th144, Lm31; :: thesis: verum
end;
end;
end;
end;
end;
for m being Nat holds S3[m] from NAT_1:sch 2(A9, A10);
hence S1[(2 * k) + 1] by A8; :: thesis: verum
end;
end;
for k being Nat holds S2[k] from NUMBER17:sch 2(A2);
hence ex b1 being s + 1 -element natural-valued positive-yielding FinSequence st b1 is a_solution_of_Sierp169 by A1; :: thesis: verum