| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > metnrmlem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for metnrm 25237. (Contributed by Mario Carneiro, 14-Jan-2014.) (Revised by Mario Carneiro, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| metdscn.f | ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) |
| metdscn.j | ⊢ 𝐽 = (MetOpen‘𝐷) |
| metnrmlem.1 | ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
| metnrmlem.2 | ⊢ (𝜑 → 𝑆 ∈ (Clsd‘𝐽)) |
| metnrmlem.3 | ⊢ (𝜑 → 𝑇 ∈ (Clsd‘𝐽)) |
| metnrmlem.4 | ⊢ (𝜑 → (𝑆 ∩ 𝑇) = ∅) |
| metnrmlem.u | ⊢ 𝑈 = ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) |
| Ref | Expression |
|---|---|
| metnrmlem2 | ⊢ (𝜑 → (𝑈 ∈ 𝐽 ∧ 𝑇 ⊆ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | metnrmlem.u | . . 3 ⊢ 𝑈 = ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) | |
| 2 | metnrmlem.1 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) | |
| 3 | metdscn.j | . . . . . 6 ⊢ 𝐽 = (MetOpen‘𝐷) | |
| 4 | 3 | mopntop 24814 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top) |
| 5 | 2, 4 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐽 ∈ Top) |
| 6 | 2 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐷 ∈ (∞Met‘𝑋)) |
| 7 | metnrmlem.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ (Clsd‘𝐽)) | |
| 8 | eqid 2763 | . . . . . . . . . 10 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 9 | 8 | cldss 23402 | . . . . . . . . 9 ⊢ (𝑇 ∈ (Clsd‘𝐽) → 𝑇 ⊆ ∪ 𝐽) |
| 10 | 7, 9 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝑇 ⊆ ∪ 𝐽) |
| 11 | 3 | mopnuni 24815 | . . . . . . . . 9 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽) |
| 12 | 2, 11 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝑋 = ∪ 𝐽) |
| 13 | 10, 12 | sseqtrrd 3950 | . . . . . . 7 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| 14 | 13 | sselda 3913 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑋) |
| 15 | metdscn.f | . . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) | |
| 16 | metnrmlem.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑆 ∈ (Clsd‘𝐽)) | |
| 17 | metnrmlem.4 | . . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ∩ 𝑇) = ∅) | |
| 18 | 15, 3, 2, 16, 7, 17 | metnrmlem1a 25233 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 < (𝐹‘𝑡) ∧ if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) ∈ ℝ+)) |
| 19 | 18 | simprd 501 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) ∈ ℝ+) |
| 20 | 19 | rphalfcld 13216 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2) ∈ ℝ+) |
| 21 | 20 | rpxrd 13205 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2) ∈ ℝ*) |
| 22 | 3 | blopn 24874 | . . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑡 ∈ 𝑋 ∧ (if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2) ∈ ℝ*) → (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) |
| 23 | 6, 14, 21, 22 | syl3anc 1399 | . . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) |
| 24 | 23 | ralrimiva 3158 | . . . 4 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) |
| 25 | iunopn 23271 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∀𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) → ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) | |
| 26 | 5, 24, 25 | syl2anc 596 | . . 3 ⊢ (𝜑 → ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) ∈ 𝐽) |
| 27 | 1, 26 | eqeltrid 2868 | . 2 ⊢ (𝜑 → 𝑈 ∈ 𝐽) |
| 28 | blcntr 24787 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑡 ∈ 𝑋 ∧ (if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2) ∈ ℝ+) → 𝑡 ∈ (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) | |
| 29 | 6, 14, 20, 28 | syl3anc 1399 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) |
| 30 | 29 | snssd 4749 | . . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → {𝑡} ⊆ (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) |
| 31 | 30 | ralrimiva 3158 | . . . 4 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 {𝑡} ⊆ (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) |
| 32 | ss2iun 4975 | . . . 4 ⊢ (∀𝑡 ∈ 𝑇 {𝑡} ⊆ (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2)) → ∪ 𝑡 ∈ 𝑇 {𝑡} ⊆ ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) | |
| 33 | 31, 32 | syl 18 | . . 3 ⊢ (𝜑 → ∪ 𝑡 ∈ 𝑇 {𝑡} ⊆ ∪ 𝑡 ∈ 𝑇 (𝑡(ball‘𝐷)(if(1 ≤ (𝐹‘𝑡), 1, (𝐹‘𝑡)) / 2))) |
| 34 | iunid 5024 | . . . 4 ⊢ ∪ 𝑡 ∈ 𝑇 {𝑡} = 𝑇 | |
| 35 | 34 | eqcomi 2772 | . . 3 ⊢ 𝑇 = ∪ 𝑡 ∈ 𝑇 {𝑡} |
| 36 | 33, 35, 1 | 3sstr4g 3966 | . 2 ⊢ (𝜑 → 𝑇 ⊆ 𝑈) |
| 37 | 27, 36 | jca 521 | 1 ⊢ (𝜑 → (𝑈 ∈ 𝐽 ∧ 𝑇 ⊆ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 ifcif 4485 {csn 4588 ∪ cuni 4872 ∪ ciun 4956 class class class wbr 5108 ↦ cmpt 5192 ran crn 5659 ‘cfv 6566 (class class class)co 7451 infcinf 9470 0cc0 11239 1c1 11240 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 / cdiv 12013 2c2 12437 ℝ+crp 13160 ∞Metcxmet 21714 ballcbl 21716 MetOpencmopn 21719 Topctop 23266 Clsdccld 23389 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-q 13116 df-rp 13161 df-xneg 13281 df-xadd 13282 df-xmul 13283 df-icc 13523 df-topgen 17664 df-psmet 21721 df-xmet 21722 df-bl 21724 df-mopn 21725 df-top 23267 df-topon 23284 df-bases 23319 df-cld 23392 df-ntr 23393 df-cls 23394 |
| This theorem is used by: metnrmlem3 25236 |
| Copyright terms: Public domain | W3C validator |