Theorem cmspropd 25703

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 24826	. . 3 ⊢ (𝜑 → (𝐾 ∈ MetSp ↔ 𝐿 ∈ MetSp))
6	1	sqxpeqd 5688	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐾) × (Base‘𝐾)))
7	6	reseq2d 5982	. . . . . 6 ⊢ (𝜑 → ((dist‘𝐾) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
8	3, 7	eqtr3d 2800	. . . . 5 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))))
9	2	sqxpeqd 5688	. . . . . 6 ⊢ (𝜑 → (𝐵 × 𝐵) = ((Base‘𝐿) × (Base‘𝐿)))
10	9	reseq2d 5982	. . . . 5 ⊢ (𝜑 → ((dist‘𝐿) ↾ (𝐵 × 𝐵)) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
11	8, 10	eqtr3d 2800	. . . 4 ⊢ (𝜑 → ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))))
12	1, 2	eqtr3d 2800	. . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
13	12	fveq2d 6915	. . . 4 ⊢ (𝜑 → (CMet‘(Base‘𝐾)) = (CMet‘(Base‘𝐿)))
14	11, 13	eleq12d 2858	. . 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 2763	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
17		eqid 2763	. . 3 ⊢ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) = ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾)))
18	16, 17	iscms 25699	. 2 ⊢ (𝐾 ∈ CMetSp ↔ (𝐾 ∈ MetSp ∧ ((dist‘𝐾) ↾ ((Base‘𝐾) × (Base‘𝐾))) ∈ (CMet‘(Base‘𝐾))))
19		eqid 2763	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
20		eqid 2763	. . 3 ⊢ ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿))) = ((dist‘𝐿) ↾ ((Base‘𝐿) × (Base‘𝐿)))
21	19, 20	iscms 25699	. 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 2147   × cxp 5654   ↾ cres 5658  ‘cfv 6561  Basecbs 17419  distcds 17469  TopOpenctopn 17624  MetSpcms 24670  CMetccmet 25608  CMetSpccms 25686

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 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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-sbc 3743  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 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-res 5668  df-iota 6515  df-fun 6563  df-fv 6569  df-top 23245  df-topon 23262  df-topsp 23284  df-xms 24672  df-ms 24673  df-cms 25689

This theorem is used by:  srabn  25714