| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnzr2 | Structured version Visualization version GIF version | ||
| Description: Equivalent characterization of nonzero rings: they have at least two elements. (Contributed by Stefan O'Rear, 24-Feb-2015.) |
| Ref | Expression |
|---|---|
| isnzr2.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| isnzr2 | ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 2o ≼ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2736 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2736 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20447 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2.b | . . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20200 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 5 | adantr 480 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ∈ 𝐵) |
| 7 | 4, 2 | ring0cl 20202 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 8 | 7 | adantr 480 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (0g‘𝑅) ∈ 𝐵) |
| 9 | simpr 484 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ≠ (0g‘𝑅)) | |
| 10 | df-ne 2933 | . . . . . . . . . 10 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 11 | neeq1 2994 | . . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝑅) → (𝑥 ≠ 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) | |
| 12 | 10, 11 | bitr3id 285 | . . . . . . . . 9 ⊢ (𝑥 = (1r‘𝑅) → (¬ 𝑥 = 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) |
| 13 | neeq2 2995 | . . . . . . . . 9 ⊢ (𝑦 = (0g‘𝑅) → ((1r‘𝑅) ≠ 𝑦 ↔ (1r‘𝑅) ≠ (0g‘𝑅))) | |
| 14 | 12, 13 | rspc2ev 3589 | . . . . . . . 8 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵 ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 15 | 6, 8, 9, 14 | syl3anc 1373 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 16 | 15 | ex 412 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) |
| 17 | 4, 1, 2 | ring1eq0 20233 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 18 | 17 | 3expb 1120 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 19 | 18 | necon3bd 2946 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 20 | 19 | rexlimdvva 3193 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 21 | 16, 20 | impbid 212 | . . . . 5 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) |
| 22 | 4 | fvexi 6848 | . . . . . 6 ⊢ 𝐵 ∈ V |
| 23 | 1sdom 9155 | . . . . . 6 ⊢ (𝐵 ∈ V → (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) | |
| 24 | 22, 23 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 25 | 21, 24 | bitr4di 289 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ 1o ≺ 𝐵)) |
| 26 | 1onn 8568 | . . . . . 6 ⊢ 1o ∈ ω | |
| 27 | sucdom 9144 | . . . . . 6 ⊢ (1o ∈ ω → (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵)) | |
| 28 | 26, 27 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵) |
| 29 | df-2o 8398 | . . . . . 6 ⊢ 2o = suc 1o | |
| 30 | 29 | breq1i 5105 | . . . . 5 ⊢ (2o ≼ 𝐵 ↔ suc 1o ≼ 𝐵) |
| 31 | 28, 30 | bitr4i 278 | . . . 4 ⊢ (1o ≺ 𝐵 ↔ 2o ≼ 𝐵) |
| 32 | 25, 31 | bitrdi 287 | . . 3 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ 2o ≼ 𝐵)) |
| 33 | 32 | pm5.32i 574 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) ↔ (𝑅 ∈ Ring ∧ 2o ≼ 𝐵)) |
| 34 | 3, 33 | bitri 275 | 1 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 2o ≼ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∃wrex 3060 Vcvv 3440 class class class wbr 5098 suc csuc 6319 ‘cfv 6492 ωcom 7808 1oc1o 8390 2oc2o 8391 ≼ cdom 8881 ≺ csdm 8882 Basecbs 17136 0gc0g 17359 1rcur 20116 Ringcrg 20168 NzRingcnzr 20445 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-nzr 20446 |
| This theorem is referenced by: znfld 21515 znidomb 21516 |
| Copyright terms: Public domain | W3C validator |