Theorems · Theorem · general topology
Filter.EventuallyLE.iInter
∀ {α : Type u} {ι : Sort x} {l : Filter α} [Finite ι] {s t : ι → Set α},
(∀ (i : ι), s i ≤ᶠ[l] t i) → ⋂ i, s i ≤ᶠ[l] ⋂ i, t i- Defined in
- Mathlib.Order.Filter.Finite
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Finitestatement and proof · cited by 3,029
- Set.iInterstatement and proof · cited by 1,084
- Filter.Eventually.monoproof · cited by 646
- Filter.EventuallyLEstatement and proof · cited by 383
- Set.mem_iInterproof · cited by 69
- Filter.eventually_allproof · cited by 16
Cited by2
Results whose statement or proof uses this declaration.
- Set.Finite.eventuallyLE_iInterproof · cited by 1
- Filter.EventuallyEq.iInterproof · cited by 0