in715_Wcover0
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
- 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 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`.
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.
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
- The proof relies entirely on kernel computation (`decide +kernel`), which exhaustively evaluates the finite search without producing individual deduction steps for each pair of edges.
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_Wcover0 : ∀ e ∈ (sharp_EL.drop 0).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel