Theorems · Theorem · order theory
monotone_of_pred_le
∀ {α : Type u_3} {β : Type u_4} [inst : PartialOrder α] [inst_1 : Preorder β] [inst_2 : PredOrder α]
[IsPredArchimedean α] {f : α → β}, (∀ (a : α), ¬IsMin a → f (Order.pred a) ≤ f a) → Monotone f- Defined in
- Mathlib.Order.SuccPred.Archimedean
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Monotonestatement · cited by 1,397
- PredOrderstatement and proof · cited by 334
- IsMinstatement and proof · cited by 277
- Order.predstatement and proof · cited by 273
- IsPredArchimedeanstatement and proof · cited by 66
- monotoneOn_of_pred_leproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- monotone_of_sub_one_leproof · cited by 0