Theorems · Definition · order theory

BoundedLatticeHom.comp

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

Composition of BoundedLatticeHoms as a BoundedLatticeHom.

Defined in

Mathlib.Order.Hom.BoundedLattice

Cited by

28 results in Mathlib

Foundations

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

Assumes

LatticeLatticeLatticeBoundedOrderBoundedOrderBoundedOrder