| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > heiborlem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for heibor 38395. Since the sizes of the balls decrease exponentially, the sequence converges to zero. (Contributed by Jeff Madsen, 23-Jan-2014.) |
| Ref | Expression |
|---|---|
| heibor.1 | ⊢ 𝐽 = (MetOpen‘𝐷) |
| heibor.3 | ⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣} |
| heibor.4 | ⊢ 𝐺 = {〈𝑦, 𝑛〉 ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)} |
| heibor.5 | ⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚)))) |
| heibor.6 | ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋)) |
| heibor.7 | ⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin)) |
| heibor.8 | ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛)) |
| heibor.9 | ⊢ (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾)) |
| heibor.10 | ⊢ (𝜑 → 𝐶𝐺0) |
| heibor.11 | ⊢ 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))) |
| heibor.12 | ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉) |
| Ref | Expression |
|---|---|
| heiborlem7 | ⊢ ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3re 12321 | . . . . . . 7 ⊢ 3 ∈ ℝ | |
| 2 | 3pos 12349 | . . . . . . 7 ⊢ 0 < 3 | |
| 3 | 1, 2 | elrpii 13019 | . . . . . 6 ⊢ 3 ∈ ℝ+ |
| 4 | rpdivcl 13043 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 3 ∈ ℝ+) → (𝑟 / 3) ∈ ℝ+) | |
| 5 | 3, 4 | mpan2 703 | . . . . 5 ⊢ (𝑟 ∈ ℝ+ → (𝑟 / 3) ∈ ℝ+) |
| 6 | 2re 12315 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 7 | 1lt2 12413 | . . . . . 6 ⊢ 1 < 2 | |
| 8 | expnlbnd 14269 | . . . . . 6 ⊢ (((𝑟 / 3) ∈ ℝ+ ∧ 2 ∈ ℝ ∧ 1 < 2) → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) | |
| 9 | 6, 7, 8 | mp3an23 1479 | . . . . 5 ⊢ ((𝑟 / 3) ∈ ℝ+ → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) |
| 10 | 5, 9 | syl 18 | . . . 4 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) |
| 11 | 2nn 12314 | . . . . . . . . . . 11 ⊢ 2 ∈ ℕ | |
| 12 | nnnn0 12511 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0) | |
| 13 | nnexpcl 14110 | . . . . . . . . . . 11 ⊢ ((2 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (2↑𝑘) ∈ ℕ) | |
| 14 | 11, 12, 13 | sylancr 598 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℕ) |
| 15 | 14 | nnrpd 13058 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℝ+) |
| 16 | rpcn 13027 | . . . . . . . . . 10 ⊢ ((2↑𝑘) ∈ ℝ+ → (2↑𝑘) ∈ ℂ) | |
| 17 | rpne0 13033 | . . . . . . . . . 10 ⊢ ((2↑𝑘) ∈ ℝ+ → (2↑𝑘) ≠ 0) | |
| 18 | 3cn 12322 | . . . . . . . . . . 11 ⊢ 3 ∈ ℂ | |
| 19 | divrec 11888 | . . . . . . . . . . 11 ⊢ ((3 ∈ ℂ ∧ (2↑𝑘) ∈ ℂ ∧ (2↑𝑘) ≠ 0) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) | |
| 20 | 18, 19 | mp3an1 1474 | . . . . . . . . . 10 ⊢ (((2↑𝑘) ∈ ℂ ∧ (2↑𝑘) ≠ 0) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 21 | 16, 17, 20 | syl2anc 595 | . . . . . . . . 9 ⊢ ((2↑𝑘) ∈ ℝ+ → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 22 | 15, 21 | syl 18 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 23 | 22 | adantl 486 | . . . . . . 7 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 24 | 23 | breq1d 5121 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 / (2↑𝑘)) < 𝑟 ↔ (3 · (1 / (2↑𝑘))) < 𝑟)) |
| 25 | 14 | nnrecred 12287 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (1 / (2↑𝑘)) ∈ ℝ) |
| 26 | rpre 13025 | . . . . . . 7 ⊢ (𝑟 ∈ ℝ+ → 𝑟 ∈ ℝ) | |
| 27 | 1, 2 | pm3.2i 475 | . . . . . . . 8 ⊢ (3 ∈ ℝ ∧ 0 < 3) |
| 28 | ltmuldiv2 12089 | . . . . . . . 8 ⊢ (((1 / (2↑𝑘)) ∈ ℝ ∧ 𝑟 ∈ ℝ ∧ (3 ∈ ℝ ∧ 0 < 3)) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) | |
| 29 | 27, 28 | mp3an3 1476 | . . . . . . 7 ⊢ (((1 / (2↑𝑘)) ∈ ℝ ∧ 𝑟 ∈ ℝ) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 30 | 25, 26, 29 | syl2anr 608 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 31 | 24, 30 | bitrd 282 | . . . . 5 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 / (2↑𝑘)) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 32 | 31 | rexbidva 3193 | . . . 4 ⊢ (𝑟 ∈ ℝ+ → (∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟 ↔ ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 33 | 10, 32 | mpbird 260 | . . 3 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟) |
| 34 | fveq2 6882 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑆‘𝑛) = (𝑆‘𝑘)) | |
| 35 | oveq2 7419 | . . . . . . . . . 10 ⊢ (𝑛 = 𝑘 → (2↑𝑛) = (2↑𝑘)) | |
| 36 | 35 | oveq2d 7427 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (3 / (2↑𝑛)) = (3 / (2↑𝑘))) |
| 37 | 34, 36 | opeq12d 4848 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉 = 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) |
| 38 | heibor.12 | . . . . . . . 8 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉) | |
| 39 | opex 5446 | . . . . . . . 8 ⊢ 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉 ∈ V | |
| 40 | 37, 38, 39 | fvmpt 6990 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (𝑀‘𝑘) = 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) |
| 41 | 40 | fveq2d 6886 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (2nd ‘〈(𝑆‘𝑘), (3 / (2↑𝑘))〉)) |
| 42 | fvex 6895 | . . . . . . 7 ⊢ (𝑆‘𝑘) ∈ V | |
| 43 | ovex 7444 | . . . . . . 7 ⊢ (3 / (2↑𝑘)) ∈ V | |
| 44 | 42, 43 | op2nd 7995 | . . . . . 6 ⊢ (2nd ‘〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) = (3 / (2↑𝑘)) |
| 45 | 41, 44 | eqtrdi 2820 | . . . . 5 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (3 / (2↑𝑘))) |
| 46 | 45 | breq1d 5121 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ (3 / (2↑𝑘)) < 𝑟)) |
| 47 | 46 | rexbiia 3116 | . . 3 ⊢ (∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ ∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟) |
| 48 | 33, 47 | sylibr 237 | . 2 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟) |
| 49 | 48 | rgen 3087 | 1 ⊢ ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 {cab 2747 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ∩ cin 3910 ⊆ wss 3911 ifcif 4490 𝒫 cpw 4565 〈cop 4598 ∪ cuni 4874 ∪ ciun 4958 class class class wbr 5111 {copab 5175 ↦ cmpt 5194 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 2nd c2nd 7985 Fincfn 8943 ℂcc 11098 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 · cmul 11105 < clt 11243 − cmin 11441 / cdiv 11871 ℕcn 12233 2c2 12295 3c3 12296 ℕ0cn0 12504 ℝ+crp 13016 seqcseq 14037 ↑cexp 14097 ballcbl 21478 MetOpencmopn 21481 CMetccmet 25382 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-sup 9402 df-inf 9403 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-z 12592 df-uz 12863 df-rp 13017 df-fl 13825 df-seq 14038 df-exp 14098 |
| This theorem is referenced by: heiborlem8 38392 heiborlem9 38393 |
| Copyright terms: Public domain | W3C validator |