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 23592

Description: Lemma for minvec 23604. 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	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ℂPreHil)
3		cphngp 23342	. . . . . . . 8 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp)
4	2, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ NrmGrp)
5	4	adantr 474	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmGrp)
6		cphlmod 23343	. . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod)
7	2, 6	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
8	7	adantr 474	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod)
9		minvec.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
10	9	adantr 474	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
11		minvec.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈))
12		minvec.x	. . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈)
13		eqid 2825	. . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
14	12, 13	lssss 19293	. . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋)
15	11, 14	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
16	15	sselda 3827	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
17		minvec.m	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
18	12, 17	lmodvsubcl 19264	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋)
19	8, 10, 16, 18	syl3anc 1496	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋)
20		minvec.n	. . . . . . 7 ⊢ 𝑁 = (norm‘𝑈)
21	12, 20	nmcl 22790	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
22	5, 19, 21	syl2anc 581	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
23	22	fmpttd 6634	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ)
24	23	frnd 6285	. . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ)
25	1, 24	syl5eqss 3874	. 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ)
26	13	lssn0 19297	. . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅)
27	11, 26	syl 17	. . 3 ⊢ (𝜑 → 𝑌 ≠ ∅)
28	1	eqeq1i 2830	. . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
29		dm0rn0 5574	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
30		fvex 6446	. . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V
31		eqid 2825	. . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))
32	30, 31	dmmpti 6256	. . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌
33	32	eqeq1i 2830	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅)
34	28, 29, 33	3bitr2i 291	. . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅)
35	34	necon3bii 3051	. . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅)
36	27, 35	sylibr 226	. 2 ⊢ (𝜑 → 𝑅 ≠ ∅)
37	12, 20	nmge0 22791	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
38	5, 19, 37	syl2anc 581	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
39	38	ralrimiva 3175	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
40	30	rgenw 3133	. . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V
41		breq2 4877	. . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦))))
42	31, 41	ralrnmpt 6617	. . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))))
43	40, 42	ax-mp 5	. . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
44	39, 43	sylibr 226	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
45	1	raleqi 3354	. . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
46	44, 45	sylibr 226	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
47	25, 36, 46	3jca 1164	1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∧ w3a 1113 = wceq 1658 ∈ wcel 2166 ≠ wne 2999 ∀wral 3117 Vcvv 3414 ⊆ wss 3798 ∅c0 4144 class class class wbr 4873 ↦ cmpt 4952 dom cdm 5342 ran crn 5343 ‘cfv 6123 (class class class)co 6905 ℝcr 10251 0cc0 10252 ≤ cle 10392 Basecbs 16222 ↾_s cress 16223 TopOpenctopn 16435 -_gcsg 17778 LModclmod 19219 LSubSpclss 19288 normcnm 22751 NrmGrpcngp 22752 ℂPreHilccph 23335 CMetSpccms 23500

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2391 ax-ext 2803 ax-rep 4994 ax-sep 5005 ax-nul 5013 ax-pow 5065 ax-pr 5127 ax-un 7209 ax-cnex 10308 ax-resscn 10309 ax-1cn 10310 ax-icn 10311 ax-addcl 10312 ax-addrcl 10313 ax-mulcl 10314 ax-mulrcl 10315 ax-mulcom 10316 ax-addass 10317 ax-mulass 10318 ax-distr 10319 ax-i2m1 10320 ax-1ne0 10321 ax-1rid 10322 ax-rnegex 10323 ax-rrecex 10324 ax-cnre 10325 ax-pre-lttri 10326 ax-pre-lttrn 10327 ax-pre-ltadd 10328 ax-pre-mulgt0 10329 ax-pre-sup 10330

This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4145 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-tp 4402 df-op 4404 df-uni 4659 df-iun 4742 df-br 4874 df-opab 4936 df-mpt 4953 df-tr 4976 df-id 5250 df-eprel 5255 df-po 5263 df-so 5264 df-fr 5301 df-we 5303 df-xp 5348 df-rel 5349 df-cnv 5350 df-co 5351 df-dm 5352 df-rn 5353 df-res 5354 df-ima 5355 df-pred 5920 df-ord 5966 df-on 5967 df-lim 5968 df-suc 5969 df-iota 6086 df-fun 6125 df-fn 6126 df-f 6127 df-f1 6128 df-fo 6129 df-f1o 6130 df-fv 6131 df-riota 6866 df-ov 6908 df-oprab 6909 df-mpt2 6910 df-om 7327 df-1st 7428 df-2nd 7429 df-wrecs 7672 df-recs 7734 df-rdg 7772 df-er 8009 df-map 8124 df-en 8223 df-dom 8224 df-sdom 8225 df-sup 8617 df-inf 8618 df-pnf 10393 df-mnf 10394 df-xr 10395 df-ltxr 10396 df-le 10397 df-sub 10587 df-neg 10588 df-div 11010 df-nn 11351 df-2 11414 df-n0 11619 df-z 11705 df-uz 11969 df-q 12072 df-rp 12113 df-xneg 12232 df-xadd 12233 df-xmul 12234 df-0g 16455 df-topgen 16457 df-mgm 17595 df-sgrp 17637 df-mnd 17648 df-grp 17779 df-minusg 17780 df-sbg 17781 df-lmod 19221 df-lss 19289 df-psmet 20098 df-xmet 20099 df-met 20100 df-bl 20101 df-mopn 20102 df-top 21069 df-topon 21086 df-topsp 21108 df-bases 21121 df-xms 22495 df-ms 22496 df-nm 22757 df-ngp 22758 df-nlm 22761 df-cph 23337

This theorem is referenced by: minveclem4c 23593 minveclem2 23594 minveclem3b 23596 minveclem4 23600 minveclem6 23602

W3C validator