MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isxms2 Structured version   Visualization version   GIF version

Theorem isxms2 23601
Description: Express the predicate "𝑋, 𝐷 is an extended metric space" with underlying set 𝑋 and distance function 𝐷. (Contributed by Mario Carneiro, 2-Sep-2015.)
Hypotheses
Ref Expression
isms.j 𝐽 = (TopOpen‘𝐾)
isms.x 𝑋 = (Base‘𝐾)
isms.d 𝐷 = ((dist‘𝐾) ↾ (𝑋 × 𝑋))
Assertion
Ref Expression
isxms2 (𝐾 ∈ ∞MetSp ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐽 = (MetOpen‘𝐷)))

Proof of Theorem isxms2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 isms.j . . 3 𝐽 = (TopOpen‘𝐾)
2 isms.x . . 3 𝑋 = (Base‘𝐾)
3 isms.d . . 3 𝐷 = ((dist‘𝐾) ↾ (𝑋 × 𝑋))
41, 2, 3isxms 23600 . 2 (𝐾 ∈ ∞MetSp ↔ (𝐾 ∈ TopSp ∧ 𝐽 = (MetOpen‘𝐷)))
52, 1istps 22083 . . . 4 (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝑋))
6 df-mopn 20593 . . . . . . . . . 10 MetOpen = (𝑥 ran ∞Met ↦ (topGen‘ran (ball‘𝑥)))
76dmmptss 6144 . . . . . . . . 9 dom MetOpen ⊆ ran ∞Met
8 toponmax 22075 . . . . . . . . . . . 12 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
98adantl 482 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋𝐽)
10 simpl 483 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐽 = (MetOpen‘𝐷))
119, 10eleqtrd 2841 . . . . . . . . . 10 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋 ∈ (MetOpen‘𝐷))
12 elfvdm 6806 . . . . . . . . . 10 (𝑋 ∈ (MetOpen‘𝐷) → 𝐷 ∈ dom MetOpen)
1311, 12syl 17 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ dom MetOpen)
147, 13sselid 3919 . . . . . . . 8 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ran ∞Met)
15 xmetunirn 23490 . . . . . . . 8 (𝐷 ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))
1614, 15sylib 217 . . . . . . 7 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
17 eqid 2738 . . . . . . . . . . . . 13 (MetOpen‘𝐷) = (MetOpen‘𝐷)
1817mopntopon 23592 . . . . . . . . . . . 12 (𝐷 ∈ (∞Met‘dom dom 𝐷) → (MetOpen‘𝐷) ∈ (TopOn‘dom dom 𝐷))
1916, 18syl 17 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (MetOpen‘𝐷) ∈ (TopOn‘dom dom 𝐷))
2010, 19eqeltrd 2839 . . . . . . . . . 10 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐽 ∈ (TopOn‘dom dom 𝐷))
21 toponuni 22063 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘dom dom 𝐷) → dom dom 𝐷 = 𝐽)
2220, 21syl 17 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → dom dom 𝐷 = 𝐽)
23 toponuni 22063 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2423adantl 482 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋 = 𝐽)
2522, 24eqtr4d 2781 . . . . . . . 8 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → dom dom 𝐷 = 𝑋)
2625fveq2d 6778 . . . . . . 7 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (∞Met‘dom dom 𝐷) = (∞Met‘𝑋))
2716, 26eleqtrd 2841 . . . . . 6 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ (∞Met‘𝑋))
2827ex 413 . . . . 5 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)))
2917mopntopon 23592 . . . . . 6 (𝐷 ∈ (∞Met‘𝑋) → (MetOpen‘𝐷) ∈ (TopOn‘𝑋))
30 eleq1 2826 . . . . . 6 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) ↔ (MetOpen‘𝐷) ∈ (TopOn‘𝑋)))
3129, 30syl5ibr 245 . . . . 5 (𝐽 = (MetOpen‘𝐷) → (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋)))
3228, 31impbid 211 . . . 4 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐷 ∈ (∞Met‘𝑋)))
335, 32bitrid 282 . . 3 (𝐽 = (MetOpen‘𝐷) → (𝐾 ∈ TopSp ↔ 𝐷 ∈ (∞Met‘𝑋)))
3433pm5.32ri 576 . 2 ((𝐾 ∈ TopSp ∧ 𝐽 = (MetOpen‘𝐷)) ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐽 = (MetOpen‘𝐷)))
354, 34bitri 274 1 (𝐾 ∈ ∞MetSp ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐽 = (MetOpen‘𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wcel 2106   cuni 4839   × cxp 5587  dom cdm 5589  ran crn 5590  cres 5591  cfv 6433  Basecbs 16912  distcds 16971  TopOpenctopn 17132  topGenctg 17148  ∞Metcxmet 20582  ballcbl 20584  MetOpencmopn 20587  TopOnctopon 22059  TopSpctps 22081  ∞MetSpcxms 23470
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-sup 9201  df-inf 9202  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-n0 12234  df-z 12320  df-uz 12583  df-q 12689  df-rp 12731  df-xneg 12848  df-xadd 12849  df-xmul 12850  df-topgen 17154  df-psmet 20589  df-xmet 20590  df-bl 20592  df-mopn 20593  df-top 22043  df-topon 22060  df-topsp 22082  df-bases 22096  df-xms 23473
This theorem is referenced by:  isms2  23603  xmsxmet  23609  setsxms  23634  tmsxms  23642  imasf1oxms  23645  ressxms  23681  prdsxms  23686
  Copyright terms: Public domain W3C validator