| 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 2766 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | eqid 2766 | . . 3 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 3 | eqid 2766 | . . 3 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 4 | eqid 2766 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 5 | eqid 2766 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 6 | 1, 2, 3, 4, 5 | issrg 20467 | . 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 1164 | 1 ⊢ (𝑅 ∈ SRing → 𝑅 ∈ CMnd) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 +gcplusg 17474 .rcmulr 17475 0gc0g 17662 Mndcmnd 18975 CMndccmn 20047 mulGrpcmgp 20413 SRingcsrg 20465 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-nul 5265 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rab 3416 df-v 3455 df-sbc 3742 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-iota 6519 df-fv 6573 df-ov 7453 df-srg 20466 |
| This theorem is used by: srgmnd 20469 srgcom 20485 srgsummulcr 20502 sgsummulcl 20503 srgbinomlem3 20507 srgbinomlem4 20508 srgbinomlem 20509 gsumvsca2 33888 |
| Copyright terms: Public domain | W3C validator |