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

theorem Th37:
  i in PrimeDivisors>3(h) implies i is prime
  proof
    assume i in PrimeDivisors>3(h);
    then i in PrimeDivisors(h);
    then ex p being Prime st i = p & p divides h;
    hence thesis;
  end;
