Theorem psmetutop 24523

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 24516	. . . . . . . . . . . 12 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2		utopval 24188	. . . . . . . . . . . 12 ⊢ ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
3	1, 2	syl 17	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
4	3	eleq2d 2823	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5		rabid 3422	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
6	4, 5	bitrdi 287	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)))
7	6	biimpa 476	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
8	7	simpld 494	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
9	8	elpwid 4565	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ 𝑋)
10		unirnblps 24375	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)
11	10	ad2antlr 728	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
12	9, 11	sseqtrrd 3973	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ ∪ ran (ball‘𝐷))
13		simpr 484	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14		simp-5r 786	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15		simplr 769	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
16	9	ad3antrrr 731	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎 ⊆ 𝑋)
17		simpllr 776	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑎)
18	16, 17	sseldd 3936	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑋)
19		metustbl 24522	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥 ∈ 𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
20	14, 15, 18, 19	syl3anc 1374	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
21		sstr 3944	. . . . . . . . . . 11 ⊢ ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏 ⊆ 𝑎)
22	21	expcom 413	. . . . . . . . . 10 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏 ⊆ 𝑎))
23	22	anim2d 613	. . . . . . . . 9 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
24	23	reximdv 3153	. . . . . . . 8 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
25	13, 20, 24	sylc 65	. . . . . . 7 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
26	7	simprd 495	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
27	26	r19.21bi 3230	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
28	25, 27	r19.29a 3146	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
29	28	ralrimiva 3130	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
30	12, 29	jca 511	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
31		fvex 6855	. . . . . 6 ⊢ (ball‘𝐷) ∈ V
32	31	rnex 7862	. . . . 5 ⊢ ran (ball‘𝐷) ∈ V
33		eltg2 22914	. . . . 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 257	. . 3 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ (topGen‘ran (ball‘𝐷)))
36	32, 33	mp1i 13	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))))
37	36	biimpa 476	. . . . . . . 8 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
38	37	simpld 494	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ⊆ ∪ ran (ball‘𝐷))
39	10	ad2antlr 728	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
40	38, 39	sseqtrd 3972	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ⊆ 𝑋)
41		elpwg 4559	. . . . . . 7 ⊢ (𝑎 ∈ (topGen‘ran (ball‘𝐷)) → (𝑎 ∈ 𝒫 𝑋 ↔ 𝑎 ⊆ 𝑋))
42	41	adantl 481	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ↔ 𝑎 ⊆ 𝑋))
43	40, 42	mpbird 257	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
44		simpllr 776	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
45	40	sselda 3935	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → 𝑥 ∈ 𝑋)
46	37	simprd 495	. . . . . . . . . . 11 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
47	46	r19.21bi 3230	. . . . . . . . . 10 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
48		blssexps 24382	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
49	44, 45, 48	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
50	47, 49	mpbid 232	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51		blval2 24518	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
52	51	3expa 1119	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
53	52	sseq1d 3967	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
54	53	rexbidva 3160	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
55	54	biimpa 476	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
56	44, 45, 50, 55	syl21anc 838	. . . . . . . 8 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57		cnvexg 7876	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V)
58		imaexg 7865	. . . . . . . . . . 11 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑑)) ∈ V)
59	57, 58	syl 17	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (◡𝐷 “ (0[,)𝑑)) ∈ V)
60	59	ralrimivw 3134	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (◡𝐷 “ (0[,)𝑑)) ∈ V)
61		eqid 2737	. . . . . . . . . 10 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))
62		imaeq1 6022	. . . . . . . . . . 11 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
63	62	sseq1d 3967	. . . . . . . . . 10 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
64	61, 63	rexrnmptw 7049	. . . . . . . . 9 ⊢ (∀𝑑 ∈ ℝ+ (◡𝐷 “ (0[,)𝑑)) ∈ V → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
65	44, 60, 64	3syl 18	. . . . . . . 8 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
66	56, 65	mpbird 257	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎)
67		oveq2 7376	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
68	67	imaeq2d 6027	. . . . . . . . . . . . . 14 ⊢ (𝑑 = 𝑒 → (◡𝐷 “ (0[,)𝑑)) = (◡𝐷 “ (0[,)𝑒)))
69	68	cbvmptv 5204	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
70	69	rneqi 5894	. . . . . . . . . . . 12 ⊢ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
71	70	metustfbas 24513	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72		ssfg 23828	. . . . . . . . . . 11 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
73	71, 72	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
74		metuval 24505	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
75	74	adantl 481	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
76	73, 75	sseqtrrd 3973	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77		ssrexv 4005	. . . . . . . . 9 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
78	76, 77	syl 17	. . . . . . . 8 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
79	78	ad2antrr 727	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
80	66, 79	mpd 15	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
81	80	ralrimiva 3130	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
82	43, 81	jca 511	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
83	6	biimpar 477	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
84	82, 83	syldan 592	. . 3 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
85	35, 84	impbida 801	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
86	85	eqrdv 2735	1 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ⊆ wss 3903  ∅c0 4287  𝒫 cpw 4556  {csn 4582  ∪ cuni 4865   ↦ cmpt 5181   × cxp 5630  ^◡ccnv 5631  ran crn 5633   “ cima 5635  ‘cfv 6500  (class class class)co 7368  0cc0 11038  ℝ⁺crp 12917  [,)cico 13275  topGenctg 17369  PsMetcpsmet 21305  ballcbl 21308  fBascfbas 21309  filGencfg 21310  metUnifcmetu 21312  UnifOncust 24156  unifTopcutop 24186

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-sup 9357  df-inf 9358  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-div 11807  df-nn 12158  df-2 12220  df-n0 12414  df-z 12501  df-uz 12764  df-q 12874  df-rp 12918  df-xneg 13038  df-xadd 13039  df-xmul 13040  df-ico 13279  df-topgen 17375  df-psmet 21313  df-bl 21316  df-fbas 21318  df-fg 21319  df-metu 21320  df-fil 23802  df-ust 24157  df-utop 24187

This theorem is referenced by:  xmetutop  24524