Theorems · Definition · order theory

SupBotHom.copy

{α : Type u_2} →
  {β : Type u_3} →
    [inst : Max α] →
      [inst_1 : Bot α] →
        [inst_2 : Max β] → [inst_3 : Bot β] → (f : SupBotHom α β) → (f' : α → β) → f' = ⇑f → SupBotHom α β

Copy of a SupBotHom with a new toFun equal to the old one. Useful to fix definitional equalities.

Defined in

Mathlib.Order.Hom.BoundedLattice

Cited by

2 results in Mathlib

Foundations

Depth 9 from the axioms · uses no axioms

Assumes

MaxBotMaxBot