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

theorem Th60:
  n <> 1 implies for m being Multiple of n st m is prime holds m = n
  proof
    assume
A1: n <> 1;
    let m be Multiple of n such that
A2: m is prime;
    m = n or m = -n by A1,A2,Th59;
    hence thesis by A2;
  end;
