AFTD Auto-Formalizing Theoretical Domains

collection_min_nonempty

def

Given a type α with decidable equality and a finite collection C of finite subsets of α, collection_min_nonempty C is the subcollection of all sets S ∈ C such that S is nonempty, and for every T ∈ C, if T is nonempty and T ⊆ S, then T = S.

Statement

def collection_min_nonempty {α : Type*} [DecidableEq α] (C : Finset (Finset α)) : Finset (Finset α)
Defined in
arXiv:2611.01102, Definition 2.4
Verified
03 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a type α with decidable equality and a finite set C of finite subsets of α, collection_min_nonempty C is the sub-collection of all sets S ∈ C such that S is nonempty, and for every T ∈ C, if T is nonempty and T ⊆ S, then T = S (i.e., the inclusion-minimal nonempty elements of C).

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

/-- The minimal nonempty sets in a collection C of finite sets: nonempty sets with no proper nonempty subset in C. -/
def collection_min_nonempty {α : Type*} [DecidableEq α] (C : Finset (Finset α)) : Finset (Finset α) :=
  C.filter fun S => S.Nonempty ∧ ∀ T ∈ C, T.Nonempty → T ⊆ S → T = S
See it in the graphDiscuss this resultChallenge it