phop - Metamath Proof Explorer

	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	⊢ 𝑁 = (norm_CV‘𝑈)

**Assertion**
Ref	Expression
phop	⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)

**Proof of Theorem phop**
Step	Hyp	Ref	Expression
1		phrel 27992	. . 3 ⊢ Rel CPreHil_OLD
2		1st2nd 7440	. . 3 ⊢ ((Rel CPreHil_OLD ∧ 𝑈 ∈ CPreHil_OLD) → 𝑈 = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩)
3	1, 2	mpan 673	. 2 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩)
4		phop.6	. . . . 5 ⊢ 𝑁 = (norm_CV‘𝑈)
5	4	nmcvfval 27784	. . . 4 ⊢ 𝑁 = (2^nd ‘𝑈)
6	5	opeq2i 4592	. . 3 ⊢ ⟨(1^st ‘𝑈), 𝑁⟩ = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩
7		phnv 27991	. . . . 5 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
8		eqid 2802	. . . . . 6 ⊢ (1^st ‘𝑈) = (1^st ‘𝑈)
9	8	nvvc 27792	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → (1^st ‘𝑈) ∈ CVec_OLD)
10		vcrel 27737	. . . . . . 7 ⊢ Rel CVec_OLD
11		1st2nd 7440	. . . . . . 7 ⊢ ((Rel CVec_OLD ∧ (1^st ‘𝑈) ∈ CVec_OLD) → (1^st ‘𝑈) = ⟨(1^st ‘(1^st ‘𝑈)), (2^nd ‘(1^st ‘𝑈))⟩)
12	10, 11	mpan 673	. . . . . 6 ⊢ ((1^st ‘𝑈) ∈ CVec_OLD → (1^st ‘𝑈) = ⟨(1^st ‘(1^st ‘𝑈)), (2^nd ‘(1^st ‘𝑈))⟩)
13		phop.2	. . . . . . . 8 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
14	13	vafval 27780	. . . . . . 7 ⊢ 𝐺 = (1^st ‘(1^st ‘𝑈))
15		phop.4	. . . . . . . 8 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
16	15	smfval 27782	. . . . . . 7 ⊢ 𝑆 = (2^nd ‘(1^st ‘𝑈))
17	14, 16	opeq12i 4593	. . . . . 6 ⊢ ⟨𝐺, 𝑆⟩ = ⟨(1^st ‘(1^st ‘𝑈)), (2^nd ‘(1^st ‘𝑈))⟩
18	12, 17	syl6eqr 2854	. . . . 5 ⊢ ((1^st ‘𝑈) ∈ CVec_OLD → (1^st ‘𝑈) = ⟨𝐺, 𝑆⟩)
19	7, 9, 18	3syl 18	. . . 4 ⊢ (𝑈 ∈ CPreHil_OLD → (1^st ‘𝑈) = ⟨𝐺, 𝑆⟩)
20	19	opeq1d 4594	. . 3 ⊢ (𝑈 ∈ CPreHil_OLD → ⟨(1^st ‘𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
21	6, 20	syl5eqr 2850	. 2 ⊢ (𝑈 ∈ CPreHil_OLD → ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
22	3, 21	eqtrd 2836	1 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1637 ∈ wcel 2155 ⟨cop 4370 Rel wrel 5310 ‘cfv 6095 1^st c1st 7390 2^nd c2nd 7391 CVec_OLDcvc 27735 NrmCVeccnv 27761 +_𝑣 cpv 27762 ·_𝑠OLD cns 27764 norm_CVcnmcv 27767 CPreHil_OLDccphlo 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

W3C validator