| 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 2769 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2769 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20593 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2.b | . . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20344 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 5 | adantr 485 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ∈ 𝐵) |
| 7 | 4, 2 | ring0cl 20346 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 8 | 7 | adantr 485 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (0g‘𝑅) ∈ 𝐵) |
| 9 | simpr 489 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (1r‘𝑅) ≠ (0g‘𝑅)) | |
| 10 | df-ne 2965 | . . . . . . . . . 10 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 11 | neeq1 3026 | . . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝑅) → (𝑥 ≠ 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) | |
| 12 | 10, 11 | bitr3id 288 | . . . . . . . . 9 ⊢ (𝑥 = (1r‘𝑅) → (¬ 𝑥 = 𝑦 ↔ (1r‘𝑅) ≠ 𝑦)) |
| 13 | neeq2 3027 | . . . . . . . . 9 ⊢ (𝑦 = (0g‘𝑅) → ((1r‘𝑅) ≠ 𝑦 ↔ (1r‘𝑅) ≠ (0g‘𝑅))) | |
| 14 | 12, 13 | rspc2ev 3603 | . . . . . . . 8 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵 ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 15 | 6, 8, 9, 14 | syl3anc 1396 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 16 | 15 | ex 417 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) |
| 17 | 4, 1, 2 | ring1eq0 20377 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 18 | 17 | 3expb 1136 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((1r‘𝑅) = (0g‘𝑅) → 𝑥 = 𝑦)) |
| 19 | 18 | necon3bd 2978 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 20 | 19 | rexlimdvva 3228 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦 → (1r‘𝑅) ≠ (0g‘𝑅))) |
| 21 | 16, 20 | impbid 215 | . . . . 5 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) |
| 22 | 4 | fvexi 6893 | . . . . . 6 ⊢ 𝐵 ∈ V |
| 23 | 1sdom 9211 | . . . . . 6 ⊢ (𝐵 ∈ V → (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦)) | |
| 24 | 22, 23 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ¬ 𝑥 = 𝑦) |
| 25 | 21, 24 | bitr4di 292 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ 1o ≺ 𝐵)) |
| 26 | 1onn 8622 | . . . . . 6 ⊢ 1o ∈ ω | |
| 27 | sucdom 9200 | . . . . . 6 ⊢ (1o ∈ ω → (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵)) | |
| 28 | 26, 27 | ax-mp 5 | . . . . 5 ⊢ (1o ≺ 𝐵 ↔ suc 1o ≼ 𝐵) |
| 29 | df-2o 8450 | . . . . . 6 ⊢ 2o = suc 1o | |
| 30 | 29 | breq1i 5117 | . . . . 5 ⊢ (2o ≼ 𝐵 ↔ suc 1o ≼ 𝐵) |
| 31 | 28, 30 | bitr4i 281 | . . . 4 ⊢ (1o ≺ 𝐵 ↔ 2o ≼ 𝐵) |
| 32 | 25, 31 | bitrdi 290 | . . 3 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ 2o ≼ 𝐵)) |
| 33 | 32 | pm5.32i 584 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) ↔ (𝑅 ∈ Ring ∧ 2o ≼ 𝐵)) |
| 34 | 3, 33 | bitri 278 | 1 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 2o ≼ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 Vcvv 3463 class class class wbr 5110 suc csuc 6360 ‘cfv 6534 ωcom 7858 1oc1o 8442 2oc2o 8443 ≼ cdom 8937 ≺ csdm 8938 Basecbs 17265 0gc0g 17488 1rcur 20259 Ringcrg 20311 NzRingcnzr 20591 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 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-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-sets 17220 df-slot 17238 df-ndx 17250 df-base 17266 df-plusg 17319 df-0g 17490 df-mgm 18694 df-sgrp 18773 df-mnd 18789 df-grp 18999 df-minusg 19000 df-cmn 19848 df-abl 19849 df-mgp 20213 df-rng 20227 df-ur 20260 df-ring 20313 df-nzr 20592 |
| This theorem is referenced by: znfld 21675 znidomb 21676 |
| Copyright terms: Public domain | W3C validator |