| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnzr2hash | Structured version Visualization version GIF version | ||
| Description: Equivalent characterization of nonzero rings: they have at least two elements. Analogous to isnzr2 20600. (Contributed by AV, 14-Apr-2019.) |
| Ref | Expression |
|---|---|
| isnzr2hash.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| isnzr2hash | ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2769 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2769 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20596 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2hash.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20347 | . . . . 5 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 4, 2 | ring0cl 20349 | . . . . 5 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 7 | 1xr 11267 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 ∈ ℝ*) |
| 9 | prex 5410 | . . . . . . . 8 ⊢ {(1r‘𝑅), (0g‘𝑅)} ∈ V | |
| 10 | hashxrcl 14392 | . . . . . . . 8 ⊢ ({(1r‘𝑅), (0g‘𝑅)} ∈ V → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) | |
| 11 | 9, 10 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) |
| 12 | 4 | fvexi 6896 | . . . . . . . 8 ⊢ 𝐵 ∈ V |
| 13 | hashxrcl 14392 | . . . . . . . 8 ⊢ (𝐵 ∈ V → (♯‘𝐵) ∈ ℝ*) | |
| 14 | 12, 13 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘𝐵) ∈ ℝ*) |
| 15 | 1lt2 12412 | . . . . . . . 8 ⊢ 1 < 2 | |
| 16 | hashprg 14430 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2)) | |
| 17 | 16 | biimpa 481 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2) |
| 18 | 15, 17 | breqtrrid 5153 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘{(1r‘𝑅), (0g‘𝑅)})) |
| 19 | fvex 6895 | . . . . . . . . . 10 ⊢ (1r‘𝑅) ∈ V | |
| 20 | fvex 6895 | . . . . . . . . . 10 ⊢ (0g‘𝑅) ∈ V | |
| 21 | 19, 20 | prss 4790 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ↔ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 22 | 21 | birani 508 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 23 | hashss 14444 | . . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) | |
| 24 | 12, 22, 23 | sylancr 598 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) |
| 25 | 8, 11, 14, 18, 24 | xrltletrd 13185 | . . . . . 6 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘𝐵)) |
| 26 | 25 | ex 417 | . . . . 5 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 27 | 5, 6, 26 | syl2anc 595 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 28 | 27 | imdistani 578 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| 29 | simpl 487 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 𝑅 ∈ Ring) | |
| 30 | 4, 1, 2 | ring1ne0 20381 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → (1r‘𝑅) ≠ (0g‘𝑅)) |
| 31 | 29, 30 | jca 520 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 32 | 28, 31 | impbii 212 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| 33 | 3, 32 | bitri 278 | 1 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 Vcvv 3463 ⊆ wss 3913 {cpr 4596 class class class wbr 5113 ‘cfv 6537 1c1 11100 ℝ*cxr 11241 < clt 11242 ≤ cle 11243 2c2 12294 ♯chash 14365 Basecbs 17268 0gc0g 17491 1rcur 20262 Ringcrg 20314 NzRingcnzr 20594 |
| 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 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| 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 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-oadd 8456 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-dju 9886 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-n0 12504 df-xnn0 12577 df-z 12591 df-uz 12862 df-fz 13535 df-hash 14366 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-plusg 17322 df-0g 17493 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-grp 19002 df-minusg 19003 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-ring 20316 df-nzr 20595 |
| This theorem is referenced by: 0ringnnzr 20608 prmidl0 21446 qsidomlem1 21448 krull 33705 el0ldepsnzr 49131 |
| Copyright terms: Public domain | W3C validator |