metss - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > metss		Structured version Visualization version GIF version

Theorem metss 24009

Description: Two ways of saying that metric 𝐷 generates a finer topology than metric 𝐶. (Contributed by Mario Carneiro, 12-Nov-2013.) (Revised by Mario Carneiro, 24-Aug-2015.)

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

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

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

Proof of Theorem metss Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		metequiv.3	. . . . 5 ⊢ 𝐽 = (MetOpen‘𝐶)
2	1	mopnval 23936	. . . 4 ⊢ (𝐶 ∈ (∞Met‘𝑋) → 𝐽 = (topGen‘ran (ball‘𝐶)))
3	2	adantr 482	. . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐽 = (topGen‘ran (ball‘𝐶)))
4		metequiv.4	. . . . 5 ⊢ 𝐾 = (MetOpen‘𝐷)
5	4	mopnval 23936	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (topGen‘ran (ball‘𝐷)))
6	5	adantl 483	. . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐾 = (topGen‘ran (ball‘𝐷)))
7	3, 6	sseq12d 4015	. 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ (topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷))))
8		blbas 23928	. . 3 ⊢ (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) ∈ TopBases)
9		unirnbl 23918	. . . . 5 ⊢ (𝐶 ∈ (∞Met‘𝑋) → ∪ ran (ball‘𝐶) = 𝑋)
10	9	adantr 482	. . . 4 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ∪ ran (ball‘𝐶) = 𝑋)
11		unirnbl 23918	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)
12	11	adantl 483	. . . 4 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ∪ ran (ball‘𝐷) = 𝑋)
13	10, 12	eqtr4d 2776	. . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ∪ ran (ball‘𝐶) = ∪ ran (ball‘𝐷))
14		tgss2 22482	. . 3 ⊢ ((ran (ball‘𝐶) ∈ TopBases ∧ ∪ ran (ball‘𝐶) = ∪ ran (ball‘𝐷)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ∈ ∪ ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
15	8, 13, 14	syl2an2r 684	. 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ∈ ∪ ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
16	10	raleqdv 3326	. . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ ∪ ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
17		blssex 23925	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) ↔ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
18	17	adantll 713	. . . . . . 7 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) ↔ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
19	18	imbi2d 341	. . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → ((𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ (𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
20	19	ralbidv 3178	. . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
21		rpxr 12980	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
22		blelrn 23915	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ^*) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
23	21, 22	syl3an3 1166	. . . . . . . . 9 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
24		blcntr 23911	. . . . . . . . 9 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) → 𝑥 ∈ (𝑥(ball‘𝐶)𝑟))
25		eleq2 2823	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥(ball‘𝐶)𝑟) → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ (𝑥(ball‘𝐶)𝑟)))
26		sseq2 4008	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
27	26	rexbidv 3179	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥(ball‘𝐶)𝑟) → (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
28	25, 27	imbi12d 345	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
29	28	rspcv 3609	. . . . . . . . . 10 ⊢ ((𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
30	29	com23 86	. . . . . . . . 9 ⊢ ((𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶) → (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
31	23, 24, 30	sylc 65	. . . . . . . 8 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
32	31	ad4ant134 1175	. . . . . . 7 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
33	32	ralrimdva 3155	. . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
34		blss 23923	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥 ∈ 𝑦) → ∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
35	34	3expb 1121	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥 ∈ 𝑦)) → ∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
36	35	ad4ant14 751	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥 ∈ 𝑦)) → ∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
37		r19.29 3115	. . . . . . . . . . . 12 ⊢ ((∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑟 ∈ ℝ⁺ (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦))
38		sstr 3990	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
39	38	expcom 415	. . . . . . . . . . . . . . 15 ⊢ ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
40	39	reximdv 3171	. . . . . . . . . . . . . 14 ⊢ ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
41	40	impcom 409	. . . . . . . . . . . . 13 ⊢ ((∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
42	41	rexlimivw 3152	. . . . . . . . . . . 12 ⊢ (∃𝑟 ∈ ℝ⁺ (∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
43	37, 42	syl 17	. . . . . . . . . . 11 ⊢ ((∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
44	43	ex 414	. . . . . . . . . 10 ⊢ (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (∃𝑟 ∈ ℝ⁺ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
45	36, 44	syl5com 31	. . . . . . . . 9 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥 ∈ 𝑦)) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
46	45	expr 458	. . . . . . . 8 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (𝑥 ∈ 𝑦 → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
47	46	com23 86	. . . . . . 7 ⊢ ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
48	47	ralrimdva 3155	. . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
49	33, 48	impbid 211	. . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
50	20, 49	bitrd 279	. . . 4 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
51	50	ralbidva 3176	. . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
52	16, 51	bitrd 279	. 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ∈ ∪ ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥 ∈ 𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
53	7, 15, 52	3bitrd 305	1 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ⁺ ∃𝑠 ∈ ℝ⁺ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ⊆ wss 3948 ∪ cuni 4908 ran crn 5677 ‘cfv 6541 (class class class)co 7406 ℝ^*cxr 11244 ℝ⁺crp 12971 topGenctg 17380 ∞Metcxmet 20922 ballcbl 20924 MetOpencmopn 20927 TopBasesctb 22440

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-er 8700 df-map 8819 df-en 8937 df-dom 8938 df-sdom 8939 df-sup 9434 df-inf 9435 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-n0 12470 df-z 12556 df-uz 12820 df-q 12930 df-rp 12972 df-xneg 13089 df-xadd 13090 df-xmul 13091 df-topgen 17386 df-psmet 20929 df-xmet 20930 df-bl 20932 df-mopn 20933 df-bases 22441

This theorem is referenced by: metequiv 24010 metss2 24013

W3C validator