| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 0rngo | Structured version Visualization version GIF version | ||
| Description: In a ring, 0 = 1 iff the ring contains only 0. (Contributed by Jeff Madsen, 6-Jan-2011.) |
| Ref | Expression |
|---|---|
| 0ring.1 | ⊢ 𝐺 = (1st ‘𝑅) |
| 0ring.2 | ⊢ 𝐻 = (2nd ‘𝑅) |
| 0ring.3 | ⊢ 𝑋 = ran 𝐺 |
| 0ring.4 | ⊢ 𝑍 = (GId‘𝐺) |
| 0ring.5 | ⊢ 𝑈 = (GId‘𝐻) |
| Ref | Expression |
|---|---|
| 0rngo | ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 ↔ 𝑋 = {𝑍})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ring.4 | . . . . . . 7 ⊢ 𝑍 = (GId‘𝐺) | |
| 2 | 1 | fvexi 6895 | . . . . . 6 ⊢ 𝑍 ∈ V |
| 3 | 2 | snid 4643 | . . . . 5 ⊢ 𝑍 ∈ {𝑍} |
| 4 | eleq1 2823 | . . . . 5 ⊢ (𝑍 = 𝑈 → (𝑍 ∈ {𝑍} ↔ 𝑈 ∈ {𝑍})) | |
| 5 | 3, 4 | mpbii 233 | . . . 4 ⊢ (𝑍 = 𝑈 → 𝑈 ∈ {𝑍}) |
| 6 | 0ring.1 | . . . . . 6 ⊢ 𝐺 = (1st ‘𝑅) | |
| 7 | 6, 1 | 0idl 38054 | . . . . 5 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅)) |
| 8 | 0ring.2 | . . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅) | |
| 9 | 0ring.3 | . . . . . 6 ⊢ 𝑋 = ran 𝐺 | |
| 10 | 0ring.5 | . . . . . 6 ⊢ 𝑈 = (GId‘𝐻) | |
| 11 | 6, 8, 9, 10 | 1idl 38055 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ {𝑍} ∈ (Idl‘𝑅)) → (𝑈 ∈ {𝑍} ↔ {𝑍} = 𝑋)) |
| 12 | 7, 11 | mpdan 687 | . . . 4 ⊢ (𝑅 ∈ RingOps → (𝑈 ∈ {𝑍} ↔ {𝑍} = 𝑋)) |
| 13 | 5, 12 | imbitrid 244 | . . 3 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 → {𝑍} = 𝑋)) |
| 14 | eqcom 2743 | . . 3 ⊢ ({𝑍} = 𝑋 ↔ 𝑋 = {𝑍}) | |
| 15 | 13, 14 | imbitrdi 251 | . 2 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 → 𝑋 = {𝑍})) |
| 16 | 6 | rneqi 5922 | . . . . 5 ⊢ ran 𝐺 = ran (1st ‘𝑅) |
| 17 | 9, 16 | eqtri 2759 | . . . 4 ⊢ 𝑋 = ran (1st ‘𝑅) |
| 18 | 17, 8, 10 | rngo1cl 37968 | . . 3 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋) |
| 19 | eleq2 2824 | . . . 4 ⊢ (𝑋 = {𝑍} → (𝑈 ∈ 𝑋 ↔ 𝑈 ∈ {𝑍})) | |
| 20 | elsni 4623 | . . . . 5 ⊢ (𝑈 ∈ {𝑍} → 𝑈 = 𝑍) | |
| 21 | 20 | eqcomd 2742 | . . . 4 ⊢ (𝑈 ∈ {𝑍} → 𝑍 = 𝑈) |
| 22 | 19, 21 | biimtrdi 253 | . . 3 ⊢ (𝑋 = {𝑍} → (𝑈 ∈ 𝑋 → 𝑍 = 𝑈)) |
| 23 | 18, 22 | syl5com 31 | . 2 ⊢ (𝑅 ∈ RingOps → (𝑋 = {𝑍} → 𝑍 = 𝑈)) |
| 24 | 15, 23 | impbid 212 | 1 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 ↔ 𝑋 = {𝑍})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 {csn 4606 ran crn 5660 ‘cfv 6536 1st c1st 7991 2nd c2nd 7992 GIdcgi 30476 RingOpscrngo 37923 Idlcidl 38036 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-1st 7993 df-2nd 7994 df-grpo 30479 df-gid 30480 df-ginv 30481 df-ablo 30531 df-ass 37872 df-exid 37874 df-mgmOLD 37878 df-sgrOLD 37890 df-mndo 37896 df-rngo 37924 df-idl 38039 |
| This theorem is referenced by: smprngopr 38081 isfldidl2 38098 |
| Copyright terms: Public domain | W3C validator |