Theorems · Theorem · order theory

BoundedLatticeHom.cancel_left

∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : Lattice α] [inst_1 : Lattice β] [inst_2 : Lattice γ]
  [inst_3 : BoundedOrder α] [inst_4 : BoundedOrder β] [inst_5 : BoundedOrder γ] {g : BoundedLatticeHom β γ}
  {f₁ f₂ : BoundedLatticeHom α β}, Function.Injective ⇑g → (g.comp f₁ = g.comp f₂ ↔ f₁ = f₂)

Defined in

Mathlib.Order.Hom.BoundedLattice

Cited by

0 results in Mathlib

Foundations

Depth 25 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LatticeLatticeLatticeBoundedOrderBoundedOrderBoundedOrder