| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > slmdvsdir | Structured version Visualization version GIF version | ||
| Description: Distributive law for scalar product. (ax-hvdistr1 30978 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
| Ref | Expression |
|---|---|
| slmdvsdir.v | ⊢ 𝑉 = (Base‘𝑊) |
| slmdvsdir.a | ⊢ + = (+g‘𝑊) |
| slmdvsdir.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| slmdvsdir.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| slmdvsdir.k | ⊢ 𝐾 = (Base‘𝐹) |
| slmdvsdir.p | ⊢ ⨣ = (+g‘𝐹) |
| Ref | Expression |
|---|---|
| slmdvsdir | ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | slmdvsdir.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | slmdvsdir.a | . . . . . . . 8 ⊢ + = (+g‘𝑊) | |
| 3 | slmdvsdir.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | eqid 2730 | . . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 5 | slmdvsdir.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 6 | slmdvsdir.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
| 7 | slmdvsdir.p | . . . . . . . 8 ⊢ ⨣ = (+g‘𝐹) | |
| 8 | eqid 2730 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 9 | eqid 2730 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | eqid 2730 | . . . . . . . 8 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | slmdlema 33162 | . . . . . . 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 ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 ‘cfv 6477 (class class class)co 7341 Basecbs 17112 +gcplusg 17153 .rcmulr 17154 Scalarcsca 17156 ·𝑠 cvsca 17157 0gc0g 17335 1rcur 20092 SLModcslmd 33159 |
| 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 2112 ax-9 2120 ax-ext 2702 ax-nul 5242 |
| 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 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rab 3394 df-v 3436 df-sbc 3740 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4282 df-if 4474 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-br 5090 df-iota 6433 df-fv 6485 df-ov 7344 df-slmd 33160 |
| This theorem is referenced by: gsumvsca2 33186 |
| Copyright terms: Public domain | W3C validator |