Theorems · Theorem · order theory

BoundedOrderHom.comp_assoc

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

Defined in

Mathlib.Order.Hom.Bounded

Cited by

0 results in Mathlib

Foundations

Depth 13 from the axioms · uses no axioms

Assumes

PreorderPreorderPreorderPreorderBoundedOrderBoundedOrderBoundedOrderBoundedOrder