| 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 31286 | . . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑃 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))) |
| 7 | 6 | oveqd 7429 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (𝐴𝑃𝐵) = (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵)) |
| 8 | fvoveq1 7435 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))) | |
| 9 | 8 | oveq1d 7427 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) |
| 10 | 9 | oveq2d 7428 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 11 | 10 | sumeq2sdv 15850 | . . . . 5 ⊢ (𝑥 = 𝐴 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 12 | 11 | oveq1d 7427 | . . . 4 ⊢ (𝑥 = 𝐴 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) |
| 13 | oveq2 7420 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → ((i↑𝑘)𝑆𝑦) = ((i↑𝑘)𝑆𝐵)) | |
| 14 | 13 | oveq2d 7428 | . . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝐴𝐺((i↑𝑘)𝑆𝑦)) = (𝐴𝐺((i↑𝑘)𝑆𝐵))) |
| 15 | 14 | fveq2d 6881 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))) |
| 16 | 15 | oveq1d 7427 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) |
| 17 | 16 | oveq2d 7428 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 18 | 17 | sumeq2sdv 15850 | . . . . 5 ⊢ (𝑦 = 𝐵 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 19 | 18 | oveq1d 7427 | . . . 4 ⊢ (𝑦 = 𝐵 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 20 | eqid 2761 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) | |
| 21 | ovex 7445 | . . . 4 ⊢ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4) ∈ V | |
| 22 | 12, 19, 20, 21 | ovmpo 7572 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 23 | 7, 22 | sylan9eq 2816 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 24 | 23 | 3impb 1132 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6531 (class class class)co 7412 ∈ cmpo 7414 1c1 11182 ici 11183 · cmul 11186 / cdiv 11954 2c2 12378 4c4 12380 ...cfz 13620 ↑cexp 14184 Σcsu 15833 NrmCVeccnv 31168 +𝑣 cpv 31169 BaseSetcba 31170 ·𝑠OLD cns 31171 normCVcnmcv 31174 ·𝑖OLDcdip 31284 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-seq 14125 df-sum 15834 df-dip 31285 |
| This theorem is used by: ipval2 31291 dipcl 31296 ipf 31297 |
| Copyright terms: Public domain | W3C validator |