Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > heiborlem9 | Structured version Visualization version GIF version |
Description: Lemma for heibor 35101. Discharge the hypotheses of heiborlem8 35098 by applying caubl 23913 to get a convergent point and adding the open cover assumption. (Contributed by Jeff Madsen, 20-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↑𝑛))〉) |
heibor.13 | ⊢ (𝜑 → 𝑈 ⊆ 𝐽) |
heiborlem9.14 | ⊢ (𝜑 → ∪ 𝑈 = 𝑋) |
Ref | Expression |
---|---|
heiborlem9 | ⊢ (𝜑 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | heibor.6 | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋)) | |
2 | cmetmet 23891 | . . . . . . 7 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋)) | |
3 | metxmet 22946 | . . . . . . 7 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)) | |
4 | 1, 2, 3 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
5 | heibor.1 | . . . . . . 7 ⊢ 𝐽 = (MetOpen‘𝐷) | |
6 | 5 | mopntopon 23051 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋)) |
7 | 4, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
8 | heibor.3 | . . . . . . . . 9 ⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣} | |
9 | heibor.4 | . . . . . . . . 9 ⊢ 𝐺 = {〈𝑦, 𝑛〉 ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)} | |
10 | heibor.5 | . . . . . . . . 9 ⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚)))) | |
11 | heibor.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin)) | |
12 | heibor.8 | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛)) | |
13 | heibor.9 | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾)) | |
14 | heibor.10 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶𝐺0) | |
15 | heibor.11 | . . . . . . . . 9 ⊢ 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))) | |
16 | heibor.12 | . . . . . . . . 9 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ 〈(𝑆‘𝑛), (3 / (2↑𝑛))〉) | |
17 | 5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16 | heiborlem5 35095 | . . . . . . . 8 ⊢ (𝜑 → 𝑀:ℕ⟶(𝑋 × ℝ+)) |
18 | 5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16 | heiborlem6 35096 | . . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ ℕ ((ball‘𝐷)‘(𝑀‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝑀‘𝑘))) |
19 | 5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16 | heiborlem7 35097 | . . . . . . . . 9 ⊢ ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 |
20 | 19 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟) |
21 | 4, 17, 18, 20 | caubl 23913 | . . . . . . 7 ⊢ (𝜑 → (1st ∘ 𝑀) ∈ (Cau‘𝐷)) |
22 | 5 | cmetcau 23894 | . . . . . . 7 ⊢ ((𝐷 ∈ (CMet‘𝑋) ∧ (1st ∘ 𝑀) ∈ (Cau‘𝐷)) → (1st ∘ 𝑀) ∈ dom (⇝𝑡‘𝐽)) |
23 | 1, 21, 22 | syl2anc 586 | . . . . . 6 ⊢ (𝜑 → (1st ∘ 𝑀) ∈ dom (⇝𝑡‘𝐽)) |
24 | 5 | methaus 23132 | . . . . . . . 8 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Haus) |
25 | 4, 24 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Haus) |
26 | lmfun 21991 | . . . . . . 7 ⊢ (𝐽 ∈ Haus → Fun (⇝𝑡‘𝐽)) | |
27 | funfvbrb 6823 | . . . . . . 7 ⊢ (Fun (⇝𝑡‘𝐽) → ((1st ∘ 𝑀) ∈ dom (⇝𝑡‘𝐽) ↔ (1st ∘ 𝑀)(⇝𝑡‘𝐽)((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)))) | |
28 | 25, 26, 27 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → ((1st ∘ 𝑀) ∈ dom (⇝𝑡‘𝐽) ↔ (1st ∘ 𝑀)(⇝𝑡‘𝐽)((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)))) |
29 | 23, 28 | mpbid 234 | . . . . 5 ⊢ (𝜑 → (1st ∘ 𝑀)(⇝𝑡‘𝐽)((⇝𝑡‘𝐽)‘(1st ∘ 𝑀))) |
30 | lmcl 21907 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (1st ∘ 𝑀)(⇝𝑡‘𝐽)((⇝𝑡‘𝐽)‘(1st ∘ 𝑀))) → ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑋) | |
31 | 7, 29, 30 | syl2anc 586 | . . . 4 ⊢ (𝜑 → ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑋) |
32 | heiborlem9.14 | . . . 4 ⊢ (𝜑 → ∪ 𝑈 = 𝑋) | |
33 | 31, 32 | eleqtrrd 2918 | . . 3 ⊢ (𝜑 → ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ ∪ 𝑈) |
34 | eluni2 4844 | . . 3 ⊢ (((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ ∪ 𝑈 ↔ ∃𝑡 ∈ 𝑈 ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡) | |
35 | 33, 34 | sylib 220 | . 2 ⊢ (𝜑 → ∃𝑡 ∈ 𝑈 ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡) |
36 | 1 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝐷 ∈ (CMet‘𝑋)) |
37 | 11 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin)) |
38 | 12 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛)) |
39 | 13 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾)) |
40 | 14 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝐶𝐺0) |
41 | heibor.13 | . . . 4 ⊢ (𝜑 → 𝑈 ⊆ 𝐽) | |
42 | 41 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝑈 ⊆ 𝐽) |
43 | fvex 6685 | . . 3 ⊢ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ V | |
44 | simprr 771 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡) | |
45 | simprl 769 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝑡 ∈ 𝑈) | |
46 | 29 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → (1st ∘ 𝑀)(⇝𝑡‘𝐽)((⇝𝑡‘𝐽)‘(1st ∘ 𝑀))) |
47 | 5, 8, 9, 10, 36, 37, 38, 39, 40, 15, 16, 42, 43, 44, 45, 46 | heiborlem8 35098 | . 2 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑈 ∧ ((⇝𝑡‘𝐽)‘(1st ∘ 𝑀)) ∈ 𝑡)) → 𝜓) |
48 | 35, 47 | rexlimddv 3293 | 1 ⊢ (𝜑 → 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 {cab 2801 ∀wral 3140 ∃wrex 3141 ∩ cin 3937 ⊆ wss 3938 ifcif 4469 𝒫 cpw 4541 〈cop 4575 ∪ cuni 4840 ∪ ciun 4921 class class class wbr 5068 {copab 5130 ↦ cmpt 5148 dom cdm 5557 ∘ ccom 5561 Fun wfun 6351 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ∈ cmpo 7160 1st c1st 7689 2nd c2nd 7690 Fincfn 8511 0cc0 10539 1c1 10540 + caddc 10542 < clt 10677 − cmin 10872 / cdiv 11299 ℕcn 11640 2c2 11695 3c3 11696 ℕ0cn0 11900 ℝ+crp 12392 seqcseq 13372 ↑cexp 13432 ∞Metcxmet 20532 Metcmet 20533 ballcbl 20534 MetOpencmopn 20537 TopOnctopon 21520 ⇝𝑡clm 21836 Hauscha 21918 Cauccau 23858 CMetccmet 23859 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-er 8291 df-map 8410 df-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-ico 12747 df-icc 12748 df-fl 13165 df-seq 13373 df-exp 13433 df-rest 16698 df-topgen 16719 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-fbas 20544 df-fg 20545 df-top 21504 df-topon 21521 df-bases 21556 df-cld 21629 df-ntr 21630 df-cls 21631 df-nei 21708 df-lm 21839 df-haus 21925 df-fil 22456 df-fm 22548 df-flim 22549 df-flf 22550 df-cfil 23860 df-cau 23861 df-cmet 23862 |
This theorem is referenced by: heiborlem10 35100 |
Copyright terms: Public domain | W3C validator |