Theorems · Definition · order theory
StrictMonoOn
{α : Type u} → {β : Type v} → [Preorder α] → [Preorder β] → (α → β) → Set α → PropA function f is strictly monotone on s if, for all a, b ∈ s, a < b implies
f a < f b.
- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 194 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 by196
Results whose statement or proof uses this declaration.
- StrictMono.strictMonoOnstatement · cited by 24
- StrictMonoOn.injOnstatement and proof · cited by 22
- StrictMonoOn.le_iff_lestatement and proof · cited by 17
- StrictMonoOn.monostatement and proof · cited by 15
- StrictMonoOn.lt_iff_ltstatement and proof · cited by 14
- Real.strictMonoOn_logstatement · cited by 13
- StrictMonoOn.monotoneOnstatement and proof · cited by 12
- strictMonoOn_of_deriv_posstatement · cited by 9
- StrictAntiOn.dual_rightstatement · cited by 8
- pow_left_strictMonoOn₀statement · cited by 6
- StrictMonoOn.dualstatement · cited by 6
- Cardinal.toNat_strictMonoOnstatement · cited by 5