 reserve n,i,k,m for Nat;
 reserve p for Prime;

theorem GreaterProduct:
  for n being Nat holds
    (Partial_Product Reci-seq2).n > 0
  proof
    let n be Nat;
    for k being Nat holds Reci-seq2.k > 0
    proof
      let k be Nat;
      Reci-seq2.k = 1 + 1 / primenumber k by My3Def;
      hence thesis;
    end;
    hence thesis by SERIES_3:43;
  end;
