AFTD Auto-Formalizing Theoretical Domains

in715_Wcover6

theoremverified

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

Statement

theorem in715_Wcover6 : ∀ e ∈ (sharp_EL.drop 30).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 states that every edge $e$ in the slice of `sharp_EL` beginning at index 30, paired with any edge $f \\in \\text{sharp\\_EL}$, is simultaneously covered by the first component of some witness pair $q \\in \\text{sharp\\_W}$. Because the lists and domain are completely explicit and finite, the statement is decidable and is proved by kernel evaluation via `decide +kernel`.

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

    Because `sharp_EL` and `sharp_W` are explicitly defined finite lists over the finite vertex set $\\text{Fin } 10$, the bounded quantifiers and list membership conditions form a decidable proposition. The `decide +kernel` tactic evaluates this decision procedure directly inside the Lean kernel by exhaustive finite verification.

    line 5

    theorem in715_Wcover6 : ∀ e ∈ (sharp_EL.drop 30).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_Wcover6 : ∀ e ∈ (sharp_EL.drop 30).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