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 25548

Description: Lemma for minvec 25560. 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 25297	. . . . . . 7 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp)
4	2, 3	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ NrmGrp)
5		cphlmod 25298	. . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod)
6	2, 5	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
7	6	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod)
8		minvec.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
9	8	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
10		minvec.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈))
11		minvec.x	. . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈)
12		eqid 2769	. . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
13	11, 12	lssss 21031	. . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋)
14	10, 13	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
15	14	sselda 3945	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
16		minvec.m	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
17	11, 16	lmodvsubcl 21002	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋)
18	7, 9, 15, 17	syl3anc 1396	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋)
19		minvec.n	. . . . . . 7 ⊢ 𝑁 = (norm‘𝑈)
20	11, 19	nmcl 24738	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
21	4, 18, 20	syl2an2r 697	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
22	21	fmpttd 7108	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ)
23	22	frnd 6712	. . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ)
24	1, 23	eqsstrid 3983	. 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ)
25	12	lssn0 21035	. . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅)
26	10, 25	syl 18	. . 3 ⊢ (𝜑 → 𝑌 ≠ ∅)
27	1	eqeq1i 2774	. . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
28		dm0rn0 5912	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
29		fvex 6892	. . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V
30		eqid 2769	. . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))
31	29, 30	dmmpti 6677	. . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌
32	31	eqeq1i 2774	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅)
33	27, 28, 32	3bitr2i 302	. . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅)
34	33	necon3bii 3016	. . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅)
35	26, 34	sylibr 237	. 2 ⊢ (𝜑 → 𝑅 ≠ ∅)
36	11, 19	nmge0 24739	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
37	4, 18, 36	syl2an2r 697	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
38	37	ralrimiva 3163	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
39	29	rgenw 3089	. . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V
40		breq2 5114	. . . . . 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 3327	. . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
45	43, 44	sylibr 237	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
46	24, 35, 45	3jca 1144	1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 Vcvv 3463 ⊆ wss 3913 ∅c0 4294 class class class wbr 5110 ↦ cmpt 5193 dom cdm 5659 ran crn 5660 ‘cfv 6534 (class class class)co 7408 ℝcr 11095 0cc0 11096 ≤ cle 11240 Basecbs 17265 ↾_s cress 17286 TopOpenctopn 17470 -_gcsg 18998 LModclmod 20955 LSubSpclss 21026 normcnm 24698 NrmGrpcngp 24699 ℂPreHilccph 25290 CMetSpccms 25456

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9398 df-inf 9399 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-n0 12501 df-z 12588 df-uz 12859 df-q 12969 df-rp 13013 df-xneg 13133 df-xadd 13134 df-xmul 13135 df-0g 17490 df-topgen 17492 df-mgm 18694 df-sgrp 18773 df-mnd 18789 df-grp 18999 df-minusg 19000 df-sbg 19001 df-lmod 20957 df-lss 21027 df-psmet 21479 df-xmet 21480 df-met 21481 df-bl 21482 df-mopn 21483 df-top 23016 df-topon 23033 df-topsp 23055 df-bases 23068 df-xms 24442 df-ms 24443 df-nm 24704 df-ngp 24705 df-nlm 24708 df-cph 25292

This theorem is referenced by: minveclem4c 25549 minveclem2 25550 minveclem3b 25552 minveclem4 25556 minveclem6 25558

W3C validator