let seq1, seq2 be Complex_Sequence; :: thesis: ( ( for k being Nat holds
( ( k <= n implies seq1 . k = ((z ExpSeq) . k) * (((Partial_Sums (w ExpSeq)) . n) - ((Partial_Sums (w ExpSeq)) . (n -' k))) ) & ( n < k implies seq1 . k = 0 ) ) ) & ( for k being Nat holds
( ( k <= n implies seq2 . k = ((z ExpSeq) . k) * (((Partial_Sums (w ExpSeq)) . n) - ((Partial_Sums (w ExpSeq)) . (n -' k))) ) & ( n < k implies seq2 . k = 0 ) ) ) implies seq1 = seq2 )
assume that
A1: for k being Nat holds
( ( k <= n implies seq1 . k = ((z ExpSeq) . k) * (((Partial_Sums (w ExpSeq)) . n) - ((Partial_Sums (w ExpSeq)) . (n -' k))) ) & ( k > n implies seq1 . k = 0 ) ) and
A2: for k being Nat holds
( ( k <= n implies seq2 . k = ((z ExpSeq) . k) * (((Partial_Sums (w ExpSeq)) . n) - ((Partial_Sums (w ExpSeq)) . (n -' k))) ) & ( k > n implies seq2 . k = 0 ) ) ; :: thesis: seq1 = seq2

now :: thesis: for k being Element of NAT holds seq1 . k = seq2 . k

let k be Element of NAT ; :: thesis: seq1 . b₁ = seq2 . b₁

per cases ( k <= n or k > n ) ;

suppose A3: k <= n ; :: thesis: seq1 . b₁ = seq2 . b₁

hence seq1 . k = ((z ExpSeq) . k) * (((Partial_Sums (w ExpSeq)) . n) - ((Partial_Sums (w ExpSeq)) . (n -' k))) by A1
.= seq2 . k by A2, A3 ;
:: thesis: verum

end;

suppose A4: k > n ; :: thesis: seq1 . b₁ = seq2 . b₁

hence seq1 . k = 0c by A1
.= seq2 . k by A2, A4 ;
:: thesis: verum

end;

end;

end;

hence seq1 = seq2 ; :: thesis: verum