MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ipval Structured version   Visualization version   GIF version

Theorem ipval 30630
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.)
Hypotheses
Ref Expression
dipfval.1 𝑋 = (BaseSet‘𝑈)
dipfval.2 𝐺 = ( +𝑣𝑈)
dipfval.4 𝑆 = ( ·𝑠OLD𝑈)
dipfval.6 𝑁 = (normCV𝑈)
dipfval.7 𝑃 = (·𝑖OLD𝑈)
Assertion
Ref Expression
ipval ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
Distinct variable groups:   𝑘,𝐺   𝑘,𝑁   𝑆,𝑘   𝑈,𝑘   𝐴,𝑘   𝐵,𝑘   𝑘,𝑋
Allowed substitution hint:   𝑃(𝑘)

Proof of Theorem ipval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef 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𝑈)
61, 2, 3, 4, 5dipfval 30629 . . . 4 (𝑈 ∈ NrmCVec → 𝑃 = (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)))
76oveqd 7420 . . 3 (𝑈 ∈ NrmCVec → (𝐴𝑃𝐵) = (𝐴(𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵))
8 fvoveq1 7426 . . . . . . . 8 (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))))
98oveq1d 7418 . . . . . . 7 (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))
109oveq2d 7419 . . . . . 6 (𝑥 = 𝐴 → ((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)))
1110sumeq2sdv 15717 . . . . 5 (𝑥 = 𝐴 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)))
1211oveq1d 7418 . . . 4 (𝑥 = 𝐴 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))
13 oveq2 7411 . . . . . . . . . 10 (𝑦 = 𝐵 → ((i↑𝑘)𝑆𝑦) = ((i↑𝑘)𝑆𝐵))
1413oveq2d 7419 . . . . . . . . 9 (𝑦 = 𝐵 → (𝐴𝐺((i↑𝑘)𝑆𝑦)) = (𝐴𝐺((i↑𝑘)𝑆𝐵)))
1514fveq2d 6879 . . . . . . . 8 (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵))))
1615oveq1d 7418 . . . . . . 7 (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))
1716oveq2d 7419 . . . . . 6 (𝑦 = 𝐵 → ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)))
1817sumeq2sdv 15717 . . . . 5 (𝑦 = 𝐵 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)))
1918oveq1d 7418 . . . 4 (𝑦 = 𝐵 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
20 eqid 2735 . . . 4 (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) = (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))
21 ovex 7436 . . . 4 𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4) ∈ V
2212, 19, 20, 21ovmpo 7565 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴(𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
237, 22sylan9eq 2790 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
24233impb 1114 1 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2108  cfv 6530  (class class class)co 7403  cmpo 7405  1c1 11128  ici 11129   · cmul 11132   / cdiv 11892  2c2 12293  4c4 12295  ...cfz 13522  cexp 14077  Σcsu 15700  NrmCVeccnv 30511   +𝑣 cpv 30512  BaseSetcba 30513   ·𝑠OLD cns 30514  normCVcnmcv 30517  ·𝑖OLDcdip 30627
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7727
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-iota 6483  df-fun 6532  df-fn 6533  df-f 6534  df-f1 6535  df-fo 6536  df-f1o 6537  df-fv 6538  df-ov 7406  df-oprab 7407  df-mpo 7408  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8383  df-rdg 8422  df-seq 14018  df-sum 15701  df-dip 30628
This theorem is referenced by:  ipval2  30634  dipcl  30639  ipf  30640
  Copyright terms: Public domain W3C validator