| 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 2769 | . . . . 5 ⊢ (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) | |
| 5 | 1, 2, 3, 4 | phllmhm 21751 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐶 ∈ 𝑉) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 6 | 5 | 3ad2antr3 1207 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 7 | simpr1 1211 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝐾) | |
| 8 | simpr2 1212 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 9 | ipdir.f | . . . 4 ⊢ 𝐾 = (Base‘𝐹) | |
| 10 | ipass.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 11 | ipass.p | . . . . 5 ⊢ × = (.r‘𝐹) | |
| 12 | rlmvsca 21299 | . . . . 5 ⊢ (.r‘𝐹) = ( ·𝑠 ‘(ringLMod‘𝐹)) | |
| 13 | 11, 12 | eqtri 2792 | . . . 4 ⊢ × = ( ·𝑠 ‘(ringLMod‘𝐹)) |
| 14 | 1, 9, 3, 10, 13 | lmhmlin 21134 | . . 3 ⊢ (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 15 | 6, 7, 8, 14 | syl3anc 1396 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 16 | phllmod 21749 | . . . . 5 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 17 | 16 | adantr 485 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ LMod) |
| 18 | 3, 1, 10, 9 | lmodvscl 20977 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → (𝐴 · 𝐵) ∈ 𝑉) |
| 19 | 17, 7, 8, 18 | syl3anc 1396 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 · 𝐵) ∈ 𝑉) |
| 20 | oveq1 7418 | . . . 4 ⊢ (𝑥 = (𝐴 · 𝐵) → (𝑥 , 𝐶) = ((𝐴 · 𝐵) , 𝐶)) | |
| 21 | ovex 7444 | . . . 4 ⊢ (𝑥 , 𝐶) ∈ V | |
| 22 | 20, 4, 21 | fvmpt3i 6996 | . . 3 ⊢ ((𝐴 · 𝐵) ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 23 | 19, 22 | syl 18 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 24 | oveq1 7418 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 , 𝐶) = (𝐵 , 𝐶)) | |
| 25 | 24, 4, 21 | fvmpt3i 6996 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 26 | 8, 25 | syl 18 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 27 | 26 | oveq2d 7427 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)) = (𝐴 × (𝐵 , 𝐶))) |
| 28 | 15, 23, 27 | 3eqtr3d 2812 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐵) , 𝐶) = (𝐴 × (𝐵 , 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ↦ cmpt 5194 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 .rcmulr 17311 Scalarcsca 17313 ·𝑠 cvsca 17314 ·𝑖cip 17315 LModclmod 20959 LMHom clmhm 21118 ringLModcrglmod 21271 PreHilcphl 21743 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-sets 17224 df-slot 17242 df-ndx 17254 df-sca 17326 df-vsca 17327 df-ip 17328 df-lmod 20961 df-lmhm 21121 df-lvec 21202 df-sra 21272 df-rgmod 21273 df-phl 21745 |
| This theorem is referenced by: ipassr 21765 phlssphl 21778 ocvlss 21791 cphass 25339 ipcau2 25362 tcphcphlem2 25364 |
| Copyright terms: Public domain | W3C validator |