![]() |
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 6906 | . . . . . 6 ⊢ 𝐵 ∈ V |
3 | hashv01gt1 14310 | . . . . . 6 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵))) | |
4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ ((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) |
5 | hasheq0 14328 | . . . . . . . . 9 ⊢ (𝐵 ∈ V → ((♯‘𝐵) = 0 ↔ 𝐵 = ∅)) | |
6 | 2, 5 | ax-mp 5 | . . . . . . . 8 ⊢ ((♯‘𝐵) = 0 ↔ 𝐵 = ∅) |
7 | ne0i 4335 | . . . . . . . . 9 ⊢ ( 0 ∈ 𝐵 → 𝐵 ≠ ∅) | |
8 | eqneqall 2950 | . . . . . . . . 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 2950 | . . . . . . 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 2995 | . . . . . . . . 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 1426 | . . . . 5 ⊢ (((♯‘𝐵) = 0 ∨ (♯‘𝐵) = 1 ∨ 1 < (♯‘𝐵)) → (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 ))) |
23 | 4, 22 | ax-mp 5 | . . . 4 ⊢ (𝑅 ∈ Ring → ((♯‘𝐵) ≠ 1 → 0 ≠ 1 )) |
24 | 23 | necon4d 2963 | . . 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 1085 = wceq 1540 ∈ wcel 2105 ≠ wne 2939 Vcvv 3473 ∅c0 4323 {csn 4629 class class class wbr 5149 ‘cfv 6544 0cc0 11113 1c1 11114 < clt 11253 ♯chash 14295 Basecbs 17149 0gc0g 17390 1rcur 20076 Ringcrg 20128 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7728 ax-cnex 11169 ax-resscn 11170 ax-1cn 11171 ax-icn 11172 ax-addcl 11173 ax-addrcl 11174 ax-mulcl 11175 ax-mulrcl 11176 ax-mulcom 11177 ax-addass 11178 ax-mulass 11179 ax-distr 11180 ax-i2m1 11181 ax-1ne0 11182 ax-1rid 11183 ax-rnegex 11184 ax-rrecex 11185 ax-cnre 11186 ax-pre-lttri 11187 ax-pre-lttrn 11188 ax-pre-ltadd 11189 ax-pre-mulgt0 11190 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7859 df-1st 7978 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-1o 8469 df-er 8706 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-card 9937 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-nn 12218 df-2 12280 df-n0 12478 df-xnn0 12550 df-z 12564 df-uz 12828 df-fz 13490 df-hash 14296 df-sets 17102 df-slot 17120 df-ndx 17132 df-base 17150 df-plusg 17215 df-0g 17392 df-mgm 18566 df-sgrp 18645 df-mnd 18661 df-grp 18859 df-minusg 18860 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 |