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

Theorem phop 28007
Description: A complex inner product space in terms of ordered pair components. (Contributed by NM, 2-Apr-2007.) (New usage is discouraged.)
Hypotheses
Ref Expression
phop.2 𝐺 = ( +𝑣𝑈)
phop.4 𝑆 = ( ·𝑠OLD𝑈)
phop.6 𝑁 = (normCV𝑈)
Assertion
Ref Expression
phop (𝑈 ∈ CPreHilOLD𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)

Proof of Theorem phop
StepHypRef Expression
1 phrel 28004 . . 3 Rel CPreHilOLD
2 1st2nd 7362 . . 3 ((Rel CPreHilOLD𝑈 ∈ CPreHilOLD) → 𝑈 = ⟨(1st𝑈), (2nd𝑈)⟩)
31, 2mpan 662 . 2 (𝑈 ∈ CPreHilOLD𝑈 = ⟨(1st𝑈), (2nd𝑈)⟩)
4 phop.6 . . . . 5 𝑁 = (normCV𝑈)
54nmcvfval 27796 . . . 4 𝑁 = (2nd𝑈)
65opeq2i 4541 . . 3 ⟨(1st𝑈), 𝑁⟩ = ⟨(1st𝑈), (2nd𝑈)⟩
7 phnv 28003 . . . . 5 (𝑈 ∈ CPreHilOLD𝑈 ∈ NrmCVec)
8 eqid 2770 . . . . . 6 (1st𝑈) = (1st𝑈)
98nvvc 27804 . . . . 5 (𝑈 ∈ NrmCVec → (1st𝑈) ∈ CVecOLD)
10 vcrel 27749 . . . . . . 7 Rel CVecOLD
11 1st2nd 7362 . . . . . . 7 ((Rel CVecOLD ∧ (1st𝑈) ∈ CVecOLD) → (1st𝑈) = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩)
1210, 11mpan 662 . . . . . 6 ((1st𝑈) ∈ CVecOLD → (1st𝑈) = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩)
13 phop.2 . . . . . . . 8 𝐺 = ( +𝑣𝑈)
1413vafval 27792 . . . . . . 7 𝐺 = (1st ‘(1st𝑈))
15 phop.4 . . . . . . . 8 𝑆 = ( ·𝑠OLD𝑈)
1615smfval 27794 . . . . . . 7 𝑆 = (2nd ‘(1st𝑈))
1714, 16opeq12i 4542 . . . . . 6 𝐺, 𝑆⟩ = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩
1812, 17syl6eqr 2822 . . . . 5 ((1st𝑈) ∈ CVecOLD → (1st𝑈) = ⟨𝐺, 𝑆⟩)
197, 9, 183syl 18 . . . 4 (𝑈 ∈ CPreHilOLD → (1st𝑈) = ⟨𝐺, 𝑆⟩)
2019opeq1d 4543 . . 3 (𝑈 ∈ CPreHilOLD → ⟨(1st𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
216, 20syl5eqr 2818 . 2 (𝑈 ∈ CPreHilOLD → ⟨(1st𝑈), (2nd𝑈)⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
223, 21eqtrd 2804 1 (𝑈 ∈ CPreHilOLD𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1630  wcel 2144  cop 4320  Rel wrel 5254  cfv 6031  1st c1st 7312  2nd c2nd 7313  CVecOLDcvc 27747  NrmCVeccnv 27773   +𝑣 cpv 27774   ·𝑠OLD cns 27776  normCVcnmcv 27779  CPreHilOLDccphlo 28001
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-reu 3067  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6795  df-oprab 6796  df-1st 7314  df-2nd 7315  df-vc 27748  df-nv 27781  df-va 27784  df-ba 27785  df-sm 27786  df-0v 27787  df-nmcv 27789  df-ph 28002
This theorem is referenced by:  phpar  28013
  Copyright terms: Public domain W3C validator