| 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 2729 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2729 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20399 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2.b | . . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20150 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 5 | adantr 480 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ∈ 𝐵) |
| 7 | 4, 2 | ring0cl 20152 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 8 | 7 | adantr 480 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (0g‘𝑅) ∈ 𝐵) |
| 9 | simpr 484 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ≠ (0g‘𝑅)) | |
| 10 | df-ne 2926 | . . . . . . . . . 10 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 11 | neeq1 2987 | . . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝑅) → (𝑥 ≠ 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) | |
| 12 | 10, 11 | bitr3id 285 | . . . . . . . . 9 ⊢ (𝑥 = (1r‘𝑅) → (¬ 𝑥 = 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) |
| 13 | neeq2 2988 | . . . . . . . . 9 ⊢ (𝑦 = (0g‘𝑅) → ((1r‘𝑅) ≠ 𝑦 ↔ (1r‘𝑅) ≠ (0g‘𝑅))) | |
| 14 | 12, 13 | rspc2ev 3598 | . . . . . . . 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 20183 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 18 | 17 | 3expb 1120 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 19 | 18 | necon3bd 2939 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 20 | 19 | rexlimdvva 3192 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 21 | 16, 20 | impbid 212 | . . . . 5 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) |
| 22 | 4 | fvexi 6854 | . . . . . 6 ⊢ 𝐵 ∈ V |
| 23 | 1sdom 9171 | . . . . . 6 ⊢ (𝐵 ∈ V → (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) | |
| 24 | 22, 23 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 25 | 21, 24 | bitr4di 289 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ 1o ≺ 𝐵)) |
| 26 | 1onn 8581 | . . . . . 6 ⊢ 1o ∈ ω | |
| 27 | sucdom 9160 | . . . . . 6 ⊢ (1o ∈ ω → (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵)) | |
| 28 | 26, 27 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵) |
| 29 | df-2o 8412 | . . . . . 6 ⊢ 2o = suc 1o | |
| 30 | 29 | breq1i 5109 | . . . . 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 1540 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 Vcvv 3444 class class class wbr 5102 suc csuc 6322 ‘cfv 6499 ωcom 7822 1oc1o 8404 2oc2o 8405 ≼ cdom 8893 ≺ csdm 8894 Basecbs 17155 0gc0g 17378 1rcur 20066 Ringcrg 20118 NzRingcnzr 20397 |
| 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 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-plusg 17209 df-0g 17380 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-grp 18844 df-minusg 18845 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-nzr 20398 |
| This theorem is referenced by: znfld 21446 znidomb 21447 |
| Copyright terms: Public domain | W3C validator |