Theorems · Theorem · general topology
Filter.EventuallyLE.countable_iInter
∀ {ι : Sort u_1} {α : Type u_2} {l : Filter α} [CountableInterFilter l] [Countable ι] {s t : ι → Set α},
(∀ (i : ι), s i ≤ᶠ[l] t i) → ⋂ i, s i ≤ᶠ[l] ⋂ i, t i- Defined in
- Mathlib.Order.Filter.CountableInter
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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.iInterstatement and proof · cited by 1,084
- Filter.Eventually.monoproof · cited by 646
- Countablestatement and proof · cited by 633
- Filter.EventuallyLEstatement and proof · cited by 383
- CountableInterFilterstatement and proof · cited by 78
- Set.mem_iInterproof · cited by 69
- eventually_countable_forallproof · cited by 7
Cited by3
Results whose statement or proof uses this declaration.
- Filter.EventuallyLE.countable_bInterproof · cited by 2
- Filter.EventuallyEq.countable_iInterproof · cited by 1
- EventuallyLE.countable_iInterproof · cited by 0