reserve X for ComplexUnitarySpace;
reserve x, y, w, g, g1, g2 for Point of X;
reserve z for Complex;
reserve p, q, r, M, M1, M2 for Real;
reserve seq, seq1, seq2, seq3 for sequence of X;
reserve k,n,m for Nat;
reserve Nseq for increasing sequence of NAT;

theorem Th5:
  seq is convergent implies z * seq is convergent
proof
  assume seq is convergent;
  then consider g such that
A1: for r st r > 0 ex m st for n st n >= m holds dist((seq.n) , g) < r;
  take h = z * g;
A2: now
A3: 0/|.z.| = 0;
    assume
A4: z <> 0;
    then
A5: |.z.| > 0 by COMPLEX1:47;
    let r;
    assume r > 0;
    then consider m1 be Nat such that
A6: for n st n >= m1 holds dist((seq.n) , g) < r/|.z.| by A1,A5,A3,XREAL_1:74;
    take k = m1;
    let n;
    assume n >= k;
    then
A7: dist((seq.n) , g) < r/|.z.| by A6;
A8: |.z.| <> 0 by A4,COMPLEX1:47;
A9: |.z.| * (r/|.z.|) = |.z.| * (|.z.|" * r) by XCMPLX_0:def 9
      .= |.z.| *|.z.|" * r
      .= 1 * r by A8,XCMPLX_0:def 7
      .= r;
    dist(z * (seq.n) , z * g) = ||.(z * (seq.n)) - (z * g).|| by CSSPACE:def 16
      .= ||.z * ((seq.n) - g).|| by CLVECT_1:9
      .= |.z.| * ||.(seq.n) - g.|| by CSSPACE:43
      .= |.z.| * dist((seq.n) , g) by CSSPACE:def 16;
    then dist((z *(seq.n)) , h) < r by A5,A7,A9,XREAL_1:68;
    hence dist((z * seq).n, h) < r by CLVECT_1:def 14;
  end;
  now
    assume
A10: z = 0;
    let r;
    assume r > 0;
    then consider m1 be Nat such that
A11: for n st n >= m1 holds dist((seq.n) , g) < r by A1;
    take k = m1;
    let n;
    assume n >= k;
    then
A12: dist((seq.n) , g) < r by A11;
    dist(z * (seq.n) , z * g) = dist(0c * (seq.n) , 09(X)) by A10,CLVECT_1:1
      .= dist(09(X) , 09(X)) by CLVECT_1:1
      .= 0 by CSSPACE:50;
    then dist(z * (seq.n) , h) < r by A12,CSSPACE:53;
    hence dist((z * seq).n, h) < r by CLVECT_1:def 14;
  end;
  hence thesis by A2;
end;
