Theorems · Definition · order theory
OrderHom.comp
{α : Type u_2} →
{β : Type u_3} →
{γ : Type u_4} → [inst : Preorder α] → [inst_1 : Preorder β] → [inst_2 : Preorder γ] → (β →o γ) → (α →o β) → α →o γThe composition of two bundled monotone functions.
- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 61 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- OrderHomstatement and proof · cited by 934
Cited by86
Results whose statement or proof uses this declaration.
- OmegaCompletePartialOrder.Chain.mapproof · cited by 41
- Finset.eraseNoneproof · cited by 21
- SSet.prodStdSimplex.objEquivproof · cited by 21
- OrderMonoidHom.compproof · cited by 20
- OrderAddMonoidHom.compproof · cited by 19
- OrderHom.comp_coestatement and proof · cited by 17
- BoundedOrderHom.compproof · cited by 14
- PseudoEpimorphism.compproof · cited by 9
- Module.End.maxUnifEigenspaceIndexproof · cited by 8
- ContinuousOrderHom.compproof · cited by 8
- OrderMonoidHom.inlₗproof · cited by 6
- OrderHom.applyproof · cited by 6