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

Theorem phop 27995
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 27992 . . 3 Rel CPreHilOLD
2 1st2nd 7440 . . 3 ((Rel CPreHilOLD𝑈 ∈ CPreHilOLD) → 𝑈 = ⟨(1st𝑈), (2nd𝑈)⟩)
31, 2mpan 673 . 2 (𝑈 ∈ CPreHilOLD𝑈 = ⟨(1st𝑈), (2nd𝑈)⟩)
4 phop.6 . . . . 5 𝑁 = (normCV𝑈)
54nmcvfval 27784 . . . 4 𝑁 = (2nd𝑈)
65opeq2i 4592 . . 3 ⟨(1st𝑈), 𝑁⟩ = ⟨(1st𝑈), (2nd𝑈)⟩
7 phnv 27991 . . . . 5 (𝑈 ∈ CPreHilOLD𝑈 ∈ NrmCVec)
8 eqid 2802 . . . . . 6 (1st𝑈) = (1st𝑈)
98nvvc 27792 . . . . 5 (𝑈 ∈ NrmCVec → (1st𝑈) ∈ CVecOLD)
10 vcrel 27737 . . . . . . 7 Rel CVecOLD
11 1st2nd 7440 . . . . . . 7 ((Rel CVecOLD ∧ (1st𝑈) ∈ CVecOLD) → (1st𝑈) = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩)
1210, 11mpan 673 . . . . . 6 ((1st𝑈) ∈ CVecOLD → (1st𝑈) = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩)
13 phop.2 . . . . . . . 8 𝐺 = ( +𝑣𝑈)
1413vafval 27780 . . . . . . 7 𝐺 = (1st ‘(1st𝑈))
15 phop.4 . . . . . . . 8 𝑆 = ( ·𝑠OLD𝑈)
1615smfval 27782 . . . . . . 7 𝑆 = (2nd ‘(1st𝑈))
1714, 16opeq12i 4593 . . . . . 6 𝐺, 𝑆⟩ = ⟨(1st ‘(1st𝑈)), (2nd ‘(1st𝑈))⟩
1812, 17syl6eqr 2854 . . . . 5 ((1st𝑈) ∈ CVecOLD → (1st𝑈) = ⟨𝐺, 𝑆⟩)
197, 9, 183syl 18 . . . 4 (𝑈 ∈ CPreHilOLD → (1st𝑈) = ⟨𝐺, 𝑆⟩)
2019opeq1d 4594 . . 3 (𝑈 ∈ CPreHilOLD → ⟨(1st𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
216, 20syl5eqr 2850 . 2 (𝑈 ∈ CPreHilOLD → ⟨(1st𝑈), (2nd𝑈)⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
223, 21eqtrd 2836 1 (𝑈 ∈ CPreHilOLD𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1637  wcel 2155  cop 4370  Rel wrel 5310  cfv 6095  1st c1st 7390  2nd c2nd 7391  CVecOLDcvc 27735  NrmCVeccnv 27761   +𝑣 cpv 27762   ·𝑠OLD cns 27764  normCVcnmcv 27767  CPreHilOLDccphlo 27989
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2067  ax-7 2103  ax-8 2157  ax-9 2164  ax-10 2184  ax-11 2200  ax-12 2213  ax-13 2419  ax-ext 2781  ax-rep 4957  ax-sep 4968  ax-nul 4977  ax-pow 5029  ax-pr 5090  ax-un 7173
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2060  df-eu 2633  df-mo 2634  df-clab 2789  df-cleq 2795  df-clel 2798  df-nfc 2933  df-ne 2975  df-ral 3097  df-rex 3098  df-reu 3099  df-rab 3101  df-v 3389  df-sbc 3628  df-csb 3723  df-dif 3766  df-un 3768  df-in 3770  df-ss 3777  df-nul 4111  df-if 4274  df-sn 4365  df-pr 4367  df-op 4371  df-uni 4624  df-iun 4707  df-br 4838  df-opab 4900  df-mpt 4917  df-id 5213  df-xp 5311  df-rel 5312  df-cnv 5313  df-co 5314  df-dm 5315  df-rn 5316  df-res 5317  df-ima 5318  df-iota 6058  df-fun 6097  df-fn 6098  df-f 6099  df-f1 6100  df-fo 6101  df-f1o 6102  df-fv 6103  df-ov 6871  df-oprab 6872  df-1st 7392  df-2nd 7393  df-vc 27736  df-nv 27769  df-va 27772  df-ba 27773  df-sm 27774  df-0v 27775  df-nmcv 27777  df-ph 27990
This theorem is referenced by:  phpar  28001
  Copyright terms: Public domain W3C validator