AFTD Auto-Formalizing Theoretical Domains

in715_deficit_x_ok

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_x_ok : X.card = 5 ∧ ∀ t ∈ X, G.IsNClique 3 t ∧ (10 : Fin 14) ∈ t
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

The proof, explained

The theorem states that a specified family $X$ of vertex subsets in an explicit 14-vertex graph $G$ contains exactly 5 elements, each of which is a 3-clique (triangle) containing vertex 10. Because both $G$ and $X$ are finite and concrete, this property is decidable. The proof delegates the complete exhaustive check directly to Lean's kernel via computational evaluation.

  1. $X$ has cardinality 5, and each $t \in X$ is a 3-clique in $G$ containing vertex 10. automation

    Because $X$ and the graph $G$ are fully concrete, finite objects defined on the 14-element vertex set $\text{Fin } 14$, the statement is a decidable proposition. The `decide +kernel` tactic evaluates the cardinality of $X$ and checks for each of its members that it forms a triangle in $G$ containing vertex 10 by direct computation in Lean's kernel.

    line 6

    theorem in715_deficit_x_ok : X.card = 5 ∧ ∀ t ∈ X, G.IsNClique 3 t ∧ (10 : Fin 14) ∈ t := by 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_x_ok : X.card = 5 ∧ ∀ t ∈ X, G.IsNClique 3 t ∧ (10 : Fin 14) ∈ t := by decide +kernel
See it in the graphDiscuss this resultChallenge it