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

Theorem slmdcmn 27438
Description: A semimodule is a commutative monoid. (Contributed by Thierry Arnoux, 1-Apr-2018.)
Assertion
Ref Expression
slmdcmn  |-  ( W  e. SLMod  ->  W  e. CMnd )

Proof of Theorem slmdcmn
Dummy variables  w  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2467 . . 3  |-  ( Base `  W )  =  (
Base `  W )
2 eqid 2467 . . 3  |-  ( +g  `  W )  =  ( +g  `  W )
3 eqid 2467 . . 3  |-  ( .s
`  W )  =  ( .s `  W
)
4 eqid 2467 . . 3  |-  ( 0g
`  W )  =  ( 0g `  W
)
5 eqid 2467 . . 3  |-  (Scalar `  W )  =  (Scalar `  W )
6 eqid 2467 . . 3  |-  ( Base `  (Scalar `  W )
)  =  ( Base `  (Scalar `  W )
)
7 eqid 2467 . . 3  |-  ( +g  `  (Scalar `  W )
)  =  ( +g  `  (Scalar `  W )
)
8 eqid 2467 . . 3  |-  ( .r
`  (Scalar `  W )
)  =  ( .r
`  (Scalar `  W )
)
9 eqid 2467 . . 3  |-  ( 1r
`  (Scalar `  W )
)  =  ( 1r
`  (Scalar `  W )
)
10 eqid 2467 . . 3  |-  ( 0g
`  (Scalar `  W )
)  =  ( 0g
`  (Scalar `  W )
)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10isslmd 27435 . 2  |-  ( W  e. SLMod 
<->  ( W  e. CMnd  /\  (Scalar `  W )  e. SRing  /\  A. w  e.  (
Base `  (Scalar `  W
) ) A. z  e.  ( Base `  (Scalar `  W ) ) A. x  e.  ( Base `  W ) A. y  e.  ( Base `  W
) ( ( ( z ( .s `  W ) y )  e.  ( Base `  W
)  /\  ( z
( .s `  W
) ( y ( +g  `  W ) x ) )  =  ( ( z ( .s `  W ) y ) ( +g  `  W ) ( z ( .s `  W
) x ) )  /\  ( ( w ( +g  `  (Scalar `  W ) ) z ) ( .s `  W ) y )  =  ( ( w ( .s `  W
) y ) ( +g  `  W ) ( z ( .s
`  W ) y ) ) )  /\  ( ( ( w ( .r `  (Scalar `  W ) ) z ) ( .s `  W ) y )  =  ( w ( .s `  W ) ( z ( .s
`  W ) y ) )  /\  (
( 1r `  (Scalar `  W ) ) ( .s `  W ) y )  =  y  /\  ( ( 0g
`  (Scalar `  W )
) ( .s `  W ) y )  =  ( 0g `  W ) ) ) ) )
1211simp1bi 1011 1  |-  ( W  e. SLMod  ->  W  e. CMnd )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767   A.wral 2814   ` cfv 5588  (class class class)co 6284   Basecbs 14490   +g cplusg 14555   .rcmulr 14556  Scalarcsca 14558   .scvsca 14559   0gc0g 14695  CMndccmn 16604   1rcur 16955  SRingcsrg 16959  SLModcslmd 27433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-nul 4576
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-iota 5551  df-fv 5596  df-ov 6287  df-slmd 27434
This theorem is referenced by:  slmdmnd  27439  gsumvsca1  27464  gsumvsca2  27465
  Copyright terms: Public domain W3C validator