Theorems · Theorem · order theory

BoundedOrderHom.dual_comp

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

Defined in

Mathlib.Order.Hom.Bounded

Cited by

0 results in Mathlib

Foundations

Depth 21 from the axioms · uses propext, Quot.sound

Assumes

PreorderBoundedOrderPreorderBoundedOrderPreorderBoundedOrder