reserve n for Nat,
  k for Integer;

theorem Th2:
  1 <= k implies k is Nat
proof
  assume 1 <= k;
  then reconsider k as Element of NAT by INT_1:3;
  k is Nat;
  hence thesis;
end;
