| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > minveclem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for minvec 25486. 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 25223 | . . . . . . 7 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ NrmGrp) | |
| 4 | 2, 3 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ NrmGrp) |
| 5 | cphlmod 25224 | . . . . . . . . 9 ⊢ (𝑈 ∈ ℂPreHil → 𝑈 ∈ LMod) | |
| 6 | 2, 5 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 7 | 6 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ LMod) |
| 8 | minvec.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 9 | 8 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋) |
| 10 | minvec.y | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈)) | |
| 11 | minvec.x | . . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑈) | |
| 12 | eqid 2761 | . . . . . . . . . 10 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
| 13 | 11, 12 | lssss 20991 | . . . . . . . . 9 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ⊆ 𝑋) |
| 14 | 10, 13 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) |
| 15 | 14 | sselda 3934 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋) |
| 16 | minvec.m | . . . . . . . 8 ⊢ − = (-g‘𝑈) | |
| 17 | 11, 16 | lmodvsubcl 20962 | . . . . . . 7 ⊢ ((𝑈 ∈ LMod ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴 − 𝑦) ∈ 𝑋) |
| 18 | 7, 9, 15, 17 | syl3anc 1389 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝐴 − 𝑦) ∈ 𝑋) |
| 19 | minvec.n | . . . . . . 7 ⊢ 𝑁 = (norm‘𝑈) | |
| 20 | 11, 19 | nmcl 24664 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
| 21 | 4, 18, 20 | syl2an2r 695 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴 − 𝑦)) ∈ ℝ) |
| 22 | 21 | fmpttd 7091 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))):𝑌⟶ℝ) |
| 23 | 22 | frnd 6695 | . . 3 ⊢ (𝜑 → ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) ⊆ ℝ) |
| 24 | 1, 23 | eqsstrid 3972 | . 2 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
| 25 | 12 | lssn0 20995 | . . . 4 ⊢ (𝑌 ∈ (LSubSp‘𝑈) → 𝑌 ≠ ∅) |
| 26 | 10, 25 | syl 17 | . . 3 ⊢ (𝜑 → 𝑌 ≠ ∅) |
| 27 | 1 | eqeq1i 2766 | . . . . 5 ⊢ (𝑅 = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) |
| 28 | dm0rn0 5896 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅) | |
| 29 | fvex 6875 | . . . . . . 7 ⊢ (𝑁‘(𝐴 − 𝑦)) ∈ V | |
| 30 | eqid 2761 | . . . . . . 7 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) | |
| 31 | 29, 30 | dmmpti 6660 | . . . . . 6 ⊢ dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = 𝑌 |
| 32 | 31 | eqeq1i 2766 | . . . . 5 ⊢ (dom (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) = ∅ ↔ 𝑌 = ∅) |
| 33 | 27, 28, 32 | 3bitr2i 301 | . . . 4 ⊢ (𝑅 = ∅ ↔ 𝑌 = ∅) |
| 34 | 33 | necon3bii 3008 | . . 3 ⊢ (𝑅 ≠ ∅ ↔ 𝑌 ≠ ∅) |
| 35 | 26, 34 | sylibr 236 | . 2 ⊢ (𝜑 → 𝑅 ≠ ∅) |
| 36 | 11, 19 | nmge0 24665 | . . . . . 6 ⊢ ((𝑈 ∈ NrmGrp ∧ (𝐴 − 𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 37 | 4, 18, 36 | syl2an2r 695 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 38 | 37 | ralrimiva 3153 | . . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑌 0 ≤ (𝑁‘(𝐴 − 𝑦))) |
| 39 | 29 | rgenw 3079 | . . . . 5 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑦)) ∈ V |
| 40 | breq2 5101 | . . . . . 6 ⊢ (𝑤 = (𝑁‘(𝐴 − 𝑦)) → (0 ≤ 𝑤 ↔ 0 ≤ (𝑁‘(𝐴 − 𝑦)))) | |
| 41 | 30, 40 | ralrnmptw 7070 | . . . . 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 3317 | . . 3 ⊢ (∀𝑤 ∈ 𝑅 0 ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦)))0 ≤ 𝑤) |
| 45 | 43, 44 | sylibr 236 | . 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
| 46 | 24, 35, 45 | 3jca 1140 | 1 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 Vcvv 3453 ⊆ wss 3902 ∅c0 4283 class class class wbr 5097 ↦ cmpt 5178 dom cdm 5643 ran crn 5644 ‘cfv 6516 (class class class)co 7391 ℝcr 11066 0cc0 11067 ≤ cle 11211 Basecbs 17236 ↾s cress 17257 TopOpenctopn 17441 -gcsg 18968 LModclmod 20915 LSubSpclss 20986 normcnm 24624 NrmGrpcngp 24625 ℂPreHilccph 25216 CMetSpccms 25382 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9382 df-inf 9383 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-n0 12476 df-z 12563 df-uz 12834 df-q 12944 df-rp 12988 df-xneg 13108 df-xadd 13109 df-xmul 13110 df-0g 17461 df-topgen 17463 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-grp 18969 df-minusg 18970 df-sbg 18971 df-lmod 20917 df-lss 20987 df-psmet 21404 df-xmet 21405 df-met 21406 df-bl 21407 df-mopn 21408 df-top 22942 df-topon 22959 df-topsp 22981 df-bases 22994 df-xms 24368 df-ms 24369 df-nm 24630 df-ngp 24631 df-nlm 24634 df-cph 25218 |
| This theorem is referenced by: minveclem4c 25475 minveclem2 25476 minveclem3b 25478 minveclem4 25482 minveclem6 25484 |
| Copyright terms: Public domain | W3C validator |