Theorems · Theorem · general topology
Filter.IsCoboundedUnder.frequently_ge
∀ {α : Type u_1} {ι : Type u_4} [inst : LinearOrder α] {f : Filter ι} [f.NeBot] {u : ι → α},
Filter.IsCoboundedUnder (fun x1 x2 => x1 ≤ x2) f u → ∃ a, ∃ᶠ (x : ι) in f, a ≤ u x- Defined in
- Mathlib.Order.Filter.IsBounded
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderFilter.NeBot
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.
- LinearOrderstatement and proof · cited by 8,572
- Filterstatement and proof · cited by 8,121
- Filter.NeBotstatement and proof · cited by 853
- Filter.Frequentlystatement · cited by 414
- Filter.IsCoboundedUnderstatement and proof · cited by 102
- Filter.IsCobounded.frequently_geproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Filter.isCoboundedUnder_le_addproof · cited by 2