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

Theorem ipval 30789
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 30788 . . . 4 (𝑈 ∈ NrmCVec → 𝑃 = (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)))
76oveqd 7377 . . 3 (𝑈 ∈ NrmCVec → (𝐴𝑃𝐵) = (𝐴(𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵))
8 fvoveq1 7383 . . . . . . . 8 (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))))
98oveq1d 7375 . . . . . . 7 (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2))
109oveq2d 7376 . . . . . 6 (𝑥 = 𝐴 → ((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)))
1110sumeq2sdv 15656 . . . . 5 (𝑥 = 𝐴 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)))
1211oveq1d 7375 . . . 4 (𝑥 = 𝐴 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))
13 oveq2 7368 . . . . . . . . . 10 (𝑦 = 𝐵 → ((i↑𝑘)𝑆𝑦) = ((i↑𝑘)𝑆𝐵))
1413oveq2d 7376 . . . . . . . . 9 (𝑦 = 𝐵 → (𝐴𝐺((i↑𝑘)𝑆𝑦)) = (𝐴𝐺((i↑𝑘)𝑆𝐵)))
1514fveq2d 6838 . . . . . . . 8 (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦))) = (𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵))))
1615oveq1d 7375 . . . . . . 7 (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2) = ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2))
1716oveq2d 7376 . . . . . 6 (𝑦 = 𝐵 → ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = ((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)))
1817sumeq2sdv 15656 . . . . 5 (𝑦 = 𝐵 → Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) = Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)))
1918oveq1d 7375 . . . 4 (𝑦 = 𝐵 → (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
20 eqid 2737 . . . 4 (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4)) = (𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))
21 ovex 7393 . . . 4 𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4) ∈ V
2212, 19, 20, 21ovmpo 7520 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴(𝑥𝑋, 𝑦𝑋 ↦ (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝑥𝐺((i↑𝑘)𝑆𝑦)))↑2)) / 4))𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
237, 22sylan9eq 2792 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
24233impb 1115 1 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝑃𝐵) = (Σ𝑘 ∈ (1...4)((i↑𝑘) · ((𝑁‘(𝐴𝐺((i↑𝑘)𝑆𝐵)))↑2)) / 4))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  cfv 6492  (class class class)co 7360  cmpo 7362  1c1 11030  ici 11031   · cmul 11034   / cdiv 11798  2c2 12227  4c4 12229  ...cfz 13452  cexp 14014  Σcsu 15639  NrmCVeccnv 30670   +𝑣 cpv 30671  BaseSetcba 30672   ·𝑠OLD cns 30673  normCVcnmcv 30676  ·𝑖OLDcdip 30786
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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  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 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-seq 13955  df-sum 15640  df-dip 30787
This theorem is referenced by:  ipval2  30793  dipcl  30798  ipf  30799
  Copyright terms: Public domain W3C validator