let f be Real_Sequence; :: thesis: for b being Real
for N being Element of NAT st f . 0 = 0 & ( for n being Element of NAT st n > 0 holds
f . n = b ) holds
for M being Element of NAT holds Sum f,N,M = b * (N - M)
let b be Real; :: thesis: for N being Element of NAT st f . 0 = 0 & ( for n being Element of NAT st n > 0 holds
f . n = b ) holds
for M being Element of NAT holds Sum f,N,M = b * (N - M)
let N be Element of NAT ; :: thesis: ( f . 0 = 0 & ( for n being Element of NAT st n > 0 holds
f . n = b ) implies for M being Element of NAT holds Sum f,N,M = b * (N - M) )
assume A1:
( f . 0 = 0 & ( for n being Element of NAT st n > 0 holds
f . n = b ) )
; :: thesis: for M being Element of NAT holds Sum f,N,M = b * (N - M)
defpred S1[ Element of NAT ] means Sum f,N,$1 = b * (N - $1);
A2:
S1[ 0 ]
A3:
for M being Element of NAT st S1[M] holds
S1[M + 1]
proof
let M be
Element of
NAT ;
:: thesis: ( S1[M] implies S1[M + 1] )
assume A4:
Sum f,
N,
M = b * (N - M)
;
:: thesis: S1[M + 1]
Sum f,
N,
(M + 1) =
(Sum f,N) - (Sum f,(M + 1))
by SERIES_1:def 7
.=
(Sum f,N) - ((Partial_Sums f) . (M + 1))
by SERIES_1:def 6
.=
(Sum f,N) - (((Partial_Sums f) . M) + (f . (M + 1)))
by SERIES_1:def 1
.=
((Sum f,N) - ((Partial_Sums f) . M)) + (- (f . (M + 1)))
.=
((Sum f,N) - (Sum f,M)) + (- (f . (M + 1)))
by SERIES_1:def 6
.=
(b * (N - M)) + (- (f . (M + 1)))
by A4, SERIES_1:def 7
.=
(b * (N - M)) + (- b)
by A1
.=
b * (N - (M + 1))
;
hence
S1[
M + 1]
;
:: thesis: verum
end;
for M being Element of NAT holds S1[M]
from NAT_1:sch 1(A2, A3);
hence
for M being Element of NAT holds Sum f,N,M = b * (N - M)
; :: thesis: verum