ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mspropd GIF version

Theorem mspropd 15474
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 15473 . . 3 (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))
61sqxpeqd 4782 . . . . . . 7 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
76reseq2d 5045 . . . . . 6 (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
83, 7eqtr3d 2269 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
92sqxpeqd 4782 . . . . . 6 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
109reseq2d 5045 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
118, 10eqtr3d 2269 . . . 4 (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
121, 2eqtr3d 2269 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
1312fveq2d 5681 . . . 4 (𝜑 → (Met‘(Base‘𝐾)) = (Met‘(Base‘𝐿)))
1411, 13eleq12d 2305 . . 3 (𝜑 → (((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾)) ↔ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿))))
155, 14anbi12d 473 . 2 (𝜑 → ((𝐾 ∈ ∞MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾))) ↔ (𝐿 ∈ ∞MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿)))))
16 eqid 2234 . . 3 (TopOpen‘𝐾) = (TopOpen‘𝐾)
17 eqid 2234 . . 3 (Base‘𝐾) = (Base‘𝐾)
18 eqid 2234 . . 3 ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
1916, 17, 18isms 15449 . 2 (𝐾 ∈ MetSp ↔ (𝐾 ∈ ∞MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾))))
20 eqid 2234 . . 3 (TopOpen‘𝐿) = (TopOpen‘𝐿)
21 eqid 2234 . . 3 (Base‘𝐿) = (Base‘𝐿)
22 eqid 2234 . . 3 ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
2320, 21, 22isms 15449 . 2 (𝐿 ∈ MetSp ↔ (𝐿 ∈ ∞MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (Met‘(Base‘𝐿))))
2415, 19, 233bitr4g 223 1 (𝜑 → (𝐾 ∈ MetSp ↔ 𝐿 ∈ MetSp))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2205   × cxp 4754  cres 4758  cfv 5359  Basecbs 13302  distcds 13389  TopOpenctopn 13543  Metcmet 14818  ∞MetSpcxms 15332  MetSpcms 15333
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-coll 4231  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-cnex 8236  ax-resscn 8237  ax-1re 8239  ax-addrcl 8242
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-f1 5364  df-fo 5365  df-f1o 5366  df-fv 5367  df-ov 6063  df-oprab 6064  df-mpo 6065  df-1st 6349  df-2nd 6350  df-inn 9260  df-2 9318  df-3 9319  df-4 9320  df-5 9321  df-6 9322  df-7 9323  df-8 9324  df-9 9325  df-ndx 13305  df-slot 13306  df-base 13308  df-tset 13399  df-rest 13544  df-topn 13545  df-top 14994  df-topon 15007  df-topsp 15027  df-xms 15335  df-ms 15336
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator