Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  slmdcmn Structured version   Visualization version   GIF version

Theorem slmdcmn 33866
Description: A semimodule is a commutative monoid. (Contributed by Thierry Arnoux, 1-Apr-2018.)
Assertion
Ref Expression
slmdcmn (𝑊 ∈ SLMod → 𝑊 ∈ CMnd)

Proof of Theorem slmdcmn
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2766 . . 3 (Base‘𝑊) = (Base‘𝑊)
2 eqid 2766 . . 3 (+g‘𝑊) = (+g‘𝑊)
3 eqid 2766 . . 3 ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
4 eqid 2766 . . 3 (0g‘𝑊) = (0g‘𝑊)
5 eqid 2766 . . 3 (Scalar‘𝑊) = (Scalar‘𝑊)
6 eqid 2766 . . 3 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
7 eqid 2766 . . 3 (+g‘(Scalar‘𝑊)) = (+g‘(Scalar‘𝑊))
8 eqid 2766 . . 3 (.r‘(Scalar‘𝑊)) = (.r‘(Scalar‘𝑊))
9 eqid 2766 . . 3 (1r‘(Scalar‘𝑊)) = (1r‘(Scalar‘𝑊))
10 eqid 2766 . . 3 (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
111, 2, 3, 4, 5, 6, 7, 8, 9, 10isslmd 33863 . 2 (𝑊 ∈ SLMod ↔ (𝑊 ∈ CMnd ∧ (Scalar‘𝑊) ∈ SRing ∧ ∀𝑤 ∈ (Base‘(Scalar‘𝑊))∀𝑧 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑧( ·𝑠 ‘𝑊)𝑦) ∈ (Base‘𝑊) ∧ (𝑧( ·𝑠 ‘𝑊)(𝑦(+g‘𝑊)𝑥)) = ((𝑧( ·𝑠 ‘𝑊)𝑦)(+g‘𝑊)(𝑧( ·𝑠 ‘𝑊)𝑥)) ∧ ((𝑤(+g‘(Scalar‘𝑊))𝑧)( ·𝑠 ‘𝑊)𝑦) = ((𝑤( ·𝑠 ‘𝑊)𝑦)(+g‘𝑊)(𝑧( ·𝑠 ‘𝑊)𝑦))) ∧ (((𝑤(.r‘(Scalar‘𝑊))𝑧)( ·𝑠 ‘𝑊)𝑦) = (𝑤( ·𝑠 ‘𝑊)(𝑧( ·𝑠 ‘𝑊)𝑦)) ∧ ((1r‘(Scalar‘𝑊))( ·𝑠 ‘𝑊)𝑦) = 𝑦 ∧ ((0g‘(Scalar‘𝑊))( ·𝑠 ‘𝑊)𝑦) = (0g‘𝑊)))))
1211simp1bi 1164 1 (𝑊 ∈ SLMod → 𝑊 ∈ CMnd)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  +gcplusg 17474  .rcmulr 17475  Scalarcsca 17477   ·𝑠 cvsca 17478  0gc0g 17662  CMndccmn 20047  1rcur 20460  SRingcsrg 20465  SLModcslmd 33861
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-slmd 33862
This theorem is used by:  slmdmnd  33867  gsumvsca1  33887  gsumvsca2  33888
  Copyright terms: Public domain W3C validator