| 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 31191 | . . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑃 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))) |
| 7 | 6 | oveqd 7434 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (𝐴𝑃𝐵) = (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵)) |
| 8 | fvoveq1 7440 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))) | |
| 9 | 8 | oveq1d 7432 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) |
| 10 | 9 | oveq2d 7433 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 11 | 10 | sumeq2sdv 15794 | . . . . 5 ⊢ (𝑥 = 𝐴 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))) |
| 12 | 11 | oveq1d 7432 | . . . 4 ⊢ (𝑥 = 𝐴 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) |
| 13 | oveq2 7425 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → ((i↑𝑘)𝑆𝑦) = ((i↑𝑘)𝑆𝐵)) | |
| 14 | 13 | oveq2d 7433 | . . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝐴𝐺((i↑𝑘)𝑆𝑦)) = (𝐴𝐺((i↑𝑘)𝑆𝐵))) |
| 15 | 14 | fveq2d 6886 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))) |
| 16 | 15 | oveq1d 7432 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) |
| 17 | 16 | oveq2d 7433 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 18 | 17 | sumeq2sdv 15794 | . . . . 5 ⊢ (𝑦 = 𝐵 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))) |
| 19 | 18 | oveq1d 7432 | . . . 4 ⊢ (𝑦 = 𝐵 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 20 | eqid 2762 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) | |
| 21 | ovex 7450 | . . . 4 ⊢ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4) ∈ V | |
| 22 | 12, 19, 20, 21 | ovmpo 7577 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4)) |
| 23 | 7, 22 | sylan9eq 2817 | . 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 6537 (class class class)co 7417 ∈ cmpo 7419 1c1 11129 ici 11130 · cmul 11133 / cdiv 11899 2c2 12323 4c4 12325 ...cfz 13565 ↑cexp 14129 Σcsu 15777 NrmCVeccnv 31073 +𝑣 cpv 31074 BaseSetcba 31075 ·𝑠OLD cns 31076 normCVcnmcv 31079 ·𝑖OLDcdip 31189 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 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-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-seq 14070 df-sum 15778 df-dip 31190 |
| This theorem is used by: ipval2 31196 dipcl 31201 ipf 31202 |
| Copyright terms: Public domain | W3C validator |