Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ring1eq0 | Structured version Visualization version GIF version |
Description: If one and zero are equal, then any two elements of a ring are equal. Alternately, every ring has one distinct from zero except the zero ring containing the single element {0}. (Contributed by Mario Carneiro, 10-Sep-2014.) |
Ref | Expression |
---|---|
ring1eq0.b | ⊢ 𝐵 = (Base‘𝑅) |
ring1eq0.u | ⊢ 1 = (1r‘𝑅) |
ring1eq0.z | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
ring1eq0 | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 1 = 0 → 𝑋 = 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 484 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → 1 = 0 ) | |
2 | 1 | oveq1d 7270 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑋) = ( 0 (.r‘𝑅)𝑋)) |
3 | 1 | oveq1d 7270 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑌) = ( 0 (.r‘𝑅)𝑌)) |
4 | simpl1 1189 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → 𝑅 ∈ Ring) | |
5 | simpl2 1190 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → 𝑋 ∈ 𝐵) | |
6 | ring1eq0.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅) | |
7 | eqid 2738 | . . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
8 | ring1eq0.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
9 | 6, 7, 8 | ringlz 19741 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ( 0 (.r‘𝑅)𝑋) = 0 ) |
10 | 4, 5, 9 | syl2anc 583 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 0 (.r‘𝑅)𝑋) = 0 ) |
11 | simpl3 1191 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → 𝑌 ∈ 𝐵) | |
12 | 6, 7, 8 | ringlz 19741 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 0 (.r‘𝑅)𝑌) = 0 ) |
13 | 4, 11, 12 | syl2anc 583 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 0 (.r‘𝑅)𝑌) = 0 ) |
14 | 10, 13 | eqtr4d 2781 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 0 (.r‘𝑅)𝑋) = ( 0 (.r‘𝑅)𝑌)) |
15 | 3, 14 | eqtr4d 2781 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑌) = ( 0 (.r‘𝑅)𝑋)) |
16 | 2, 15 | eqtr4d 2781 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑋) = ( 1 (.r‘𝑅)𝑌)) |
17 | ring1eq0.u | . . . . 5 ⊢ 1 = (1r‘𝑅) | |
18 | 6, 7, 17 | ringlidm 19725 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑋) = 𝑋) |
19 | 4, 5, 18 | syl2anc 583 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑋) = 𝑋) |
20 | 6, 7, 17 | ringlidm 19725 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑌) = 𝑌) |
21 | 4, 11, 20 | syl2anc 583 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → ( 1 (.r‘𝑅)𝑌) = 𝑌) |
22 | 16, 19, 21 | 3eqtr3d 2786 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 1 = 0 ) → 𝑋 = 𝑌) |
23 | 22 | ex 412 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 1 = 0 → 𝑋 = 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 .rcmulr 16889 0gc0g 17067 1rcur 19652 Ringcrg 19698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-mgp 19636 df-ur 19653 df-ring 19700 |
This theorem is referenced by: ring1ne0 19745 abvneg 20009 isnzr2 20447 ringelnzr 20450 nrginvrcn 23762 |
Copyright terms: Public domain | W3C validator |