![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > lmodvsass | GIF version |
Description: Associative law for scalar product. (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 2189 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
3 | lmodvsass.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | lmodvsass.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | lmodvsass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
6 | eqid 2189 | . . . . . . 7 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
7 | lmodvsass.t | . . . . . . 7 ⊢ × = (.r‘𝐹) | |
8 | eqid 2189 | . . . . . . 7 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 13605 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
10 | 9 | simprld 530 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
11 | 10 | 3expa 1205 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
12 | 11 | anabsan2 584 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
13 | 12 | exp42 371 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
14 | 13 | 3imp2 1224 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 ‘cfv 5235 (class class class)co 5895 Basecbs 12511 +gcplusg 12586 .rcmulr 12587 Scalarcsca 12589 ·𝑠 cvsca 12590 1rcur 13310 LModclmod 13600 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-cnex 7931 ax-resscn 7932 ax-1re 7934 ax-addrcl 7937 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-rex 2474 df-rab 2477 df-v 2754 df-sbc 2978 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4311 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-iota 5196 df-fun 5237 df-fn 5238 df-fv 5243 df-ov 5898 df-inn 8949 df-2 9007 df-3 9008 df-4 9009 df-5 9010 df-6 9011 df-ndx 12514 df-slot 12515 df-base 12517 df-plusg 12599 df-mulr 12600 df-sca 12602 df-vsca 12603 df-lmod 13602 |
This theorem is referenced by: lmodvs0 13635 lmodvsneg 13644 lmodsubvs 13656 lmodsubdi 13657 lmodsubdir 13658 islss3 13692 lss1d 13696 |
Copyright terms: Public domain | W3C validator |