Theorems · Theorem · order theory

BoundedLatticeHom.dual_comp

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

Defined in

Mathlib.Order.Hom.BoundedLattice

Cited by

0 results in Mathlib

Foundations

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

Assumes

LatticeBoundedOrderLatticeBoundedOrderLatticeBoundedOrder