AFTD Auto-Formalizing Theoretical Domains

in715_deficit_proper_row_3

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_proper_row_3 : ∀ v : Fin 14, G.Adj 3 v → s((3 : Fin 14),v) ∉ C → color 3 ≠ 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 every edge incident to vertex 3 in the 14-vertex graph $G$ is properly colored by `color`, except possibly for edges belonging to the deficit set $C$. The proof introduces an arbitrary vertex $v$ and performs an exhaustive case analysis over all 14 elements of $\mathrm{Fin}\ 14$. Because the graph adjacency, set membership, and coloring are completely concrete and finite, each of the 14 cases is verified by direct kernel evaluation.

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

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

    line 7

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

    Since $v$ belongs to the finite type $\mathrm{Fin}\ 14$, `fin_cases` splits the goal into 14 exhaustive cases $v = 0, 1, \dots, 13$. For each specific vertex, the adjacency relation in $G$, membership of the edge $\{3, v\}$ in the finite set $C$, and the comparison of boolean colors are all concrete, decidable terms. Lean's kernel evaluates each case directly via computational reduction (`decide +kernel`) to close all 14 subgoals.

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