![]() |
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 20547 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 6921 | . . . . . 6 ⊢ 𝐵 ∈ V |
3 | hashv01gt1 14381 | . . . . . 6 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵))) | |
4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) |
5 | hasheq0 14399 | . . . . . . . . 9 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ↔ 𝐵 = ∅)) | |
6 | 2, 5 | ax-mp 5 | . . . . . . . 8 ⊢ ((♯‘𝐵) = 0 ↔ 𝐵 = ∅) |
7 | ne0i 4347 | . . . . . . . . 9 ⊢ ( 0 ∈ 𝐵 → 𝐵 ≠ ∅) | |
8 | eqneqall 2949 | . . . . . . . . 9 ⊢ (𝐵 = ∅ → (𝐵 ≠ ∅ → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) | |
9 | 7, 8 | syl5com 31 | . . . . . . . 8 ⊢ ( 0 ∈ 𝐵 → (𝐵 = ∅ → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
10 | 6, 9 | biimtrid 242 | . . . . . . 7 ⊢ ( 0 ∈ 𝐵 → ((♯‘𝐵) = 0 → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
11 | 0ring.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
12 | 1, 11 | ring0cl 20281 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 0 ∈ 𝐵) |
13 | 10, 12 | syl11 33 | . . . . . 6 ⊢ ((♯‘𝐵) = 0 → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
14 | eqneqall 2949 | . . . . . . 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 20313 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘𝐵)) → 1 ≠ 0 ) |
18 | 17 | necomd 2994 | . . . . . . . . 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 1427 | . . . . 5 ⊢ (((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
23 | 4, 22 | ax-mp 5 | . . . 4 ⊢ (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 )) |
24 | 23 | necon4d 2962 | . . 3 ⊢ (𝑅 ∈ Ring → ( 0 = 1 → (♯‘𝐵) = 1)) |
25 | 24 | imp 406 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 0 = 1 ) → (♯‘𝐵) = 1) |
26 | 1, 11 | 0ring 20543 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (♯‘𝐵) = 1) → 𝐵 = { 0 }) |
27 | 25, 26 | syldan 591 | 1 ⊢ ((𝑅 ∈ Ring ∧ 0 = 1 ) → 𝐵 = { 0 }) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ w3o 1085 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 Vcvv 3478 ∅c0 4339 {csn 4631 class class class wbr 5148 ‘cfv 6563 0cc0 11153 1c1 11154 < clt 11293 ♯chash 14366 Basecbs 17245 0gc0g 17486 1rcur 20199 Ringcrg 20251 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-n0 12525 df-xnn0 12598 df-z 12612 df-uz 12877 df-fz 13545 df-hash 14367 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-0g 17488 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-minusg 18968 df-cmn 19815 df-abl 19816 df-mgp 20153 df-rng 20171 df-ur 20200 df-ring 20253 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |