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

Theorem isxms2 22063
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 22062 . 2 (𝐾 ∈ ∞MetSp ↔ (𝐾 ∈ TopSp ∧ 𝐽 = (MetOpen‘𝐷)))
52, 1istps 20551 . . . 4 (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝑋))
6 df-mopn 19563 . . . . . . . . . 10 MetOpen = (𝑥 ran ∞Met ↦ (topGen‘ran (ball‘𝑥)))
76dmmptss 5548 . . . . . . . . 9 dom MetOpen ⊆ ran ∞Met
8 toponmax 20543 . . . . . . . . . . . 12 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
98adantl 481 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋𝐽)
10 simpl 472 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐽 = (MetOpen‘𝐷))
119, 10eleqtrd 2690 . . . . . . . . . 10 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋 ∈ (MetOpen‘𝐷))
12 elfvdm 6130 . . . . . . . . . 10 (𝑋 ∈ (MetOpen‘𝐷) → 𝐷 ∈ dom MetOpen)
1311, 12syl 17 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ dom MetOpen)
147, 13sseldi 3566 . . . . . . . 8 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ran ∞Met)
15 xmetunirn 21952 . . . . . . . 8 (𝐷 ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))
1614, 15sylib 207 . . . . . . 7 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
17 eqid 2610 . . . . . . . . . . . . 13 (MetOpen‘𝐷) = (MetOpen‘𝐷)
1817mopntopon 22054 . . . . . . . . . . . 12 (𝐷 ∈ (∞Met‘dom dom 𝐷) → (MetOpen‘𝐷) ∈ (TopOn‘dom dom 𝐷))
1916, 18syl 17 . . . . . . . . . . 11 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (MetOpen‘𝐷) ∈ (TopOn‘dom dom 𝐷))
2010, 19eqeltrd 2688 . . . . . . . . . 10 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐽 ∈ (TopOn‘dom dom 𝐷))
21 toponuni 20542 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘dom dom 𝐷) → dom dom 𝐷 = 𝐽)
2220, 21syl 17 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → dom dom 𝐷 = 𝐽)
23 toponuni 20542 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2423adantl 481 . . . . . . . . 9 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝑋 = 𝐽)
2522, 24eqtr4d 2647 . . . . . . . 8 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → dom dom 𝐷 = 𝑋)
2625fveq2d 6107 . . . . . . 7 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (∞Met‘dom dom 𝐷) = (∞Met‘𝑋))
2716, 26eleqtrd 2690 . . . . . 6 ((𝐽 = (MetOpen‘𝐷) ∧ 𝐽 ∈ (TopOn‘𝑋)) → 𝐷 ∈ (∞Met‘𝑋))
2827ex 449 . . . . 5 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)))
2917mopntopon 22054 . . . . . 6 (𝐷 ∈ (∞Met‘𝑋) → (MetOpen‘𝐷) ∈ (TopOn‘𝑋))
30 eleq1 2676 . . . . . 6 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) ↔ (MetOpen‘𝐷) ∈ (TopOn‘𝑋)))
3129, 30syl5ibr 235 . . . . 5 (𝐽 = (MetOpen‘𝐷) → (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋)))
3228, 31impbid 201 . . . 4 (𝐽 = (MetOpen‘𝐷) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐷 ∈ (∞Met‘𝑋)))
335, 32syl5bb 271 . . 3 (𝐽 = (MetOpen‘𝐷) → (𝐾 ∈ TopSp ↔ 𝐷 ∈ (∞Met‘𝑋)))
3433pm5.32ri 668 . 2 ((𝐾 ∈ TopSp ∧ 𝐽 = (MetOpen‘𝐷)) ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐽 = (MetOpen‘𝐷)))
354, 34bitri 263 1 (𝐾 ∈ ∞MetSp ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐽 = (MetOpen‘𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wb 195  wa 383   = wceq 1475  wcel 1977   cuni 4372   × cxp 5036  dom cdm 5038  ran crn 5039  cres 5040  cfv 5804  Basecbs 15695  distcds 15777  TopOpenctopn 15905  topGenctg 15921  ∞Metcxmt 19552  ballcbl 19554  MetOpencmopn 19557  TopOnctopon 20518  TopSpctps 20519  ∞MetSpcxme 21932
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-sup 8231  df-inf 8232  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-xneg 11822  df-xadd 11823  df-xmul 11824  df-topgen 15927  df-psmet 19559  df-xmet 19560  df-bl 19562  df-mopn 19563  df-top 20521  df-bases 20522  df-topon 20523  df-topsp 20524  df-xms 21935
This theorem is referenced by:  isms2  22065  xmsxmet  22071  setsxms  22094  tmsxms  22101  imasf1oxms  22104  ressxms  22140  prdsxms  22145
  Copyright terms: Public domain W3C validator