reserve Al for QC-alphabet;
reserve p,q,p1,p2,q1 for Element of CQC-WFF(Al),
  k for Element of NAT,
  f,f1,f2,g for FinSequence of CQC-WFF(Al),
  a,b,b1,b2,c,i,n for Nat;

theorem Th2:
  seq(a,0) = {}
proof
  hereby
    set x =the  Element of seq(a,0);
    assume
A1: seq(a,0) <> {};
    then reconsider x as Element of NAT by TARSKI:def 3;
    1+a <= x & x <= 0+a by A1,Th1;
    hence contradiction by NAT_1:13;
  end;
end;
