let p be Real; :: thesis: ( p > 0 implies ex n being Nat st
for m being Nat st n <= m holds
|.(((r (#) s) . m) - (r * (lim s))).| < p )
assume A2: p > 0 ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
|.(((r (#) s) . m) - (r * (lim s))).| < p
A3: |.r.| > 0 by A1, COMPLEX1:47;
p / |.r.| > 0 by A3, A2;
then consider n being Nat such that
A4: for m being Nat st n <= m holds
|.((s . m) - (lim s)).| < p / |.r.| by Def6;
take n ; :: thesis: for m being Nat st n <= m holds
|.(((r (#) s) . m) - (r * (lim s))).| < p
let m be Nat; :: thesis: ( n <= m implies |.(((r (#) s) . m) - (r * (lim s))).| < p )
assume n <= m ; :: thesis: |.(((r (#) s) . m) - (r * (lim s))).| < p
then |.((s . m) - (lim s)).| < p / |.r.| by A4;
then |.((s . m) - (lim s)).| * |.r.| < (p / |.r.|) * |.r.| by A3, XREAL_1:68;
then |.((s . m) - (lim s)).| * |.r.| < (p * (|.r.| ")) * |.r.| by XCMPLX_0:def 9;
then |.((s . m) - (lim s)).| * |.r.| < p * ((|.r.| ") * |.r.|) ;
then A5: |.((s . m) - (lim s)).| * |.r.| < p * 1 by A3, XCMPLX_0:def 7;
|.(((r (#) s) . m) - (r * (lim s))).| = |.((r * (s . m)) - (r * (lim s))).| by VALUED_1:6
.= |.(r * ((s . m) - (lim s))).|
.= |.((s . m) - (lim s)).| * |.r.| by COMPLEX1:65 ;
hence |.(((r (#) s) . m) - (r * (lim s))).| < p by A5; :: thesis: verum

let n be Nat; :: thesis: (r (#) s) . n = 0c
thus (r (#) s) . n = 0c * (s . n) by A6, VALUED_1:6
.= 0c ; :: thesis: verum