Theorems · Theorem · order theory
monotoneOn_iff_forall_lt
∀ {α : Type u} {β : Type v} [inst : PartialOrder α] [inst_1 : Preorder β] {f : α → β} {s : Set α},
MonotoneOn f s ↔ ∀ ⦃a : α⦄, a ∈ s → ∀ ⦃b : α⦄, b ∈ s → a < b → f a ≤ f b- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderPreorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- PartialOrderstatement and proof · cited by 6,410
- LT.lt.leproof · cited by 2,189
- Eq.leproof · cited by 605
- MonotoneOnstatement and proof · cited by 311
- LE.le.eq_or_ltproof · cited by 220
Cited by5
Results whose statement or proof uses this declaration.
- StrictMonoOn.monotoneOnproof · cited by 12
- monovaryOn_iff_exists_monotoneOnproof · cited by 1
- StrictMonoOn.trans_monovaryOnproof · cited by 0
- StrictAntiOn.trans_antivaryOnproof · cited by 0
- monovaryOn_id_iffproof · cited by 0