Ordered ring homomorphisms

Homomorphisms between ordered (semi)rings that respect the ordering.

Main definitions

• OrderRingHom : Monotone semiring homomorphisms.
• OrderRingIso : Monotone semiring isomorphisms.

Notation

• →+*o: Ordered ring homomorphisms.
• ≃+*o: Ordered ring isomorphisms.

Tags

ordered ring homomorphism, order homomorphism

structure OrderRingHom (α : Type u_6) (β : Type u_7) [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] extends RingHom : Type (max u_6 u_7)

• toFun : α → β
• map_one' : OneHom.toFun (↑↑s.toRingHom) 1 = 1
• map_mul' : ∀ (x y : α), OneHom.toFun (↑↑s.toRingHom) (x * y) = OneHom.toFun (↑↑s.toRingHom) x * OneHom.toFun (↑↑s.toRingHom) y
• map_zero' : OneHom.toFun (↑↑s.toRingHom) 0 = 0
• map_add' : ∀ (x y : α), OneHom.toFun (↑↑s.toRingHom) (x + y) = OneHom.toFun (↑↑s.toRingHom) x + OneHom.toFun (↑↑s.toRingHom) y
• monotone' : Monotone s.toFun

  The proposition that the function preserves the order.

OrderRingHom α β is the type of monotone semiring homomorphisms from α to β.

When possible, instead of parametrizing results over (f : OrderRingHom α β), you should parametrize over (F : Type*) [OrderRingHomClass F α β] (f : F).

When you extend this structure, make sure to extend OrderRingHomClass.

def «term_→+*o_» : Lean.TrailingParserDescr

OrderRingHom α β is the type of monotone semiring homomorphisms from α to β.

When possible, instead of parametrizing results over (f : OrderRingHom α β), you should parametrize over (F : Type*) [OrderRingHomClass F α β] (f : F).

When you extend this structure, make sure to extend OrderRingHomClass.

structure OrderRingIso (α : Type u_6) (β : Type u_7) [Mul α] [Mul β] [Add α] [Add β] [LE α] [LE β] extends RingEquiv : Type (max u_6 u_7)

• toFun : α → β
• invFun : β → α
• left_inv : Function.LeftInverse s.invFun s.toFun
• right_inv : Function.RightInverse s.invFun s.toFun
• map_mul' : ∀ (x y : α), Equiv.toFun s.toEquiv (x * y) = Equiv.toFun s.toEquiv x * Equiv.toFun s.toEquiv y
• map_add' : ∀ (x y : α), Equiv.toFun s.toEquiv (x + y) = Equiv.toFun s.toEquiv x + Equiv.toFun s.toEquiv y
• map_le_map_iff' : ∀ {a b : α}, Equiv.toFun s.toEquiv a ≤ Equiv.toFun s.toEquiv b ↔ a ≤ b

  The proposition that the function preserves the order bijectively.

OrderRingHom α β is the type of order-preserving semiring isomorphisms between α and β.

When possible, instead of parametrizing results over (f : OrderRingIso α β), you should parametrize over (F : Type*) [OrderRingIsoClass F α β] (f : F).

When you extend this structure, make sure to extend OrderRingIsoClass.

def «term_≃+*o_» : Lean.TrailingParserDescr

OrderRingHom α β is the type of order-preserving semiring isomorphisms between α and β.

When possible, instead of parametrizing results over (f : OrderRingIso α β), you should parametrize over (F : Type*) [OrderRingIsoClass F α β] (f : F).

When you extend this structure, make sure to extend OrderRingIsoClass.

class OrderRingHomClass (F : Type u_6) (α : outParam (Type u_7)) (β : outParam (Type u_8)) [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] extends RingHomClass : Type (max (max u_6 u_7) u_8)

