
theorem
  2 is prime
proof
  thus 2 > 1;
  let n be Nat;
  assume
A1: n divides 2;
  then n <= 2 by INT_2:27;
  then n = 0 or ... or n = 2;
  hence thesis by A1,INT_2:3;
end;
