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

theorem Th6:
  for a being Prime st a divides p |^ b holds a = p
proof
  let a be Prime;
  assume a divides p |^ b;
  then a <> 1 & a divides p by Th5,INT_2:def 4;
  hence thesis by INT_2:def 4;
end;
