Theorems · Definition · order theory

OrderRingHom.copy

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

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

Defined in

Mathlib.Algebra.Order.Hom.Ring

Cited by

2 results in Mathlib

Foundations

Depth 19 from the axioms · uses no axioms

Assumes

NonAssocSemiringPreorderNonAssocSemiringPreorder