let m be non zero Nat; :: thesis: for k being Nat holds (Partial_Sums (Step_ ((ln * ((x_+_ 1) | rohl)),m))) . k = ln . (((k + m) !) / ((m ^ k) * (m !)))
let k be Nat; :: thesis: (Partial_Sums (Step_ ((ln * ((x_+_ 1) | rohl)),m))) . k = ln . (((k + m) !) / ((m ^ k) * (m !)))
defpred S1[ Nat] means (Partial_Sums (Step_ ((ln * ((x_+_ 1) | rohl)),m))) . $1 = ln . ((($1 + m) !) / ((m ^ $1) * (m !)));
A1: for k being Nat st S1[k] holds
S1[k + 1]
proof
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A2: S1[k] ; :: thesis: S1[k + 1]
((x_+_ 1) | rohl) . ((k + 1) / m) = (x_+_ 1) . ((k + 1) / m) by Lm49, FUNCT_1:49
.= (1 * ((k + 1) / m)) + 1 by FCONT_1:def 4
.= ((k + 1) / m) + (m / m) by XCMPLX_1:60
.= ((k + m) + 1) / m ;
then A4: (ln * ((x_+_ 1) | rohl)) . ((k + 1) / m) = ln . (((k + m) + 1) / m) by Lm49, Lm50, FUNCT_1:13;
set n1 = m;
set kn1 = k + m;
A5: (((k + m) !) / ((m ^ k) * (m !))) * (((k + m) + 1) / m) = (((k + m) !) * ((k + m) + 1)) / (((m !) * (m ^ k)) * m) by XCMPLX_1:76
.= (((k + m) + 1) !) / ((m !) * ((m ^ k) * (m ^ 1))) by NEWTON:15
.= (((k + m) + 1) !) / ((m !) * (m ^ (k + 1))) by NEWTON:8 ;
(ln . (((k + m) !) / ((m ^ k) * (m !)))) + ((Step_ ((ln * ((x_+_ 1) | rohl)),m)) . (k + 1)) = (ln . (((k + m) !) / ((m ^ k) * (m !)))) + (ln . (((k + m) + 1) / m)) by A4, Def19
.= ln . ((((k + 1) + m) !) / ((m ^ (k + 1)) * (m !))) by A5, MOEBIUS3:19 ;
hence S1[k + 1] by A2, SERIES_1:def 1; :: thesis: verum
end;
A6: S1[ 0 ]
proof
A7: (Partial_Sums (Step_ ((ln * ((x_+_ 1) | rohl)),m))) . 0 = (Step_ ((ln * ((x_+_ 1) | rohl)),m)) . 0 by SERIES_1:def 1
.= (ln * ((x_+_ 1) | rohl)) . (0 / m) by Def19
.= ln . 1 by Lm50 ;
ln . (((0 + m) !) / ((m ^ 0) * (m !))) = ln . ((m !) / (1 * (m !))) by NEWTON:4
.= ln . 1 by XCMPLX_1:60 ;
hence S1[ 0 ] by A7; :: thesis: verum
end;
for n being Nat holds S1[n] from NAT_1:sch 2(A6, A1);
hence (Partial_Sums (Step_ ((ln * ((x_+_ 1) | rohl)),m))) . k = ln . (((k + m) !) / ((m ^ k) * (m !))) ; :: thesis: verum