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 33396
Description: Closure of scalar product for a semiring left module. (hvmulcl 31218 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 263 . 2 (𝑊 ∈ SLMod ↔ 𝑊 ∈ SLMod)
2 pm4.24 571 . 2 (𝑅𝐾 ↔ (𝑅𝐾𝑅𝐾))
3 pm4.24 571 . 2 (𝑋𝑉 ↔ (𝑋𝑉𝑋𝑉))
4 slmdvscl.v . . . . 5 𝑉 = (Base‘𝑊)
5 eqid 2764 . . . . 5 (+g𝑊) = (+g𝑊)
6 slmdvscl.s . . . . 5 · = ( ·𝑠𝑊)
7 eqid 2764 . . . . 5 (0g𝑊) = (0g𝑊)
8 slmdvscl.f . . . . 5 𝐹 = (Scalar‘𝑊)
9 slmdvscl.k . . . . 5 𝐾 = (Base‘𝐹)
10 eqid 2764 . . . . 5 (+g𝐹) = (+g𝐹)
11 eqid 2764 . . . . 5 (.r𝐹) = (.r𝐹)
12 eqid 2764 . . . . 5 (1r𝐹) = (1r𝐹)
13 eqid 2764 . . . . 5 (0g𝐹) = (0g𝐹)
144, 5, 6, 7, 8, 9, 10, 11, 12, 13slmdlema 33385 . . . 4 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g𝑊)𝑋)) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋))) ∧ (((𝑅(.r𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r𝐹) · 𝑋) = 𝑋 ∧ ((0g𝐹) · 𝑋) = (0g𝑊))))
1514simpld 498 . . 3 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g𝑊)𝑋)) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋)) ∧ ((𝑅(+g𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋)(+g𝑊)(𝑅 · 𝑋))))
1615simp1d 1156 . 2 ((𝑊 ∈ SLMod ∧ (𝑅𝐾𝑅𝐾) ∧ (𝑋𝑉𝑋𝑉)) → (𝑅 · 𝑋) ∈ 𝑉)
171, 2, 3, 16syl3anb 1175 1 ((𝑊 ∈ SLMod ∧ 𝑅𝐾𝑋𝑉) → (𝑅 · 𝑋) ∈ 𝑉)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1099   = wceq 1562  wcel 2144  cfv 6523  (class class class)co 7398  Basecbs 17247  +gcplusg 17288  .rcmulr 17289  Scalarcsca 17291   ·𝑠 cvsca 17292  0gc0g 17470  1rcur 20233  SLModcslmd 33382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-nul 5258
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-iota 6479  df-fv 6531  df-ov 7401  df-slmd 33383
This theorem is referenced by:  gsumvsca1  33408  gsumvsca2  33409  sitgaddlemb  34647
  Copyright terms: Public domain W3C validator