AFTD Auto-Formalizing Theoretical Domains

in715_Wcover1

theoremverified

Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.

Statement

theorem in715_Wcover1 : ∀ e ∈ (sharp_EL.drop 5).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1
Source
Ten-vertex graph and pair-avoidance witnesses from experiments 20301–20303 and 20312; see state/campaigns/triangle_reductions/private_k4_in694.md.
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1

The proof, explained

The theorem asserts a pair-covering property: for any edge $e$ in the second five-element block of the edge list `sharp_EL` and any edge $f \\in \\mathrm{sharp\\_EL}$, there is some witness $q \\in \\mathrm{sharp\\_W}$ whose edge set contains both $e$ and $f$. Since all domains are concrete finite lists over the 10-element vertex set $\\mathrm{Fin}\\;10$, the claim is decidable. The proof delegates the exhaustive check of all 155 pairs directly to the Lean kernel evaluator using `decide +kernel`.

  1. For every edge $e$ in the slice of five edges from `sharp_EL` (indices 5 to 9) and every edge $f \\in \\mathrm{sharp\\_EL}$, there exists an element $q \\in \\mathrm{sharp\\_W}$ whose first component contains both $e$ and $f$. automation

    The proposition is a bounded quantification over explicit, finite lists of edges and witness tuples on the vertex set $\\mathrm{Fin}\\;10$. The tactic `decide +kernel` evaluates the resulting Boolean decision procedure directly in the Lean kernel by exhaustive finite case checking across all $5 \\times 31 = 155$ pairs $(e, f)$, confirming that a covering witness $q$ exists in `sharp_W` for each pair.

    line 5

    theorem in715_Wcover1 : ∀ e ∈ (sharp_EL.drop 5).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel

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

open scoped Sym2set_option maxRecDepth 100000set_option maxHeartbeats 30000000theorem in715_Wcover1 : ∀ e ∈ (sharp_EL.drop 5).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel
See it in the graphDiscuss this resultChallenge it