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

Theorem isphg 28131
Description: The predicate "is a complex inner product space." An inner product space is a normed vector space whose norm satisfies the parallelogram law. The vector (group) addition operation is 𝐺, the scalar product is 𝑆, and the norm is 𝑁. An inner product space is also called a pre-Hilbert space. (Contributed by NM, 2-Apr-2007.) (New usage is discouraged.)
Hypothesis
Ref Expression
isphg.1 𝑋 = ran 𝐺
Assertion
Ref Expression
isphg ((𝐺𝐴𝑆𝐵𝑁𝐶) → (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ CPreHilOLD ↔ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))))
Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑁,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)

Proof of Theorem isphg
Dummy variables 𝑔 𝑛 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ph 28127 . . 3 CPreHilOLD = (NrmCVec ∩ {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))})
21elin2 3965 . 2 (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ CPreHilOLD ↔ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ∧ ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))}))
3 rneq 5521 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
4 isphg.1 . . . . . 6 𝑋 = ran 𝐺
53, 4syl6eqr 2817 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
6 oveq 6850 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
76fveq2d 6381 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑛‘(𝑥𝑔𝑦)) = (𝑛‘(𝑥𝐺𝑦)))
87oveq1d 6859 . . . . . . . 8 (𝑔 = 𝐺 → ((𝑛‘(𝑥𝑔𝑦))↑2) = ((𝑛‘(𝑥𝐺𝑦))↑2))
9 oveq 6850 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑥𝑔(-1𝑠𝑦)) = (𝑥𝐺(-1𝑠𝑦)))
109fveq2d 6381 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑛‘(𝑥𝑔(-1𝑠𝑦))) = (𝑛‘(𝑥𝐺(-1𝑠𝑦))))
1110oveq1d 6859 . . . . . . . 8 (𝑔 = 𝐺 → ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2) = ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2))
128, 11oveq12d 6862 . . . . . . 7 (𝑔 = 𝐺 → (((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)))
1312eqeq1d 2767 . . . . . 6 (𝑔 = 𝐺 → ((((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))))
145, 13raleqbidv 3300 . . . . 5 (𝑔 = 𝐺 → (∀𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ ∀𝑦𝑋 (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))))
155, 14raleqbidv 3300 . . . 4 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))))
16 oveq 6850 . . . . . . . . . 10 (𝑠 = 𝑆 → (-1𝑠𝑦) = (-1𝑆𝑦))
1716oveq2d 6860 . . . . . . . . 9 (𝑠 = 𝑆 → (𝑥𝐺(-1𝑠𝑦)) = (𝑥𝐺(-1𝑆𝑦)))
1817fveq2d 6381 . . . . . . . 8 (𝑠 = 𝑆 → (𝑛‘(𝑥𝐺(-1𝑠𝑦))) = (𝑛‘(𝑥𝐺(-1𝑆𝑦))))
1918oveq1d 6859 . . . . . . 7 (𝑠 = 𝑆 → ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2) = ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2))
2019oveq2d 6860 . . . . . 6 (𝑠 = 𝑆 → (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)))
2120eqeq1d 2767 . . . . 5 (𝑠 = 𝑆 → ((((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))))
22212ralbidv 3136 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋𝑦𝑋 (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))))
23 fveq1 6376 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛‘(𝑥𝐺𝑦)) = (𝑁‘(𝑥𝐺𝑦)))
2423oveq1d 6859 . . . . . . 7 (𝑛 = 𝑁 → ((𝑛‘(𝑥𝐺𝑦))↑2) = ((𝑁‘(𝑥𝐺𝑦))↑2))
25 fveq1 6376 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛‘(𝑥𝐺(-1𝑆𝑦))) = (𝑁‘(𝑥𝐺(-1𝑆𝑦))))
2625oveq1d 6859 . . . . . . 7 (𝑛 = 𝑁 → ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2) = ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2))
2724, 26oveq12d 6862 . . . . . 6 (𝑛 = 𝑁 → (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)))
28 fveq1 6376 . . . . . . . . 9 (𝑛 = 𝑁 → (𝑛𝑥) = (𝑁𝑥))
2928oveq1d 6859 . . . . . . . 8 (𝑛 = 𝑁 → ((𝑛𝑥)↑2) = ((𝑁𝑥)↑2))
30 fveq1 6376 . . . . . . . . 9 (𝑛 = 𝑁 → (𝑛𝑦) = (𝑁𝑦))
3130oveq1d 6859 . . . . . . . 8 (𝑛 = 𝑁 → ((𝑛𝑦)↑2) = ((𝑁𝑦)↑2))
3229, 31oveq12d 6862 . . . . . . 7 (𝑛 = 𝑁 → (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)) = (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)))
3332oveq2d 6860 . . . . . 6 (𝑛 = 𝑁 → (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))
3427, 33eqeq12d 2780 . . . . 5 (𝑛 = 𝑁 → ((((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)))))
35342ralbidv 3136 . . . 4 (𝑛 = 𝑁 → (∀𝑥𝑋𝑦𝑋 (((𝑛‘(𝑥𝐺𝑦))↑2) + ((𝑛‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)))))
3615, 22, 35eloprabg 6948 . . 3 ((𝐺𝐴𝑆𝐵𝑁𝐶) → (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))} ↔ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2)))))
3736anbi2d 622 . 2 ((𝐺𝐴𝑆𝐵𝑁𝐶) → ((⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ∧ ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔(((𝑛‘(𝑥𝑔𝑦))↑2) + ((𝑛‘(𝑥𝑔(-1𝑠𝑦)))↑2)) = (2 · (((𝑛𝑥)↑2) + ((𝑛𝑦)↑2)))}) ↔ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))))
382, 37syl5bb 274 1 ((𝐺𝐴𝑆𝐵𝑁𝐶) → (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ CPreHilOLD ↔ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥𝑋𝑦𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1𝑆𝑦)))↑2)) = (2 · (((𝑁𝑥)↑2) + ((𝑁𝑦)↑2))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  w3a 1107   = wceq 1652  wcel 2155  wral 3055  cop 4342  ran crn 5280  cfv 6070  (class class class)co 6844  {coprab 6845  1c1 10192   + caddc 10194   · cmul 10196  -cneg 10523  2c2 11329  cexp 13070  NrmCVeccnv 27898  CPreHilOLDccphlo 28126
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-sep 4943  ax-nul 4951  ax-pr 5064
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ral 3060  df-rex 3061  df-rab 3064  df-v 3352  df-dif 3737  df-un 3739  df-in 3741  df-ss 3748  df-nul 4082  df-if 4246  df-sn 4337  df-pr 4339  df-op 4343  df-uni 4597  df-br 4812  df-opab 4874  df-cnv 5287  df-dm 5289  df-rn 5290  df-iota 6033  df-fv 6078  df-ov 6847  df-oprab 6848  df-ph 28127
This theorem is referenced by:  cncph  28133  isph  28136  phpar  28138  hhph  28494
  Copyright terms: Public domain W3C validator