Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > minvecolem4c | Structured version Visualization version GIF version |
Description: Lemma for minveco 27124. 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 27114 | . . . 4 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
13 | 12 | simp1d 1066 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
14 | 12 | simp2d 1067 | . . 3 ⊢ (𝜑 → 𝑅 ≠ ∅) |
15 | 0re 9919 | . . . 4 ⊢ 0 ∈ ℝ | |
16 | 12 | simp3d 1068 | . . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
17 | breq1 4586 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤)) | |
18 | 17 | ralbidv 2969 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
19 | 18 | rspcev 3282 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
20 | 15, 16, 19 | sylancr 694 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
21 | infrecl 10882 | . . 3 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ) | |
22 | 13, 14, 20, 21 | syl3anc 1318 | . 2 ⊢ (𝜑 → inf(𝑅, ℝ, < ) ∈ ℝ) |
23 | 1, 22 | syl5eqel 2692 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 ∃wrex 2897 ∩ cin 3539 ⊆ wss 3540 ∅c0 3874 class class class wbr 4583 ↦ cmpt 4643 ran crn 5039 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 infcinf 8230 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 < clt 9953 ≤ cle 9954 / cdiv 10563 ℕcn 10897 2c2 10947 ↑cexp 12722 MetOpencmopn 19557 BaseSetcba 26825 −𝑣 cnsb 26828 normCVcnmcv 26829 IndMetcims 26830 SubSpcss 26960 CPreHilOLDccphlo 27051 CBanccbn 27102 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-inf 8232 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-seq 12664 df-exp 12723 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-grpo 26731 df-gid 26732 df-ginv 26733 df-gdiv 26734 df-ablo 26783 df-vc 26798 df-nv 26831 df-va 26834 df-ba 26835 df-sm 26836 df-0v 26837 df-vs 26838 df-nmcv 26839 df-ssp 26961 df-ph 27052 df-cbn 27103 |
This theorem is referenced by: minvecolem4 27120 |
Copyright terms: Public domain | W3C validator |