reserve m, n for Nat;

theorem Th49:
  for n being non zero Nat, p being Prime st p |-count
  n <> 0 holds (PFactors n).p = p
proof
  let n be non zero Nat, p be Prime;
  assume p |-count n <> 0;
  then (pfexp n).p <> 0 by NAT_3:def 8;
  then p in support pfexp n by PRE_POLY:def 7;
  hence thesis by Def6;
end;
