Theorems · Definition · order theory

sSupHom.comp

{α : Type u_2} →
  {β : Type u_3} →
    {γ : Type u_4} →
      [inst : SupSet α] → [inst_1 : SupSet β] → [inst_2 : SupSet γ] → sSupHom β γ → sSupHom α β → sSupHom α γ

Composition of sSupHoms as a sSupHom.

Defined in

Mathlib.Order.Hom.CompleteLattice

Cited by

11 results in Mathlib

Foundations

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

Assumes

SupSetSupSetSupSet