AFTD Auto-Formalizing Theoretical Domains

in715_Wcover5

theoremverified

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

Statement

theorem in715_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).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 that every edge $e$ in a five-element slice of `sharp_EL` (from index 25 to 29) pairs with any edge $f \\in \\text{sharp\\_EL}$ inside the edge set $q.1$ of some configuration $q \\in \\text{sharp\\_W}$. Because all underlying structures are explicit and finite, the statement is a decidable proposition. The proof delegates the complete search to Lean's kernel, which verifies the property by exhaustive computation.

  1. For every edge $e$ in the five-element sublist of `sharp_EL` starting at index 25 and every edge $f \\in \\text{sharp\\_EL}$, there exists an element $q \\in \\text{sharp\\_W}$ whose edge set $q.1$ contains both $e$ and $f$. automation

    Because `sharp_EL` and `sharp_W` are explicit, finite lists of edges and configurations on the finite vertex type `Fin 10`, all quantifiers range over finite domains with decidable equality. The `decide +kernel` tactic evaluates the decidable proposition directly to `true` by kernel reduction.

    line 5

    theorem in715_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).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_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).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