Theorems · Definition · order theory

BoundedOrderHom.comp

{α : 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 γ] → BoundedOrderHom β γ → BoundedOrderHom α β → BoundedOrderHom α γ

Composition of BoundedOrderHoms as a BoundedOrderHom.

Defined in

Mathlib.Order.Hom.Bounded

Cited by

14 results in Mathlib

Foundations

Depth 12 from the axioms · uses no axioms

Assumes

PreorderPreorderPreorderBoundedOrderBoundedOrderBoundedOrder