AFTD Auto-Formalizing Theoretical Domains

in715_Wok3

theoremverified

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

Statement

theorem in715_Wok3 : ∀ q ∈ in715_W3, 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 asserts that each configuration in the explicit finite list in715_W3 satisfies four properties on the ten-vertex set Fin 10: it has exactly 8 distinct blocks, each block is in sharp_T, distinct blocks intersect in at most one vertex (forming a triangle packing), and no block contains any of the specified avoided edges. Because the domain and all predicates are finite and constructive, the proposition is decidable. The proof delegates the entire verification to Lean's kernel via `decide +kernel`, which computes the result by exhaustive evaluation.

  1. Every configuration in in715_W3 satisfies the block-count, membership, pairwise intersection, and edge-avoidance conditions. automation

    Because in715_W3 is an explicit finite list of pairs on the finite vertex set Fin 10, the universal quantification and all its conjuncts are decidable. The `decide +kernel` tactic delegates the exhaustive evaluation of these conditions directly to the Lean kernel's reduction engine, which verifies that the predicate evaluates to true for every entry.

    line 5

    theorem in715_Wok3 : ∀ q ∈ in715_W3, 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_Wok3 : ∀ q ∈ in715_W3, 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