Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ring1zr | Structured version Visualization version GIF version |
Description: The only (unital) ring with a base set consisting of one element is the zero ring (at least if its operations are internal binary operations). Note: The assumption 𝑅 ∈ Ring could be weakened if a definition of a non-unital ring ("Rng") was available (it would be sufficient that the multiplication is closed). (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.) (Proof shortened by AV, 7-Feb-2020.) |
Ref | Expression |
---|---|
ring1zr.b | ⊢ 𝐵 = (Base‘𝑅) |
ring1zr.p | ⊢ + = (+g‘𝑅) |
ring1zr.t | ⊢ ∗ = (.r‘𝑅) |
Ref | Expression |
---|---|
ring1zr | ⊢ (((𝑅 ∈ Ring ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ringsrg 19826 | . 2 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing) | |
2 | ring1zr.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
3 | ring1zr.p | . . 3 ⊢ + = (+g‘𝑅) | |
4 | ring1zr.t | . . 3 ⊢ ∗ = (.r‘𝑅) | |
5 | 2, 3, 4 | srg1zr 19763 | . 2 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
6 | 1, 5 | syl3anl1 1411 | 1 ⊢ (((𝑅 ∈ Ring ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 {csn 4563 〈cop 4569 × cxp 5589 Fn wfn 6430 ‘cfv 6435 Basecbs 16910 +gcplusg 16960 .rcmulr 16961 SRingcsrg 19739 Ringcrg 19781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5225 ax-nul 5232 ax-pow 5290 ax-pr 5354 ax-un 7588 ax-cnex 10925 ax-resscn 10926 ax-1cn 10927 ax-icn 10928 ax-addcl 10929 ax-addrcl 10930 ax-mulcl 10931 ax-mulrcl 10932 ax-mulcom 10933 ax-addass 10934 ax-mulass 10935 ax-distr 10936 ax-i2m1 10937 ax-1ne0 10938 ax-1rid 10939 ax-rnegex 10940 ax-rrecex 10941 ax-cnre 10942 ax-pre-lttri 10943 ax-pre-lttrn 10944 ax-pre-ltadd 10945 ax-pre-mulgt0 10946 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3433 df-sbc 3718 df-csb 3834 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-pss 3907 df-nul 4259 df-if 4462 df-pw 4537 df-sn 4564 df-pr 4566 df-op 4570 df-uni 4842 df-iun 4928 df-br 5077 df-opab 5139 df-mpt 5160 df-tr 5194 df-id 5491 df-eprel 5497 df-po 5505 df-so 5506 df-fr 5546 df-we 5548 df-xp 5597 df-rel 5598 df-cnv 5599 df-co 5600 df-dm 5601 df-rn 5602 df-res 5603 df-ima 5604 df-pred 6204 df-ord 6271 df-on 6272 df-lim 6273 df-suc 6274 df-iota 6393 df-fun 6437 df-fn 6438 df-f 6439 df-f1 6440 df-fo 6441 df-f1o 6442 df-fv 6443 df-riota 7234 df-ov 7280 df-oprab 7281 df-mpo 7282 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8095 df-wrecs 8126 df-recs 8200 df-rdg 8239 df-er 8496 df-en 8732 df-dom 8733 df-sdom 8734 df-pnf 11009 df-mnf 11010 df-xr 11011 df-ltxr 11012 df-le 11013 df-sub 11205 df-neg 11206 df-nn 11972 df-2 12034 df-sets 16863 df-slot 16881 df-ndx 16893 df-base 16911 df-plusg 16973 df-0g 17150 df-plusf 18323 df-mgm 18324 df-sgrp 18373 df-mnd 18384 df-grp 18578 df-minusg 18579 df-cmn 19386 df-abl 19387 df-mgp 19719 df-ur 19736 df-srg 19740 df-ring 19783 |
This theorem is referenced by: rngen1zr 20545 |
Copyright terms: Public domain | W3C validator |