| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > minveclem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for minvec 25413. 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 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ ℂPreHil) | |
| 3 | cphngp 25150 | . . . . . . 7 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp) | |
| 4 | 2, 3 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ NrmGrp) |
| 5 | cphlmod 25151 | . . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod) | |
| 6 | 2, 5 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod) |
| 8 | minvec.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 9 | 8 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋) |
| 10 | minvec.y | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈)) | |
| 11 | minvec.x | . . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈) | |
| 12 | eqid 2737 | . . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
| 13 | 11, 12 | lssss 20922 | . . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋) |
| 14 | 10, 13 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) |
| 15 | 14 | sselda 3922 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋) |
| 16 | minvec.m | . . . . . . . 8 ⊢ − = (-g‘𝑈) | |
| 17 | 11, 16 | lmodvsubcl 20893 | . . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋) |
| 18 | 7, 9, 15, 17 | syl3anc 1374 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋) |
| 19 | minvec.n | . . . . . . 7 ⊢ 𝑁 = (norm‘𝑈) | |
| 20 | 11, 19 | nmcl 24591 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
| 21 | 4, 18, 20 | syl2an2r 686 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
| 22 | 21 | fmpttd 7061 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ) |
| 23 | 22 | frnd 6670 | . . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ) |
| 24 | 1, 23 | eqsstrid 3961 | . 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
| 25 | 12 | lssn0 20926 | . . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅) |
| 26 | 10, 25 | syl 17 | . . 3 ⊢ (𝜑 → 𝑌 ≠ ∅) |
| 27 | 1 | eqeq1i 2742 | . . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) |
| 28 | dm0rn0 5873 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) | |
| 29 | fvex 6847 | . . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V | |
| 30 | eqid 2737 | . . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) | |
| 31 | 29, 30 | dmmpti 6636 | . . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌 |
| 32 | 31 | eqeq1i 2742 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅) |
| 33 | 27, 28, 32 | 3bitr2i 299 | . . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅) |
| 34 | 33 | necon3bii 2985 | . . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅) |
| 35 | 26, 34 | sylibr 234 | . 2 ⊢ (𝜑 → 𝑅 ≠ ∅) |
| 36 | 11, 19 | nmge0 24592 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 37 | 4, 18, 36 | syl2an2r 686 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 38 | 37 | ralrimiva 3130 | . . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 39 | 29 | rgenw 3056 | . . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V |
| 40 | breq2 5090 | . . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦)))) | |
| 41 | 30, 40 | ralrnmptw 7040 | . . . . 5 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦)))) |
| 42 | 39, 41 | ax-mp 5 | . . . 4 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 43 | 38, 42 | sylibr 234 | . . 3 ⊢ (𝜑 → ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤) |
| 44 | 1 | raleqi 3294 | . . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤) |
| 45 | 43, 44 | sylibr 234 | . 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
| 46 | 24, 35, 45 | 3jca 1129 | 1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 Vcvv 3430 ⊆ wss 3890 ∅c0 4274 class class class wbr 5086 ↦ cmpt 5167 dom cdm 5624 ran crn 5625 ‘cfv 6492 (class class class)co 7360 ℝcr 11028 0cc0 11029 ≤ cle 11171 Basecbs 17170 ↾s cress 17191 TopOpenctopn 17375 -gcsg 18902 LModclmod 20846 LSubSpclss 20917 normcnm 24551 NrmGrpcngp 24552 ℂPreHilccph 25143 CMetSpccms 25309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-q 12890 df-rp 12934 df-xneg 13054 df-xadd 13055 df-xmul 13056 df-0g 17395 df-topgen 17397 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-lmod 20848 df-lss 20918 df-psmet 21336 df-xmet 21337 df-met 21338 df-bl 21339 df-mopn 21340 df-top 22869 df-topon 22886 df-topsp 22908 df-bases 22921 df-xms 24295 df-ms 24296 df-nm 24557 df-ngp 24558 df-nlm 24561 df-cph 25145 |
| This theorem is referenced by: minveclem4c 25402 minveclem2 25403 minveclem3b 25405 minveclem4 25409 minveclem6 25411 |
| Copyright terms: Public domain | W3C validator |