• coe : F → α → β
• coe_injective' : Function.Injective FunLike.coe
• map_mul : ∀ (f : F) (x y : α), ↑f (x * y) = ↑f x * ↑f y
• map_one : ∀ (f : F), ↑f 1 = 1
• map_add : ∀ (f : F) (x y : α), ↑f (x + y) = ↑f x + ↑f y
• map_zero : ∀ (f : F), ↑f 0 = 0
• monotone : ∀ (f : F), Monotone ↑f

  The proposition that the function preserves the order.

OrderRingHomClass F α β states that F is a type of ordered semiring homomorphisms. You should extend this typeclass when you extend OrderRingHom.

class OrderRingIsoClass (F : Type u_6) (α : outParam (Type u_7)) (β : outParam (Type u_8)) [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] extends RingEquivClass : Type (max (max u_6 u_7) u_8)

• coe : F → α → β
• inv : F → β → α
• left_inv : ∀ (e : F), Function.LeftInverse (EquivLike.inv e) (EquivLike.coe e)
• right_inv : ∀ (e : F), Function.RightInverse (EquivLike.inv e) (EquivLike.coe e)
• coe_injective' : ∀ (e g : F), EquivLike.coe e = EquivLike.coe g → EquivLike.inv e = EquivLike.inv g → e = g
• map_mul : ∀ (f : F) (a b : α), ↑f (a * b) = ↑f a * ↑f b
• map_add : ∀ (f : F) (a b : α), ↑f (a + b) = ↑f a + ↑f b
• map_le_map_iff : ∀ (f : F) {a b : α}, ↑f a ≤ ↑f b ↔ a ≤ b

  The proposition that the function preserves the order bijectively.

OrderRingIsoClass F α β states that F is a type of ordered semiring isomorphisms. You should extend this class when you extend OrderRingIso.

instance OrderRingHomClass.toOrderAddMonoidHomClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [OrderRingHomClass F α β] : OrderAddMonoidHomClass F α β

instance OrderRingHomClass.toOrderMonoidWithZeroHomClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [OrderRingHomClass F α β] : OrderMonoidWithZeroHomClass F α β

instance OrderRingIsoClass.toOrderIsoClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [OrderRingIsoClass F α β] : OrderIsoClass F α β

instance OrderRingIsoClass.toOrderRingHomClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [OrderRingIsoClass F α β] : OrderRingHomClass F α β

def OrderRingHomClass.toOrderRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [OrderRingHomClass F α β] (f : F) : α →+*o β

Turn an element of a type F satisfying OrderRingHomClass F α β into an actual OrderRingHom. This is declared as the default coercion from F to α →+*o β.

instance instCoeTCOrderRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [OrderRingHomClass F α β] : CoeTC F (α →+*o β)

Any type satisfying OrderRingHomClass can be cast into OrderRingHom via OrderRingHomClass.toOrderRingHom.

