AFTD Auto-Formalizing Theoretical Domains

in715_Wcover0

theoremverified

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

Statement

theorem in715_Wcover0 : ∀ e ∈ (sharp_EL.drop 0).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 statement is a finite combinatorial check: for each of the first 5 edges $e$ in the list `sharp_EL` and every edge $f$ in `sharp_EL`, there is a configuration $q \\in \\text{sharp\\_W}$ whose edge set $q.1$ contains both $e$ and $f$. Because all sets and quantifiers involved are finite and decidable, the proof proceeds by direct computation in Lean's kernel using `decide +kernel`.

  1. For every edge $e$ in the first 5 edges of `sharp_EL` and every edge $f \\in \\text{sharp\\_EL}$, there exists an element $q \\in \\text{sharp\\_W}$ such that both $e$ and $f$ belong to $q.1$. automation

    Because `sharp_EL` and `sharp_W` are explicit finite lists and equality on the ten-vertex edge set $\\text{Sym2}(\\text{Fin } 10)$ is decidable, the statement is a bounded sentence over finite lists with a decidable truth value. The tactic `decide +kernel` evaluates the corresponding decision procedure directly within Lean's kernel, exhaustively verifying the condition for all $5 \\times 31 = 155$ edge pairs.

    line 5

    theorem in715_Wcover0 : ∀ e ∈ (sharp_EL.drop 0).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_Wcover0 : ∀ e ∈ (sharp_EL.drop 0).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