| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xmsusp | Structured version Visualization version GIF version | ||
| Description: If the uniform set of a metric space is the uniform structure generated by its metric, then it is a uniform space. (Contributed by Thierry Arnoux, 14-Dec-2017.) |
| Ref | Expression |
|---|---|
| xmsusp.x | ⊢ 𝑋 = (Base‘𝐹) |
| xmsusp.d | ⊢ 𝐷 = ((dist‘𝐹) ↾ (𝑋 × 𝑋)) |
| xmsusp.u | ⊢ 𝑈 = (UnifSt‘𝐹) |
| Ref | Expression |
|---|---|
| xmsusp | ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝐹 ∈ UnifSp) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1156 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝑈 = (metUnif‘𝐷)) | |
| 2 | simp1 1154 | . . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝑋 ≠ ∅) | |
| 3 | xmsusp.x | . . . . . 6 ⊢ 𝑋 = (Base‘𝐹) | |
| 4 | xmsusp.d | . . . . . 6 ⊢ 𝐷 = ((dist‘𝐹) ↾ (𝑋 × 𝑋)) | |
| 5 | 3, 4 | xmsxmet 24784 | . . . . 5 ⊢ (𝐹 ∈ ∞MetSp → 𝐷 ∈ (∞Met‘𝑋)) |
| 6 | 5 | 3ad2ant2 1152 | . . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝐷 ∈ (∞Met‘𝑋)) |
| 7 | xmetpsmet 24676 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ∈ (PsMet‘𝑋)) | |
| 8 | metuust 24888 | . . . . 5 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋)) | |
| 9 | 7, 8 | sylan2 605 | . . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (∞Met‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋)) |
| 10 | 2, 6, 9 | syl2anc 596 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋)) |
| 11 | 1, 10 | eqeltrd 2860 | . 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝑈 ∈ (UnifOn‘𝑋)) |
| 12 | xmetutop 24896 | . . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (∞Met‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (MetOpen‘𝐷)) | |
| 13 | 2, 6, 12 | syl2anc 596 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → (unifTop‘(metUnif‘𝐷)) = (MetOpen‘𝐷)) |
| 14 | 1 | fveq2d 6894 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → (unifTop‘𝑈) = (unifTop‘(metUnif‘𝐷))) |
| 15 | eqid 2760 | . . . . 5 ⊢ (TopOpen‘𝐹) = (TopOpen‘𝐹) | |
| 16 | 15, 3, 4 | xmstopn 24779 | . . . 4 ⊢ (𝐹 ∈ ∞MetSp → (TopOpen‘𝐹) = (MetOpen‘𝐷)) |
| 17 | 16 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → (TopOpen‘𝐹) = (MetOpen‘𝐷)) |
| 18 | 13, 14, 17 | 3eqtr4rd 2806 | . 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → (TopOpen‘𝐹) = (unifTop‘𝑈)) |
| 19 | xmsusp.u | . . 3 ⊢ 𝑈 = (UnifSt‘𝐹) | |
| 20 | 3, 19, 15 | isusp 24589 | . 2 ⊢ (𝐹 ∈ UnifSp ↔ (𝑈 ∈ (UnifOn‘𝑋) ∧ (TopOpen‘𝐹) = (unifTop‘𝑈))) |
| 21 | 11, 18, 20 | sylanbrc 595 | 1 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ ∞MetSp ∧ 𝑈 = (metUnif‘𝐷)) → 𝐹 ∈ UnifSp) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∅c0 4277 × cxp 5649 ↾ cres 5653 ‘cfv 6543 Basecbs 17396 distcds 17446 TopOpenctopn 17601 PsMetcpsmet 21671 ∞Metcxmet 21672 MetOpencmopn 21677 metUnifcmetu 21678 UnifOncust 24528 unifTopcutop 24558 UnifStcuss 24581 UnifSpcusp 24582 ∞MetSpcxms 24645 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-map 8857 df-en 8982 df-dom 8983 df-sdom 8984 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-n0 12614 df-z 12701 df-uz 12973 df-q 13083 df-rp 13128 df-xneg 13248 df-xadd 13249 df-xmul 13250 df-ico 13489 df-topgen 17623 df-psmet 21679 df-xmet 21680 df-bl 21682 df-mopn 21683 df-fbas 21684 df-fg 21685 df-metu 21686 df-top 23221 df-topon 23238 df-topsp 23260 df-bases 23273 df-fil 24174 df-ust 24529 df-utop 24559 df-usp 24585 df-xms 24648 |
| This theorem is used by: cmetcusp1 25683 |
| Copyright terms: Public domain | W3C validator |