nvop - Metamath Proof Explorer

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

Theorem nvop 27531

Description: A complex inner product space in terms of ordered pair components. (Contributed by NM, 11-Sep-2007.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nvop.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
nvop.4	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
nvop.6	⊢ 𝑁 = (norm_CV‘𝑈)

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

**Proof of Theorem nvop**
Step	Hyp	Ref	Expression
1		nvrel 27457	. . 3 ⊢ Rel NrmCVec
2		1st2nd 7214	. . 3 ⊢ ((Rel NrmCVec ∧ 𝑈 ∈ NrmCVec) → 𝑈 = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩)
3	1, 2	mpan 706	. 2 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩)
4		nvop.6	. . . . 5 ⊢ 𝑁 = (norm_CV‘𝑈)
5	4	nmcvfval 27462	. . . 4 ⊢ 𝑁 = (2^nd ‘𝑈)
6	5	opeq2i 4406	. . 3 ⊢ ⟨(1^st ‘𝑈), 𝑁⟩ = ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩
7		eqid 2622	. . . . 5 ⊢ (1^st ‘𝑈) = (1^st ‘𝑈)
8		nvop.2	. . . . 5 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
9		nvop.4	. . . . 5 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
10	7, 8, 9	nvvop 27464	. . . 4 ⊢ (𝑈 ∈ NrmCVec → (1^st ‘𝑈) = ⟨𝐺, 𝑆⟩)
11	10	opeq1d 4408	. . 3 ⊢ (𝑈 ∈ NrmCVec → ⟨(1^st ‘𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
12	6, 11	syl5eqr 2670	. 2 ⊢ (𝑈 ∈ NrmCVec → ⟨(1^st ‘𝑈), (2^nd ‘𝑈)⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
13	3, 12	eqtrd 2656	1 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ⟨cop 4183 Rel wrel 5119 ‘cfv 5888 1^st c1st 7166 2^nd c2nd 7167 NrmCVeccnv 27439 +_𝑣 cpv 27440 ·_𝑠OLD cns 27442 norm_CVcnmcv 27445

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fo 5894 df-fv 5896 df-oprab 6654 df-1st 7168 df-2nd 7169 df-vc 27414 df-nv 27447 df-va 27450 df-sm 27452 df-nmcv 27455

This theorem is referenced by: sspval 27578 isph 27677 hilhhi 28021

W3C validator