common_predecessor_exceptional_vertex_budget_arithmetic
If z≤1, d≥47, and d≤6t≤d+z, then t+40≤d+z.
Statement
theorem common_predecessor_exceptional_vertex_budget_arithmetic (z d t : ℕ)
(hz : z ≤ 1) (hd : 47 ≤ d) (hlo : d ≤ 6 * t) (hhi : 6 * t ≤ d + z) :
t + 40 ≤ d + z- Source
- Auxiliary-graph transfer and counting steps for the OP-110 campaign.
- Verified
- 02 Nov 2026
- Axioms
Quot.soundpropext
The proof, explained
The theorem establishes the inequality t + 40 ≤ d + z for natural numbers z, d, and t satisfying z ≤ 1, d ≥ 47, d ≤ 6t, and 6t ≤ d + z. From d ≥ 47 and d ≤ 6t, it follows that t ≥ 8, which gives t + 40 ≤ 6t ≤ d + z. This integer linear arithmetic inequality is decided directly by the omega tactic.
t + 40 ≤ d + z automation
The inequality follows by linear arithmetic over the natural numbers: from d ≥ 47 and d ≤ 6t, we have 6t ≥ 47, which implies t ≥ 8. Consequently, t + 40 ≤ t + 5t = 6t, and since 6t ≤ d + z, we obtain t + 40 ≤ d + z. The decision procedure omega closes the goal 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.
theorem common_predecessor_exceptional_vertex_budget_arithmetic (z d t : ℕ) (hz : z ≤ 1) (hd : 47 ≤ d) (hlo : d ≤ 6 * t) (hhi : 6 * t ≤ d + z) : t + 40 ≤ d + z := by omega