AFTD Auto-Formalizing Theoretical Domains

in715_deficit_c_edges

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_c_edges : ∀ e ∈ C, e ∈ G.edgeSet
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 3

The proof, explained

The theorem asserts that every edge in a distinguished set of pairs $C$ belongs to the edge set of the explicit fourteen-vertex graph $G$. Because both $C$ and $G$ are finite objects on $\mathrm{Fin}(14)$, this universal quantification over a finite set is a decidable proposition. The entire proof is carried out by direct computational evaluation in the Lean kernel via `decide +kernel`.

  1. Every edge in the finite set $C$ is an edge of the graph $G$. automation

    The edge set of $G$ and the collection $C$ are both explicitly given finite combinatorial objects on the vertex set $\mathrm{Fin}(14)$. Checking whether every element $e \in C$ satisfies $e \in G.\mathrm{edgeSet}$ reduces to a finite number of decidable boolean checks, which Lean verifies by exhaustive computation in the kernel.

    line 6

    theorem in715_deficit_c_edges : ∀ e ∈ C, e ∈ G.edgeSet := 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_c_edges : ∀ e ∈ C, e ∈ G.edgeSet := by decide +kernel
See it in the graphDiscuss this resultChallenge it