def OrderRingIsoClass.toOrderRingIso {F : Type u_1} {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [OrderRingIsoClass F α β] (f : F) : α ≃+*o β

Turn an element of a type F satisfying OrderRingIsoClass F α β into an actual OrderRingIso. This is declared as the default coercion from F to α ≃+*o β.

instance instCoeTCOrderRingIso {F : Type u_1} {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [OrderRingIsoClass F α β] : CoeTC F (α ≃+*o β)

Any type satisfying OrderRingIsoClass can be cast into OrderRingIso via OrderRingIsoClass.toOrderRingIso.

Ordered ring homomorphisms

def OrderRingHom.toOrderAddMonoidHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : α →+o β

Reinterpret an ordered ring homomorphism as an ordered additive monoid homomorphism.

def OrderRingHom.toOrderMonoidWithZeroHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : α →*₀o β

Reinterpret an ordered ring homomorphism as an order homomorphism.

instance OrderRingHom.instOrderRingHomClassOrderRingHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] : OrderRingHomClass (α →+*o β) α β

theorem OrderRingHom.toFun_eq_coe {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : f.toFun = ↑f

theorem OrderRingHom.ext {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] {f : α →+*o β} {g : α →+*o β} (h : ∀ (a : α), ↑f a = ↑g a) : f = g

@[simp]

theorem OrderRingHom.toRingHom_eq_coe {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : f.toRingHom = ↑f

@[simp]

theorem OrderRingHom.toOrderAddMonoidHom_eq_coe {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : OrderRingHom.toOrderAddMonoidHom f = ↑f

@[simp]

theorem OrderRingHom.toOrderMonoidWithZeroHom_eq_coe {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : OrderRingHom.toOrderMonoidWithZeroHom f = ↑f

@[simp]

theorem OrderRingHom.coe_coe_ringHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : ↑↑f = ↑f

@[simp]

theorem OrderRingHom.coe_coe_orderAddMonoidHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : ↑↑f = ↑f

@[simp]

theorem OrderRingHom.coe_coe_orderMonoidWithZeroHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : ↑↑f = ↑f

theorem OrderRingHom.coe_ringHom_apply {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (a : α) : ↑↑f a = ↑f a

theorem OrderRingHom.coe_orderAddMonoidHom_apply {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (a : α) : ↑↑f a = ↑f a

theorem OrderRingHom.coe_orderMonoidWithZeroHom_apply {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (a : α) : ↑↑f a = ↑f a

def OrderRingHom.copy {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (f' : α → β) (h : f' = ↑f) : α →+*o β

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

@[simp]

theorem OrderRingHom.coe_copy {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (f' : α → β) (h : f' = ↑f) : ↑(OrderRingHom.copy f f' h) = f'

theorem OrderRingHom.copy_eq {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) (f' : α → β) (h : f' = ↑f) : OrderRingHom.copy f f' h = f

def OrderRingHom.id (α : Type u_2) [NonAssocSemiring α] [Preorder α] : α →+*o α

The identity as an ordered ring homomorphism.

instance OrderRingHom.instInhabitedOrderRingHom (α : Type u_2) [NonAssocSemiring α] [Preorder α] : Inhabited (α →+*o α)

@[simp]

theorem OrderRingHom.coe_id (α : Type u_2) [NonAssocSemiring α] [Preorder α] : ↑(OrderRingHom.id α) = id

@[simp]

theorem OrderRingHom.id_apply {α : Type u_2} [NonAssocSemiring α] [Preorder α] (a : α) : ↑(OrderRingHom.id α) a = a

@[simp]

theorem OrderRingHom.coe_ringHom_id {α : Type u_2} [NonAssocSemiring α] [Preorder α] : ↑(OrderRingHom.id α) = RingHom.id α

@[simp]

theorem OrderRingHom.coe_orderAddMonoidHom_id {α : Type u_2} [NonAssocSemiring α] [Preorder α] : ↑(OrderRingHom.id α) = OrderAddMonoidHom.id α

@[simp]

theorem OrderRingHom.coe_orderMonoidWithZeroHom_id {α : Type u_2} [NonAssocSemiring α] [Preorder α] : ↑(OrderRingHom.id α) = OrderMonoidWithZeroHom.id α

def OrderRingHom.comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] (f : β →+*o γ) (g : α →+*o β) : α →+*o γ

Composition of two OrderRingHoms as an OrderRingHom.

@[simp]

theorem OrderRingHom.coe_comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] (f : β →+*o γ) (g : α →+*o β) : ↑(OrderRingHom.comp f g) = ↑f ∘ ↑g

@[simp]

theorem OrderRingHom.comp_apply {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] (f : β →+*o γ) (g : α →+*o β) (a : α) : ↑(OrderRingHom.comp f g) a = ↑f (↑g a)

theorem OrderRingHom.comp_assoc {α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] [NonAssocSemiring δ] [Preorder δ] (f : γ →+*o δ) (g : β →+*o γ) (h : α →+*o β) : OrderRingHom.comp (OrderRingHom.comp f g) h = OrderRingHom.comp f (OrderRingHom.comp g h)

@[simp]

theorem OrderRingHom.comp_id {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : OrderRingHom.comp f (OrderRingHom.id α) = f

@[simp]

theorem OrderRingHom.id_comp {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α →+*o β) : OrderRingHom.comp (OrderRingHom.id β) f = f

@[simp]

theorem OrderRingHom.cancel_right {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] {f₁ : β →+*o γ} {f₂ : β →+*o γ} {g : α →+*o β} (hg : Function.Surjective ↑g) : OrderRingHom.comp f₁ g = OrderRingHom.comp f₂ g ↔ f₁ = f₂

@[simp]

theorem OrderRingHom.cancel_left {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] [NonAssocSemiring γ] [Preorder γ] {f : β →+*o γ} {g₁ : α →+*o β} {g₂ : α →+*o β} (hf : Function.Injective ↑f) : OrderRingHom.comp f g₁ = OrderRingHom.comp f g₂ ↔ g₁ = g₂

instance OrderRingHom.instPreorderOrderRingHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] : Preorder (α →+*o β)

instance OrderRingHom.instPartialOrderOrderRingHomToPreorder {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [PartialOrder β] : PartialOrder (α →+*o β)

Ordered ring isomorphisms

def OrderRingIso.toOrderIso {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : α ≃o β

Reinterpret an ordered ring isomorphism as an order isomorphism.

instance OrderRingIso.instOrderRingIsoClassOrderRingIso {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] : OrderRingIsoClass (α ≃+*o β) α β

theorem OrderRingIso.toFun_eq_coe {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : f.toFun = ↑f

Helper instance for when there's too many metavariables to apply FunLike.has_coe_to_fun directly.

theorem OrderRingIso.ext {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] {f : α ≃+*o β} {g : α ≃+*o β} (h : ∀ (a : α), ↑f a = ↑g a) : f = g

@[simp]

theorem OrderRingIso.coe_mk {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+* β) (h : ∀ {a b : α}, Equiv.toFun e.toEquiv a ≤ Equiv.toFun e.toEquiv b ↔ a ≤ b) : ↑{ toRingEquiv := e, map_le_map_iff' := h } = ↑e

@[simp]

theorem OrderRingIso.mk_coe {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) (h : ∀ {a b : α}, Equiv.toFun (↑e).toEquiv a ≤ Equiv.toFun (↑e).toEquiv b ↔ a ≤ b) : { toRingEquiv := ↑e, map_le_map_iff' := h } = e

@[simp]

theorem OrderRingIso.toRingEquiv_eq_coe {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : f.toRingEquiv = ↑f

@[simp]

theorem OrderRingIso.toOrderIso_eq_coe {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : ↑f = ↑f

@[simp]

theorem OrderRingIso.coe_toRingEquiv {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : ↑↑f = ↑f

@[simp]

theorem OrderRingIso.coe_toOrderIso {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (f : α ≃+*o β) : ↑↑f = ↑f

def OrderRingIso.refl (α : Type u_2) [Mul α] [Add α] [LE α] : α ≃+*o α

The identity map as an ordered ring isomorphism.

instance OrderRingIso.instInhabitedOrderRingIso (α : Type u_2) [Mul α] [Add α] [LE α] : Inhabited (α ≃+*o α)

@[simp]

theorem OrderRingIso.refl_apply (α : Type u_2) [Mul α] [Add α] [LE α] (x : α) : ↑(OrderRingIso.refl α) x = x

@[simp]

theorem OrderRingIso.coe_ringEquiv_refl (α : Type u_2) [Mul α] [Add α] [LE α] : ↑(OrderRingIso.refl α) = RingEquiv.refl α

@[simp]

theorem OrderRingIso.coe_orderIso_refl (α : Type u_2) [Mul α] [Add α] [LE α] : ↑(OrderRingIso.refl α) = OrderIso.refl α

def OrderRingIso.symm {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) : β ≃+*o α

The inverse of an ordered ring isomorphism as an ordered ring isomorphism.

def OrderRingIso.Simps.symm_apply {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) : β → α

See Note [custom simps projection]

@[simp]

theorem OrderRingIso.symm_symm {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) : OrderRingIso.symm (OrderRingIso.symm e) = e

def OrderRingIso.trans {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [Mul γ] [Add γ] [LE γ] (f : α ≃+*o β) (g : β ≃+*o γ) : α ≃+*o γ

Composition of OrderRingIsos as an OrderRingIso.

theorem OrderRingIso.trans_toRingEquiv {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [Mul γ] [Add γ] [LE γ] (f : α ≃+*o β) (g : β ≃+*o γ) : (OrderRingIso.trans f g).toRingEquiv = RingEquiv.trans f.toRingEquiv g.toRingEquiv

@[simp]

theorem OrderRingIso.trans_toRingEquiv_aux {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [Mul γ] [Add γ] [LE γ] (f : α ≃+*o β) (g : β ≃+*o γ) : ↑(OrderRingIso.trans f g) = RingEquiv.trans f.toRingEquiv g.toRingEquiv

@[simp]

theorem OrderRingIso.trans_apply {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] [Mul γ] [Add γ] [LE γ] (f : α ≃+*o β) (g : β ≃+*o γ) (a : α) : ↑(OrderRingIso.trans f g) a = ↑g (↑f a)

@[simp]

theorem OrderRingIso.self_trans_symm {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) : OrderRingIso.trans e (OrderRingIso.symm e) = OrderRingIso.refl α

@[simp]

theorem OrderRingIso.symm_trans_self {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] (e : α ≃+*o β) : OrderRingIso.trans (OrderRingIso.symm e) e = OrderRingIso.refl β

theorem OrderRingIso.symm_bijective {α : Type u_2} {β : Type u_3} [Mul α] [Add α] [LE α] [Mul β] [Add β] [LE β] : Function.Bijective OrderRingIso.symm

def OrderRingIso.toOrderRingHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α ≃+*o β) : α →+*o β

Reinterpret an ordered ring isomorphism as an ordered ring homomorphism.

@[simp]

theorem OrderRingIso.toOrderRingHom_eq_coe {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α ≃+*o β) : OrderRingIso.toOrderRingHom f = ↑f

@[simp]

theorem OrderRingIso.coe_toOrderRingHom {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] (f : α ≃+*o β) : ↑↑f = ↑f

@[simp]

theorem OrderRingIso.coe_toOrderRingHom_refl {α : Type u_2} [NonAssocSemiring α] [Preorder α] : ↑(OrderRingIso.refl α) = OrderRingHom.id α

theorem OrderRingIso.toOrderRingHom_injective {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [Preorder α] [NonAssocSemiring β] [Preorder β] : Function.Injective OrderRingIso.toOrderRingHom

Uniqueness

There is at most one ordered ring homomorphism from a linear ordered field to an archimedean linear ordered field. Reciprocally, such an ordered ring homomorphism exists when the codomain is further conditionally complete.

instance OrderRingHom.subsingleton {α : Type u_2} {β : Type u_3} [LinearOrderedField α] [LinearOrderedField β] [Archimedean β] : Subsingleton (α →+*o β)

There is at most one ordered ring homomorphism from a linear ordered field to an archimedean linear ordered field.

instance OrderRingIso.subsingleton_right {α : Type u_2} {β : Type u_3} [LinearOrderedField α] [LinearOrderedField β] [Archimedean β] : Subsingleton (α ≃+*o β)

There is at most one ordered ring isomorphism between a linear ordered field and an archimedean linear ordered field.

instance OrderRingIso.subsingleton_left {α : Type u_2} {β : Type u_3} [LinearOrderedField α] [Archimedean α] [LinearOrderedField β] : Subsingleton (α ≃+*o β)

There is at most one ordered ring isomorphism between an archimedean linear ordered field and a linear ordered field.