Theorems · Definition · order theory
OrderHomClass
(F : Type u_6) → (α : outParam (Type u_7)) → (β : outParam (Type u_8)) → [LE α] → [LE β] → [FunLike F α β] → Prop
OrderHomClass F α b asserts that F is a type of ≤-preserving morphisms.
- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 4 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.
- FunLikestatement and proof · cited by 2,560
- RelHomClassproof · cited by 13
Cited by24
Results whose statement or proof uses this declaration.
- OrderHomClass.toOrderHomstatement and proof · cited by 44
- OrderHomClass.monostatement and proof · cited by 22
- OrderHomClass.monotonestatement and proof · cited by 5
- OrderMonoidHomClass.toOrderAddMonoidHomstatement and proof · cited by 5
- OrderMonoidHomClass.toOrderMonoidHomstatement and proof · cited by 5
- map_nonnegstatement and proof · cited by 4
- OrderMonoidWithZeroHomClass.toOrderMonoidWithZeroHomstatement and proof · cited by 4
- OrderRingHomClass.toOrderRingHomstatement and proof · cited by 3
- OrderHomClass.toLatticeHomstatement and proof · cited by 3
- IsSelfAdjoint.map'statement and proof · cited by 1
- map_absstatement and proof · cited by 1
- OrderHomClass.of_addMonoidHomstatement · cited by 1