Theorem slmdvsdir 33247

Description: Distributive law for scalar product. (ax-hvdistr1 31032 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.)

Hypotheses

Ref	Expression
slmdvsdir.v	⊢ 𝑉 = (Base‘𝑊)
slmdvsdir.a	⊢ + = (+g‘𝑊)
slmdvsdir.f	⊢ 𝐹 = (Scalar‘𝑊)
slmdvsdir.s	⊢ · = ( ·𝑠 ‘𝑊)
slmdvsdir.k	⊢ 𝐾 = (Base‘𝐹)
slmdvsdir.p	⊢ ⨣ = (+g‘𝐹)

Assertion

Ref	Expression
slmdvsdir	⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))

Proof of Theorem slmdvsdir

Step	Hyp	Ref	Expression
1		slmdvsdir.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
2		slmdvsdir.a	. . . . . . . 8 ⊢ + = (+g‘𝑊)
3		slmdvsdir.s	. . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊)
4		eqid 2734	. . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊)
5		slmdvsdir.f	. . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊)
6		slmdvsdir.k	. . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹)
7		slmdvsdir.p	. . . . . . . 8 ⊢ ⨣ = (+g‘𝐹)
8		eqid 2734	. . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹)
9		eqid 2734	. . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹)
10		eqid 2734	. . . . . . . 8 ⊢ (0g‘𝐹) = (0g‘𝐹)
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	slmdlema 33234	. . . . . . 7 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑄(.r‘𝐹)𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))))
12	11	simpld 494	. . . . . 6 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))))
13	12	simp3d 1144	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))
14	13	3expa 1118	. . . 4 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))
15	14	anabsan2 674	. . 3 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))
16	15	exp42 435	. 2 ⊢ (𝑊 ∈ SLMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))))))
17	16	3imp2 1350	1 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ‘cfv 6490  (class class class)co 7356  Basecbs 17134  +_gcplusg 17175  ._rcmulr 17176  Scalarcsca 17178   ·_𝑠 cvsca 17179  0_gc0g 17357  1_rcur 20114  SLModcslmd 33231

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-nul 5249

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-iota 6446  df-fv 6498  df-ov 7359  df-slmd 33232

This theorem is referenced by:  gsumvsca2  33258