AFTD Auto-Formalizing Theoretical Domains

in715_deficit_proper_row_4

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_proper_row_4 : ∀ v : Fin 14, G.Adj 4 v → s((4 : Fin 14),v) ∉ C → color 4 ≠ color v
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
Used by 1

The proof, explained

The theorem establishes that vertex 4 satisfies the proper coloring condition (outside of the exceptional set of edges $C$) with respect to all of its neighbors in the 14-vertex graph $G$. The proof introduces an arbitrary vertex $v$ and performs an exhaustive case analysis over all 14 vertices in $\mathrm{Fin}\,14$. For each case, the statement reduces to a concrete decidable proposition that is discharged by kernel computation.

  1. Fix an arbitrary vertex $v$ in the graph.

    We introduce the universally quantified variable $v \in \mathrm{Fin}\,14$ into the local context.

    line 7

      intro v
  2. For each possible vertex $v \in \{0, \dots, 13\}$, if vertex 4 is adjacent to $v$ and the edge $\{4, v\}$ is not in $C$, then vertex 4 and vertex $v$ have different colors. automation

    The tactic `fin_cases` enumerates the 14 possible values of $v \in \mathrm{Fin}\,14$. Each of the resulting 14 subgoals is a closed, decidable proposition about explicitly defined finite objects (the graph $G$, the set $C$, and the coloring function). Lean's kernel evaluates each case directly by computation via `decide +kernel`.

    line 8

      fin_cases v <;> 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 30000000open In701Deficit14theorem in715_deficit_proper_row_4 : ∀ v : Fin 14, G.Adj 4 v → s((4 : Fin 14),v) ∉ C → color 4 ≠ color v := by  intro v  fin_cases v <;> decide +kernel
See it in the graphDiscuss this resultChallenge it