| 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 2238 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 3 | lmodvsass.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | lmodvsass.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | lmodvsass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | eqid 2238 | . . . . . . 7 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 7 | lmodvsass.t | . . . . . . 7 ⊢ × = (.r‘𝐹) | |
| 8 | eqid 2238 | . . . . . . 7 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 14601 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋(+g‘𝑊)𝑋)) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋)) ∧ ((𝑄(+g‘𝐹)𝑅) · 𝑋) = ((𝑄 · 𝑋)(+g‘𝑊)(𝑅 · 𝑋))) ∧ (((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simprld 536 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 11 | 10 | 3expa 1234 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 12 | 11 | anabsan2 590 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| 13 | 12 | exp42 371 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)))))) |
| 14 | 13 | 3imp2 1253 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 × 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ‘cfv 5372 (class class class)co 6075 Basecbs 13330 +gcplusg 13408 .rcmulr 13409 Scalarcsca 13411 ·𝑠 cvsca 13412 1rcur 14237 LModclmod 14596 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-cnex 8260 ax-resscn 8261 ax-1re 8263 ax-addrcl 8266 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-iota 5332 df-fun 5374 df-fn 5375 df-fv 5380 df-ov 6078 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-5 9345 df-6 9346 df-ndx 13333 df-slot 13334 df-base 13336 df-plusg 13421 df-mulr 13422 df-sca 13424 df-vsca 13425 df-lmod 14598 |
| This theorem is referenced by: lmodvs0 14631 lmodvsneg 14640 lmodsubvs 14652 lmodsubdi 14653 lmodsubdir 14654 islss3 14688 lss1d 14692 |
| Copyright terms: Public domain | W3C validator |