reserve x,y for object, X for set;

theorem Th5:
  for p,q be Prime,n,m be Nat st p divides m*(q|^n) & p
  <> q holds p divides m
proof
  let p,q be Prime;
  let n,m be Nat;
  assume that
A1: p divides m*(q|^n) and
A2: p <> q;
  p divides m or p divides (q|^n) by A1,NEWTON:80;
  hence thesis by A2,NAT_3:6;
end;
