Theorem xmspropd 24407

Description: Property deduction for an extended 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
xmspropd	⊢ (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))

Proof of Theorem xmspropd

Step	Hyp	Ref	Expression
1		xmspropd.1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		xmspropd.2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3	1, 2	eqtr3d 2770	. . . 4 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
4		xmspropd.4	. . . 4 ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
5	3, 4	tpspropd 22868	. . 3 ⊢ (𝜑 → (𝐾 ∈ TopSp ↔ 𝐿 ∈ TopSp))
6		xmspropd.3	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
7	1	sqxpeqd 5714	. . . . . . . 8 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
8	7	reseq2d 5989	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
9	6, 8	eqtr3d 2770	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
10	2	sqxpeqd 5714	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
11	10	reseq2d 5989	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
12	9, 11	eqtr3d 2770	. . . . 5 ⊢ (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
13	12	fveq2d 6906	. . . 4 ⊢ (𝜑 → (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))))
14	4, 13	eqeq12d 2744	. . 3 ⊢ (𝜑 → ((TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))) ↔ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))))
15	5, 14	anbi12d 630	. 2 ⊢ (𝜑 → ((𝐾 ∈ TopSp ∧ (TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))) ↔ (𝐿 ∈ TopSp ∧ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))))))
16		eqid 2728	. . 3 ⊢ (TopOpen‘𝐾) = (TopOpen‘𝐾)
17		eqid 2728	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2728	. . 3 ⊢ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
19	16, 17, 18	isxms 24381	. 2 ⊢ (𝐾 ∈ ∞MetSp ↔ (𝐾 ∈ TopSp ∧ (TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))))
20		eqid 2728	. . 3 ⊢ (TopOpen‘𝐿) = (TopOpen‘𝐿)
21		eqid 2728	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2728	. . 3 ⊢ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
23	20, 21, 22	isxms 24381	. 2 ⊢ (𝐿 ∈ ∞MetSp ↔ (𝐿 ∈ TopSp ∧ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))))
24	15, 19, 23	3bitr4g 313	1 ⊢ (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098   × cxp 5680   ↾ cres 5684  ‘cfv 6553  Basecbs 17189  distcds 17251  TopOpenctopn 17412  MetOpencmopn 21283  TopSpctps 22862  ∞MetSpcxms 24251

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7748

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-res 5694  df-iota 6505  df-fun 6555  df-fv 6561  df-top 22824  df-topon 22841  df-topsp 22863  df-xms 24254

This theorem is referenced by:  mspropd  24408