Theorem xmspropd 24699

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 2797	. . . 4 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
4		xmspropd.4	. . . 4 ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
5	3, 4	tpspropd 23163	. . 3 ⊢ (𝜑 → (𝐾 ∈ TopSp ↔ 𝐿 ∈ TopSp))
6		xmspropd.3	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
7	1	sqxpeqd 5687	. . . . . . . 8 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
8	7	reseq2d 5972	. . . . . . 7 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
9	6, 8	eqtr3d 2797	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
10	2	sqxpeqd 5687	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
11	10	reseq2d 5972	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
12	9, 11	eqtr3d 2797	. . . . 5 ⊢ (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
13	12	fveq2d 6882	. . . 4 ⊢ (𝜑 → (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))) = (MetOpen‘((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))))
14	4, 13	eqeq12d 2776	. . 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 2760	. . 3 ⊢ (TopOpen‘𝐾) = (TopOpen‘𝐾)
17		eqid 2760	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2760	. . 3 ⊢ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
19	16, 17, 18	isxms 24673	. 2 ⊢ (𝐾 ∈ ∞MetSp ↔ (𝐾 ∈ TopSp ∧ (TopOpen‘𝐾) = (MetOpen‘((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))))
20		eqid 2760	. . 3 ⊢ (TopOpen‘𝐿) = (TopOpen‘𝐿)
21		eqid 2760	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2760	. . 3 ⊢ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
23	20, 21, 22	isxms 24673	. 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 2145   × cxp 5653   ↾ cres 5657  ‘cfv 6533  Basecbs 17301  distcds 17351  TopOpenctopn 17506  MetOpencmopn 21575  TopSpctps 23157  ∞MetSpcxms 24543

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-res 5667  df-iota 6489  df-fun 6535  df-fv 6541  df-top 23119  df-topon 23136  df-topsp 23158  df-xms 24546

This theorem is used by:  mspropd  24700