reserve X for set;
reserve a,b,c,k,m,n for Nat;
reserve i,j for Integer;
reserve r,s for Real;
reserve p,p1,p2,p3 for Prime;
reserve z for Complex;

theorem
  k > 0 implies not n in GreaterOrEqualsNumbers(n+k)
  proof
    assume k > 0;
    then n+0 < n+k by XREAL_1:8;
    hence thesis by Th56;
  end;
