AFTD Auto-Formalizing Theoretical Domains

in715_deficit_proper_row_6

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_proper_row_6 : ∀ v : Fin 14, G.Adj 6 v → s((6 : Fin 14),v) ∉ C → color 6 ≠ 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 the coloring on the explicit 14-vertex graph is proper at vertex 6 along all edges outside the deficit set C. The proof proceeds by exhaustively checking each of the 14 possible vertices v in the graph. In each case, the condition reduces to a finite boolean check verified directly by computation in Lean's kernel.

  1. Fix an arbitrary vertex v of the graph.

    We introduce the universally quantified variable v from the finite vertex type Fin 14.

    line 7

      intro v
  2. If vertex 6 is adjacent to v and the edge s(6, v) is not in C, then vertices 6 and v have distinct colors. automation

    Since there are only fourteen vertices, we enumerate each possible value of v in {0, ..., 13}. For each case, the adjacency condition, set non-membership, and color inequality evaluate to concrete boolean values from the explicit definitions, which Lean's kernel verifies by direct computation.

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