Theorems · Theorem · general topology
Ultrafilter.finite_biUnion_mem_iff
∀ {α : Type u} {β : Type v} {f : Ultrafilter α} {is : Set β} {s : β → Set α},
is.Finite → (⋃ i ∈ is, s i ∈ f ↔ ∃ i ∈ is, s i ∈ f)- Defined in
- Mathlib.Order.Filter.Ultrafilter.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.iUnionstatement · cited by 2,483
- Set.Finitestatement and proof · cited by 1,814
- Ultrafilterstatement and proof · cited by 193
- Set.Finite.imageproof · cited by 96
- Ultrafilter.finite_sUnion_mem_iffproof · cited by 5
Cited by3
Results whose statement or proof uses this declaration.
- Set.Finite.isCompact_biUnionproof · cited by 11
- Ultrafilter.eq_pure_of_finite_memproof · cited by 2
- Ultrafilter.eventually_exists_mem_iffproof · cited by 2