AFTD Auto-Formalizing Theoretical Domains

in715_Wok4

theoremverified

Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.

Statement

theorem in715_Wok4 : ∀ q ∈ in715_W4, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2)
Source
Ten-vertex graph and pair-avoidance witnesses from experiments 20301–20303 and 20312; see state/campaigns/triangle_reductions/private_k4_in694.md.
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1

The proof, explained

The theorem verifies that each configuration in the finite list in715_W4 satisfies four structural conditions: its collection of sets has size 8, every set belongs to sharp_T, distinct sets share at most one vertex, and no specified edge occurs in any set. Because all data structures and predicates are explicit and finite, the claim is decidable. The proof succeeds by direct kernel computation using decide +kernel.

  1. For every entry q in in715_W4, q.2 has cardinality 8, all its elements belong to sharp_T, any two distinct elements intersect in at most one vertex, and no edge in q.1 belongs to any element of q.2. automation

    The statement is a bounded universal quantification over finite lists of finite sets and edges over Fin 10, making the entire proposition decidable. The tactic decide +kernel instructs Lean's kernel to reduce the decision procedure by direct computation, verifying all four conditions for each witness in in715_W4.

    line 5

    theorem in715_Wok4 : ∀ q ∈ in715_W4, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2) := 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 30000000theorem in715_Wok4 : ∀ q ∈ in715_W4, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2) := by decide +kernel
See it in the graphDiscuss this resultChallenge it