Theorems · Theorem · order theory

BoundedOrderHom.coe_comp_botHom

∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : Preorder α] [inst_1 : Preorder β] [inst_2 : Preorder γ]
  [inst_3 : BoundedOrder α] [inst_4 : BoundedOrder β] [inst_5 : BoundedOrder γ] (f : BoundedOrderHom β γ)
  (g : BoundedOrderHom α β), ↑(f.comp g) = (↑f).comp ↑g

Defined in

Mathlib.Order.Hom.Bounded

Cited by

0 results in Mathlib

Foundations

Depth 13 from the axioms · uses no axioms

Assumes

PreorderPreorderPreorderBoundedOrderBoundedOrderBoundedOrder