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

theorem Th37:
  b is non empty & a is Prime & a divides b implies a in support pfexp b
proof
  assume that
A1: b is non empty and
A2: a is Prime and
A3: a divides b;
  1 < a by A2,INT_2:def 4;
  then
A4: a |-count b <> 0 by A1,A3,Th27;
  (pfexp b).a = a |-count b by A2,Def8;
  hence thesis by A4,PRE_POLY:def 7;
end;
