 reserve n,i,k,m for Nat;
 reserve p for Prime;
 reserve s, s1, s2 for Real_Sequence;

theorem
  for p being Prime st p > 2 holds
    ReciProducts (p+1) = ReciProducts p
  proof
    let p be Prime;
    assume p > 2; then
    p+1 is not prime by P1NotPrime; then
    SetPrimes (p+1) = SetPrimes p by PrimesSet;
    hence thesis;
  end;
