AFTD Auto-Formalizing Theoretical Domains

finset_restricted_family

def

Given a family of sets F and sets J and U, the restricted family F_{J,U} consists of all subsets A of J such that A ∪ U is in F.

Statement

def finset_restricted_family {α : Type*} [DecidableEq α] (ℱ : Finset (Finset α)) (J U : Finset α) : Finset (Finset α)
Defined in
arXiv:2611.06860, Section 2.2
Verified
08 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

Given a type α with decidable equality, a family of finite sets ℱ : Finset (Finset α), and finite sets J, U : Finset α, finset_restricted_family ℱ J U is defined as the finite set of all subsets A of J such that A ∪ U ∈ ℱ.

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 restricted family F_{J,U} = {A ⊆ J : A ∪ U ∈ F}. -/
def finset_restricted_family {α : Type*} [DecidableEq α] (ℱ : Finset (Finset α)) (J U : Finset α) : Finset (Finset α) := J.powerset.filter (fun A => A ∪ U ∈ ℱ)
See it in the graphDiscuss this resultChallenge it