AFTD Auto-Formalizing Theoretical Domains

IsSpiny

def

For a type α and a finite collection S of finite subsets of α, IsSpiny S holds if and only if for every set A ∈ S, there exists an element x ∈ A such that for all B ∈ S with B ≠ A, x ∉ B.

Statement

def IsSpiny {α : Type*} (S : Finset (Finset α)) : Prop
Defined in
scout/2611-13495-the-largest-ground-set-for-sunflower-free-systems.md:107
Verified
11 Nov 2026
Axioms
none listed

Read back from the Lean

For a type α and a finite set S of finite sets of elements of α, IsSpiny S is defined to hold if and only if for every set A ∈ S, there exists an element x ∈ A such that for every set B ∈ S, if B ≠ A, then x ∉ B (that is, every set in S contains an element that belongs to no other set in S).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A finite family of finite sets is spiny if each member contains an element appearing in no other member. -/
def IsSpiny {α : Type*} (S : Finset (Finset α)) : Prop := ∀ A ∈ S, ∃ x ∈ A, ∀ B ∈ S, B ≠ A → x ∉ B
See it in the graphDiscuss this resultChallenge it