minveclem1 - Metamath Proof Explorer

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

Theorem minveclem1 25652

Description: Lemma for minvec 25664. The set of all distances from points of 𝑌 to 𝐴 are a nonempty set of nonnegative reals. (Contributed by Mario Carneiro, 8-May-2014.) (Revised by Mario Carneiro, 15-Oct-2015.)

**Hypotheses**
Ref	Expression
minvec.x	⊢ 𝑋 = (Base‘𝑈)
minvec.m	⊢ − = (-_g‘𝑈)
minvec.n	⊢ 𝑁 = (norm‘𝑈)
minvec.u	⊢ (𝜑 → 𝑈 ∈ ℂPreHil)
minvec.y	⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈))
minvec.w	⊢ (𝜑 → (𝑈 ↾_s 𝑌) ∈ CMetSp)
minvec.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
minvec.j	⊢ 𝐽 = (TopOpen‘𝑈)
minvec.r	⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))

**Assertion**
Ref	Expression
minveclem1	⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))

Distinct variable groups: 𝑦,𝑤, − 𝑤,𝐴,𝑦 𝑤,𝐽,𝑦 𝑤,𝑁,𝑦 𝜑,𝑤,𝑦 𝑤,𝑅,𝑦 𝑤,𝑈,𝑦 𝑤,𝑋,𝑦 𝑤,𝑌,𝑦

**Proof of Theorem minveclem1**
Step	Hyp	Ref	Expression
1		minvec.r	. . 3 ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))
2		minvec.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ ℂPreHil)
3		cphngp 25401	. . . . . . 7 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp)
4	2, 3	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ NrmGrp)
5		cphlmod 25402	. . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod)
6	2, 5	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
7	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod)
8		minvec.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
9	8	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
10		minvec.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈))
11		minvec.x	. . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈)
12		eqid 2760	. . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
13	11, 12	lssss 21120	. . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋)
14	10, 13	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
15	14	sselda 3931	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
16		minvec.m	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
17	11, 16	lmodvsubcl 21091	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋)
18	7, 9, 15, 17	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋)
19		minvec.n	. . . . . . 7 ⊢ 𝑁 = (norm‘𝑈)
20	11, 19	nmcl 24842	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
21	4, 18, 20	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
22	21	fmpttd 7108	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ)
23	22	frnd 6711	. . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ)
24	1, 23	eqsstrid 3969	. 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ)
25	12	lssn0 21124	. . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅)
26	10, 25	syl 18	. . 3 ⊢ (𝜑 → 𝑌 ≠ ∅)
27	1	eqeq1i 2765	. . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
28		dm0rn0 5908	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
29		fvex 6891	. . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V
30		eqid 2760	. . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))
31	29, 30	dmmpti 6676	. . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌
32	31	eqeq1i 2765	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅)
33	27, 28, 32	3bitr2i 302	. . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅)
34	33	necon3bii 3007	. . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅)
35	26, 34	sylibr 237	. 2 ⊢ (𝜑 → 𝑅 ≠ ∅)
36	11, 19	nmge0 24843	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
37	4, 18, 36	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
38	37	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
39	29	rgenw 3080	. . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V
40		breq2 5107	. . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦))))
41	30, 40	ralrnmptw 7087	. . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))))
42	39, 41	ax-mp 5	. . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
43	38, 42	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
44	1	raleqi 3317	. . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
45	43, 44	sylibr 237	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
46	24, 35, 45	3jca 1146	1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 Vcvv 3450 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5655 ran crn 5656 ‘cfv 6533 (class class class)co 7413 ℝcr 11123 0cc0 11124 ≤ cle 11268 Basecbs 17301 ↾_s cress 17322 TopOpenctopn 17506 -_gcsg 19059 LModclmod 21044 LSubSpclss 21115 normcnm 24802 NrmGrpcngp 24803 ℂPreHilccph 25394 CMetSpccms 25560

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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-q 12998 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-0g 17526 df-topgen 17528 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-sbg 19062 df-lmod 21046 df-lss 21116 df-psmet 21577 df-xmet 21578 df-met 21579 df-bl 21580 df-mopn 21581 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-xms 24546 df-ms 24547 df-nm 24808 df-ngp 24809 df-nlm 24812 df-cph 25396

This theorem is used by: minveclem4c 25653 minveclem2 25654 minveclem3b 25656 minveclem4 25660 minveclem6 25662

W3C validator