theorem
  a in support pfexp b implies a divides b
proof
  set f = pfexp b;
  assume
A1: a in support f;
  then reconsider a as Prime by Th34;
A2: a <> 1 & f.a = a |-count b by Def8,INT_2:def 4;
  f.a <> 0 by A1,PRE_POLY:def 7;
  hence thesis by A2,Th27;
end;
