Theorem orngring 21081

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 2760	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		eqid 2760	. . 3 ⊢ (0g‘𝑅) = (0g‘𝑅)
3		eqid 2760	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
4		eqid 2760	. . 3 ⊢ (le‘𝑅) = (le‘𝑅)
5	1, 2, 3, 4	isorng 21080	. 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 2145  ∀wral 3076   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  Basecbs 17349  ._rcmulr 17391  lecple 17397  0_gc0g 17572  oGrpcogrp 20296  Ringcrg 20421  oRingcorng 21076

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-nul 5259

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-iota 6483  df-fv 6535  df-ov 7411  df-orng 21078

This theorem is used by:  orngsqr  21085  ornglmulle  21086  orngrmulle  21087  ornglmullt  21088  orngrmullt  21089  orngmullt  21090  orng0le1  21093  suborng  21095  isarchiofld  33694