
theorem
  for i being Integer holds PrimeDivisors i c= SetPrimes
  proof
    let i be Integer;
    let x be object;
    assume x in PrimeDivisors i;
    then ex k being Prime st x = k & k divides i;
    hence thesis by NEWTON:def 6;
  end;
