| 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 2736 | . . . . 5 ⊢ (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) | |
| 5 | 1, 2, 3, 4 | phllmhm 21612 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐶 ∈ 𝑉) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 6 | 5 | 3ad2antr3 1192 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹))) |
| 7 | simpr1 1196 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝐾) | |
| 8 | simpr2 1197 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 9 | ipdir.f | . . . 4 ⊢ 𝐾 = (Base‘𝐹) | |
| 10 | ipass.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 11 | ipass.p | . . . . 5 ⊢ × = (.r‘𝐹) | |
| 12 | rlmvsca 21195 | . . . . 5 ⊢ (.r‘𝐹) = ( ·𝑠 ‘(ringLMod‘𝐹)) | |
| 13 | 11, 12 | eqtri 2759 | . . . 4 ⊢ × = ( ·𝑠 ‘(ringLMod‘𝐹)) |
| 14 | 1, 9, 3, 10, 13 | lmhmlin 21030 | . . 3 ⊢ (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 15 | 6, 7, 8, 14 | syl3anc 1374 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵))) |
| 16 | phllmod 21610 | . . . . 5 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 17 | 16 | adantr 480 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ LMod) |
| 18 | 3, 1, 10, 9 | lmodvscl 20873 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉) → (𝐴 · 𝐵) ∈ 𝑉) |
| 19 | 17, 7, 8, 18 | syl3anc 1374 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 · 𝐵) ∈ 𝑉) |
| 20 | oveq1 7374 | . . . 4 ⊢ (𝑥 = (𝐴 · 𝐵) → (𝑥 , 𝐶) = ((𝐴 · 𝐵) , 𝐶)) | |
| 21 | ovex 7400 | . . . 4 ⊢ (𝑥 , 𝐶) ∈ V | |
| 22 | 20, 4, 21 | fvmpt3i 6953 | . . 3 ⊢ ((𝐴 · 𝐵) ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 23 | 19, 22 | syl 17 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 · 𝐵)) = ((𝐴 · 𝐵) , 𝐶)) |
| 24 | oveq1 7374 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 , 𝐶) = (𝐵 , 𝐶)) | |
| 25 | 24, 4, 21 | fvmpt3i 6953 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 26 | 8, 25 | syl 17 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶)) |
| 27 | 26 | oveq2d 7383 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 × ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)) = (𝐴 × (𝐵 , 𝐶))) |
| 28 | 15, 23, 27 | 3eqtr3d 2779 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐵) , 𝐶) = (𝐴 × (𝐵 , 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5166 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 .rcmulr 17221 Scalarcsca 17223 ·𝑠 cvsca 17224 ·𝑖cip 17225 LModclmod 20855 LMHom clmhm 21014 ringLModcrglmod 21167 PreHilcphl 21604 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-sets 17134 df-slot 17152 df-ndx 17164 df-sca 17236 df-vsca 17237 df-ip 17238 df-lmod 20857 df-lmhm 21017 df-lvec 21098 df-sra 21168 df-rgmod 21169 df-phl 21606 |
| This theorem is referenced by: ipassr 21626 phlssphl 21639 ocvlss 21652 cphass 25178 ipcau2 25201 tcphcphlem2 25203 |
| Copyright terms: Public domain | W3C validator |