Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > minvecolem4c | Structured version Visualization version GIF version |
Description: Lemma for minveco 28937. The infimum of the distances to 𝐴 is a real number. (Contributed by Mario Carneiro, 16-Jun-2014.) (Revised by AV, 4-Oct-2020.) (New usage is discouraged.) |
Ref | Expression |
---|---|
minveco.x | ⊢ 𝑋 = (BaseSet‘𝑈) |
minveco.m | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
minveco.n | ⊢ 𝑁 = (normCV‘𝑈) |
minveco.y | ⊢ 𝑌 = (BaseSet‘𝑊) |
minveco.u | ⊢ (𝜑 → 𝑈 ∈ CPreHilOLD) |
minveco.w | ⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan)) |
minveco.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
minveco.d | ⊢ 𝐷 = (IndMet‘𝑈) |
minveco.j | ⊢ 𝐽 = (MetOpen‘𝐷) |
minveco.r | ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) |
minveco.s | ⊢ 𝑆 = inf(𝑅, ℝ, < ) |
minveco.f | ⊢ (𝜑 → 𝐹:ℕ⟶𝑌) |
minveco.1 | ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐴𝐷(𝐹‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))) |
Ref | Expression |
---|---|
minvecolem4c | ⊢ (𝜑 → 𝑆 ∈ ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | minveco.s | . 2 ⊢ 𝑆 = inf(𝑅, ℝ, < ) | |
2 | minveco.x | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
3 | minveco.m | . . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
4 | minveco.n | . . . . 5 ⊢ 𝑁 = (normCV‘𝑈) | |
5 | minveco.y | . . . . 5 ⊢ 𝑌 = (BaseSet‘𝑊) | |
6 | minveco.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ CPreHilOLD) | |
7 | minveco.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan)) | |
8 | minveco.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
9 | minveco.d | . . . . 5 ⊢ 𝐷 = (IndMet‘𝑈) | |
10 | minveco.j | . . . . 5 ⊢ 𝐽 = (MetOpen‘𝐷) | |
11 | minveco.r | . . . . 5 ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) | |
12 | 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | minvecolem1 28927 | . . . 4 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
13 | 12 | simp1d 1144 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
14 | 12 | simp2d 1145 | . . 3 ⊢ (𝜑 → 𝑅 ≠ ∅) |
15 | 0re 10818 | . . . 4 ⊢ 0 ∈ ℝ | |
16 | 12 | simp3d 1146 | . . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
17 | breq1 5046 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤)) | |
18 | 17 | ralbidv 3111 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
19 | 18 | rspcev 3530 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
20 | 15, 16, 19 | sylancr 590 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
21 | infrecl 11797 | . . 3 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ) | |
22 | 13, 14, 20, 21 | syl3anc 1373 | . 2 ⊢ (𝜑 → inf(𝑅, ℝ, < ) ∈ ℝ) |
23 | 1, 22 | eqeltrid 2838 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 ≠ wne 2935 ∀wral 3054 ∃wrex 3055 ∩ cin 3856 ⊆ wss 3857 ∅c0 4227 class class class wbr 5043 ↦ cmpt 5124 ran crn 5541 ⟶wf 6365 ‘cfv 6369 (class class class)co 7202 infcinf 9046 ℝcr 10711 0cc0 10712 1c1 10713 + caddc 10715 < clt 10850 ≤ cle 10851 / cdiv 11472 ℕcn 11813 2c2 11868 ↑cexp 13618 MetOpencmopn 20325 BaseSetcba 28639 −𝑣 cnsb 28642 normCVcnmcv 28643 IndMetcims 28644 SubSpcss 28774 CPreHilOLDccphlo 28865 CBanccbn 28915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 ax-pre-sup 10790 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-er 8380 df-en 8616 df-dom 8617 df-sdom 8618 df-sup 9047 df-inf 9048 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-div 11473 df-nn 11814 df-2 11876 df-3 11877 df-n0 12074 df-z 12160 df-uz 12422 df-rp 12570 df-seq 13558 df-exp 13619 df-cj 14645 df-re 14646 df-im 14647 df-sqrt 14781 df-abs 14782 df-grpo 28546 df-gid 28547 df-ginv 28548 df-gdiv 28549 df-ablo 28598 df-vc 28612 df-nv 28645 df-va 28648 df-ba 28649 df-sm 28650 df-0v 28651 df-vs 28652 df-nmcv 28653 df-ssp 28775 df-ph 28866 df-cbn 28916 |
This theorem is referenced by: minvecolem4 28933 |
Copyright terms: Public domain | W3C validator |