| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipass | Structured version Visualization version GIF version | ||
| Description: Associative law for inner product. Equation I2 of [Ponnusamy] p. 363. (Contributed by NM, 25-Aug-2007.) (Revised by Mario Carneiro, 7-Oct-2015.) |
| Ref | Expression |
|---|---|
| phlsrng.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| phllmhm.h | ⊢ , = (·𝑖‘𝑊) |
| phllmhm.v | ⊢ 𝑉 = (Base‘𝑊) |
| ipdir.f | ⊢ 𝐾 = (Base‘𝐹) |
| ipass.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| ipass.p | ⊢ × = (.r‘𝐹) |
| Ref | Expression |
|---|---|
| ipass | ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐵) , 𝐶) = (𝐴 × (𝐵 , 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | phlsrng.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 2 | phllmhm.h | . . . . 5 ⊢ , = (·𝑖‘𝑊) | |
| 3 | phllmhm.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | eqid 2741 | . . . . 5 ⊢ (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) | |
| 5 | 1, 2, 3, 4 | phllmhm 21611 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐶 ∈ 𝑉) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 6 | 5 | 3ad2antr3 1198 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 7 | simpr1 1202 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝐾) | |
| 8 | simpr2 1203 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 9 | ipdir.f | . . . 4 ⊢ 𝐾 = (Base‘𝐹) | |
| 10 | ipass.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 11 | ipass.p | . . . . 5 ⊢ × = (.r‘𝐹) | |
| 12 | rlmvsca 21194 | . . . . 5 ⊢ (.r‘𝐹) = ( ·𝑠 ‘(ringLMod‘𝐹)) | |
| 13 | 11, 12 | eqtri 2764 | . . . 4 ⊢ × = ( ·𝑠 ‘(ringLMod‘𝐹)) |
| 14 | 1, 9, 3, 10, 13 | lmhmlin 21029 | . . 3 ⊢ (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 15 | 6, 7, 8, 14 | syl3anc 1380 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 16 | phllmod 21609 | . . . . 5 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 17 | 16 | adantr 482 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ LMod) |
| 18 | 3, 1, 10, 9 | lmodvscl 20872 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → (𝐴 · 𝐵) ∈ 𝑉) |
| 19 | 17, 7, 8, 18 | syl3anc 1380 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 · 𝐵) ∈ 𝑉) |
| 20 | oveq1 7367 | . . . 4 ⊢ (𝑥 = (𝐴 · 𝐵) → (𝑥 , 𝐶) = ((𝐴 · 𝐵) , 𝐶)) | |
| 21 | ovex 7393 | . . . 4 ⊢ (𝑥 , 𝐶) ∈ V | |
| 22 | 20, 4, 21 | fvmpt3i 6945 | . . 3 ⊢ ((𝐴 · 𝐵) ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 23 | 19, 22 | syl 17 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 24 | oveq1 7367 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 , 𝐶) = (𝐵 , 𝐶)) | |
| 25 | 24, 4, 21 | fvmpt3i 6945 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 26 | 8, 25 | syl 17 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 27 | 26 | oveq2d 7376 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)) = (𝐴 × (𝐵 , 𝐶))) |
| 28 | 15, 23, 27 | 3eqtr3d 2784 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐵) , 𝐶) = (𝐴 × (𝐵 , 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ↦ cmpt 5156 ‘cfv 6489 (class class class)co 7360 Basecbs 17174 .rcmulr 17216 Scalarcsca 17218 ·𝑠 cvsca 17219 ·𝑖cip 17220 LModclmod 20854 LMHom clmhm 21013 ringLModcrglmod 21166 PreHilcphl 21603 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-sets 17129 df-slot 17147 df-ndx 17159 df-sca 17231 df-vsca 17232 df-ip 17233 df-lmod 20856 df-lmhm 21016 df-lvec 21097 df-sra 21167 df-rgmod 21168 df-phl 21605 |
| This theorem is referenced by: ipassr 21625 phlssphl 21638 ocvlss 21651 cphass 25200 ipcau2 25223 tcphcphlem2 25225 |
| Copyright terms: Public domain | W3C validator |