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

theorem Th38:
  i is prime & i > 3 & i divides h implies i in PrimeDivisors>3(h)
  proof
    assume that
A1: i is prime and
A2: i > 3 and
A3: i divides h;
A4: i is Element of NAT by A2,INT_1:3;
    then
A5: i in PrimeDivisors(h) by A1,A3;
    i >= 3+1 by A2,NAT_1:13;
    then i in GreaterOrEqualsNumbers(4) by A4,NUMBER09:56;
    hence thesis by A5,XBOOLE_0:def 4;
  end;
