| 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 20819. (Contributed by AV, 14-Apr-2019.) |
| Ref | Expression |
|---|---|
| isnzr2hash.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| isnzr2hash | ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 2 | eqid 2763 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 3 | 1, 2 | isnzr 20815 | . 2 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ (1r‘𝑅) ≠ (0g‘𝑅))) |
| 4 | isnzr2hash.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 4, 1 | ringidcl 20545 | . . . . 5 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 6 | 4, 2 | ring0cl 20547 | . . . . 5 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ 𝐵) |
| 7 | 1xr 11407 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 ∈ ℝ*) |
| 9 | prex 5403 | . . . . . . . 8 ⊢ {(1r‘𝑅), (0g‘𝑅)} ∈ V | |
| 10 | hashxrcl 14542 | . . . . . . . 8 ⊢ ({(1r‘𝑅), (0g‘𝑅)} ∈ V → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) | |
| 11 | 9, 10 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) ∈ ℝ*) |
| 12 | 4 | fvexi 6930 | . . . . . . . 8 ⊢ 𝐵 ∈ V |
| 13 | hashxrcl 14542 | . . . . . . . 8 ⊢ (𝐵 ∈ V → (♯‘𝐵) ∈ ℝ*) | |
| 14 | 12, 13 | mp1i 14 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘𝐵) ∈ ℝ*) |
| 15 | 1lt2 12555 | . . . . . . . 8 ⊢ 1 < 2 | |
| 16 | hashprg 14580 | . . . . . . . . 9 ⊢ (((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) → ((1r‘𝑅) ≠ (0g‘𝑅) ↔ (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2)) | |
| 17 | 16 | biimpa 482 | . . . . . . . 8 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → (♯‘{(1r‘𝑅), (0g‘𝑅)}) = 2) |
| 18 | 15, 17 | breqtrrid 5149 | . . . . . . 7 ⊢ ((((1r‘𝑅) ∈ 𝐵 ∧ (0g‘𝑅) ∈ 𝐵) ∧ (1r‘𝑅) ≠ (0g‘𝑅)) → 1 < (♯‘{(1r‘𝑅), (0g‘𝑅)})) |
| 19 | fvex 6929 | . . . . . . . . . 10 ⊢ (1r‘𝑅) ∈ V | |
| 20 | fvex 6929 | . . . . . . . . . 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 14594 | . . . . . . . 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 13330 | . . . . . 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 20581 | . . . 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 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 {cpr 4590 class class class wbr 5108 ‘cfv 6566 1c1 11240 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 2c2 12437 ♯chash 14515 Basecbs 17431 0gc0g 17660 1rcur 20458 Ringcrg 20510 NzRingcnzr 20813 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-fz 13680 df-hash 14516 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-nzr 20814 |
| This theorem is used by: 0ringnnzr 20827 prmidl0 21685 qsidomlem1 21687 krull 34107 el0ldepsnzr 49971 |
| Copyright terms: Public domain | W3C validator |