AFTD Auto-Formalizing Theoretical Domains

is_compatible_collection

def

For an arbitrary type V with decidable equality, a finite collection C of finite subsets of V (C : Finset (Finset V)) is compatible if for all distinct sets C1, C2 in C and every element x in C1 ∩ C2, there exists a set C3 in C such that C3 ⊆ (C1 ∪ C2) \ {x}.

Statement

def is_compatible_collection {V : Type*} [DecidableEq V] (C : Finset (Finset V)) : Prop
Defined in
arXiv:2611.01102 Sec. 2, Definition 2.6 and line 201
Verified
03 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

Let $V$ be a type with decidable equality, and let $C$ be a finite set of finite subsets of $V$. The definition is_compatible_collection C asserts that for all $C_1, C_2 \in C$ such that $C_1 \neq C_2$, and for every element $x \in C_1 \cap C_2$, there exists an element $C_3 \in C$ such that $C_3 \subseteq (C_1 \cup C_2) \setminus \{x\}$.

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 collection of subsets is compatible if for distinct C1, C2 and x in C1 ∩ C2, there is C3 ⊆ (C1 ∪ C2) \ {x}. -/
def is_compatible_collection {V : Type*} [DecidableEq V] (C : Finset (Finset V)) : Prop := ∀ C1 ∈ C, ∀ C2 ∈ C, C1 ≠ C2 → ∀ x ∈ C1 ∩ C2, ∃ C3 ∈ C, C3 ⊆ (C1 ∪ C2) \ {x}
See it in the graphDiscuss this resultChallenge it