![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > minvecolem4c | Structured version Visualization version GIF version |
Description: Lemma for minveco 30913. 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 30903 | . . . 4 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
13 | 12 | simp1d 1141 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ ℝ) |
14 | 12 | simp2d 1142 | . . 3 ⊢ (𝜑 → 𝑅 ≠ ∅) |
15 | 0re 11261 | . . . 4 ⊢ 0 ∈ ℝ | |
16 | 12 | simp3d 1143 | . . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) |
17 | breq1 5151 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤)) | |
18 | 17 | ralbidv 3176 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)) |
19 | 18 | rspcev 3622 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
20 | 15, 16, 19 | sylancr 587 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) |
21 | infrecl 12248 | . . 3 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ) | |
22 | 13, 14, 20, 21 | syl3anc 1370 | . 2 ⊢ (𝜑 → inf(𝑅, ℝ, < ) ∈ ℝ) |
23 | 1, 22 | eqeltrid 2843 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∀wral 3059 ∃wrex 3068 ∩ cin 3962 ⊆ wss 3963 ∅c0 4339 class class class wbr 5148 ↦ cmpt 5231 ran crn 5690 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 infcinf 9479 ℝcr 11152 0cc0 11153 1c1 11154 + caddc 11156 < clt 11293 ≤ cle 11294 / cdiv 11918 ℕcn 12264 2c2 12319 ↑cexp 14099 MetOpencmopn 21372 BaseSetcba 30615 −𝑣 cnsb 30618 normCVcnmcv 30619 IndMetcims 30620 SubSpcss 30750 CPreHilOLDccphlo 30841 CBanccbn 30891 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9480 df-inf 9481 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-seq 14040 df-exp 14100 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-grpo 30522 df-gid 30523 df-ginv 30524 df-gdiv 30525 df-ablo 30574 df-vc 30588 df-nv 30621 df-va 30624 df-ba 30625 df-sm 30626 df-0v 30627 df-vs 30628 df-nmcv 30629 df-ssp 30751 df-ph 30842 df-cbn 30892 |
This theorem is referenced by: minvecolem4 30909 |
Copyright terms: Public domain | W3C validator |