reserve a, b, n for Nat,
  r for Real,
  f for FinSequence of REAL;
reserve p for Prime;
reserve n, m for non zero Nat;

theorem Th59:
  (ppf (p |^ n)).p = p |^ n
proof
  p > 1 by INT_2:def 4;
  then p |-count (p |^ n) = n by Th25;
  hence thesis by Th56;
end;
