| 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 37991. 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 12227 | . . . . . . 7 ⊢ 3 ∈ ℝ | |
| 2 | 3pos 12252 | . . . . . . 7 ⊢ 0 < 3 | |
| 3 | 1, 2 | elrpii 12910 | . . . . . 6 ⊢ 3 ∈ ℝ+ |
| 4 | rpdivcl 12934 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 3 ∈ ℝ+) → (𝑟 / 3) ∈ ℝ+) | |
| 5 | 3, 4 | mpan2 692 | . . . . 5 ⊢ (𝑟 ∈ ℝ+ → (𝑟 / 3) ∈ ℝ+) |
| 6 | 2re 12221 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 7 | 1lt2 12313 | . . . . . 6 ⊢ 1 < 2 | |
| 8 | expnlbnd 14158 | . . . . . 6 ⊢ (((𝑟 / 3) ∈ ℝ+ ∧ 2 ∈ ℝ ∧ 1 < 2) → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) | |
| 9 | 6, 7, 8 | mp3an23 1456 | . . . . 5 ⊢ ((𝑟 / 3) ∈ ℝ+ → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) |
| 10 | 5, 9 | syl 17 | . . . 4 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3)) |
| 11 | 2nn 12220 | . . . . . . . . . . 11 ⊢ 2 ∈ ℕ | |
| 12 | nnnn0 12410 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0) | |
| 13 | nnexpcl 13999 | . . . . . . . . . . 11 ⊢ ((2 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (2↑𝑘) ∈ ℕ) | |
| 14 | 11, 12, 13 | sylancr 588 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℕ) |
| 15 | 14 | nnrpd 12949 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℝ+) |
| 16 | rpcn 12918 | . . . . . . . . . 10 ⊢ ((2↑𝑘) ∈ ℝ+ → (2↑𝑘) ∈ ℂ) | |
| 17 | rpne0 12924 | . . . . . . . . . 10 ⊢ ((2↑𝑘) ∈ ℝ+ → (2↑𝑘) ≠ 0) | |
| 18 | 3cn 12228 | . . . . . . . . . . 11 ⊢ 3 ∈ ℂ | |
| 19 | divrec 11814 | . . . . . . . . . . 11 ⊢ ((3 ∈ ℂ ∧ (2↑𝑘) ∈ ℂ ∧ (2↑𝑘) ≠ 0) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) | |
| 20 | 18, 19 | mp3an1 1451 | . . . . . . . . . 10 ⊢ (((2↑𝑘) ∈ ℂ ∧ (2↑𝑘) ≠ 0) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 21 | 16, 17, 20 | syl2anc 585 | . . . . . . . . 9 ⊢ ((2↑𝑘) ∈ ℝ+ → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 22 | 15, 21 | syl 17 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 23 | 22 | adantl 481 | . . . . . . 7 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → (3 / (2↑𝑘)) = (3 · (1 / (2↑𝑘)))) |
| 24 | 23 | breq1d 5107 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 / (2↑𝑘)) < 𝑟 ↔ (3 · (1 / (2↑𝑘))) < 𝑟)) |
| 25 | 14 | nnrecred 12198 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (1 / (2↑𝑘)) ∈ ℝ) |
| 26 | rpre 12916 | . . . . . . 7 ⊢ (𝑟 ∈ ℝ+ → 𝑟 ∈ ℝ) | |
| 27 | 1, 2 | pm3.2i 470 | . . . . . . . 8 ⊢ (3 ∈ ℝ ∧ 0 < 3) |
| 28 | ltmuldiv2 12018 | . . . . . . . 8 ⊢ (((1 / (2↑𝑘)) ∈ ℝ ∧ 𝑟 ∈ ℝ ∧ (3 ∈ ℝ ∧ 0 < 3)) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) | |
| 29 | 27, 28 | mp3an3 1453 | . . . . . . 7 ⊢ (((1 / (2↑𝑘)) ∈ ℝ ∧ 𝑟 ∈ ℝ) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 30 | 25, 26, 29 | syl2anr 598 | . . . . . 6 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 · (1 / (2↑𝑘))) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 31 | 24, 30 | bitrd 279 | . . . . 5 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑘 ∈ ℕ) → ((3 / (2↑𝑘)) < 𝑟 ↔ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 32 | 31 | rexbidva 3157 | . . . 4 ⊢ (𝑟 ∈ ℝ+ → (∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟 ↔ ∃𝑘 ∈ ℕ (1 / (2↑𝑘)) < (𝑟 / 3))) |
| 33 | 10, 32 | mpbird 257 | . . 3 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟) |
| 34 | fveq2 6833 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑆‘𝑛) = (𝑆‘𝑘)) | |
| 35 | oveq2 7366 | . . . . . . . . . 10 ⊢ (𝑛 = 𝑘 → (2↑𝑛) = (2↑𝑘)) | |
| 36 | 35 | oveq2d 7374 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (3 / (2↑𝑛)) = (3 / (2↑𝑘))) |
| 37 | 34, 36 | opeq12d 4836 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉 = 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) |
| 38 | heibor.12 | . . . . . . . 8 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉) | |
| 39 | opex 5411 | . . . . . . . 8 ⊢ 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉 ∈ V | |
| 40 | 37, 38, 39 | fvmpt 6940 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ → (𝑀‘𝑘) = 〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) |
| 41 | 40 | fveq2d 6837 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (2nd ‘〈(𝑆‘𝑘), (3 / (2↑𝑘))〉)) |
| 42 | fvex 6846 | . . . . . . 7 ⊢ (𝑆‘𝑘) ∈ V | |
| 43 | ovex 7391 | . . . . . . 7 ⊢ (3 / (2↑𝑘)) ∈ V | |
| 44 | 42, 43 | op2nd 7942 | . . . . . 6 ⊢ (2nd ‘〈(𝑆‘𝑘), (3 / (2↑𝑘))〉) = (3 / (2↑𝑘)) |
| 45 | 41, 44 | eqtrdi 2786 | . . . . 5 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (3 / (2↑𝑘))) |
| 46 | 45 | breq1d 5107 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ (3 / (2↑𝑘)) < 𝑟)) |
| 47 | 46 | rexbiia 3080 | . . 3 ⊢ (∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ ∃𝑘 ∈ ℕ (3 / (2↑𝑘)) < 𝑟) |
| 48 | 33, 47 | sylibr 234 | . 2 ⊢ (𝑟 ∈ ℝ+ → ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟) |
| 49 | 48 | rgen 3052 | 1 ⊢ ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {cab 2713 ≠ wne 2931 ∀wral 3050 ∃wrex 3059 ∩ cin 3899 ⊆ wss 3900 ifcif 4478 𝒫 cpw 4553 〈cop 4585 ∪ cuni 4862 ∪ ciun 4945 class class class wbr 5097 {copab 5159 ↦ cmpt 5178 ⟶wf 6487 ‘cfv 6491 (class class class)co 7358 ∈ cmpo 7360 2nd c2nd 7932 Fincfn 8885 ℂcc 11026 ℝcr 11027 0cc0 11028 1c1 11029 + caddc 11031 · cmul 11033 < clt 11168 − cmin 11366 / cdiv 11796 ℕcn 12147 2c2 12202 3c3 12203 ℕ0cn0 12403 ℝ+crp 12907 seqcseq 13926 ↑cexp 13986 ballcbl 21298 MetOpencmopn 21301 CMetccmet 25212 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-sup 9347 df-inf 9348 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-fl 13714 df-seq 13927 df-exp 13987 |
| This theorem is referenced by: heiborlem8 37988 heiborlem9 37989 |
| Copyright terms: Public domain | W3C validator |