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 33632
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 2762 . . 3 (Base‘𝑊) = (Base‘𝑊)
2 eqid 2762 . . 3 (+g𝑊) = (+g𝑊)
3 eqid 2762 . . 3 ( ·𝑠𝑊) = ( ·𝑠𝑊)
4 eqid 2762 . . 3 (0g𝑊) = (0g𝑊)
5 eqid 2762 . . 3 (Scalar‘𝑊) = (Scalar‘𝑊)
6 eqid 2762 . . 3 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
7 eqid 2762 . . 3 (+g‘(Scalar‘𝑊)) = (+g‘(Scalar‘𝑊))
8 eqid 2762 . . 3 (.r‘(Scalar‘𝑊)) = (.r‘(Scalar‘𝑊))
9 eqid 2762 . . 3 (1r‘(Scalar‘𝑊)) = (1r‘(Scalar‘𝑊))
10 eqid 2762 . . 3 (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
111, 2, 3, 4, 5, 6, 7, 8, 9, 10isslmd 33629 . 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 1163 1 (𝑊 ∈ SLMod → 𝑊 ∈ CMnd)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078  cfv 6537  (class class class)co 7416  Basecbs 17305  +gcplusg 17346  .rcmulr 17347  Scalarcsca 17349   ·𝑠 cvsca 17350  0gc0g 17528  CMndccmn 19908  1rcur 20321  SRingcsrg 20326  SLModcslmd 33627
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-nul 5267
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-iota 6493  df-fv 6545  df-ov 7419  df-slmd 33628
This theorem is used by:  slmdmnd  33633  gsumvsca1  33653  gsumvsca2  33654
  Copyright terms: Public domain W3C validator