Theorems · Theorem · general topology
Filter.EventuallyLE.countable_bUnion
∀ {α : Type u_2} {l : Filter α} [CountableInterFilter l] {ι : Type u_4} {S : Set ι},
S.Countable →
∀ {s t : (i : ι) → i ∈ S → Set α},
(∀ (i : ι) (hi : i ∈ S), s i hi ≤ᶠ[l] t i hi) → ⋃ i, ⋃ (h : i ∈ S), s i h ≤ᶠ[l] ⋃ i, ⋃ (h : i ∈ S), t i h- Defined in
- Mathlib.Order.Filter.CountableInter
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 65 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.
Cites11
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.iUnionstatement · cited by 2,483
- Set.Countablestatement and proof · cited by 545
- Filter.EventuallyLEstatement and proof · cited by 383
- Encodableproof · cited by 140
- CountableInterFilterstatement and proof · cited by 78
- Set.biUnion_eq_iUnionproof · cited by 41
- Set.Countable.toEncodableproof · cited by 22
- Filter.EventuallyLE.countable_iUnionproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Filter.EventuallyEq.countable_bUnionproof · cited by 2
- EventuallyLE.countable_bUnionproof · cited by 0