lean_workbook_plus_76884
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
That implies that so there are .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_76884 (x : ℝ)
(h₀ : 0 < x)
(h₁ : x^2 - 2 * x ≤ 0)
(h₂ : 0 ≤ x^2 - 2 * x + 22)
(h₃ : x^2 - 2 * x + 22 ≤ 25) :
↑22 ≤ x ∧ x ≤ ↑25 := by sorry
The source bounds x itself in [22,25], while the target imposes different quadratic conditions that hold at x=1.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Recover the original equation defining the quantity being counted and prove the integer solutions are exactly 22,23,24,25; do not substitute unrelated quadratic bounds.
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.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_76884 (x : ℝ) (h₀ : 0 < x) (h₁ : x^2 - 2 * x ≤ 0) (h₂ : 0 ≤ x^2 - 2 * x + 22) (h₃ : x^2 - 2 * x + 22 ≤ 25) : ↑22 ≤ x ∧ x ≤ ↑25 := by sorry