let seq, seq1, seq2 be Real_Sequence; :: thesis: ( seq = seq1 (#) seq2 iff for n being Nat holds seq . n = (seq1 . n) * (seq2 . n) )
thus ( seq = seq1 (#) seq2 implies for n being Nat holds seq . n = (seq1 . n) * (seq2 . n) ) :: thesis: ( ( for n being Nat holds seq . n = (seq1 . n) * (seq2 . n) ) implies seq = seq1 (#) seq2 )

proof

assume A1: seq = seq1 (#) seq2 ; :: thesis: for n being Nat holds seq . n = (seq1 . n) * (seq2 . n)
let n be Nat; :: thesis: seq . n = (seq1 . n) * (seq2 . n)
A2: n in NAT by ORDINAL1:def 12;
dom seq = NAT by FUNCT_2:def 1;
hence seq . n = (seq1 . n) * (seq2 . n) by A1, VALUED_1:def 4, A2; :: thesis: verum

end;

assume for n being Nat holds seq . n = (seq1 . n) * (seq2 . n) ; :: thesis: seq = seq1 (#) seq2
then A3: for n being object st n in dom seq holds
seq . n = (seq1 . n) * (seq2 . n) ;
dom seq = NAT /\ NAT by FUNCT_2:def 1
.= NAT /\ (dom seq2) by FUNCT_2:def 1
.= (dom seq1) /\ (dom seq2) by FUNCT_2:def 1 ;
hence seq = seq1 (#) seq2 by A3, VALUED_1:def 4; :: thesis: verum