AFTD Auto-Formalizing Theoretical Domains

has_strong_elimination

def

Given a type α with decidable equality, a finite collection C of finite subsets of α has the strong elimination property if for all C₁, C₂ ∈ C, every element x ∈ C₁ ∩ C₂, and every element y ∈ C₁ \ C₂, there exists some C₃ ∈ C such that y ∈ C₃ and C₃ ⊆ (C₁ ∪ C₂) \ {x}.

Statement

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

Read back from the Lean

Let α be a type with decidable equality, and let C be a finite set of finite subsets of α. The definition has_strong_elimination C asserts that for all C₁ ∈ C and C₂ ∈ C, for every element x ∈ C₁ ∩ C₂, and for every element y ∈ C₁ \ C₂, there exists some C₃ ∈ C such that y ∈ C₃ and C₃ ⊆ (C₁ ∪ C₂) \ {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

/-- The strong elimination property for a collection of subsets: eliminating x while preserving y in C₁. -/
def has_strong_elimination {α : Type*} [DecidableEq α] (C : Finset (Finset α)) : Prop :=
  ∀ C₁ ∈ C, ∀ C₂ ∈ C, ∀ x ∈ C₁ ∩ C₂, ∀ y ∈ C₁ \ C₂,
    ∃ C₃ ∈ C, y ∈ C₃ ∧ C₃ ⊆ (C₁ ∪ C₂) \ {x}
See it in the graphDiscuss this resultChallenge it