Theorems · Definition · order theory
Monotone
{α : Type u} → {β : Type v} → [Preorder α] → [Preorder β] → (α → β) → PropA function f is monotone if a ≤ b implies f a ≤ f b.
- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 1,397 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 5 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
Cited by1,466
Results whose statement or proof uses this declaration.
- StrictMono.monotonestatement · cited by 118
- eVariationOnproof · cited by 90
- GaloisConnection.monotone_lstatement · cited by 76
- Nat.mono_caststatement · cited by 76
- OrderHom.monotonestatement · cited by 70
- Monotone.compstatement and proof · cited by 67
- Monotone.functorstatement and proof · cited by 66
- Filter.map_monostatement · cited by 63
- List.SortedLEproof · cited by 57
- Monotone.map_maxstatement and proof · cited by 55
- GaloisConnection.monotone_ustatement · cited by 53
- monotone_nat_of_le_succstatement · cited by 45
Showing the 200 most cited of 1,466.