Theorem xmspropd 24847

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 2800	. . . 4 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
4		xmspropd.4	. . . 4 ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
5	3, 4	tpspropd 23311	. . 3 ⊢ (𝜑 → (𝐾 ∈ TopSp ↔ 𝐿 ∈ TopSp))
6		xmspropd.3	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
7	1	sqxpeqd 5690	. . . . . . . 8 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
8	7	reseq2d 5986	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
9	6, 8	eqtr3d 2800	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
10	2	sqxpeqd 5690	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
11	10	reseq2d 5986	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
12	9, 11	eqtr3d 2800	. . . . 5 ⊢ (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
13	12	fveq2d 6920	. . . 4 ⊢ (𝜑 → (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))))
14	4, 13	eqeq12d 2779	. . 3 ⊢ (𝜑 → ((TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))) ↔ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))))
15	5, 14	anbi12d 644	. 2 ⊢ (𝜑 → ((𝐾 ∈ TopSp ∧ (TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))) ↔ (𝐿 ∈ TopSp ∧ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))))))
16		eqid 2763	. . 3 ⊢ (TopOpen‘𝐾) = (TopOpen‘𝐾)
17		eqid 2763	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2763	. . 3 ⊢ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
19	16, 17, 18	isxms 24821	. 2 ⊢ (𝐾 ∈ ∞MetSp ↔ (𝐾 ∈ TopSp ∧ (TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))))
20		eqid 2763	. . 3 ⊢ (TopOpen‘𝐿) = (TopOpen‘𝐿)
21		eqid 2763	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2763	. . 3 ⊢ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
23	20, 21, 22	isxms 24821	. 2 ⊢ (𝐿 ∈ ∞MetSp ↔ (𝐿 ∈ TopSp ∧ (TopOpen‘𝐿) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))))
24	15, 19, 23	3bitr4g 317	1 ⊢ (𝜑 → (𝐾 ∈ ∞MetSp ↔ 𝐿 ∈ ∞MetSp))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   × cxp 5656   ↾ cres 5660  ‘cfv 6566  Basecbs 17431  distcds 17481  TopOpenctopn 17642  MetOpencmopn 21719  TopSpctps 23305  ∞MetSpcxms 24691

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-top 23267  df-topon 23284  df-topsp 23306  df-xms 24694

This theorem is used by:  mspropd  24848