Theorems · Inductive type · order theory
OrderMonoidHom
(α : Type u_6) → (β : Type u_7) → [Preorder α] → [Preorder β] → [MulOneClass α] → [MulOneClass β] → Type (max u_6 u_7)
α →*o β is the type of functions α → β that preserve the ordered monoid structure.
OrderMonoidHom 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
- 67 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
- MulOneClassstatement · cited by 1,018
Cited by93
Results whose statement or proof uses this declaration.
- OrderMonoidHom.compstatement and proof · cited by 20
- OrderMonoidWithZeroHom.compproof · cited by 14
- OrderMonoidHom.extstatement and proof · cited by 8
- OrderMonoidHom.idstatement · cited by 6
- OrderMonoidHom.inlₗstatement · cited by 6
- MulArchimedeanClass.orderHomstatement and proof · cited by 5
- OrderMonoidHom.inlstatement · cited by 5
- OrderMonoidHom.inrstatement · cited by 5
- OrderMonoidHom.inrₗstatement · cited by 5
- OrderMonoidHom.toMonoidHomstatement and proof · cited by 5
- OrderMonoidHomClass.toOrderMonoidHomstatement · cited by 5
- LocallyFiniteOrder.orderMonoidHomstatement · cited by 4