Theorems · Definition · order theory
MonotoneOn
{α : Type u} → {β : Type v} → [Preorder α] → [Preorder β] → (α → β) → Set α → PropA function f is monotone on s if, for all a, b ∈ s, a ≤ b implies f a ≤ f b.
- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 311 results in Mathlib
- Foundations
- Depth 4 from the axioms, rests on 11 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by311
Results whose statement or proof uses this declaration.
- Monotone.monotoneOnstatement · cited by 43
- AntitoneOn.dual_rightstatement · cited by 29
- monotoneOn_of_deriv_nonnegstatement · cited by 25
- MonotoneOn.monostatement and proof · cited by 16
- StrictMonoOn.monotoneOnstatement · cited by 12
- MonotoneOn.dualstatement · cited by 10
- ConvexOn.slope_monostatement · cited by 8
- AntitoneOn.negstatement · cited by 8
- MonotoneOn.negstatement and proof · cited by 8
- monotoneOn_univstatement and proof · cited by 6
- MonotoneOn.convex_lestatement and proof · cited by 6
- Monotone.comp_monotoneOnstatement and proof · cited by 6
Showing the 200 most cited of 311.