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

Theorem slmdvsass 33825
Description: Associative law for scalar product. (ax-hvmulass 31615 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
slmdvsass.v 𝑉 = (Base‘𝑊)
slmdvsass.f 𝐹 = (Scalar‘𝑊)
slmdvsass.s · = ( ·𝑠 ‘𝑊)
slmdvsass.k 𝐾 = (Base‘𝐹)
slmdvsass.t × = (.r‘𝐹)
Assertion
Ref Expression
slmdvsass ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))

Proof of Theorem slmdvsass
StepHypRef Expression
1 slmdvsass.v . . . . . . . 8 𝑉 = (Base‘𝑊)
2 eqid 2760 . . . . . . . 8 (+g‘𝑊) = (+g‘𝑊)
3 slmdvsass.s . . . . . . . 8 · = ( ·𝑠 ‘𝑊)
4 eqid 2760 . . . . . . . 8 (0g‘𝑊) = (0g‘𝑊)
5 slmdvsass.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
6 slmdvsass.k . . . . . . . 8 𝐾 = (Base‘𝐹)
7 eqid 2760 . . . . . . . 8 (+g‘𝐹) = (+g‘𝐹)
8 slmdvsass.t . . . . . . . 8 × = (.r‘𝐹)
9 eqid 2760 . . . . . . . 8 (1r‘𝐹) = (1r‘𝐹)
10 eqid 2760 . . . . . . . 8 (0g‘𝐹) = (0g‘𝐹)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10slmdlema 33811 . . . . . . 7 ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))))
1211simprd 501 . . . . . 6 ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊)))
1312simp1d 1160 . . . . 5 ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))
14133expa 1136 . . . 4 (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))
1514anabsan2 687 . . 3 (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))
1615exp42 441 . 2 (𝑊 ∈ SLMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))))))
17163imp2 1368 1 ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  +gcplusg 17434  .rcmulr 17435  Scalarcsca 17437   ·𝑠 cvsca 17438  0gc0g 17616  1rcur 20413  SLModcslmd 33808
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-ov 7424  df-slmd 33809
This theorem is used by:  slmdvs0  33833
  Copyright terms: Public domain W3C validator