English
Simplicial equivalences relate curry to membership in the product filter.
Русский
Симплексиальные эквивалентности связывают карри с принадлежностью произведённому фильтру.
LaTeX
$$$Eq ( Filter.instMembership.mem (l.curry m) s ) = ( Filter.Eventually (\\lambda x, Filter.Eventually (\\lambda y, s {fst:=x, snd:=y} ) m) l)$$$
Lean4
/-- `Filter.CountableGenerateSets g` is the (sets of the)
greatest `countableInterFilter` containing `g`. -/
inductive CountableGenerateSets : Set α → Prop
| basic {s : Set α} : s ∈ g → CountableGenerateSets s
| univ : CountableGenerateSets univ
| superset {s t : Set α} : CountableGenerateSets s → s ⊆ t → CountableGenerateSets t
| sInter {S : Set (Set α)} : S.Countable → (∀ s ∈ S, CountableGenerateSets s) → CountableGenerateSets (⋂₀ S)
