Theorems · Theorem · general topology
Monotone.frequently_le_map_of_frequently_le
∀ {R : Type u_5} {S : Type u_6} {F : Filter R} [inst : LinearOrder R] [inst_1 : LinearOrder S] {f : R → S},
Monotone f → ∀ {l : R}, (∃ᶠ (x : R) in F, x ≤ l) → ∃ᶠ (x' : S) in Filter.map f F, x' ≤ f l- Defined in
- Mathlib.Order.Filter.IsBounded
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrderLinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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
- Set.ofPredproof · cited by 6,101
- Set.preimageproof · cited by 4,946
- Filter.Eventuallyproof · cited by 3,134
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Monotonestatement and proof · cited by 1,397
- Filter.mapstatement and proof · cited by 819
- Filter.Frequentlystatement and proof · cited by 414
- not_leproof · cited by 328
- not_ltproof · cited by 306
Cited by2
Results whose statement or proof uses this declaration.
- Antitone.frequently_ge_map_of_frequently_leproof · cited by 1
- Monotone.isCoboundedUnder_ge_of_isCoboundedproof · cited by 0