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

Theorem mspropd 15160
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 15159 . . 3 (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))
61sqxpeqd 4745 . . . . . . 7 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
76reseq2d 5005 . . . . . 6 (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
83, 7eqtr3d 2264 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
92sqxpeqd 4745 . . . . . 6 (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
109reseq2d 5005 . . . . 5 (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
118, 10eqtr3d 2264 . . . 4 (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
121, 2eqtr3d 2264 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
1312fveq2d 5633 . . . 4 (𝜑 → (Met‘(Base‘𝐾)) = (Met‘(Base‘𝐿)))
1411, 13eleq12d 2300 . . 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 2229 . . 3 (TopOpen‘𝐾) = (TopOpen‘𝐾)
17 eqid 2229 . . 3 (Base‘𝐾) = (Base‘𝐾)
18 eqid 2229 . . 3 ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
1916, 17, 18isms 15135 . 2 (𝐾 ∈ MetSp ↔ (𝐾 ∈ ∞MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (Met‘(Base‘𝐾))))
20 eqid 2229 . . 3 (TopOpen‘𝐿) = (TopOpen‘𝐿)
21 eqid 2229 . . 3 (Base‘𝐿) = (Base‘𝐿)
22 eqid 2229 . . 3 ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
2320, 21, 22isms 15135 . 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 1395  wcel 2200   × cxp 4717  cres 4721  cfv 5318  Basecbs 13040  distcds 13127  TopOpenctopn 13281  Metcmet 14509  ∞MetSpcxms 15018  MetSpcms 15019
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8098  ax-resscn 8099  ax-1re 8101  ax-addrcl 8104
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-inn 9119  df-2 9177  df-3 9178  df-4 9179  df-5 9180  df-6 9181  df-7 9182  df-8 9183  df-9 9184  df-ndx 13043  df-slot 13044  df-base 13046  df-tset 13137  df-rest 13282  df-topn 13283  df-top 14680  df-topon 14693  df-topsp 14713  df-xms 15021  df-ms 15022
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator