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 29369 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 2738 | . . . . . . . 8 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
3 | slmdvsass.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | eqid 2738 | . . . . . . . 8 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
5 | slmdvsass.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
6 | slmdvsass.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
7 | eqid 2738 | . . . . . . . 8 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
8 | slmdvsass.t | . . . . . . . 8 ⊢ × = (.r‘𝐹) | |
9 | eqid 2738 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
10 | eqid 2738 | . . . . . . . 8 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | slmdlema 31456 | . . . . . . 7 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊)))) |
12 | 11 | simprd 496 | . . . . . 6 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ ((0g‘𝐹) · 𝑋) = (0g‘𝑊))) |
13 | 12 | simp1d 1141 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
14 | 13 | 3expa 1117 | . . . 4 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
15 | 14 | anabsan2 671 | . . 3 ⊢ (((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
16 | 15 | exp42 436 | . 2 ⊢ (𝑊 ∈ SLMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
17 | 16 | 3imp2 1348 | 1 ⊢ ((𝑊 ∈ SLMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 .rcmulr 16963 Scalarcsca 16965 ·𝑠 cvsca 16966 0gc0g 17150 1rcur 19737 SLModcslmd 31453 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-nul 5230 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 df-ov 7278 df-slmd 31454 |
This theorem is referenced by: slmdvs0 31478 |
Copyright terms: Public domain | W3C validator |