Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > srgcmn | Structured version Visualization version GIF version |
Description: A semiring is a commutative monoid. (Contributed by Thierry Arnoux, 21-Mar-2018.) |
Ref | Expression |
---|---|
srgcmn | ⊢ (𝑅 ∈ SRing → 𝑅 ∈ CMnd) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2610 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
2 | eqid 2610 | . . 3 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
3 | eqid 2610 | . . 3 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
4 | eqid 2610 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
5 | eqid 2610 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
6 | 1, 2, 3, 4, 5 | issrg 18330 | . 2 ⊢ (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝑅)(∀𝑦 ∈ (Base‘𝑅)∀𝑧 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)(𝑦(+g‘𝑅)𝑧)) = ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)(𝑥(.r‘𝑅)𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦)(.r‘𝑅)𝑧) = ((𝑥(.r‘𝑅)𝑧)(+g‘𝑅)(𝑦(.r‘𝑅)𝑧))) ∧ (((0g‘𝑅)(.r‘𝑅)𝑥) = (0g‘𝑅) ∧ (𝑥(.r‘𝑅)(0g‘𝑅)) = (0g‘𝑅))))) |
7 | 6 | simp1bi 1069 | 1 ⊢ (𝑅 ∈ SRing → 𝑅 ∈ CMnd) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 +gcplusg 15768 .rcmulr 15769 0gc0g 15923 Mndcmnd 17117 CMndccmn 18016 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-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-nul 4717 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-iota 5768 df-fv 5812 df-ov 6552 df-srg 18329 |
This theorem is referenced by: srgmnd 18332 srgcom 18348 srgsummulcr 18360 sgsummulcl 18361 srgbinomlem3 18365 srgbinomlem4 18366 srgbinomlem 18367 gsumvsca2 29114 |
Copyright terms: Public domain | W3C validator |