| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lmodvsass | Structured version Visualization version GIF version | ||
| Description: Associative law for scalar product. (ax-hvmulass 31299 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) |
| Ref | Expression |
|---|---|
| lmodvsass.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodvsass.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsass.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsass.k | ⊢ 𝐾 = (Base‘𝐹) |
| lmodvsass.t | ⊢ × = (.r‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvsass | ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodvsass.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | eqid 2769 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 3 | lmodvsass.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | lmodvsass.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | lmodvsass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | eqid 2769 | . . . . . . 7 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 7 | lmodvsass.t | . . . . . . 7 ⊢ × = (.r‘𝐹) | |
| 8 | eqid 2769 | . . . . . . 7 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 20963 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simprld 783 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 11 | 10 | 3expa 1134 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 12 | 11 | anabsan2 686 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 13 | 12 | exp42 440 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
| 14 | 13 | 3imp2 1366 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 +gcplusg 17309 .rcmulr 17310 Scalarcsca 17312 ·𝑠 cvsca 17313 1rcur 20262 LModclmod 20958 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-nul 5271 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-ov 7414 df-lmod 20960 |
| This theorem is referenced by: lmodvs0 20994 lmodvsneg 21004 lmodsubvs 21016 lmodsubdi 21017 lmodsubdir 21018 islss3 21057 lss1d 21061 prdslmodd 21067 lmodvsinv 21134 lmhmvsca 21143 lvecvs0or 21209 lssvs0or 21211 lvecinv 21214 lspsnvs 21215 lspfixed 21229 lspsolvlem 21243 lspsolv 21244 frlmup1 21916 assa2ass 21981 assa2ass2 21982 ascldimul 22006 assamulgscmlem2 22018 mplmon2mul 22188 smatvscl 22649 matinv 22802 clmvsass 25216 cvsi 25257 imaslmod 33615 vietalem 33913 lshpkrlem4 39776 lcdvsass 42270 baerlem3lem1 42370 hgmapmul 42558 prjspertr 43228 prjspner1 43249 mendlmod 43807 lincscm 49094 ldepsprlem 49136 lincresunit3lem3 49138 lincresunit3lem1 49143 |
| Copyright terms: Public domain | W3C validator |