Theorems · Theorem · order theory

BoundedOrderHom.cancel_left

∀ {α : 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 γ] {g : BoundedOrderHom β γ}
  {f₁ f₂ : BoundedOrderHom α β}, Function.Injective ⇑g → (g.comp f₁ = g.comp f₂ ↔ f₁ = f₂)

Defined in

Mathlib.Order.Hom.Bounded

Cited by

0 results in Mathlib

Foundations

Depth 14 from the axioms · uses Quot.sound

Assumes

PreorderPreorderPreorderBoundedOrderBoundedOrderBoundedOrder