minvecolem1 - Metamath Proof Explorer

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

Theorem minvecolem1 31476

Description: Lemma for minveco 31486. The set of all distances from points of 𝑌 to 𝐴 are a nonempty set of nonnegative reals. (Contributed by Mario Carneiro, 8-May-2014.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
minveco.x	⊢ 𝑋 = (BaseSet‘𝑈)
minveco.m	⊢ 𝑀 = ( −_𝑣 ‘𝑈)
minveco.n	⊢ 𝑁 = (norm_CV‘𝑈)
minveco.y	⊢ 𝑌 = (BaseSet‘𝑊)
minveco.u	⊢ (𝜑 → 𝑈 ∈ CPreHil_OLD)
minveco.w	⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
minveco.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
minveco.d	⊢ 𝐷 = (IndMet‘𝑈)
minveco.j	⊢ 𝐽 = (MetOpen‘𝐷)
minveco.r	⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))

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

Distinct variable groups: 𝑦,𝑤,𝐽 𝑤,𝑀,𝑦 𝑤,𝑁,𝑦 𝜑,𝑤,𝑦 𝑤,𝑅 𝑤,𝐴,𝑦 𝑤,𝐷,𝑦 𝑤,𝑈,𝑦 𝑤,𝑊,𝑦 𝑤,𝑋 𝑤,𝑌,𝑦 Allowed substitution hints: 𝑅(𝑦) 𝑋(𝑦)

**Proof of Theorem minvecolem1**
Step	Hyp	Ref	Expression
1		minveco.r	. . 3 ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
2		minveco.u	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ CPreHil_OLD)
3		phnv 31416	. . . . . . . 8 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
4	2, 3	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ NrmCVec)
5	4	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmCVec)
6		minveco.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
7	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
8		minveco.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
9		elin 3915	. . . . . . . . . . 11 ⊢ (𝑊 ∈ ((SubSp‘𝑈) ∩ CBan) ↔ (𝑊 ∈ (SubSp‘𝑈) ∧ 𝑊 ∈ CBan))
10	8, 9	sylib 221	. . . . . . . . . 10 ⊢ (𝜑 → (𝑊 ∈ (SubSp‘𝑈) ∧ 𝑊 ∈ CBan))
11	10	simpld 500	. . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ (SubSp‘𝑈))
12		minveco.x	. . . . . . . . . 10 ⊢ 𝑋 = (BaseSet‘𝑈)
13		minveco.y	. . . . . . . . . 10 ⊢ 𝑌 = (BaseSet‘𝑊)
14		eqid 2761	. . . . . . . . . 10 ⊢ (SubSp‘𝑈) = (SubSp‘𝑈)
15	12, 13, 14	sspba 31329	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ (SubSp‘𝑈)) → 𝑌 ⊆ 𝑋)
16	4, 11, 15	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
17	16	sselda 3931	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
18		minveco.m	. . . . . . . 8 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
19	12, 18	nvmcl 31248	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝑀𝑦) ∈ 𝑋)
20	5, 7, 17, 19	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴𝑀𝑦) ∈ 𝑋)
21		minveco.n	. . . . . . 7 ⊢ 𝑁 = (norm_CV‘𝑈)
22	12, 21	nvcl 31263	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
23	5, 20, 22	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
24	23	fmpttd 7115	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))):𝑌⟶ℝ)
25	24	frnd 6718	. . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) ⊆ ℝ)
26	1, 25	eqsstrid 3969	. 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ)
27	10	simprd 501	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ CBan)
28		bnnv 31468	. . . . . 6 ⊢ (𝑊 ∈ CBan → 𝑊 ∈ NrmCVec)
29		eqid 2761	. . . . . . 7 ⊢ (0_vec‘𝑊) = (0_vec‘𝑊)
30	13, 29	nvzcl 31236	. . . . . 6 ⊢ (𝑊 ∈ NrmCVec → (0_vec‘𝑊) ∈ 𝑌)
31	27, 28, 30	3syl 19	. . . . 5 ⊢ (𝜑 → (0_vec‘𝑊) ∈ 𝑌)
32		fvex 6898	. . . . . 6 ⊢ (𝑁‘(𝐴𝑀𝑦)) ∈ V
33		eqid 2761	. . . . . 6 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
34	32, 33	dmmpti 6683	. . . . 5 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = 𝑌
35	31, 34	eleqtrrdi 2872	. . . 4 ⊢ (𝜑 → (0_vec‘𝑊) ∈ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))))
36	35	ne0d 4288	. . 3 ⊢ (𝜑 → dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) ≠ ∅)
37		dm0rn0 5906	. . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = ∅)
38	1	eqeq1i 2766	. . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = ∅)
39	37, 38	bitr4i 281	. . . 4 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = ∅ ↔ 𝑅 = ∅)
40	39	necon3bii 3008	. . 3 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) ≠ ∅ ↔ 𝑅 ≠ ∅)
41	36, 40	sylib 221	. 2 ⊢ (𝜑 → 𝑅 ≠ ∅)
42	12, 21	nvge0 31275	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
43	5, 20, 42	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
44	43	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
45	32	rgenw 3081	. . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V
46		breq2 5107	. . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴𝑀𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴𝑀𝑦))))
47	33, 46	ralrnmptw 7094	. . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴𝑀𝑦))))
48	45, 47	ax-mp 5	. . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
49	44, 48	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))0 ≤ 𝑤)
50	1	raleqi 3318	. . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))0 ≤ 𝑤)
51	49, 50	sylibr 237	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
52	26, 41, 51	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 2956 ∀wral 3077 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 ran crn 5652 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 0cc0 11200 ≤ cle 11344 MetOpencmopn 21668 NrmCVeccnv 31186 BaseSetcba 31188 0_veccn0v 31190 −_𝑣 cnsb 31191 norm_CVcnmcv 31192 IndMetcims 31193 SubSpcss 31323 CPreHil_OLDccphlo 31414 CBanccbn 31464

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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9434 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-grpo 31095 df-gid 31096 df-ginv 31097 df-gdiv 31098 df-ablo 31147 df-vc 31161 df-nv 31194 df-va 31197 df-ba 31198 df-sm 31199 df-0v 31200 df-vs 31201 df-nmcv 31202 df-ssp 31324 df-ph 31415 df-cbn 31465

This theorem is used by: minvecolem2 31477 minvecolem3 31478 minvecolem4c 31481 minvecolem4 31482 minvecolem5 31483 minvecolem6 31484

W3C validator