metequiv2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > metequiv2		GIF version

Theorem metequiv2 13999

Description: If there is a sequence of radii approaching zero for which the balls of both metrics coincide, then the generated topologies are equivalent. (Contributed by Mario Carneiro, 26-Aug-2015.)

**Hypotheses**
Ref	Expression
metequiv.3	⊢ 𝐽 = (MetOpen‘𝐶)
metequiv.4	⊢ 𝐾 = (MetOpen‘𝐷)

**Assertion**
Ref	Expression
metequiv2	⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → 𝐽 = 𝐾))

Distinct variable groups: 𝑠,𝑟,𝑥,𝐶 𝐽,𝑟,𝑠,𝑥 𝐾,𝑟,𝑠,𝑥 𝐷,𝑟,𝑠,𝑥 𝑋,𝑟,𝑠,𝑥

**Proof of Theorem metequiv2**
Step	Hyp	Ref	Expression
1		simprrr 540	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠))
2		simplll 533	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝐶 ∈ (∞Met‘𝑋))
3		simplr 528	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑥 ∈ 𝑋)
4		simprlr 538	. . . . . . . . . . . . 13 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑠 ∈ ℝ⁺)
5	4	rpxrd 9697	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑠 ∈ ℝ^*)
6		simprll 537	. . . . . . . . . . . . 13 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑟 ∈ ℝ⁺)
7	6	rpxrd 9697	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑟 ∈ ℝ^*)
8		simprrl 539	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝑠 ≤ 𝑟)
9		ssbl 13929	. . . . . . . . . . . 12 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ (𝑠 ∈ ℝ^* ∧ 𝑟 ∈ ℝ^*) ∧ 𝑠 ≤ 𝑟) → (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))
10	2, 3, 5, 7, 8, 9	syl221anc 1249	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))
11	1, 10	eqsstrrd 3193	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))
12		simpllr 534	. . . . . . . . . . . 12 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → 𝐷 ∈ (∞Met‘𝑋))
13		ssbl 13929	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ (𝑠 ∈ ℝ^* ∧ 𝑟 ∈ ℝ^*) ∧ 𝑠 ≤ 𝑟) → (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))
14	12, 3, 5, 7, 8, 13	syl221anc 1249	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))
15	1, 14	eqsstrd 3192	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))
16	11, 15	jca 306	. . . . . . . . 9 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ ((𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺) ∧ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)))) → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟)))
17	16	expr 375	. . . . . . . 8 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑟 ∈ ℝ⁺ ∧ 𝑠 ∈ ℝ⁺)) → ((𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
18	17	anassrs 400	. . . . . . 7 ⊢ (((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑠 ∈ ℝ⁺) → ((𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
19	18	reximdva 2579	. . . . . 6 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → ∃𝑠 ∈ ℝ⁺ ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
20		r19.40 2631	. . . . . 6 ⊢ (∃𝑠 ∈ ℝ⁺ ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟)) → (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟)))
21	19, 20	syl6 33	. . . . 5 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
22	21	ralimdva 2544	. . . 4 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → ∀𝑟 ∈ ℝ⁺ (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
23		r19.26 2603	. . . 4 ⊢ (∀𝑟 ∈ ℝ⁺ (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟)) ↔ (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟)))
24	22, 23	imbitrdi 161	. . 3 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
25	24	ralimdva 2544	. 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → ∀𝑥 ∈ 𝑋 (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
26		metequiv.3	. . 3 ⊢ 𝐽 = (MetOpen‘𝐶)
27		metequiv.4	. . 3 ⊢ 𝐾 = (MetOpen‘𝐷)
28	26, 27	metequiv 13998	. 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽 = 𝐾 ↔ ∀𝑥 ∈ 𝑋 (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑠) ⊆ (𝑥(ball‘𝐷)𝑟))))
29	25, 28	sylibrd 169	1 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑠 ≤ 𝑟 ∧ (𝑥(ball‘𝐶)𝑠) = (𝑥(ball‘𝐷)𝑠)) → 𝐽 = 𝐾))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ∃wrex 2456 ⊆ wss 3130 class class class wbr 4004 ‘cfv 5217 (class class class)co 5875 ℝ^*cxr 7991 ≤ cle 7993 ℝ⁺crp 9653 ∞Metcxmet 13443 ballcbl 13445 MetOpencmopn 13448

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4119 ax-sep 4122 ax-nul 4130 ax-pow 4175 ax-pr 4210 ax-un 4434 ax-setind 4537 ax-iinf 4588 ax-cnex 7902 ax-resscn 7903 ax-1cn 7904 ax-1re 7905 ax-icn 7906 ax-addcl 7907 ax-addrcl 7908 ax-mulcl 7909 ax-mulrcl 7910 ax-addcom 7911 ax-mulcom 7912 ax-addass 7913 ax-mulass 7914 ax-distr 7915 ax-i2m1 7916 ax-0lt1 7917 ax-1rid 7918 ax-0id 7919 ax-rnegex 7920 ax-precex 7921 ax-cnre 7922 ax-pre-ltirr 7923 ax-pre-ltwlin 7924 ax-pre-lttrn 7925 ax-pre-apti 7926 ax-pre-ltadd 7927 ax-pre-mulgt0 7928 ax-pre-mulext 7929 ax-arch 7930 ax-caucvg 7931

This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2740 df-sbc 2964 df-csb 3059 df-dif 3132 df-un 3134 df-in 3136 df-ss 3143 df-nul 3424 df-if 3536 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-int 3846 df-iun 3889 df-br 4005 df-opab 4066 df-mpt 4067 df-tr 4103 df-id 4294 df-po 4297 df-iso 4298 df-iord 4367 df-on 4369 df-ilim 4370 df-suc 4372 df-iom 4591 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-rn 4638 df-res 4639 df-ima 4640 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-fo 5223 df-f1o 5224 df-fv 5225 df-isom 5226 df-riota 5831 df-ov 5878 df-oprab 5879 df-mpo 5880 df-1st 6141 df-2nd 6142 df-recs 6306 df-frec 6392 df-map 6650 df-sup 6983 df-inf 6984 df-pnf 7994 df-mnf 7995 df-xr 7996 df-ltxr 7997 df-le 7998 df-sub 8130 df-neg 8131 df-reap 8532 df-ap 8539 df-div 8630 df-inn 8920 df-2 8978 df-3 8979 df-4 8980 df-n0 9177 df-z 9254 df-uz 9529 df-q 9620 df-rp 9654 df-xneg 9772 df-xadd 9773 df-seqfrec 10446 df-exp 10520 df-cj 10851 df-re 10852 df-im 10853 df-rsqrt 11007 df-abs 11008 df-topgen 12709 df-psmet 13450 df-xmet 13451 df-bl 13453 df-mopn 13454 df-top 13501 df-bases 13546

This theorem is referenced by: bdmopn 14007

W3C validator