Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > minveclem1 | Structured version Visualization version GIF version |
Description: Lemma for minvec 23207. 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.) |
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 (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
Ref | Expression |
---|---|
minveclem1 | ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | minvec.r | . . 3 ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) | |
2 | minvec.u | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ℂPreHil) | |
3 | cphngp 22973 | . . . . . . . 8 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp) | |
4 | 2, 3 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ NrmGrp) |
5 | 4 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmGrp) |
6 | cphlmod 22974 | . . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod) | |
7 | 2, 6 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod) |
8 | 7 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod) |
9 | minvec.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
10 | 9 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋) |
11 | minvec.y | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈)) | |
12 | minvec.x | . . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈) | |
13 | eqid 2622 | . . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
14 | 12, 13 | lssss 18937 | . . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋) |
15 | 11, 14 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) |
16 | 15 | sselda 3603 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋) |
17 | minvec.m | . . . . . . . 8 ⊢ − = (-g‘𝑈) | |
18 | 12, 17 | lmodvsubcl 18908 | . . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋) |
19 | 8, 10, 16, 18 | syl3anc 1326 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋) |
20 | minvec.n | . . . . . . 7 ⊢ 𝑁 = (norm‘𝑈) | |
21 | 12, 20 | nmcl 22420 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
22 | 5, 19, 21 | syl2anc 693 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
23 | eqid 2622 | . . . . 5 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) | |
24 | 22, 23 | fmptd 6385 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ) |
25 | frn 6053 | . . . 4 ⊢ ((𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ) | |
26 | 24, 25 | syl 17 | . . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ) |
27 | 1, 26 | syl5eqss 3649 | . 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
28 | 13 | lssn0 18941 | . . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅) |
29 | 11, 28 | syl 17 | . . 3 ⊢ (𝜑 → 𝑌 ≠ ∅) |
30 | 1 | eqeq1i 2627 | . . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) |
31 | dm0rn0 5342 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) | |
32 | fvex 6201 | . . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V | |
33 | 32, 23 | dmmpti 6023 | . . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌 |
34 | 33 | eqeq1i 2627 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅) |
35 | 30, 31, 34 | 3bitr2i 288 | . . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅) |
36 | 35 | necon3bii 2846 | . . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅) |
37 | 29, 36 | sylibr 224 | . 2 ⊢ (𝜑 → 𝑅 ≠ ∅) |
38 | 12, 20 | nmge0 22421 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
39 | 5, 19, 38 | syl2anc 693 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
40 | 39 | ralrimiva 2966 | . . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
41 | 32 | rgenw 2924 | . . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V |
42 | breq2 4657 | . . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦)))) | |
43 | 23, 42 | ralrnmpt 6368 | . . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))) |
44 | 41, 43 | ax-mp 5 | . . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
45 | 40, 44 | sylibr 224 | . . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤) |
46 | 1 | raleqi 3142 | . . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤) |
47 | 45, 46 | sylibr 224 | . 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
48 | 27, 37, 47 | 3jca 1242 | 1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 Vcvv 3200 ⊆ wss 3574 ∅c0 3915 class class class wbr 4653 ↦ cmpt 4729 dom cdm 5114 ran crn 5115 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ℝcr 9935 0cc0 9936 ≤ cle 10075 Basecbs 15857 ↾s cress 15858 TopOpenctopn 16082 -gcsg 17424 LModclmod 18863 LSubSpclss 18932 normcnm 22381 NrmGrpcngp 22382 ℂPreHilccph 22966 CMetSpccms 23129 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-n0 11293 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-0g 16102 df-topgen 16104 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-grp 17425 df-minusg 17426 df-sbg 17427 df-lmod 18865 df-lss 18933 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-xms 22125 df-ms 22126 df-nm 22387 df-ngp 22388 df-nlm 22391 df-cph 22968 |
This theorem is referenced by: minveclem4c 23196 minveclem2 23197 minveclem3b 23199 minveclem4 23203 minveclem6 23205 |
Copyright terms: Public domain | W3C validator |