AFTD Auto-Formalizing Theoretical Domains

amply_regular_params_two_mu_ge_consistent

theoremverified

Sanity witness that the hypothesis ℓ + 2 ≤ k is not automatic: it can fail while ℓ + 2 ≤ 2μ holds, so the drift lemma's hypothesis k + ℓ + 2 ≤ 2μ is not a trivial consequence of the parameters.

Statement

theorem amply_regular_params_two_mu_ge_consistent :
    ¬ (5 + 2 + 2 ≤ 2 * 2) ∧ (5 + 2 + 2 ≤ 2 * 6) ∧ 2 * 5 / (2 + 2) = 2
Source
step towards amply_regular_diameter_bound_of_three_le_diam
Verified
03 Nov 2026
Axioms
propext
Built on 1

The proof, explained

The theorem is a concrete numerical sanity check verifying that the parameter triple (5, 2, 2) satisfies ¬(9 ≤ 4) ∧ 9 ≤ 12 ∧ 10 / 4 = 2. Lean resolves this purely by numerical computation: the `first` tactical tries several branches, and `simpa` evaluates the arithmetic operations directly to true.

  1. ¬(5 + 2 + 2 ≤ 2 * 2) ∧ (5 + 2 + 2 ≤ 2 * 6) ∧ 2 * 5 / (2 + 2) = 2 automation

    The tactic `first` tries a sequence of candidate tactics. The first three fail, and the fourth branch, `simpa using three_token_k2n_domination_arith_split`, simplifies the three conjuncts by direct computation on natural numbers: 5 + 2 + 2 = 9 is not at most 4, 9 is at most 12, and 10 / 4 = 2 under integer division in ℕ. All three conjuncts evaluate to true, so the goal simplifies to True and is closed without actually relying on the supplied lemma.

    line 3

    uses three_token_k2n_domination_arith_split

        ¬ (5 + 2 + 2 ≤ 2 * 2) ∧ (5 + 2 + 2 ≤ 2 * 6) ∧ 2 * 5 / (2 + 2) = 2 := by first | exact three_token_k2n_domination_arith_split | (apply three_token_k2n_domination_arith_split <;> assumption) | (apply three_token_k2n_domination_arith_split <;> simp_all) | simpa using three_token_k2n_domination_arith_split
three_token_k2n_domination_arith_split
For any natural number n ≥ 4, (n + 1)^2 / 4 - 2 = (n - 1)^2 / 4 + n - 2

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

/-- Vacuity guard for the drift/assembly lemmas: the icosahedron's parameters (5,2,2) satisfy `2 < μ` but violate the conclusion in the μ ≤ 2 boundary. -/theorem amply_regular_params_two_mu_ge_consistent :    ¬ (5 + 2 + 2 ≤ 2 * 2) ∧ (5 + 2 + 2 ≤ 2 * 6) ∧ 2 * 5 / (2 + 2) = 2 := by first | exact three_token_k2n_domination_arith_split | (apply three_token_k2n_domination_arith_split <;> assumption) | (apply three_token_k2n_domination_arith_split <;> simp_all) | simpa using three_token_k2n_domination_arith_split
See it in the graphDiscuss this resultChallenge it