AFTD Auto-Formalizing Theoretical Domains

in715_deficit_c_size

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_c_size : C.card = 7
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
Quot.soundpropext
Built on 1
Used by 2
  • in715_deficit_preciseAn explicit fourteen-vertex graph has a maximum seven-triangle packing, a seven-edge triangle cover, an outside five-cycle link and a…
  • in715_deficit_pack_eqFinite certificate for the explicit fourteen-vertex graph.

The proof, explained

The theorem asserts that the edge set C has cardinality 7. Since C is explicitly defined as an enumerated finite set of seven distinct edges on a 14-vertex graph, the cardinality claim is decidable and proven by direct computational evaluation in the Lean kernel.

  1. The cardinality of C is 7. automation

    The edge set C is explicitly defined as the finite set of seven unordered pairs {s(0, 1), s(1, 2), s(2, 3), s(3, 4), s(0, 4), s(0, 11), s(1, 11)} on the vertex set Fin 14. Because the set is finite and all its elements are concrete, the proposition that its cardinality equals 7 is decidable. The `decide +kernel` tactic evaluates this decision procedure directly within the Lean kernel to establish the identity.

    line 6

    theorem in715_deficit_c_size : C.card = 7 := 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_size : C.card = 7 := by decide +kernel
See it in the graphDiscuss this resultChallenge it