AFTD Auto-Formalizing Theoretical Domains

strongly_incomparable

def

An indexed family of finset families 𝒜 : ι → Finset (Finset α) is strongly incomparable if for all i j : ι with i ≠ j, for all A ∈ 𝒜 i and B ∈ 𝒜 j, A is not a subset of B.

Statement

def strongly_incomparable {ι α : Type*} (𝒜 : ι → Finset (Finset α)) : Prop
Defined in
arXiv:2611.12199
Verified
10 Nov 2026
Axioms
none listed
Used by 24

Read back from the Lean

For any types ι and α, and any family 𝒜 : ι → Finset (Finset α) of finite collections of finite subsets of α, strongly_incomparable 𝒜 asserts that for all indices i, j : ι such that i ≠ j, and for all sets A ∈ 𝒜 i and B ∈ 𝒜 j, A is not a subset of B (¬(A ⊆ B)).

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

/-- Families of sets are strongly incomparable if no set in one family is a subset of a set in another family. -/
def strongly_incomparable {ι α : Type*} (𝒜 : ι → Finset (Finset α)) : Prop := ∀ i j, i ≠ j → ∀ A ∈ 𝒜 i, ∀ B ∈ 𝒜 j, ¬(A ⊆ B)
See it in the graphDiscuss this resultChallenge it