AFTD Auto-Formalizing Theoretical Domains

in715_Wcover4

theoremverified

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

Statement

theorem in715_Wcover4 : ∀ e ∈ (sharp_EL.drop 20).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 establishes that any edge $e$ from indices 20 through 24 of `sharp_EL`, together with any edge $f \\in \\text{sharp\\_EL}$, are simultaneously covered by the edge set of some witness $q$ in `sharp_W`. Because the list of edges and the list of witnesses are finite and explicitly given, this is a bounded universal statement over decidable predicates. The proof proceeds entirely by kernel-level computation (`decide +kernel`).

  1. For every edge $e$ in the five-element sublist `(sharp_EL.drop 20).take 5` 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 fully explicit finite lists, checking that each of the $5 \\times 31 = 155$ pairs of edges $(e, f)$ is covered by some candidate in `sharp_W` is a decidable proposition. The proof delegates this exhaustive check to Lean's kernel evaluator.

    line 5

    theorem in715_Wcover4 : ∀ e ∈ (sharp_EL.drop 20).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_Wcover4 : ∀ e ∈ (sharp_EL.drop 20).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