![]() |
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 31039 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 2740 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
3 | lmodvsass.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | lmodvsass.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | lmodvsass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
6 | eqid 2740 | . . . . . . 7 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
7 | lmodvsass.t | . . . . . . 7 ⊢ × = (.r‘𝐹) | |
8 | eqid 2740 | . . . . . . 7 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 20885 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
10 | 9 | simprld 771 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
11 | 10 | 3expa 1118 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
12 | 11 | anabsan2 673 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
13 | 12 | exp42 435 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
14 | 13 | 3imp2 1349 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 +gcplusg 17311 .rcmulr 17312 Scalarcsca 17314 ·𝑠 cvsca 17315 1rcur 20208 LModclmod 20880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-nul 5324 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 df-ov 7451 df-lmod 20882 |
This theorem is referenced by: lmodvs0 20916 lmodvsneg 20926 lmodsubvs 20938 lmodsubdi 20939 lmodsubdir 20940 islss3 20980 lss1d 20984 prdslmodd 20990 lmodvsinv 21058 lmhmvsca 21067 lvecvs0or 21133 lssvs0or 21135 lvecinv 21138 lspsnvs 21139 lspfixed 21153 lspsolvlem 21167 lspsolv 21168 frlmup1 21841 assa2ass 21906 assa2ass2 21907 ascldimul 21931 assamulgscmlem2 21943 mplmon2mul 22116 smatvscl 22551 matinv 22704 clmvsass 25141 cvsi 25182 imaslmod 33346 lshpkrlem4 39069 lcdvsass 41564 baerlem3lem1 41664 hgmapmul 41852 prjspertr 42560 prjspner1 42581 mendlmod 43150 lincscm 48159 ldepsprlem 48201 lincresunit3lem3 48203 lincresunit3lem1 48208 |
Copyright terms: Public domain | W3C validator |