Theorem orngring 21149

Description: An ordered ring is a ring. (Contributed by Thierry Arnoux, 23-Mar-2018.)

Assertion

Ref	Expression
orngring	⊢ (𝑅 ∈ oRing → 𝑅 ∈ Ring)

Proof of Theorem orngring

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2763	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		eqid 2763	. . 3 ⊢ (0g‘𝑅) = (0g‘𝑅)
3		eqid 2763	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
4		eqid 2763	. . 3 ⊢ (le‘𝑅) = (le‘𝑅)
5	1, 2, 3, 4	isorng 21148	. 2 ⊢ (𝑅 ∈ oRing ↔ (𝑅 ∈ Ring ∧ 𝑅 ∈ oGrp ∧ ∀𝑎 ∈ (Base‘𝑅)∀𝑏 ∈ (Base‘𝑅)(((0g‘𝑅)(le‘𝑅)𝑎 ∧ (0g‘𝑅)(le‘𝑅)𝑏) → (0g‘𝑅)(le‘𝑅)(𝑎(.r‘𝑅)𝑏))))
6	5	simp1bi 1163	1 ⊢ (𝑅 ∈ oRing → 𝑅 ∈ Ring)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  ._rcmulr 17458  lecple 17464  0_gc0g 17639  oGrpcogrp 20364  Ringcrg 20489  oRingcorng 21144

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5263

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6512  df-fv 6566  df-ov 7446  df-orng 21146

This theorem is used by:  orngsqr  21153  ornglmulle  21154  orngrmulle  21155  ornglmullt  21156  orngrmullt  21157  orngmullt  21158  orng0le1  21161  suborng  21163  isarchiofld  33830