| 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 31212 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 2763 | . . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 5 | slmdvsdir.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 6 | slmdvsdir.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
| 7 | slmdvsdir.p | . . . . . . . 8 ⊢ ⨣ = (+g‘𝐹) | |
| 8 | eqid 2763 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 9 | eqid 2763 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | eqid 2763 | . . . . . . . 8 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | slmdlema 33384 | . . . . . . 7 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑄(.r‘𝐹)𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊)))) |
| 12 | 11 | simpld 498 | . . . . . 6 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))) |
| 13 | 12 | simp3d 1158 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 14 | 13 | 3expa 1132 | . . . 4 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 15 | 14 | anabsan2 684 | . . 3 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 16 | 15 | exp42 439 | . 2 ⊢ (𝑊 ∈ SLMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))))) |
| 17 | 16 | 3imp2 1364 | 1 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ‘cfv 6522 (class class class)co 7397 Basecbs 17246 +gcplusg 17287 .rcmulr 17288 Scalarcsca 17290 ·𝑠 cvsca 17291 0gc0g 17469 1rcur 20232 SLModcslmd 33381 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 ax-nul 5257 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3078 df-rab 3416 df-v 3457 df-sbc 3746 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5102 df-iota 6478 df-fv 6530 df-ov 7400 df-slmd 33382 |
| This theorem is referenced by: gsumvsca2 33408 |
| Copyright terms: Public domain | W3C validator |