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

Theorem slmdvsdi 33876
Description: Distributive law for scalar product. (ax-hvdistr1 31669 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
slmdvsdi.v 𝑉 = (Base‘𝑊)
slmdvsdi.a + = (+g‘𝑊)
slmdvsdi.f 𝐹 = (Scalar‘𝑊)
slmdvsdi.s · = ( ·𝑠 ‘𝑊)
slmdvsdi.k 𝐾 = (Base‘𝐹)
Assertion
Ref Expression
slmdvsdi ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))

Proof of Theorem slmdvsdi
StepHypRef Expression
1 slmdvsdi.v . . . . . . . . 9 𝑉 = (Base‘𝑊)
2 slmdvsdi.a . . . . . . . . 9 + = (+g‘𝑊)
3 slmdvsdi.s . . . . . . . . 9 · = ( ·𝑠 ‘𝑊)
4 eqid 2766 . . . . . . . . 9 (0g‘𝑊) = (0g‘𝑊)
5 slmdvsdi.f . . . . . . . . 9 𝐹 = (Scalar‘𝑊)
6 slmdvsdi.k . . . . . . . . 9 𝐾 = (Base‘𝐹)
7 eqid 2766 . . . . . . . . 9 (+g‘𝐹) = (+g‘𝐹)
8 eqid 2766 . . . . . . . . 9 (.r‘𝐹) = (.r‘𝐹)
9 eqid 2766 . . . . . . . . 9 (1r‘𝐹) = (1r‘𝐹)
10 eqid 2766 . . . . . . . . 9 (0g‘𝐹) = (0g‘𝐹)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10slmdlema 33864 . . . . . . . 8 ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑅(.r‘𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))))
1211simpld 500 . . . . . . 7 ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋))))
1312simp2d 1162 . . . . . 6 ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))
14133expia 1140 . . . . 5 ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))
1514anabsan2 687 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑅 ∈ 𝐾) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))
1615exp4b 436 . . 3 (𝑊 ∈ SLMod → (𝑅 ∈ 𝐾 → (𝑌 ∈ 𝑉 → (𝑋 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))))
1716com34 92 . 2 (𝑊 ∈ SLMod → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → (𝑌 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))))
18173imp2 1370 1 ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  +gcplusg 17474  .rcmulr 17475  Scalarcsca 17477   ·𝑠 cvsca 17478  0gc0g 17662  1rcur 20460  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:  gsumvsca1  33887
  Copyright terms: Public domain W3C validator