Theorems · Definition · order theory
BoundedOrderHom.toBotHom
{α : Type u_2} →
{β : Type u_3} →
[inst : Preorder α] →
[inst_1 : Preorder β] → [inst_2 : BoundedOrder α] → [inst_3 : BoundedOrder β] → BoundedOrderHom α β → BotHom α βReinterpret a BoundedOrderHom as a BotHom.
- Defined in
- Mathlib.Order.Hom.Bounded
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- BoundedOrderstatement and proof · cited by 270
- BoundedOrderHomstatement and proof · cited by 54
- OrderHom.toFunproof · cited by 45
- BotHomstatement · cited by 37
- BoundedOrderHom.toOrderHomproof · cited by 4
- BoundedOrderHom.map_bot'proof · cited by 0
Cited by2
Results whose statement or proof uses this declaration.
- BoundedOrderHom.compproof · cited by 14
- BoundedOrderHom.copyproof · cited by 2