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

theorem Th34:
  for x being set st x in support pfexp n holds x is Prime
proof
  let x be set;
  set f = pfexp n;
A1: support f c= dom f by PRE_POLY:37;
  assume x in support f;
  hence thesis by A1,Th33;
end;
