Theorems · Definition · order theory

OrderMonoidHom.copy

{α : Type u_2} →
  {β : Type u_3} →
    [inst : Preorder α] →
      [inst_1 : Preorder β] →
        [inst_2 : MulOneClass α] → [inst_3 : MulOneClass β] → (f : α →*o β) → (f' : α → β) → f' = ⇑f → α →*o β

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

Defined in

Mathlib.Algebra.Order.Hom.Monoid

Cited by

2 results in Mathlib

Foundations

Depth 14 from the axioms · uses no axioms

Assumes

PreorderPreorderMulOneClassMulOneClass