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

Theorem slmdvscl 31467
Description: Closure of scalar product for a semiring left module. (hvmulcl 29375 analog.) (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
slmdvscl.v 𝑉 = (Base‘𝑊)
slmdvscl.f 𝐹 = (Scalar‘𝑊)
slmdvscl.s · = ( ·𝑠𝑊)
slmdvscl.k 𝐾 = (Base‘𝐹)
Assertion
Ref Expression
slmdvscl ((𝑊 ∈ SLMod ∧ 𝑅𝐾𝑋𝑉) → (𝑅 · 𝑋) ∈ 𝑉)

Proof of Theorem slmdvscl
StepHypRef Expression
1 biid 260 . 2 (𝑊 ∈ SLMod ↔ 𝑊 ∈ SLMod)
2 pm4.24 564 . 2 (𝑅𝐾 ↔ (𝑅𝐾𝑅𝐾))
3 pm4.24 564 . 2 (𝑋𝑉 ↔ (𝑋𝑉𝑋𝑉))
4 slmdvscl.v . . . . 5 𝑉 = (Base‘𝑊)
5 eqid 2738 . . . . 5 (+g𝑊) = (+g𝑊)
6 slmdvscl.s . . . . 5 · = ( ·𝑠𝑊)
7 eqid 2738 . . . . 5 (0g𝑊) = (0g𝑊)
8 slmdvscl.f . . . . 5 𝐹 = (Scalar‘𝑊)
9 slmdvscl.k . . . . 5 𝐾 = (Base‘𝐹)
10 eqid 2738 . . . . 5 (+g𝐹) = (+g𝐹)
11 eqid 2738 . . . . 5 (.r𝐹) = (.r𝐹)
12 eqid 2738 . . . . 5 (1r𝐹) = (1r𝐹)
13 eqid 2738 . . . . 5 (0g𝐹) = (0g𝐹)
144, 5, 6, 7, 8, 9, 10, 11, 12, 13slmdlema 31456 . . . 4 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g𝑊)𝑋)) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋))) ∧ (((𝑅(.r𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r𝐹) · 𝑋) = 𝑋 ∧ ((0g𝐹) · 𝑋) = (0g𝑊))))
1514simpld 495 . . 3 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g𝑊)𝑋)) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋))))
1615simp1d 1141 . 2 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → (𝑅 · 𝑋) ∈ 𝑉)
171, 2, 3, 16syl3anb 1160 1 ((𝑊 ∈ SLMod ∧ 𝑅𝐾𝑋𝑉) → (𝑅 · 𝑋) ∈ 𝑉)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1539  wcel 2106  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  .rcmulr 16963  Scalarcsca 16965   ·𝑠 cvsca 16966  0gc0g 17150  1rcur 19737  SLModcslmd 31453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-nul 5230
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-iota 6391  df-fv 6441  df-ov 7278  df-slmd 31454
This theorem is referenced by:  gsumvsca1  31479  gsumvsca2  31480  sitgaddlemb  32315
  Copyright terms: Public domain W3C validator