in715_Wcover6
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
- in715_sharp_witness_countFinite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
- simple_graph_in693_ten_seed_packing_numberThe concrete ten-vertex five-link seed has triangle packing number eight.
- Used by 1
- simple_graph_in693_ten_seed_pair_stableDeleting any two distinct edges of the ten-vertex seed leaves its triangle packing number equal to eight.
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`.
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.
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
- The proof performs no symbolic deduction: it delegates the entire verification to the Lean kernel via computational reflection (`decide +kernel`), which exhaustively checks the finite search space.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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