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
  seq is Cauchy iff for r st r > 0 ex k st for n, m st n >= k & m >= k
  holds ||.(seq.n) - (seq.m).|| < r
proof
  thus seq is Cauchy implies for r st r > 0 ex k st for n, m st n >= k & m >=
  k holds ||.(seq.n) - (seq.m).|| < r
  proof
    assume
A1: seq is Cauchy;
    let r;
    assume r > 0;
    then consider l being Nat such that
A2: for n, m st n >= l & m >= l holds dist((seq.n), (seq.m)) < r by A1;
    take k = l;
    let n, m;
    assume n >= k & m >= k;
    then dist((seq.n), (seq.m)) < r by A2;
    hence thesis by CSSPACE:def 16;
  end;
  ( for r st r > 0 ex k st for n, m st ( n >= k & m >= k ) holds ||.(seq.n
  ) - (seq.m).|| < r ) implies seq is Cauchy
  proof
    assume
A3: for r st r > 0 ex k st for n, m st n >= k & m >= k holds ||.(seq.n
    ) - (seq.m).|| < r;
    let r;
    assume r > 0;
    then consider l being Nat such that
A4: for n, m st n >= l & m >= l holds ||.(seq.n) - (seq.m).|| < r by A3;
    take k = l;
    let n, m;
    assume n >= k & m >= k;
    then ||.(seq.n) - (seq.m).|| < r by A4;
    hence thesis by CSSPACE:def 16;
  end;
  hence thesis;
end;
