let p be Prime; :: thesis: for n being non zero Nat st p |-count n = 0 holds
(ppf n) . p = 0
let n be non zero Nat; :: thesis: ( p |-count n = 0 implies (ppf n) . p = 0 )
assume p |-count n = 0 ; :: thesis: (ppf n) . p = 0
then (pfexp n) . p = 0 by Def8;
then not p in support (pfexp n) by PRE_POLY:def 7;
then not p in support (ppf n) by Def9;
hence (ppf n) . p = 0 by PRE_POLY:def 7; :: thesis: verum