Theorems · Theorem · order theory
monotone_iff_forall_lt
∀ {α : Type u} {β : Type v} [inst : PartialOrder α] [inst_1 : Preorder β] {f : α → β},
Monotone f ↔ ∀ ⦃a b : α⦄, a < b → f a ≤ f b- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 9 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.
Cites6
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
- PartialOrderstatement and proof · cited by 6,410
- LT.lt.leproof · cited by 2,189
- Monotonestatement · cited by 1,397
- Eq.leproof · cited by 605
- LE.le.eq_or_ltproof · cited by 220
Cited by9
Results whose statement or proof uses this declaration.
- StrictMono.monotoneproof · cited by 118
- Fin.monotone_iff_le_succproof · cited by 5
- Ordinal.veblenWith_left_monotoneproof · cited by 2
- Tuple.antitone_pair_of_not_sorted'proof · cited by 2
- Matrix.IsPivotedBy.monotoneproof · cited by 1
- AddConstMapClass.monotone_iff_Iccproof · cited by 1
- monovary_id_iffproof · cited by 0
- StrictMono.trans_monovaryproof · cited by 0
- StrictAnti.trans_antivaryproof · cited by 0