AFTD Auto-Formalizing Theoretical Domains

triangle_hypergraph_obstruction11_nodup

theoremverified

The eleven listed triples are distinct.

Statement

theorem triangle_hypergraph_obstruction11_nodup : triangle_hypergraph_obstruction11.Nodup
Source
Elementary property of the finite hypergraph obstruction from experiment 13111.
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • triangle_hypergraph_obstruction11An explicit eleven-point eleven-triple linear degree-three system arising as a counterexample to a proposed hypergraph extension of…

The proof, explained

The theorem asserts that the eleven hyperedges defining `triangle_hypergraph_obstruction11` are all distinct. Because the hyperedges are explicit finite subsets of `Fin 11`, the proposition is decidable and proved by direct computation using the `decide` tactic.

  1. The list triangle_hypergraph_obstruction11 has no duplicate elements. automation

    Because the list and each of its eleven finset elements over `Fin 11` are completely concrete and finite, whether the list has duplicate elements is a decidable proposition. The `decide` tactic evaluates the pairwise inequalities by direct computation to confirm all eleven elements are distinct.

    line 1

    theorem triangle_hypergraph_obstruction11_nodup : triangle_hypergraph_obstruction11.Nodup := by decide

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

theorem triangle_hypergraph_obstruction11_nodup : triangle_hypergraph_obstruction11.Nodup := by decide
See it in the graphDiscuss this resultChallenge it