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

Theorem phpar2 27062
 Description: The parallelogram law for an inner product space. (Contributed by NM, 2-Apr-2007.) (New usage is discouraged.)
Hypotheses
Ref Expression
isph.1 𝑋 = (BaseSet‘𝑈)
isph.2 𝐺 = ( +𝑣𝑈)
isph.3 𝑀 = ( −𝑣𝑈)
isph.6 𝑁 = (normCV𝑈)
Assertion
Ref Expression
phpar2 ((𝑈 ∈ CPreHilOLD𝐴𝑋𝐵𝑋) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2))))

Proof of Theorem phpar2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isph.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
2 isph.2 . . . . 5 𝐺 = ( +𝑣𝑈)
3 isph.3 . . . . 5 𝑀 = ( −𝑣𝑈)
4 isph.6 . . . . 5 𝑁 = (normCV𝑈)
51, 2, 3, 4isph 27061 . . . 4 (𝑈 ∈ CPreHilOLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)))))
65simprbi 479 . . 3 (𝑈 ∈ CPreHilOLD → ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))
763ad2ant1 1075 . 2 ((𝑈 ∈ CPreHilOLD𝐴𝑋𝐵𝑋) → ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))
8 oveq1 6556 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
98fveq2d 6107 . . . . . . 7 (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺𝑦)) = (𝑁‘(𝐴𝐺𝑦)))
109oveq1d 6564 . . . . . 6 (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺𝑦))↑2) = ((𝑁‘(𝐴𝐺𝑦))↑2))
11 oveq1 6556 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥𝑀𝑦) = (𝐴𝑀𝑦))
1211fveq2d 6107 . . . . . . 7 (𝑥 = 𝐴 → (𝑁‘(𝑥𝑀𝑦)) = (𝑁‘(𝐴𝑀𝑦)))
1312oveq1d 6564 . . . . . 6 (𝑥 = 𝐴 → ((𝑁‘(𝑥𝑀𝑦))↑2) = ((𝑁‘(𝐴𝑀𝑦))↑2))
1410, 13oveq12d 6567 . . . . 5 (𝑥 = 𝐴 → (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)))
15 fveq2 6103 . . . . . . . 8 (𝑥 = 𝐴 → (𝑁𝑥) = (𝑁𝐴))
1615oveq1d 6564 . . . . . . 7 (𝑥 = 𝐴 → ((𝑁𝑥)↑2) = ((𝑁𝐴)↑2))
1716oveq1d 6564 . . . . . 6 (𝑥 = 𝐴 → (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)) = (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2)))
1817oveq2d 6565 . . . . 5 (𝑥 = 𝐴 → (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2))))
1914, 18eqeq12d 2625 . . . 4 (𝑥 = 𝐴 → ((((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))) ↔ (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2)))))
20 oveq2 6557 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
2120fveq2d 6107 . . . . . . 7 (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺𝑦)) = (𝑁‘(𝐴𝐺𝐵)))
2221oveq1d 6564 . . . . . 6 (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺𝑦))↑2) = ((𝑁‘(𝐴𝐺𝐵))↑2))
23 oveq2 6557 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴𝑀𝑦) = (𝐴𝑀𝐵))
2423fveq2d 6107 . . . . . . 7 (𝑦 = 𝐵 → (𝑁‘(𝐴𝑀𝑦)) = (𝑁‘(𝐴𝑀𝐵)))
2524oveq1d 6564 . . . . . 6 (𝑦 = 𝐵 → ((𝑁‘(𝐴𝑀𝑦))↑2) = ((𝑁‘(𝐴𝑀𝐵))↑2))
2622, 25oveq12d 6567 . . . . 5 (𝑦 = 𝐵 → (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)))
27 fveq2 6103 . . . . . . . 8 (𝑦 = 𝐵 → (𝑁𝑦) = (𝑁𝐵))
2827oveq1d 6564 . . . . . . 7 (𝑦 = 𝐵 → ((𝑁𝑦)↑2) = ((𝑁𝐵)↑2))
2928oveq2d 6565 . . . . . 6 (𝑦 = 𝐵 → (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2)) = (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2)))
3029oveq2d 6565 . . . . 5 (𝑦 = 𝐵 → (2 · (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2))) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2))))
3126, 30eqeq12d 2625 . . . 4 (𝑦 = 𝐵 → ((((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝑦)↑2))) ↔ (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2)))))
3219, 31rspc2v 3293 . . 3 ((𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2)))))
33323adant1 1072 . 2 ((𝑈 ∈ CPreHilOLD𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2)))))
347, 33mpd 15 1 ((𝑈 ∈ CPreHilOLD𝐴𝑋𝐵𝑋) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁𝐴)↑2) + ((𝑁𝐵)↑2))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ‘cfv 5804  (class class class)co 6549   + caddc 9818   · cmul 9820  2c2 10947  ↑cexp 12722  NrmCVeccnv 26823   +𝑣 cpv 26824  BaseSetcba 26825   −𝑣 cnsb 26828  normCVcnmcv 26829  CPreHilOLDccphlo 27051 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-ltxr 9958  df-sub 10147  df-neg 10148  df-grpo 26731  df-gid 26732  df-ginv 26733  df-gdiv 26734  df-ablo 26783  df-vc 26798  df-nv 26831  df-va 26834  df-ba 26835  df-sm 26836  df-0v 26837  df-vs 26838  df-nmcv 26839  df-ph 27052 This theorem is referenced by:  sspph  27094  minvecolem2  27115  hlpar2  27136
 Copyright terms: Public domain W3C validator