| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > prrngorngo | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, use prmrngring 49136 instead. A prime ring is a ring. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| prrngorngo | ⊢ (𝑅 ∈ PrRing → 𝑅 ∈ RingOps) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ (1st ‘𝑅) = (1st ‘𝑅) | |
| 2 | eqid 2765 | . . 3 ⊢ (GId‘(1st ‘𝑅)) = (GId‘(1st ‘𝑅)) | |
| 3 | 1, 2 | isprrngo 38734 | . 2 ⊢ (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {(GId‘(1st ‘𝑅))} ∈ (PrIdl‘𝑅))) |
| 4 | 3 | simplbi 502 | 1 ⊢ (𝑅 ∈ PrRing → 𝑅 ∈ RingOps) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 {csn 4591 ‘cfv 6540 1st c1st 7986 GIdcgi 30889 RingOpscrngo 38578 PrIdlcpridl 38692 PrRingcprrng 38730 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| 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 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-iota 6496 df-fv 6548 df-prrngo 38732 |
| This theorem is used by: isdmn2 38739 |
| Copyright terms: Public domain | W3C validator |