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