| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipval | Structured version Visualization version GIF version | ||
| Description: Value of the inner product. The definition is meaningful for normed complex vector spaces that are also inner product spaces, i.e. satisfy the parallelogram law, although for convenience we define it for any normed complex vector space. The vector (group) addition operation is 𝐺, the scalar product is 𝑆, the norm is 𝑁, and the set of vectors is 𝑋. Equation 6.45 of [Ponnusamy] p. 361. (Contributed by NM, 31-Jan-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dipfval.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| dipfval.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| dipfval.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| dipfval.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| dipfval.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| Ref | Expression |
|---|---|
| ipval | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dipfval.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | dipfval.2 | . . . . 5 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 3 | dipfval.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 4 | dipfval.6 | . . . . 5 ⊢ 𝑁 = (normCV‘𝑈) | |
| 5 | dipfval.7 | . . . . 5 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 6 | 1, 2, 3, 4, 5 | dipfval 30777 | . . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑃 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))) |
| 7 | 6 | oveqd 7375 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (𝐴𝑃𝐵) = (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵)) |
| 8 | fvoveq1 7381 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))) | |
| 9 | 8 | oveq1d 7373 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) |
| 10 | 9 | oveq2d 7374 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 11 | 10 | sumeq2sdv 15626 | . . . . 5 ⊢ (𝑥 = 𝐴 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 12 | 11 | oveq1d 7373 | . . . 4 ⊢ (𝑥 = 𝐴 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) |
| 13 | oveq2 7366 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → ((i↑𝑘)𝑆𝑦) = ((i↑𝑘)𝑆𝐵)) | |
| 14 | 13 | oveq2d 7374 | . . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝐴𝐺((i↑𝑘)𝑆𝑦)) = (𝐴𝐺((i↑𝑘)𝑆𝐵))) |
| 15 | 14 | fveq2d 6838 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))) |
| 16 | 15 | oveq1d 7373 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) |
| 17 | 16 | oveq2d 7374 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 18 | 17 | sumeq2sdv 15626 | . . . . 5 ⊢ (𝑦 = 𝐵 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 19 | 18 | oveq1d 7373 | . . . 4 ⊢ (𝑦 = 𝐵 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 20 | eqid 2736 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) | |
| 21 | ovex 7391 | . . . 4 ⊢ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4) ∈ V | |
| 22 | 12, 19, 20, 21 | ovmpo 7518 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 23 | 7, 22 | sylan9eq 2791 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 24 | 23 | 3impb 1114 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 1c1 11027 ici 11028 · cmul 11031 / cdiv 11794 2c2 12200 4c4 12202 ...cfz 13423 ↑cexp 13984 Σcsu 15609 NrmCVeccnv 30659 +𝑣 cpv 30660 BaseSetcba 30661 ·𝑠OLD cns 30662 normCVcnmcv 30665 ·𝑖OLDcdip 30775 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-seq 13925 df-sum 15610 df-dip 30776 |
| This theorem is referenced by: ipval2 30782 dipcl 30787 ipf 30788 |
| Copyright terms: Public domain | W3C validator |