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 24029

Description: Lemma for minvec 24041. 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 23779	. . . . . . 7 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp)
4	2, 3	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ NrmGrp)
5		cphlmod 23780	. . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod)
6	2, 5	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
7	6	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod)
8		minvec.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
9	8	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
10		minvec.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈))
11		minvec.x	. . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈)
12		eqid 2823	. . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
13	11, 12	lssss 19710	. . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋)
14	10, 13	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
15	14	sselda 3969	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
16		minvec.m	. . . . . . . 8 ⊢ − = (-_g‘𝑈)
17	11, 16	lmodvsubcl 19681	. . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋)
18	7, 9, 15, 17	syl3anc 1367	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋)
19		minvec.n	. . . . . . 7 ⊢ 𝑁 = (norm‘𝑈)
20	11, 19	nmcl 23227	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
21	4, 18, 20	syl2an2r 683	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ)
22	21	fmpttd 6881	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ)
23	22	frnd 6523	. . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ)
24	1, 23	eqsstrid 4017	. 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ)
25	12	lssn0 19714	. . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅)
26	10, 25	syl 17	. . 3 ⊢ (𝜑 → 𝑌 ≠ ∅)
27	1	eqeq1i 2828	. . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
28		dm0rn0 5797	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅)
29		fvex 6685	. . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V
30		eqid 2823	. . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))
31	29, 30	dmmpti 6494	. . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌
32	31	eqeq1i 2828	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅)
33	27, 28, 32	3bitr2i 301	. . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅)
34	33	necon3bii 3070	. . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅)
35	26, 34	sylibr 236	. 2 ⊢ (𝜑 → 𝑅 ≠ ∅)
36	11, 19	nmge0 23228	. . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
37	4, 18, 36	syl2an2r 683	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦)))
38	37	ralrimiva 3184	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
39	29	rgenw 3152	. . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V
40		breq2 5072	. . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦))))
41	30, 40	ralrnmptw 6862	. . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))))
42	39, 41	ax-mp 5	. . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))
43	38, 42	sylibr 236	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
44	1	raleqi 3415	. . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤)
45	43, 44	sylibr 236	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
46	24, 35, 45	3jca 1124	1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 Vcvv 3496 ⊆ wss 3938 ∅c0 4293 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ran crn 5558 ‘cfv 6357 (class class class)co 7158 ℝcr 10538 0cc0 10539 ≤ cle 10678 Basecbs 16485 ↾_s cress 16486 TopOpenctopn 16697 -_gcsg 18107 LModclmod 19636 LSubSpclss 19705 normcnm 23188 NrmGrpcngp 23189 ℂPreHilccph 23772 CMetSpccms 23937

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-n0 11901 df-z 11985 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-0g 16717 df-topgen 16719 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-grp 18108 df-minusg 18109 df-sbg 18110 df-lmod 19638 df-lss 19706 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-top 21504 df-topon 21521 df-topsp 21543 df-bases 21556 df-xms 22932 df-ms 22933 df-nm 23194 df-ngp 23195 df-nlm 23198 df-cph 23774

This theorem is referenced by: minveclem4c 24030 minveclem2 24031 minveclem3b 24033 minveclem4 24037 minveclem6 24039

W3C validator