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 Th56:
  p |-count n <> 0 implies (ppf n).p = p |^ (p |-count n)
proof
  assume p |-count n <> 0;
  then (pfexp n).p <> 0 by Def8;
  then p in support pfexp n by PRE_POLY:def 7;
  hence thesis by Def9;
end;
