Theorem prrngorngo 38801

Description: Obsolete theorem, use prmrngring 49253 instead. A prime ring is a ring. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
prrngorngo	⊢ (𝑅 ∈ PrRing → 𝑅 ∈ RingOps)

Proof of Theorem prrngorngo

Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ (1st ‘𝑅) = (1st ‘𝑅)
2		eqid 2760	. . 3 ⊢ (GId‘(1st ‘𝑅)) = (GId‘(1st ‘𝑅))
3	1, 2	isprrngo 38800	. 2 ⊢ (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {(GId‘(1st ‘𝑅))} ∈ (PrIdl‘𝑅)))
4	3	simplbi 502	1 ⊢ (𝑅 ∈ PrRing → 𝑅 ∈ RingOps)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  {csn 4584  ‘cfv 6533  1^st c1st 7984  GIdcgi 30971  RingOpscrngo 38644  PrIdlcpridl 38758  PrRingcprrng 38796

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

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-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541  df-prrngo 38798

This theorem is used by:  isdmn2  38805