Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lebnumlem2 | Structured version Visualization version GIF version |
Description: Lemma for lebnum 23495. As a finite sum of point-to-set distance functions, which are continuous by metdscn 23391, the function 𝐹 is also continuous. (Contributed by Mario Carneiro, 14-Feb-2015.) (Revised by AV, 30-Sep-2020.) |
Ref | Expression |
---|---|
lebnum.j | ⊢ 𝐽 = (MetOpen‘𝐷) |
lebnum.d | ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋)) |
lebnum.c | ⊢ (𝜑 → 𝐽 ∈ Comp) |
lebnum.s | ⊢ (𝜑 → 𝑈 ⊆ 𝐽) |
lebnum.u | ⊢ (𝜑 → 𝑋 = ∪ 𝑈) |
lebnumlem1.u | ⊢ (𝜑 → 𝑈 ∈ Fin) |
lebnumlem1.n | ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) |
lebnumlem1.f | ⊢ 𝐹 = (𝑦 ∈ 𝑋 ↦ Σ𝑘 ∈ 𝑈 inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) |
lebnumlem2.k | ⊢ 𝐾 = (topGen‘ran (,)) |
Ref | Expression |
---|---|
lebnumlem2 | ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lebnumlem1.f | . . . 4 ⊢ 𝐹 = (𝑦 ∈ 𝑋 ↦ Σ𝑘 ∈ 𝑈 inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) | |
2 | eqid 2818 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
3 | lebnum.d | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋)) | |
4 | metxmet 22871 | . . . . . . 7 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)) | |
5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
6 | lebnum.j | . . . . . . 7 ⊢ 𝐽 = (MetOpen‘𝐷) | |
7 | 6 | mopntopon 22976 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋)) |
8 | 5, 7 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
9 | lebnumlem1.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ Fin) | |
10 | 3 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐷 ∈ (Met‘𝑋)) |
11 | difssd 4106 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋 ∖ 𝑘) ⊆ 𝑋) | |
12 | 5 | adantr 481 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐷 ∈ (∞Met‘𝑋)) |
13 | 12, 7 | syl 17 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐽 ∈ (TopOn‘𝑋)) |
14 | lebnum.s | . . . . . . . . 9 ⊢ (𝜑 → 𝑈 ⊆ 𝐽) | |
15 | 14 | sselda 3964 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ∈ 𝐽) |
16 | toponss 21463 | . . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑘 ∈ 𝐽) → 𝑘 ⊆ 𝑋) | |
17 | 13, 15, 16 | syl2anc 584 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ⊆ 𝑋) |
18 | lebnumlem1.n | . . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) | |
19 | eleq1 2897 | . . . . . . . . . . 11 ⊢ (𝑘 = 𝑋 → (𝑘 ∈ 𝑈 ↔ 𝑋 ∈ 𝑈)) | |
20 | 19 | notbid 319 | . . . . . . . . . 10 ⊢ (𝑘 = 𝑋 → (¬ 𝑘 ∈ 𝑈 ↔ ¬ 𝑋 ∈ 𝑈)) |
21 | 18, 20 | syl5ibrcom 248 | . . . . . . . . 9 ⊢ (𝜑 → (𝑘 = 𝑋 → ¬ 𝑘 ∈ 𝑈)) |
22 | 21 | necon2ad 3028 | . . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ 𝑈 → 𝑘 ≠ 𝑋)) |
23 | 22 | imp 407 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝑘 ≠ 𝑋) |
24 | pssdifn0 4322 | . . . . . . 7 ⊢ ((𝑘 ⊆ 𝑋 ∧ 𝑘 ≠ 𝑋) → (𝑋 ∖ 𝑘) ≠ ∅) | |
25 | 17, 23, 24 | syl2anc 584 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑋 ∖ 𝑘) ≠ ∅) |
26 | eqid 2818 | . . . . . . 7 ⊢ (𝑦 ∈ 𝑋 ↦ inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) = (𝑦 ∈ 𝑋 ↦ inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) | |
27 | 26, 6, 2 | metdscn2 23392 | . . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝑋 ∖ 𝑘) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑘) ≠ ∅) → (𝑦 ∈ 𝑋 ↦ inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) ∈ (𝐽 Cn (TopOpen‘ℂfld))) |
28 | 10, 11, 25, 27 | syl3anc 1363 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑦 ∈ 𝑋 ↦ inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) ∈ (𝐽 Cn (TopOpen‘ℂfld))) |
29 | 2, 8, 9, 28 | fsumcn 23405 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ Σ𝑘 ∈ 𝑈 inf(ran (𝑧 ∈ (𝑋 ∖ 𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) ∈ (𝐽 Cn (TopOpen‘ℂfld))) |
30 | 1, 29 | eqeltrid 2914 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (TopOpen‘ℂfld))) |
31 | 2 | cnfldtopon 23318 | . . . . 5 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (TopOpen‘ℂfld) ∈ (TopOn‘ℂ)) |
33 | lebnum.c | . . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Comp) | |
34 | lebnum.u | . . . . . . 7 ⊢ (𝜑 → 𝑋 = ∪ 𝑈) | |
35 | 6, 3, 33, 14, 34, 9, 18, 1 | lebnumlem1 23492 | . . . . . 6 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ+) |
36 | 35 | frnd 6514 | . . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ+) |
37 | rpssre 12384 | . . . . 5 ⊢ ℝ+ ⊆ ℝ | |
38 | 36, 37 | sstrdi 3976 | . . . 4 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ) |
39 | ax-resscn 10582 | . . . . 5 ⊢ ℝ ⊆ ℂ | |
40 | 39 | a1i 11 | . . . 4 ⊢ (𝜑 → ℝ ⊆ ℂ) |
41 | cnrest2 21822 | . . . 4 ⊢ (((TopOpen‘ℂfld) ∈ (TopOn‘ℂ) ∧ ran 𝐹 ⊆ ℝ ∧ ℝ ⊆ ℂ) → (𝐹 ∈ (𝐽 Cn (TopOpen‘ℂfld)) ↔ 𝐹 ∈ (𝐽 Cn ((TopOpen‘ℂfld) ↾t ℝ)))) | |
42 | 32, 38, 40, 41 | syl3anc 1363 | . . 3 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn (TopOpen‘ℂfld)) ↔ 𝐹 ∈ (𝐽 Cn ((TopOpen‘ℂfld) ↾t ℝ)))) |
43 | 30, 42 | mpbid 233 | . 2 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn ((TopOpen‘ℂfld) ↾t ℝ))) |
44 | lebnumlem2.k | . . . 4 ⊢ 𝐾 = (topGen‘ran (,)) | |
45 | 2 | tgioo2 23338 | . . . 4 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) |
46 | 44, 45 | eqtri 2841 | . . 3 ⊢ 𝐾 = ((TopOpen‘ℂfld) ↾t ℝ) |
47 | 46 | oveq2i 7156 | . 2 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn ((TopOpen‘ℂfld) ↾t ℝ)) |
48 | 43, 47 | eleqtrrdi 2921 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∖ cdif 3930 ⊆ wss 3933 ∅c0 4288 ∪ cuni 4830 ↦ cmpt 5137 ran crn 5549 ‘cfv 6348 (class class class)co 7145 Fincfn 8497 infcinf 8893 ℂcc 10523 ℝcr 10524 ℝ*cxr 10662 < clt 10663 ℝ+crp 12377 (,)cioo 12726 Σcsu 15030 ↾t crest 16682 TopOpenctopn 16683 topGenctg 16699 ∞Metcxmet 20458 Metcmet 20459 MetOpencmopn 20463 ℂfldccnfld 20473 TopOnctopon 21446 Cn ccn 21760 Compccmp 21922 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 ax-addf 10604 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-er 8278 df-ec 8280 df-map 8397 df-ixp 8450 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-fi 8863 df-sup 8894 df-inf 8895 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-q 12337 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-ioo 12730 df-ico 12732 df-icc 12733 df-fz 12881 df-fzo 13022 df-seq 13358 df-exp 13418 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-sum 15031 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-mulr 16567 df-starv 16568 df-sca 16569 df-vsca 16570 df-ip 16571 df-tset 16572 df-ple 16573 df-ds 16575 df-unif 16576 df-hom 16577 df-cco 16578 df-rest 16684 df-topn 16685 df-0g 16703 df-gsum 16704 df-topgen 16705 df-pt 16706 df-prds 16709 df-xrs 16763 df-qtop 16768 df-imas 16769 df-xps 16771 df-mre 16845 df-mrc 16846 df-acs 16848 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-submnd 17945 df-mulg 18163 df-cntz 18385 df-cmn 18837 df-psmet 20465 df-xmet 20466 df-met 20467 df-bl 20468 df-mopn 20469 df-cnfld 20474 df-top 21430 df-topon 21447 df-topsp 21469 df-bases 21482 df-cld 21555 df-ntr 21556 df-cls 21557 df-cn 21763 df-cnp 21764 df-tx 22098 df-hmeo 22291 df-xms 22857 df-ms 22858 df-tms 22859 |
This theorem is referenced by: lebnumlem3 23494 |
Copyright terms: Public domain | W3C validator |