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

Theorem mspropd 23979
Description: Property deduction for a metric space. (Contributed by Mario Carneiro, 4-Oct-2015.)
Hypotheses
Ref Expression
xmspropd.1 (𝜑𝐵 = (Base‘𝐾))
xmspropd.2 (𝜑𝐵 = (Base‘𝐿))
xmspropd.3 (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
xmspropd.4 (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
Assertion
Ref Expression
mspropd (𝜑 → (𝐾 ∈ MetSp ↔ 𝐿 ∈ MetSp))

Proof of Theorem mspropd
StepHypRef Expression
1 xmspropd.1 . . . 4 (𝜑𝐵 = (Base‘𝐾))
2 xmspropd.2 . . . 4 (𝜑𝐵 = (Base‘𝐿))
3 xmspropd.3 . . . 4 (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
4 xmspropd.4 . . . 4 (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
51, 2, 3, 4xmspropd 23978 . . 3 (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))
61sqxpeqd 5708 . . . . . . 7 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
76reseq2d 5981 . . . . . 6 (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
83, 7eqtr3d 2774 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
92sqxpeqd 5708 . . . . . 6 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
109reseq2d 5981 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
118, 10eqtr3d 2774 . . . 4 (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
121, 2eqtr3d 2774 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
1312fveq2d 6895 . . . 4 (𝜑 → (Met‘(Base‘𝐾)) = (Met‘(Base‘𝐿)))
1411, 13eleq12d 2827 . . 3 (𝜑 → (((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾)) ↔ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿))))
155, 14anbi12d 631 . 2 (𝜑 → ((𝐾 ∈ ∞MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾))) ↔ (𝐿 ∈ ∞MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿)))))
16 eqid 2732 . . 3 (TopOpen‘𝐾) = (TopOpen‘𝐾)
17 eqid 2732 . . 3 (Base‘𝐾) = (Base‘𝐾)
18 eqid 2732 . . 3 ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
1916, 17, 18isms 23954 . 2 (𝐾 ∈ MetSp ↔ (𝐾 ∈ ∞MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾))))
20 eqid 2732 . . 3 (TopOpen‘𝐿) = (TopOpen‘𝐿)
21 eqid 2732 . . 3 (Base‘𝐿) = (Base‘𝐿)
22 eqid 2732 . . 3 ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
2320, 21, 22isms 23954 . 2 (𝐿 ∈ MetSp ↔ (𝐿 ∈ ∞MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿))))
2415, 19, 233bitr4g 313 1 (𝜑 → (𝐾 ∈ MetSp ↔ 𝐿 ∈ MetSp))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106   × cxp 5674  cres 5678  cfv 6543  Basecbs 17143  distcds 17205  TopOpenctopn 17366  Metcmet 20929  ∞MetSpcxms 23822  MetSpcms 23823
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-res 5688  df-iota 6495  df-fun 6545  df-fv 6551  df-top 22395  df-topon 22412  df-topsp 22434  df-xms 23825  df-ms 23826
This theorem is referenced by:  ngppropd  24145  cmspropd  24865  zhmnrg  32942
  Copyright terms: Public domain W3C validator