low_hole_two_mul_sub_ge_two
For integers z_RL, z_2, and z_2A, if z_RL ≤ z_2 and z_2 < z_2A, then 2 ≤ 2 * (z_2A - z_RL).
Statement
theorem low_hole_two_mul_sub_ge_two (z_RL z_2 z_2A : ℤ)
(hle : z_RL ≤ z_2) (hgt : z_2 < z_2A) :
2 ≤ 2 * (z_2A - z_RL)- Source
- scout/2610-22875-overtake-and-the-recursive-line-equality-for-second-order-z.md:552
- Verified
- 22 Oct 2026
- Axioms
Quot.soundpropext- Used by 1
- low_hole_reduction_overtakeLet m, n be natural numbers and let z, z_RL, z_2, z_2A, H, d be integers. If z_RL ≤ z_2, z_2 ≤ z_2A, 0 ≤ H, 0 ≤ d, 2 * (z_2A - z_RL) =…
Read back from the Lean
For all integers $z_{\\mathrm{RL}}$, $z_2$, and $z_{2\\mathrm{A}}$, if $z_{\\mathrm{RL}} \\le z_2$ and $z_2 < z_{2\\mathrm{A}}$, then $2 \\le 2 \\cdot (z_{2\\mathrm{A}} - z_{\\mathrm{RL}})$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof relies on linear integer arithmetic. From z_RL ≤ z_2 and z_2 < z_2A, the difference z_2A - z_RL is at least 1. Multiplying both sides by 2 yields the required inequality 2 ≤ 2 * (z_2A - z_RL), which is settled directly by the `omega` tactic.
2 ≤ 2 * (z_2A - z_RL) automation
Combining the hypotheses z_RL ≤ z_2 and z_2 < z_2A shows that z_2A - z_RL ≥ 1 over the integers. Multiplying both sides by 2 yields 2 ≤ 2 * (z_2A - z_RL). The `omega` decision procedure resolves this linear integer arithmetic problem automatically.
omega
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- If z_RL ≤ z_2 and z_2 < z_2A, then 2 * (z_2A - z_RL) is at least 2. -/theorem low_hole_two_mul_sub_ge_two (z_RL z_2 z_2A : ℤ) (hle : z_RL ≤ z_2) (hgt : z_2 < z_2A) : 2 ≤ 2 * (z_2A - z_RL) := by omega