lean_workbook_plus_25176

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Prove that there exist infinitely many prime numbers $p$ such that $p \equiv 1 \pmod 6$.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_25176 (n : ℕ) (hn : n > 0) : ∃ p :ℕ,  p.Prime ∧ p ≡ 1 [ZMOD 6]  :=  by sorry

The accepted fixed witness 7 suffices only because the unboundedness condition is omitted.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Proposed corrected statement

Require p>n for each bound n, or conclude infinitude of the prime set p≡1 mod 6.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.