in715_deficit_private_tip
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_private_tip : ({0,4,9} : Finset (Fin 14)) ∈ P ∧
∀ t ∈ P, (9 : Fin 14) ∈ t → t = ({0,4,9} : Finset (Fin 14))- Source
- Finite graph and certificates from experiments 20940 and 20968; see state/campaigns/triangle_reductions/outside_induced_kernel_in701.md.
- Verified
- 10 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- in715_deficit_p_sizeFinite certificate for the explicit fourteen-vertex graph.
- Used by 2
- in715_deficit_preciseAn explicit fourteen-vertex graph has a maximum seven-triangle packing, a seven-edge triangle cover, an outside five-cycle link and a…
- is_partial_transversal_emptyFor any dimension δ : ℕ and any finset of cells S in Fin δ × Fin δ, the empty finset ∅ is a partial transversal of S…
The proof, explained
The theorem asserts that the subset {0, 4, 9} belongs to the family P of 3-element vertex sets in a 14-vertex graph, and that vertex 9 is a private tip of this set (it belongs to no other member of P). Because P is an explicit finite collection over the finite type Fin 14, both conjuncts are decidable. The proof evaluates the proposition directly to true using Lean's kernel computation via `decide +kernel`.
{0, 4, 9} ∈ P and every subset t ∈ P containing vertex 9 is equal to {0, 4, 9} automation
Because P is an explicitly defined finite set of 3-element subsets of Fin 14 (specifically, {{0, 1, 5}, {1, 2, 6}, {2, 3, 7}, {3, 4, 8}, {0, 4, 9}, {0, 11, 12}, {1, 11, 13}}), both membership in P and the bounded universal quantification over P are decidable predicates. The tactic `decide +kernel` delegates the exhaustive check of both conjuncts to Lean's kernel via computational reflection, verifying that {0, 4, 9} ∈ P and that 9 appears in no other element of P.
∀ t ∈ P, (9 : Fin 14) ∈ t → t = ({0,4,9} : Finset (Fin 14)) := by decide +kernel
- The entire proof is executed by `decide +kernel`, which checks the finite combinatorial condition by direct kernel computation rather than building an explicit step-by-step mathematical proof from library lemmas.
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 30000000open In701Deficit14theorem in715_deficit_private_tip : ({0,4,9} : Finset (Fin 14)) ∈ P ∧ ∀ t ∈ P, (9 : Fin 14) ∈ t → t = ({0,4,9} : Finset (Fin 14)) := by decide +kernel