let seq1, seq2 be Complex_Sequence; :: thesis: ( seq1 . 0 = 1 & ( for n being Element of NAT holds seq1 . (n + 1) = (seq1 . n) * (n + 1) ) & seq2 . 0 = 1 & ( for n being Element of NAT holds seq2 . (n + 1) = (seq2 . n) * (n + 1) ) implies seq1 = seq2 )
assume that
A2: ( seq1 . 0 = 1 & ( for n being Element of NAT holds seq1 . (n + 1) = (seq1 . n) * (n + 1) ) ) and
A3: ( seq2 . 0 = 1 & ( for n being Element of NAT holds seq2 . (n + 1) = (seq2 . n) * (n + 1) ) ) ; :: thesis: seq1 = seq2
defpred S₁[ Element of NAT ] means seq1 . $1 = seq2 . $1;
A4: S₁[ 0 ] by A2, A3;
A5: for k being Element of NAT st S₁[k] holds
S₁[k + 1]

proof

let k be Element of NAT ; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume seq1 . k = seq2 . k ; :: thesis: S₁[k + 1]
hence seq1 . (k + 1) = (seq2 . k) * (k + 1) by A2
.= seq2 . (k + 1) by A3 ;
:: thesis: verum

end;

for n being Element of NAT holds S₁[n] from NAT_1:sch 1(A4, A5);
hence seq1 = seq2 by FUNCT_2:113; :: thesis: verum