Theorem cmspropd 25650

Description: Property deduction for a complete metric space. (Contributed by Mario Carneiro, 15-Oct-2015.)

Hypotheses

Ref	Expression
cmspropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
cmspropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
cmspropd.3	⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
cmspropd.4	⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))

Assertion

Ref	Expression
cmspropd	⊢ (𝜑 → (𝐾 ∈ CMetSp ↔ 𝐿 ∈ CMetSp))

Proof of Theorem cmspropd

Step	Hyp	Ref	Expression
1		cmspropd.1	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		cmspropd.2	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3		cmspropd.3	. . . 4 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ (𝐵 × 𝐵)))
4		cmspropd.4	. . . 4 ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))
5	1, 2, 3, 4	mspropd 24773	. . 3 ⊢ (𝜑 → (𝐾 ∈ MetSp ↔ 𝐿 ∈ MetSp))
6	1	sqxpeqd 5683	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
7	6	reseq2d 5970	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
8	3, 7	eqtr3d 2798	. . . . 5 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
9	2	sqxpeqd 5683	. . . . . 6 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
10	9	reseq2d 5970	. . . . 5 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
11	8, 10	eqtr3d 2798	. . . 4 ⊢ (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
12	1, 2	eqtr3d 2798	. . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
13	12	fveq2d 6881	. . . 4 ⊢ (𝜑 → (CMet‘(Base‘𝐾)) = (CMet‘(Base‘𝐿)))
14	11, 13	eleq12d 2855	. . 3 ⊢ (𝜑 → (((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (CMet‘(Base‘𝐾)) ↔ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (CMet‘(Base‘𝐿))))
15	5, 14	anbi12d 644	. 2 ⊢ (𝜑 → ((𝐾 ∈ MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (CMet‘(Base‘𝐾))) ↔ (𝐿 ∈ MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (CMet‘(Base‘𝐿)))))
16		eqid 2761	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
17		eqid 2761	. . 3 ⊢ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
18	16, 17	iscms 25646	. 2 ⊢ (𝐾 ∈ CMetSp ↔ (𝐾 ∈ MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (CMet‘(Base‘𝐾))))
19		eqid 2761	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
20		eqid 2761	. . 3 ⊢ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
21	19, 20	iscms 25646	. 2 ⊢ (𝐿 ∈ CMetSp ↔ (𝐿 ∈ MetSp ∧ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) ∈ (CMet‘(Base‘𝐿))))
22	15, 18, 21	3bitr4g 317	1 ⊢ (𝜑 → (𝐾 ∈ CMetSp ↔ 𝐿 ∈ CMetSp))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   × cxp 5649   ↾ cres 5653  ‘cfv 6531  Basecbs 17367  distcds 17417  TopOpenctopn 17572  MetSpcms 24617  CMetccmet 25555  CMetSpccms 25633

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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-iota 6487  df-fun 6533  df-fv 6539  df-top 23192  df-topon 23209  df-topsp 23231  df-xms 24619  df-ms 24620  df-cms 25636

This theorem is used by:  srabn  25661