Theorems · Theorem · general topology
countable_bInter_mem
∀ {α : Type u_2} {l : Filter α} [CountableInterFilter l] {ι : Type u_4} {S : Set ι},
S.Countable → ∀ {s : (i : ι) → i ∈ S → Set α}, ⋂ i, ⋂ (hi : i ∈ S), s i hi ∈ l ↔ ∀ (i : ι) (hi : i ∈ S), s i hi ∈ l- Defined in
- Mathlib.Order.Filter.CountableInter
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CountableInterFilter
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- Filterstatement and proof · cited by 8,121
- Set.Elemproof · cited by 7,166
- Set.iInterstatement · cited by 1,084
- Set.Countablestatement and proof · cited by 545
- Encodableproof · cited by 140
- CountableInterFilterstatement and proof · cited by 78
- Set.Countable.toEncodableproof · cited by 22
- Set.biInter_eq_iInterproof · cited by 19
- countable_iInter_memproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- isLindelof_of_countable_subcoverproof · cited by 4
- eventually_countable_ballproof · cited by 3
- Filter.exists_subset_subsingleton_mem_of_forall_separatingproof · cited by 2
- IsLindelof.disjoint_nhdsSet_leftproof · cited by 1