| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 0rngo | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, use 0ring01eqbi2 20630 instead. In a ring, 0 = 1 iff the ring contains only 0. (Contributed by Jeff Madsen, 6-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
| 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 4628 | . . . . 5 ⊢ 𝑍 ∈ {𝑍} |
| 4 | eleq1 2851 | . . . . 5 ⊢ (𝑍 = 𝑈 → (𝑍 ∈ {𝑍} ↔ 𝑈 ∈ {𝑍})) | |
| 5 | 3, 4 | mpbii 236 | . . . 4 ⊢ (𝑍 = 𝑈 → 𝑈 ∈ {𝑍}) |
| 6 | 0ring.1 | . . . . . 6 ⊢ 𝐺 = (1st ‘𝑅) | |
| 7 | 6, 1 | 0idl 38676 | . . . . 5 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅)) |
| 8 | 0ring.2 | . . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅) | |
| 9 | 0ring.3 | . . . . . 6 ⊢ 𝑋 = ran 𝐺 | |
| 10 | 0ring.5 | . . . . . 6 ⊢ 𝑈 = (GId‘𝐻) | |
| 11 | 6, 8, 9, 10 | 1idl 38677 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ {𝑍} ∈ (Idl‘𝑅)) → (𝑈 ∈ {𝑍} ↔ {𝑍} = 𝑋)) |
| 12 | 7, 11 | mpdan 699 | . . . 4 ⊢ (𝑅 ∈ RingOps → (𝑈 ∈ {𝑍} ↔ {𝑍} = 𝑋)) |
| 13 | 5, 12 | imbitrid 247 | . . 3 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 → {𝑍} = 𝑋)) |
| 14 | eqcom 2770 | . . 3 ⊢ ({𝑍} = 𝑋 ↔ 𝑋 = {𝑍}) | |
| 15 | 13, 14 | imbitrdi 254 | . 2 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 → 𝑋 = {𝑍})) |
| 16 | 6 | rneqi 5927 | . . . . 5 ⊢ ran 𝐺 = ran (1st ‘𝑅) |
| 17 | 9, 16 | eqtri 2786 | . . . 4 ⊢ 𝑋 = ran (1st ‘𝑅) |
| 18 | 17, 8, 10 | rngo1cl 38590 | . . 3 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋) |
| 19 | eleq2 2852 | . . . 4 ⊢ (𝑋 = {𝑍} → (𝑈 ∈ 𝑋 ↔ 𝑈 ∈ {𝑍})) | |
| 20 | elsni 4606 | . . . . 5 ⊢ (𝑈 ∈ {𝑍} → 𝑈 = 𝑍) | |
| 21 | 20 | eqcomd 2769 | . . . 4 ⊢ (𝑈 ∈ {𝑍} → 𝑍 = 𝑈) |
| 22 | 19, 21 | biimtrdi 256 | . . 3 ⊢ (𝑋 = {𝑍} → (𝑈 ∈ 𝑋 → 𝑍 = 𝑈)) |
| 23 | 18, 22 | syl5com 32 | . 2 ⊢ (𝑅 ∈ RingOps → (𝑋 = {𝑍} → 𝑍 = 𝑈)) |
| 24 | 15, 23 | impbid 215 | 1 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 ↔ 𝑋 = {𝑍})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2143 {csn 4589 ran crn 5662 ‘cfv 6536 1st c1st 7980 2nd c2nd 7981 GIdcgi 30842 RingOpscrngo 38545 Idlcidl 38658 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 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 7982 df-2nd 7983 df-grpo 30845 df-gid 30846 df-ginv 30847 df-ablo 30897 df-ass 38494 df-exid 38496 df-mgmOLD 38500 df-sgrOLD 38512 df-mndo 38518 df-rngo 38546 df-idl 38661 |
| This theorem is referenced by: smprngopr 38703 isfldidl2 38720 |
| Copyright terms: Public domain | W3C validator |