defpred S1[ Nat] means for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = $1 & ( for k being Nat st k < $1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= $1 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq );
now :: thesis: for n being Nat st ( for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n & ( for k being Nat st k < n holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq ) ) holds
for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n + 1 & ( for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n + 1 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq )
let n be Nat; :: thesis: ( ( for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n & ( for k being Nat st k < n holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq ) ) implies for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n + 1 & ( for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n + 1 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq ) )

assume A1: for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n & ( for k being Nat st k < n holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq ) ; :: thesis: for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = n + 1 & ( for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n + 1 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq )

let seq be Real_Sequence; :: thesis: for sq being FinSequence of REAL st len sq = n + 1 & ( for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n + 1 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq )

let sq be FinSequence of REAL ; :: thesis: ( len sq = n + 1 & ( for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= n + 1 holds
seq . k = 0 ) implies ( seq is summable & Sum seq = Sum sq ) )

assume that
A2: len sq = n + 1 and
A3: for k being Nat st k < n + 1 holds
seq . k = sq . (k + 1) and
A4: for k being Nat st k >= n + 1 holds
seq . k = 0 ; :: thesis: ( seq is summable & Sum seq = Sum sq )
A5: now :: thesis: for k being Nat st k < n holds
(seq ^\ 1) . k = (sq /^ 1) . (k + 1)
let k be Nat; :: thesis: ( k < n implies (seq ^\ 1) . k = (sq /^ 1) . (k + 1) )
A6: k + 1 >= 0 + 1 by XREAL_1:6;
assume k < n ; :: thesis: (seq ^\ 1) . k = (sq /^ 1) . (k + 1)
then A7: k + 1 < n + 1 by XREAL_1:6;
thus (seq ^\ 1) . k = seq . (k + 1) by NAT_1:def 3
.= sq . ((k + 1) + 1) by A3, A7
.= (sq /^ 1) . (k + 1) by A2, A7, A6, Th16 ; :: thesis: verum
end;
A8: now :: thesis: for k being Nat st k >= n holds
(seq ^\ 1) . k = 0
let k be Nat; :: thesis: ( k >= n implies (seq ^\ 1) . k = 0 )
assume k >= n ; :: thesis: (seq ^\ 1) . k = 0
then A9: k + 1 >= n + 1 by XREAL_1:6;
thus (seq ^\ 1) . k = seq . (k + 1) by NAT_1:def 3
.= 0 by A4, A9 ; :: thesis: verum
end;
n + 1 >= 0 + 1 by XREAL_1:6;
then A10: len (sq /^ 1) = (len sq) - 1 by A2, RFINSEQ:def 1
.= n by A2 ;
then A11: Sum (seq ^\ 1) = Sum (sq /^ 1) by A1, A5, A8;
A12: seq ^\ 1 is summable by A1, A10, A5, A8;
hence seq is summable by Th15; :: thesis: Sum seq = Sum sq
thus Sum seq = (seq . 0) + (Sum (seq ^\ 1)) by A12, Th15
.= (sq . (0 + 1)) + (Sum (seq ^\ 1)) by A3
.= Sum sq by A2, A11, Th17 ; :: thesis: verum
end;
then A13: for k being Nat st S1[k] holds
S1[k + 1] ;
now :: thesis: for seq being Real_Sequence
for sq being FinSequence of REAL st len sq = 0 & ( for k being Nat st k < 0 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= 0 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq )
let seq be Real_Sequence; :: thesis: for sq being FinSequence of REAL st len sq = 0 & ( for k being Nat st k < 0 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= 0 holds
seq . k = 0 ) holds
( seq is summable & Sum seq = Sum sq )

let sq be FinSequence of REAL ; :: thesis: ( len sq = 0 & ( for k being Nat st k < 0 holds
seq . k = sq . (k + 1) ) & ( for k being Nat st k >= 0 holds
seq . k = 0 ) implies ( seq is summable & Sum seq = Sum sq ) )

assume that
A14: len sq = 0 and
for k being Nat st k < 0 holds
seq . k = sq . (k + 1) and
A15: for k being Nat st k >= 0 holds
seq . k = 0 ; :: thesis: ( seq is summable & Sum seq = Sum sq )
sq is Element of 0 -tuples_on REAL by A14, FINSEQ_2:92;
then A16: Sum sq = 0 by RVSUM_1:79;
defpred S2[ Nat] means (Partial_Sums seq) . $1 = 0 ;
A17: now :: thesis: for k being Nat st S2[k] holds
S2[k + 1]
let k be Nat; :: thesis: ( S2[k] implies S2[k + 1] )
A18: (Partial_Sums seq) . (k + 1) = ((Partial_Sums seq) . k) + (seq . (k + 1)) by SERIES_1:def 1;
assume S2[k] ; :: thesis: S2[k + 1]
hence S2[k + 1] by A15, A18; :: thesis: verum
end;
seq . 0 = 0 by A15;
then A19: S2[ 0 ] by SERIES_1:def 1;
A20: for k being Nat holds S2[k] from NAT_1:sch 2(A19, A17);
then Partial_Sums seq is convergent by Th9;
hence seq is summable by SERIES_1:def 2; :: thesis: Sum seq = Sum sq
lim (Partial_Sums seq) = 0 by A20, Th9;
hence Sum seq = Sum sq by A16, SERIES_1:def 3; :: thesis: verum
end;
then A21: S1[ 0 ] ;
thus for n being Nat holds S1[n] from NAT_1:sch 2(A21, A13); :: thesis: verum