nvvop - Metamath Proof Explorer

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

Theorem nvvop 31211

Description: The vector space component of a normed complex vector space is an ordered pair of the underlying group and a scalar product. (Contributed by NM, 28-Nov-2006.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nvvop.1	⊢ 𝑊 = (1^st ‘𝑈)
nvvop.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
nvvop.4	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)

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

**Proof of Theorem nvvop**
Step	Hyp	Ref	Expression
1		vcrel 31162	. . 3 ⊢ Rel CVec_OLD
2		nvss 31195	. . . . 5 ⊢ NrmCVec ⊆ (CVec_OLD × V)
3		nvvop.1	. . . . . . . 8 ⊢ 𝑊 = (1^st ‘𝑈)
4		eqid 2761	. . . . . . . 8 ⊢ (norm_CV‘𝑈) = (norm_CV‘𝑈)
5	3, 4	nvop2 31210	. . . . . . 7 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨𝑊, (norm_CV‘𝑈)⟩)
6	5	eleq1d 2846	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑈 ∈ NrmCVec ↔ ⟨𝑊, (norm_CV‘𝑈)⟩ ∈ NrmCVec))
7	6	ibi 270	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → ⟨𝑊, (norm_CV‘𝑈)⟩ ∈ NrmCVec)
8	2, 7	sselid 3929	. . . 4 ⊢ (𝑈 ∈ NrmCVec → ⟨𝑊, (norm_CV‘𝑈)⟩ ∈ (CVec_OLD × V))
9		opelxp1 5693	. . . 4 ⊢ (⟨𝑊, (norm_CV‘𝑈)⟩ ∈ (CVec_OLD × V) → 𝑊 ∈ CVec_OLD)
10	8, 9	syl 18	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝑊 ∈ CVec_OLD)
11		1st2nd 8050	. . 3 ⊢ ((Rel CVec_OLD ∧ 𝑊 ∈ CVec_OLD) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
12	1, 10, 11	sylancr 599	. 2 ⊢ (𝑈 ∈ NrmCVec → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
13		nvvop.2	. . . . 5 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
14	13	vafval 31205	. . . 4 ⊢ 𝐺 = (1^st ‘(1^st ‘𝑈))
15	3	fveq2i 6888	. . . 4 ⊢ (1^st ‘𝑊) = (1^st ‘(1^st ‘𝑈))
16	14, 15	eqtr4i 2787	. . 3 ⊢ 𝐺 = (1^st ‘𝑊)
17		nvvop.4	. . . . 5 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
18	17	smfval 31207	. . . 4 ⊢ 𝑆 = (2^nd ‘(1^st ‘𝑈))
19	3	fveq2i 6888	. . . 4 ⊢ (2^nd ‘𝑊) = (2^nd ‘(1^st ‘𝑈))
20	18, 19	eqtr4i 2787	. . 3 ⊢ 𝑆 = (2^nd ‘𝑊)
21	16, 20	opeq12i 4838	. 2 ⊢ ⟨𝐺, 𝑆⟩ = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩
22	12, 21	eqtr4di 2814	1 ⊢ (𝑈 ∈ NrmCVec → 𝑊 = ⟨𝐺, 𝑆⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ⟨cop 4590 × cxp 5649 Rel wrel 5656 ‘cfv 6538 1^st c1st 7999 2^nd c2nd 8000 CVec_OLDcvc 31160 NrmCVeccnv 31186 +_𝑣 cpv 31187 ·_𝑠OLD cns 31189 norm_CVcnmcv 31192

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-oprab 7424 df-1st 8001 df-2nd 8002 df-vc 31161 df-nv 31194 df-va 31197 df-sm 31199 df-nmcv 31202

This theorem is used by: nvi 31216 nvvc 31217 nvop 31278

W3C validator