Theorem slmdvsdi 30893

Description: Distributive law for scalar product. (ax-hvdistr1 28791 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

Step	Hyp	Ref	Expression
1		slmdvsdi.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑊)
2		slmdvsdi.a	. . . . . . . . 9 ⊢ + = (+g‘𝑊)
3		slmdvsdi.s	. . . . . . . . 9 ⊢ · = ( ·𝑠 ‘𝑊)
4		eqid 2798	. . . . . . . . 9 ⊢ (0g‘𝑊) = (0g‘𝑊)
5		slmdvsdi.f	. . . . . . . . 9 ⊢ 𝐹 = (Scalar‘𝑊)
6		slmdvsdi.k	. . . . . . . . 9 ⊢ 𝐾 = (Base‘𝐹)
7		eqid 2798	. . . . . . . . 9 ⊢ (+g‘𝐹) = (+g‘𝐹)
8		eqid 2798	. . . . . . . . 9 ⊢ (.r‘𝐹) = (.r‘𝐹)
9		eqid 2798	. . . . . . . . 9 ⊢ (1r‘𝐹) = (1r‘𝐹)
10		eqid 2798	. . . . . . . . 9 ⊢ (0g‘𝐹) = (0g‘𝐹)
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	slmdlema 30881	. . . . . . . 8 ⊢ ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑅(.r‘𝐹)𝑅) · 𝑋) = (𝑅 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))))
12	11	simpld 498	. . . . . . 7 ⊢ ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)) ∧ ((𝑅(+g‘𝐹)𝑅) · 𝑋) = ((𝑅 · 𝑋) + (𝑅 · 𝑋))))
13	12	simp2d 1140	. . . . . 6 ⊢ ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))
14	13	3expia 1118	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))
15	14	anabsan2 673	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑅 ∈ 𝐾) → ((𝑌 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))
16	15	exp4b 434	. . 3 ⊢ (𝑊 ∈ SLMod → (𝑅 ∈ 𝐾 → (𝑌 ∈ 𝑉 → (𝑋 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))))
17	16	com34 91	. 2 ⊢ (𝑊 ∈ SLMod → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → (𝑌 ∈ 𝑉 → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌))))))
18	17	3imp2 1346	1 ⊢ ((𝑊 ∈ SLMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝑅 · (𝑋 + 𝑌)) = ((𝑅 · 𝑋) + (𝑅 · 𝑌)))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ‘cfv 6324  (class class class)co 7135  Basecbs 16475  +_gcplusg 16557  ._rcmulr 16558  Scalarcsca 16560   ·_𝑠 cvsca 16561  0_gc0g 16705  1_rcur 19244  SLModcslmd 30878

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-nul 5174

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-iota 6283  df-fv 6332  df-ov 7138  df-slmd 30879

This theorem is referenced by:  gsumvsca1  30904