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 27248 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 | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
2 | eqid 2610 | . . . . . . . 8 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
3 | lmodvsass.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | lmodvsass.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | lmodvsass.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
6 | eqid 2610 | . . . . . . . 8 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
7 | lmodvsass.t | . . . . . . . 8 ⊢ × = (.r‘𝐹) | |
8 | eqid 2610 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 18691 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
10 | 9 | simprd 478 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋)) |
11 | 10 | simpld 474 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
12 | 11 | 3expa 1257 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
13 | 12 | anabsan2 859 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
14 | 13 | exp42 637 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
15 | 14 | 3imp2 1274 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 +gcplusg 15768 .rcmulr 15769 Scalarcsca 15771 ·𝑠 cvsca 15772 1rcur 18324 LModclmod 18686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-nul 4717 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-iota 5768 df-fv 5812 df-ov 6552 df-lmod 18688 |
This theorem is referenced by: lmodvs0 18720 lmodvsneg 18730 lmodsubvs 18742 lmodsubdi 18743 lmodsubdir 18744 islss3 18780 lss1d 18784 prdslmodd 18790 lmodvsinv 18857 lmhmvsca 18866 lvecvs0or 18929 lssvs0or 18931 lvecinv 18934 lspsnvs 18935 lspfixed 18949 lspsolvlem 18963 lspsolv 18964 assa2ass 19143 asclrhm 19163 assamulgscmlem2 19170 mplmon2mul 19322 frlmup1 19956 smatvscl 20149 matinv 20302 clmvsass 22697 cvsi 22738 lshpkrlem4 33418 lcdvsass 35914 baerlem3lem1 36014 hgmapmul 36205 mendlmod 36782 lincscm 42013 ldepsprlem 42055 lincresunit3lem3 42057 lincresunit3lem1 42062 |
Copyright terms: Public domain | W3C validator |