AFTD Auto-Formalizing Theoretical Domains

is_uncomplemented

def

A family of subsets of a finite set is uncomplemented if no set and its complement both belong to the family.

Statement

def is_uncomplemented {α : Type*} [Fintype α] [DecidableEq α] (𝒜 : Finset (Finset α)) : Prop
Defined in
arXiv:2611.12199
Verified
10 Nov 2026
Axioms
none listed
Used by 29

Read back from the Lean

Given a finite type α with decidable equality, a family of finite sets 𝒜 : Finset (Finset α) satisfies is_uncomplemented 𝒜 if and only if for every set A in 𝒜, the complement of A (with respect to the universe of α) is not an element of 𝒜.

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 family of sets is uncomplemented if it contains no set together with its complement. -/
def is_uncomplemented {α : Type*} [Fintype α] [DecidableEq α] (𝒜 : Finset (Finset α)) : Prop := ∀ A ∈ 𝒜, Aᶜ ∉ 𝒜
See it in the graphDiscuss this resultChallenge it