ncvs1 - Metamath Proof Explorer

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

Theorem ncvs1 24674

Description: From any nonzero vector of a normed subcomplex vector space, construct a collinear vector whose norm is one. (Contributed by NM, 6-Dec-2007.) (Revised by AV, 8-Oct-2021.)

**Hypotheses**
Ref	Expression
ncvs1.x	⊢ 𝑋 = (Base‘𝐺)
ncvs1.n	⊢ 𝑁 = (norm‘𝐺)
ncvs1.z	⊢ 0 = (0_g‘𝐺)
ncvs1.s	⊢ · = ( ·_𝑠 ‘𝐺)
ncvs1.f	⊢ 𝐹 = (Scalar‘𝐺)
ncvs1.k	⊢ 𝐾 = (Base‘𝐹)

**Assertion**
Ref	Expression
ncvs1	⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘((1 / (𝑁‘𝐴)) · 𝐴)) = 1)

**Proof of Theorem ncvs1**
Step	Hyp	Ref	Expression
1		simp1 1137	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → 𝐺 ∈ (NrmVec ∩ ℂVec))
2		simp3 1139	. . . 4 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (1 / (𝑁‘𝐴)) ∈ 𝐾)
3		elin 3965	. . . . . . . . 9 ⊢ (𝐺 ∈ (NrmVec ∩ ℂVec) ↔ (𝐺 ∈ NrmVec ∧ 𝐺 ∈ ℂVec))
4		nvcnlm 24213	. . . . . . . . . . 11 ⊢ (𝐺 ∈ NrmVec → 𝐺 ∈ NrmMod)
5		nlmngp 24194	. . . . . . . . . . 11 ⊢ (𝐺 ∈ NrmMod → 𝐺 ∈ NrmGrp)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ (𝐺 ∈ NrmVec → 𝐺 ∈ NrmGrp)
7	6	adantr 482	. . . . . . . . 9 ⊢ ((𝐺 ∈ NrmVec ∧ 𝐺 ∈ ℂVec) → 𝐺 ∈ NrmGrp)
8	3, 7	sylbi 216	. . . . . . . 8 ⊢ (𝐺 ∈ (NrmVec ∩ ℂVec) → 𝐺 ∈ NrmGrp)
9		simpl 484	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) → 𝐴 ∈ 𝑋)
10	8, 9	anim12i 614	. . . . . . 7 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋))
11		ncvs1.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
12		ncvs1.n	. . . . . . . 8 ⊢ 𝑁 = (norm‘𝐺)
13	11, 12	nmcl 24125	. . . . . . 7 ⊢ ((𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℝ)
14	10, 13	syl 17	. . . . . 6 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (𝑁‘𝐴) ∈ ℝ)
15		ncvs1.z	. . . . . . . . . . . 12 ⊢ 0 = (0_g‘𝐺)
16	11, 12, 15	nmeq0 24127	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) = 0 ↔ 𝐴 = 0 ))
17	16	bicomd 222	. . . . . . . . . 10 ⊢ ((𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋) → (𝐴 = 0 ↔ (𝑁‘𝐴) = 0))
18	8, 17	sylan 581	. . . . . . . . 9 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ 𝐴 ∈ 𝑋) → (𝐴 = 0 ↔ (𝑁‘𝐴) = 0))
19	18	necon3bid 2986	. . . . . . . 8 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ 𝐴 ∈ 𝑋) → (𝐴 ≠ 0 ↔ (𝑁‘𝐴) ≠ 0))
20	19	biimpd 228	. . . . . . 7 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ 𝐴 ∈ 𝑋) → (𝐴 ≠ 0 → (𝑁‘𝐴) ≠ 0))
21	20	impr 456	. . . . . 6 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (𝑁‘𝐴) ≠ 0)
22	14, 21	rereccld 12041	. . . . 5 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (1 / (𝑁‘𝐴)) ∈ ℝ)
23	22	3adant3 1133	. . . 4 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (1 / (𝑁‘𝐴)) ∈ ℝ)
24	2, 23	elind 4195	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (1 / (𝑁‘𝐴)) ∈ (𝐾 ∩ ℝ))
25		1re 11214	. . . . . . . 8 ⊢ 1 ∈ ℝ
26		0le1 11737	. . . . . . . 8 ⊢ 0 ≤ 1
27	25, 26	pm3.2i 472	. . . . . . 7 ⊢ (1 ∈ ℝ ∧ 0 ≤ 1)
28	27	a1i 11	. . . . . 6 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (1 ∈ ℝ ∧ 0 ≤ 1))
29		simprr 772	. . . . . . 7 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → 𝐴 ≠ 0 )
30	11, 12, 15	nmgt0 24139	. . . . . . . 8 ⊢ ((𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋) → (𝐴 ≠ 0 ↔ 0 < (𝑁‘𝐴)))
31	10, 30	syl 17	. . . . . . 7 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → (𝐴 ≠ 0 ↔ 0 < (𝑁‘𝐴)))
32	29, 31	mpbid 231	. . . . . 6 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → 0 < (𝑁‘𝐴))
33	28, 14, 32	jca32 517	. . . . 5 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 )) → ((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((𝑁‘𝐴) ∈ ℝ ∧ 0 < (𝑁‘𝐴))))
34	33	3adant3 1133	. . . 4 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → ((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((𝑁‘𝐴) ∈ ℝ ∧ 0 < (𝑁‘𝐴))))
35		divge0 12083	. . . 4 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((𝑁‘𝐴) ∈ ℝ ∧ 0 < (𝑁‘𝐴))) → 0 ≤ (1 / (𝑁‘𝐴)))
36	34, 35	syl 17	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → 0 ≤ (1 / (𝑁‘𝐴)))
37		simp2l 1200	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → 𝐴 ∈ 𝑋)
38		ncvs1.s	. . . 4 ⊢ · = ( ·_𝑠 ‘𝐺)
39		ncvs1.f	. . . 4 ⊢ 𝐹 = (Scalar‘𝐺)
40		ncvs1.k	. . . 4 ⊢ 𝐾 = (Base‘𝐹)
41	11, 12, 38, 39, 40	ncvsge0 24670	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ ((1 / (𝑁‘𝐴)) ∈ (𝐾 ∩ ℝ) ∧ 0 ≤ (1 / (𝑁‘𝐴))) ∧ 𝐴 ∈ 𝑋) → (𝑁‘((1 / (𝑁‘𝐴)) · 𝐴)) = ((1 / (𝑁‘𝐴)) · (𝑁‘𝐴)))
42	1, 24, 36, 37, 41	syl121anc 1376	. 2 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘((1 / (𝑁‘𝐴)) · 𝐴)) = ((1 / (𝑁‘𝐴)) · (𝑁‘𝐴)))
43	10	3adant3 1133	. . . . 5 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝐺 ∈ NrmGrp ∧ 𝐴 ∈ 𝑋))
44	43, 13	syl 17	. . . 4 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘𝐴) ∈ ℝ)
45	44	recnd 11242	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘𝐴) ∈ ℂ)
46	21	3adant3 1133	. . 3 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘𝐴) ≠ 0)
47	45, 46	recid2d 11986	. 2 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → ((1 / (𝑁‘𝐴)) · (𝑁‘𝐴)) = 1)
48	42, 47	eqtrd 2773	1 ⊢ ((𝐺 ∈ (NrmVec ∩ ℂVec) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ≠ 0 ) ∧ (1 / (𝑁‘𝐴)) ∈ 𝐾) → (𝑁‘((1 / (𝑁‘𝐴)) · 𝐴)) = 1)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∩ cin 3948 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 ℝcr 11109 0cc0 11110 1c1 11111 · cmul 11115 < clt 11248 ≤ cle 11249 / cdiv 11871 Basecbs 17144 Scalarcsca 17200 ·_𝑠 cvsca 17201 0_gc0g 17385 normcnm 24085 NrmGrpcngp 24086 NrmModcnlm 24089 NrmVeccnvc 24090 ℂVecccvs 24639

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189 ax-mulf 11190

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-fz 13485 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-0g 17387 df-topgen 17389 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-grp 18822 df-subg 19003 df-cmn 19650 df-mgp 19988 df-ring 20058 df-cring 20059 df-subrg 20317 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-cnfld 20945 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-xms 23826 df-ms 23827 df-nm 24091 df-ngp 24092 df-nlm 24095 df-nvc 24096 df-clm 24579 df-cvs 24640

This theorem is referenced by: (None)

W3C validator