| 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 20564. (Contributed by AV, 14-Apr-2019.) |
| Ref | Expression |
|---|---|
| isnzr2hash.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| isnzr2hash | ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2762 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2762 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20560 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2hash.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20311 | . . . . 5 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 4, 2 | ring0cl 20313 | . . . . 5 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 7 | 1xr 11241 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 ∈ ℝ*) |
| 9 | prex 5395 | . . . . . . . 8 ⊢ {(1r‘𝑅), (0g‘𝑅)} ∈ V | |
| 10 | hashxrcl 14370 | . . . . . . . 8 ⊢ ({(1r‘𝑅), (0g‘𝑅)} ∈ V → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) | |
| 11 | 9, 10 | mp1i 13 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) |
| 12 | 4 | fvexi 6881 | . . . . . . . 8 ⊢ 𝐵 ∈ V |
| 13 | hashxrcl 14370 | . . . . . . . 8 ⊢ (𝐵 ∈ V → (♯‘𝐵) ∈ ℝ*) | |
| 14 | 12, 13 | mp1i 13 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘𝐵) ∈ ℝ*) |
| 15 | 1lt2 12390 | . . . . . . . 8 ⊢ 1 < 2 | |
| 16 | hashprg 14408 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2)) | |
| 17 | 16 | biimpa 480 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2) |
| 18 | 15, 17 | breqtrrid 5138 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘{(1r‘𝑅), (0g‘𝑅)})) |
| 19 | fvex 6880 | . . . . . . . . . 10 ⊢ (1r‘𝑅) ∈ V | |
| 20 | fvex 6880 | . . . . . . . . . 10 ⊢ (0g‘𝑅) ∈ V | |
| 21 | 19, 20 | prss 4778 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ↔ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 22 | 21 | birani 507 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) |
| 23 | hashss 14422 | . . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ {(1r‘𝑅), (0g‘𝑅)} ⊆ 𝐵) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) | |
| 24 | 12, 22, 23 | sylancr 596 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ≤ (♯‘𝐵)) |
| 25 | 8, 11, 14, 18, 24 | xrltletrd 13163 | . . . . . 6 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘𝐵)) |
| 26 | 25 | ex 416 | . . . . 5 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 27 | 5, 6, 26 | syl2anc 593 | . . . 4 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ≠ (0g‘𝑅) → 1 < (♯‘𝐵))) |
| 28 | 27 | imdistani 576 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| 29 | simpl 486 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 𝑅 ∈ Ring) | |
| 30 | 4, 1, 2 | ring1ne0 20345 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → (1r‘𝑅) ≠ (0g‘𝑅)) |
| 31 | 29, 30 | jca 519 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 32 | 28, 31 | impbii 211 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅)) ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| 33 | 3, 32 | bitri 277 | 1 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ⊆ wss 3904 {cpr 4584 class class class wbr 5100 ‘cfv 6521 1c1 11074 ℝ*cxr 11215 < clt 11216 ≤ cle 11217 2c2 12272 ♯chash 14343 Basecbs 17245 0gc0g 17468 1rcur 20227 Ringcrg 20279 NzRingcnzr 20558 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-oadd 8441 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-dju 9859 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-n0 12482 df-xnn0 12555 df-z 12569 df-uz 12840 df-fz 13513 df-hash 14344 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-plusg 17299 df-0g 17470 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20228 df-ring 20281 df-nzr 20559 |
| This theorem is referenced by: 0ringnnzr 20571 prmidl0 33634 qsidomlem1 33636 krull 33664 el0ldepsnzr 49086 |
| Copyright terms: Public domain | W3C validator |