| 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 2231 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 3 | lmodvsass.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | lmodvsass.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | lmodvsass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | eqid 2231 | . . . . . . 7 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 7 | lmodvsass.t | . . . . . . 7 ⊢ × = (.r‘𝐹) | |
| 8 | eqid 2231 | . . . . . . 7 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 14312 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simprld 532 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 11 | 10 | 3expa 1229 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 12 | 11 | anabsan2 586 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 13 | 12 | exp42 371 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
| 14 | 13 | 3imp2 1248 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 Basecbs 13087 +gcplusg 13165 .rcmulr 13166 Scalarcsca 13168 ·𝑠 cvsca 13169 1rcur 13978 LModclmod 14307 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-ov 6021 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-ndx 13090 df-slot 13091 df-base 13093 df-plusg 13178 df-mulr 13179 df-sca 13181 df-vsca 13182 df-lmod 14309 |
| This theorem is referenced by: lmodvs0 14342 lmodvsneg 14351 lmodsubvs 14363 lmodsubdi 14364 lmodsubdir 14365 islss3 14399 lss1d 14403 |
| Copyright terms: Public domain | W3C validator |