Theorem psmetutop 24627

Description: The topology induced by a uniform structure generated by a metric 𝐷 is generated by that metric's open balls. (Contributed by Thierry Arnoux, 6-Dec-2017.) (Revised by Thierry Arnoux, 11-Mar-2018.)

Assertion

Ref	Expression
psmetutop	⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))

Proof of Theorem psmetutop

Dummy variables 𝑎 𝑏 𝑑 𝑒 𝑣 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		metuust 24620	. . . . . . . . . . . 12 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2		utopval 24292	. . . . . . . . . . . 12 ⊢ ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
3	1, 2	syl 17	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
4	3	eleq2d 2848	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5		rabid 3435	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
6	4, 5	bitrdi 289	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)))
7	6	biimpa 480	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
8	7	simpld 498	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
9	8	elpwid 4564	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ 𝑋)
10		unirnblps 24479	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)
11	10	ad2antlr 737	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
12	9, 11	sseqtrrd 3973	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ ∪ ran (ball‘𝐷))
13		simpr 488	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14		simp-5r 795	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15		simplr 778	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
16	9	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎 ⊆ 𝑋)
17		simpllr 785	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑎)
18	16, 17	sseldd 3937	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑋)
19		metustbl 24626	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥 ∈ 𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
20	14, 15, 18, 19	syl3anc 1390	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
21		sstr 3944	. . . . . . . . . . 11 ⊢ ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏 ⊆ 𝑎)
22	21	expcom 417	. . . . . . . . . 10 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏 ⊆ 𝑎))
23	22	anim2d 621	. . . . . . . . 9 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
24	23	reximdv 3177	. . . . . . . 8 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
25	13, 20, 24	sylc 65	. . . . . . 7 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
26	7	simprd 499	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
27	26	r19.21bi 3254	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
28	25, 27	r19.29a 3170	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
29	28	ralrimiva 3154	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
30	12, 29	jca 519	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
31		fvex 6880	. . . . . 6 ⊢ (ball‘𝐷) ∈ V
32	31	rnex 7891	. . . . 5 ⊢ ran (ball‘𝐷) ∈ V
33		eltg2 23018	. . . . 5 ⊢ (ran (ball‘𝐷) ∈ V → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))))
34	32, 33	mp1i 13	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))))
35	30, 34	mpbird 259	. . 3 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ (topGen‘ran (ball‘𝐷)))
36	32, 33	mp1i 13	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))))
37	36	biimpa 480	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
38	37	simpld 498	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ⊆ ∪ ran (ball‘𝐷))
39	10	ad2antlr 737	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
40	38, 39	sseqtrd 3972	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ⊆ 𝑋)
41		elpwg 4558	. . . . . . 7 ⊢ (𝑎 ∈ (topGen‘ran (ball‘𝐷)) → (𝑎 ∈ 𝒫 𝑋 ↔ 𝑎 ⊆ 𝑋))
42	41	adantl 485	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ↔ 𝑎 ⊆ 𝑋))
43	40, 42	mpbird 259	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
44		simpllr 785	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
45	40	sselda 3936	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → 𝑥 ∈ 𝑋)
46	37	simprd 499	. . . . . . . . . . 11 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
47	46	r19.21bi 3254	. . . . . . . . . 10 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
48		blssexps 24486	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
49	44, 45, 48	syl2anc 593	. . . . . . . . . 10 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
50	47, 49	mpbid 234	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51		blval2 24622	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
52	51	3expa 1131	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
53	52	sseq1d 3967	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
54	53	rexbidva 3184	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
55	54	biimpa 480	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
56	44, 45, 50, 55	syl21anc 848	. . . . . . . 8 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57		cnvexg 7905	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V)
58		imaexg 7894	. . . . . . . . . . 11 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑑)) ∈ V)
59	57, 58	syl 17	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (◡𝐷 “ (0[,)𝑑)) ∈ V)
60	59	ralrimivw 3158	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (◡𝐷 “ (0[,)𝑑)) ∈ V)
61		eqid 2762	. . . . . . . . . 10 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))
62		imaeq1 6044	. . . . . . . . . . 11 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
63	62	sseq1d 3967	. . . . . . . . . 10 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
64	61, 63	rexrnmptw 7076	. . . . . . . . 9 ⊢ (∀𝑑 ∈ ℝ+ (◡𝐷 “ (0[,)𝑑)) ∈ V → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
65	44, 60, 64	3syl 18	. . . . . . . 8 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
66	56, 65	mpbird 259	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎)
67		oveq2 7404	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
68	67	imaeq2d 6049	. . . . . . . . . . . . . 14 ⊢ (𝑑 = 𝑒 → (◡𝐷 “ (0[,)𝑑)) = (◡𝐷 “ (0[,)𝑒)))
69	68	cbvmptv 5204	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
70	69	rneqi 5913	. . . . . . . . . . . 12 ⊢ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
71	70	metustfbas 24617	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72		ssfg 23932	. . . . . . . . . . 11 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
73	71, 72	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
74		metuval 24609	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
75	74	adantl 485	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
76	73, 75	sseqtrrd 3973	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77		ssrexv 4006	. . . . . . . . 9 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
78	76, 77	syl 17	. . . . . . . 8 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
79	78	ad2antrr 736	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
80	66, 79	mpd 15	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
81	80	ralrimiva 3154	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
82	43, 81	jca 519	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
83	6	biimpar 481	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
84	82, 83	syldan 600	. . 3 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
85	35, 84	impbida 810	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
86	85	eqrdv 2760	1 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1560   ∈ wcel 2142   ≠ wne 2957  ∀wral 3076  ∃wrex 3086  {crab 3414  Vcvv 3454   ⊆ wss 3904  ∅c0 4285  𝒫 cpw 4555  {csn 4582  ∪ cuni 4865   ↦ cmpt 5181   × cxp 5645  ^◡ccnv 5646  ran crn 5648   “ cima 5650  ‘cfv 6521  (class class class)co 7396  0cc0 11073  ℝ⁺crp 12993  [,)cico 13351  topGenctg 17466  PsMetcpsmet 21408  ballcbl 21411  fBascfbas 21412  filGencfg 21413  metUnifcmetu 21415  UnifOncust 24260  unifTopcutop 24290

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130  ax-1cn 11131  ax-icn 11132  ax-addcl 11133  ax-addrcl 11134  ax-mulcl 11135  ax-mulrcl 11136  ax-mulcom 11137  ax-addass 11138  ax-mulass 11139  ax-distr 11140  ax-i2m1 11141  ax-1ne0 11142  ax-1rid 11143  ax-rnegex 11144  ax-rrecex 11145  ax-cnre 11146  ax-pre-lttri 11147  ax-pre-lttrn 11148  ax-pre-ltadd 11149  ax-pre-mulgt0 11150  ax-pre-sup 11151

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-er 8678  df-map 8810  df-en 8928  df-dom 8929  df-sdom 8930  df-sup 9388  df-inf 9389  df-pnf 11218  df-mnf 11219  df-xr 11220  df-ltxr 11221  df-le 11222  df-sub 11416  df-neg 11417  df-div 11845  df-nn 12211  df-2 12280  df-n0 12482  df-z 12569  df-uz 12840  df-q 12950  df-rp 12994  df-xneg 13114  df-xadd 13115  df-xmul 13116  df-ico 13355  df-topgen 17472  df-psmet 21416  df-bl 21419  df-fbas 21421  df-fg 21422  df-metu 21423  df-fil 23906  df-ust 24261  df-utop 24291

This theorem is referenced by:  xmetutop  24628