![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > srg1zr | Structured version Visualization version GIF version |
Description: The only semiring with a base set consisting of one element is the zero ring (at least if its operations are internal binary operations). (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.) |
Ref | Expression |
---|---|
srg1zr.b | ⊢ 𝐵 = (Base‘𝑅) |
srg1zr.p | ⊢ + = (+g‘𝑅) |
srg1zr.t | ⊢ ∗ = (.r‘𝑅) |
Ref | Expression |
---|---|
srg1zr | ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm4.24 673 | . 2 ⊢ (𝐵 = {𝑍} ↔ (𝐵 = {𝑍} ∧ 𝐵 = {𝑍})) | |
2 | srgmnd 18332 | . . . . . . 7 ⊢ (𝑅 ∈ SRing → 𝑅 ∈ Mnd) | |
3 | 2 | 3ad2ant1 1075 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) → 𝑅 ∈ Mnd) |
4 | 3 | adantr 480 | . . . . 5 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → 𝑅 ∈ Mnd) |
5 | mndmgm 17123 | . . . . 5 ⊢ (𝑅 ∈ Mnd → 𝑅 ∈ Mgm) | |
6 | 4, 5 | syl 17 | . . . 4 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → 𝑅 ∈ Mgm) |
7 | simpr 476 | . . . 4 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → 𝑍 ∈ 𝐵) | |
8 | simpl2 1058 | . . . 4 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → + Fn (𝐵 × 𝐵)) | |
9 | srg1zr.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
10 | srg1zr.p | . . . . 5 ⊢ + = (+g‘𝑅) | |
11 | 9, 10 | mgmb1mgm1 17077 | . . . 4 ⊢ ((𝑅 ∈ Mgm ∧ 𝑍 ∈ 𝐵 ∧ + Fn (𝐵 × 𝐵)) → (𝐵 = {𝑍} ↔ + = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
12 | 6, 7, 8, 11 | syl3anc 1318 | . . 3 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ + = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
13 | simpl1 1057 | . . . . . 6 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → 𝑅 ∈ SRing) | |
14 | eqid 2610 | . . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
15 | 14 | srgmgp 18333 | . . . . . 6 ⊢ (𝑅 ∈ SRing → (mulGrp‘𝑅) ∈ Mnd) |
16 | mndmgm 17123 | . . . . . 6 ⊢ ((mulGrp‘𝑅) ∈ Mnd → (mulGrp‘𝑅) ∈ Mgm) | |
17 | 13, 15, 16 | 3syl 18 | . . . . 5 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (mulGrp‘𝑅) ∈ Mgm) |
18 | srg1zr.t | . . . . . . . . . 10 ⊢ ∗ = (.r‘𝑅) | |
19 | 14, 18 | mgpplusg 18316 | . . . . . . . . 9 ⊢ ∗ = (+g‘(mulGrp‘𝑅)) |
20 | 19 | fneq1i 5899 | . . . . . . . 8 ⊢ ( ∗ Fn (𝐵 × 𝐵) ↔ (+g‘(mulGrp‘𝑅)) Fn (𝐵 × 𝐵)) |
21 | 20 | biimpi 205 | . . . . . . 7 ⊢ ( ∗ Fn (𝐵 × 𝐵) → (+g‘(mulGrp‘𝑅)) Fn (𝐵 × 𝐵)) |
22 | 21 | 3ad2ant3 1077 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) → (+g‘(mulGrp‘𝑅)) Fn (𝐵 × 𝐵)) |
23 | 22 | adantr 480 | . . . . 5 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (+g‘(mulGrp‘𝑅)) Fn (𝐵 × 𝐵)) |
24 | 14, 9 | mgpbas 18318 | . . . . . 6 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
25 | eqid 2610 | . . . . . 6 ⊢ (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅)) | |
26 | 24, 25 | mgmb1mgm1 17077 | . . . . 5 ⊢ (((mulGrp‘𝑅) ∈ Mgm ∧ 𝑍 ∈ 𝐵 ∧ (+g‘(mulGrp‘𝑅)) Fn (𝐵 × 𝐵)) → (𝐵 = {𝑍} ↔ (+g‘(mulGrp‘𝑅)) = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
27 | 17, 7, 23, 26 | syl3anc 1318 | . . . 4 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ (+g‘(mulGrp‘𝑅)) = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
28 | 19 | eqcomi 2619 | . . . . . 6 ⊢ (+g‘(mulGrp‘𝑅)) = ∗ |
29 | 28 | a1i 11 | . . . . 5 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (+g‘(mulGrp‘𝑅)) = ∗ ) |
30 | 29 | eqeq1d 2612 | . . . 4 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → ((+g‘(mulGrp‘𝑅)) = {〈〈𝑍, 𝑍〉, 𝑍〉} ↔ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
31 | 27, 30 | bitrd 267 | . . 3 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉})) |
32 | 12, 31 | anbi12d 743 | . 2 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → ((𝐵 = {𝑍} ∧ 𝐵 = {𝑍}) ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
33 | 1, 32 | syl5bb 271 | 1 ⊢ (((𝑅 ∈ SRing ∧ + Fn (𝐵 × 𝐵) ∧ ∗ Fn (𝐵 × 𝐵)) ∧ 𝑍 ∈ 𝐵) → (𝐵 = {𝑍} ↔ ( + = {〈〈𝑍, 𝑍〉, 𝑍〉} ∧ ∗ = {〈〈𝑍, 𝑍〉, 𝑍〉}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 {csn 4125 〈cop 4131 × cxp 5036 Fn wfn 5799 ‘cfv 5804 Basecbs 15695 +gcplusg 15768 .rcmulr 15769 Mgmcmgm 17063 Mndcmnd 17117 mulGrpcmgp 18312 SRingcsrg 18328 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-plusg 15781 df-plusf 17064 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-cmn 18018 df-mgp 18313 df-srg 18329 |
This theorem is referenced by: srgen1zr 18353 ring1zr 19096 |
Copyright terms: Public domain | W3C validator |