reserve a,b,c,k,m,n for Nat;
reserve i,j for Integer;
reserve p for Prime;

theorem Th1:
  n < 3 implies n = 0 or n = 1 or n = 2
  proof
    assume n < 3;
    then n < 2+1;
    then n <= 2 by NAT_1:13;
    then n = 0 or ... or n = 2;
    hence thesis;
  end;
