AFTD Auto-Formalizing Theoretical Domains

in715_deficit_outside

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_outside : (10 : Fin 14) ∉ P.biUnion id
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
  • 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…

The proof, explained

The theorem asserts that the vertex 10 does not belong to the union of the sets in the family P. Because P is an explicitly given finite collection of triples in Fin 14, membership in its union is a decidable statement. Lean's kernel verifies this claim directly by exhaustive finite computation.

  1. Vertex 10 does not belong to any subset in the family P (that is, 10 ∉ ⋃ P). automation

    The family P consists of seven explicit triples of vertices in Fin 14: {0, 1, 5}, {1, 2, 6}, {2, 3, 7}, {3, 4, 8}, {0, 4, 9}, {0, 11, 12}, and {1, 11, 13}. The union of these sets is {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13}, which excludes 10. Because this is a finite proposition over concrete finite sets, the tactic `decide +kernel` settles it by exhaustive computation in the Lean kernel.

    line 6

    theorem in715_deficit_outside : (10 : Fin 14) ∉ P.biUnion id := 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_outside : (10 : Fin 14) ∉ P.biUnion id := by decide +kernel
See it in the graphDiscuss this resultChallenge it