![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 01eq0ringOLD | Structured version Visualization version GIF version |
Description: Obsolete version of 01eq0ring 20420 as of 23-Feb-2025. (Contributed by AV, 16-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
0ring.b | ⊢ 𝐵 = (Base‘𝑅) |
0ring.0 | ⊢ 0 = (0g‘𝑅) |
0ring01eq.1 | ⊢ 1 = (1r‘𝑅) |
Ref | Expression |
---|---|
01eq0ringOLD | ⊢ ((𝑅 ∈ Ring ∧ 0 = 1 ) → 𝐵 = { 0 }) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ring.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
2 | 1 | fvexi 6895 | . . . . . 6 ⊢ 𝐵 ∈ V |
3 | hashv01gt1 14302 | . . . . . 6 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵))) | |
4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) |
5 | hasheq0 14320 | . . . . . . . . 9 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ↔ 𝐵 = ∅)) | |
6 | 2, 5 | ax-mp 5 | . . . . . . . 8 ⊢ ((♯‘𝐵) = 0 ↔ 𝐵 = ∅) |
7 | ne0i 4326 | . . . . . . . . 9 ⊢ ( 0 ∈ 𝐵 → 𝐵 ≠ ∅) | |
8 | eqneqall 2943 | . . . . . . . . 9 ⊢ (𝐵 = ∅ → (𝐵 ≠ ∅ → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) | |
9 | 7, 8 | syl5com 31 | . . . . . . . 8 ⊢ ( 0 ∈ 𝐵 → (𝐵 = ∅ → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
10 | 6, 9 | biimtrid 241 | . . . . . . 7 ⊢ ( 0 ∈ 𝐵 → ((♯‘𝐵) = 0 → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
11 | 0ring.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
12 | 1, 11 | ring0cl 20156 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 0 ∈ 𝐵) |
13 | 10, 12 | syl11 33 | . . . . . 6 ⊢ ((♯‘𝐵) = 0 → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
14 | eqneqall 2943 | . . . . . . 7 ⊢ ((♯‘𝐵) = 1 → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 )) | |
15 | 14 | a1d 25 | . . . . . 6 ⊢ ((♯‘𝐵) = 1 → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
16 | 0ring01eq.1 | . . . . . . . . . . 11 ⊢ 1 = (1r‘𝑅) | |
17 | 1, 16, 11 | ring1ne0 20188 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 1 ≠ 0 ) |
18 | 17 | necomd 2988 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 0 ≠ 1 ) |
19 | 18 | ex 412 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → (1 < (♯‘𝐵) → 0 ≠ 1 )) |
20 | 19 | a1i 11 | . . . . . . 7 ⊢ ((♯‘𝐵) ≠ 1 → (𝑅 ∈ Ring → (1 < (♯‘𝐵) → 0 ≠ 1 ))) |
21 | 20 | com13 88 | . . . . . 6 ⊢ (1 < (♯‘𝐵) → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
22 | 13, 15, 21 | 3jaoi 1424 | . . . . 5 ⊢ (((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
23 | 4, 22 | ax-mp 5 | . . . 4 ⊢ (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 )) |
24 | 23 | necon4d 2956 | . . 3 ⊢ (𝑅 ∈ Ring → ( 0 = 1 → (♯‘𝐵) = 1)) |
25 | 24 | imp 406 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 0 = 1 ) → (♯‘𝐵) = 1) |
26 | 1, 11 | 0ring 20416 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (♯‘𝐵) = 1) → 𝐵 = { 0 }) |
27 | 25, 26 | syldan 590 | 1 ⊢ ((𝑅 ∈ Ring ∧ 0 = 1 ) → 𝐵 = { 0 }) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ w3o 1083 = wceq 1533 ∈ wcel 2098 ≠ wne 2932 Vcvv 3466 ∅c0 4314 {csn 4620 class class class wbr 5138 ‘cfv 6533 0cc0 11106 1c1 11107 < clt 11245 ♯chash 14287 Basecbs 17143 0gc0g 17384 1rcur 20076 Ringcrg 20128 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1st 7968 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-n0 12470 df-xnn0 12542 df-z 12556 df-uz 12820 df-fz 13482 df-hash 14288 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-plusg 17209 df-0g 17386 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-grp 18856 df-minusg 18857 df-cmn 19692 df-abl 19693 df-mgp 20030 df-rng 20048 df-ur 20077 df-ring 20130 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |