| 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 20768. (Contributed by AV, 14-Apr-2019.) |
| Ref | Expression |
|---|---|
| isnzr2hash.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| isnzr2hash | ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2761 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20764 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2hash.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20494 | . . . . 5 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 4, 2 | ring0cl 20496 | . . . . 5 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 7 | 1xr 11368 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 ∈ ℝ*) |
| 9 | prex 5396 | . . . . . . . 8 ⊢ {(1r‘𝑅), (0g‘𝑅)} ∈ V | |
| 10 | hashxrcl 14501 | . . . . . . . 8 ⊢ ({(1r‘𝑅), (0g‘𝑅)} ∈ V → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) | |
| 11 | 9, 10 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) |
| 12 | 4 | fvexi 6899 | . . . . . . . 8 ⊢ 𝐵 ∈ V |
| 13 | hashxrcl 14501 | . . . . . . . 8 ⊢ (𝐵 ∈ V → (♯‘𝐵) ∈ ℝ*) | |
| 14 | 12, 13 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘𝐵) ∈ ℝ*) |
| 15 | 1lt2 12515 | . . . . . . . 8 ⊢ 1 < 2 | |
| 16 | hashprg 14539 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2)) | |
| 17 | 16 | biimpa 482 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2) |
| 18 | 15, 17 | breqtrrid 5143 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘{(1r‘𝑅), (0g‘𝑅)})) |
| 19 | fvex 6898 | . . . . . . . . . 10 ⊢ (1r‘𝑅) ∈ V | |
| 20 | fvex 6898 | . . . . . . . . . 10 ⊢ (0g‘𝑅) ∈ V | |
| 21 | 19, 20 | prss 4781 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ↔ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 22 | 21 | birani 509 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 23 | hashss 14553 | . . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) | |
| 24 | 12, 22, 23 | sylancr 599 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) |
| 25 | 8, 11, 14, 18, 24 | xrltletrd 13290 | . . . . . 6 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘𝐵)) |
| 26 | 25 | ex 418 | . . . . 5 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 27 | 5, 6, 26 | syl2anc 596 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 28 | 27 | imdistani 579 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| 29 | simpl 488 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 𝑅 ∈ Ring) | |
| 30 | 4, 1, 2 | ring1ne0 20530 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → (1r‘𝑅) ≠ (0g‘𝑅)) |
| 31 | 29, 30 | jca 521 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 Vcvv 3451 ⊆ wss 3899 {cpr 4586 class class class wbr 5103 ‘cfv 6538 1c1 11201 ℝ*cxr 11342 < clt 11343 ≤ cle 11344 2c2 12397 ♯chash 14474 Basecbs 17387 0gc0g 17610 1rcur 20407 Ringcrg 20459 NzRingcnzr 20762 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-n0 12607 df-xnn0 12680 df-z 12694 df-uz 12966 df-fz 13640 df-hash 14475 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-plusg 17441 df-0g 17612 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-grp 19147 df-minusg 19148 df-cmn 19996 df-abl 19997 df-mgp 20361 df-rng 20375 df-ur 20408 df-ring 20461 df-nzr 20763 |
| This theorem is used by: 0ringnnzr 20776 prmidl0 21634 qsidomlem1 21636 krull 34003 el0ldepsnzr 49578 |
| Copyright terms: Public domain | W3C validator |