| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > slmdvsass | Structured version Visualization version GIF version | ||
| Description: Associative law for scalar product. (ax-hvmulass 31340 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
| Ref | Expression |
|---|---|
| slmdvsass.v | ⊢ 𝑉 = (Base‘𝑊) |
| slmdvsass.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| slmdvsass.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| slmdvsass.k | ⊢ 𝐾 = (Base‘𝐹) |
| slmdvsass.t | ⊢ × = (.r‘𝐹) |
| Ref | Expression |
|---|---|
| slmdvsass | ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | slmdvsass.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | eqid 2763 | . . . . . . . 8 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 3 | slmdvsass.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | eqid 2763 | . . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 5 | slmdvsass.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 6 | slmdvsass.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
| 7 | eqid 2763 | . . . . . . . 8 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 8 | slmdvsass.t | . . . . . . . 8 ⊢ × = (.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 33504 | . . . . . . 7 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊)))) |
| 12 | 11 | simprd 500 | . . . . . 6 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))) |
| 13 | 12 | simp1d 1160 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 14 | 13 | 3expa 1136 | . . . 4 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 15 | 14 | anabsan2 686 | . . 3 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 16 | 15 | exp42 440 | . 2 ⊢ (𝑊 ∈ SLMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
| 17 | 16 | 3imp2 1368 | 1 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 +gcplusg 17311 .rcmulr 17312 Scalarcsca 17314 ·𝑠 cvsca 17315 0gc0g 17493 1rcur 20264 SLModcslmd 33501 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-nul 5270 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-iota 6494 df-fv 6546 df-ov 7415 df-slmd 33502 |
| This theorem is referenced by: slmdvs0 33526 |
| Copyright terms: Public domain | W3C validator |