Theorems · Inductive type · order theory
OrderAddMonoidHom
(α : Type u_6) → (β : Type u_7) → [Preorder α] → [Preorder β] → [AddZeroClass α] → [AddZeroClass β] → Type (max u_6 u_7)
α →+o β is the type of monotone functions α → β that preserve the ordered additive monoid
structure.
OrderAddMonoidHom is also used for ordered group homomorphisms.
When possible, instead of parametrizing results over (f : α →+o β),
you should parametrize over
(F : Type*) [FunLike F M N] [MonoidHomClass F M N] [OrderHomClass F M N] (f : F).
- Defined in
- Mathlib.Algebra.Order.Hom.Monoid
- Cited by
- 80 results in Mathlib
- Foundations
- Depth 1 from the axioms · 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.
- Preorderstatement · cited by 7,952
- AddZeroClassstatement · cited by 1,237
Cited by111
Results whose statement or proof uses this declaration.
- OrderAddMonoidHom.compstatement and proof · cited by 19
- OrderRingHom.compproof · cited by 15
- ArchimedeanClass.orderHomstatement and proof · cited by 8
- OrderAddMonoidHom.extstatement and proof · cited by 8
- OrderAddMonoidHom.idstatement · cited by 7
- OrderMonoidHomClass.toOrderAddMonoidHomstatement · cited by 5
- ArchimedeanClass.orderHom_mkstatement and proof · cited by 5
- LocallyFiniteOrder.orderAddMonoidHomstatement · cited by 5
- OrderAddMonoidHom.inlstatement · cited by 5
- OrderAddMonoidHom.inrstatement · cited by 5
- OrderAddMonoidHom.toAddMonoidHomstatement and proof · cited by 5
- OrderAddMonoidHom.inlₗstatement · cited by 4