Theorem psmetutop 24462

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 24455	. . . . . . . . . . . 12 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2		utopval 24127	. . . . . . . . . . . 12 ⊢ ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
3	1, 2	syl 17	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
4	3	eleq2d 2815	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5		rabid 3430	. . . . . . . . . 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 4575	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ 𝑋)
10		unirnblps 24314	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)
11	10	ad2antlr 727	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
12	9, 11	sseqtrrd 3987	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ⊆ ∪ ran (ball‘𝐷))
13		simpr 484	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14		simp-5r 785	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15		simplr 768	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
16	9	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎 ⊆ 𝑋)
17		simpllr 775	. . . . . . . . . 10 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑎)
18	16, 17	sseldd 3950	. . . . . . . . 9 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥 ∈ 𝑋)
19		metustbl 24461	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥 ∈ 𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
20	14, 15, 18, 19	syl3anc 1373	. . . . . . . 8 ⊢ ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})))
21		sstr 3958	. . . . . . . . . . 11 ⊢ ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏 ⊆ 𝑎)
22	21	expcom 413	. . . . . . . . . 10 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏 ⊆ 𝑎))
23	22	anim2d 612	. . . . . . . . 9 ⊢ ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
24	23	reximdv 3149	. . . . . . . 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 3142	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
29	28	ralrimiva 3126	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎))
30	12, 29	jca 511	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ⊆ ∪ ran (ball‘𝐷) ∧ ∀𝑥 ∈ 𝑎 ∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎)))
31		fvex 6874	. . . . . 6 ⊢ (ball‘𝐷) ∈ V
32	31	rnex 7889	. . . . 5 ⊢ ran (ball‘𝐷) ∈ V
33		eltg2 22852	. . . . 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 727	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∪ ran (ball‘𝐷) = 𝑋)
40	38, 39	sseqtrd 3986	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ⊆ 𝑋)
41		elpwg 4569	. . . . . . 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 775	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
45	40	sselda 3949	. . . . . . . . 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 24321	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
49	44, 45, 48	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥 ∈ 𝑏 ∧ 𝑏 ⊆ 𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
50	47, 49	mpbid 232	. . . . . . . . 9 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51		blval2 24457	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
52	51	3expa 1118	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
53	52	sseq1d 3981	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
54	53	rexbidva 3156	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
55	54	biimpa 476	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
56	44, 45, 50, 55	syl21anc 837	. . . . . . . 8 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑑 ∈ ℝ+ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57		cnvexg 7903	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V)
58		imaexg 7892	. . . . . . . . . . 11 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑑)) ∈ V)
59	57, 58	syl 17	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (◡𝐷 “ (0[,)𝑑)) ∈ V)
60	59	ralrimivw 3130	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (◡𝐷 “ (0[,)𝑑)) ∈ V)
61		eqid 2730	. . . . . . . . . 10 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))
62		imaeq1 6029	. . . . . . . . . . 11 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}))
63	62	sseq1d 3981	. . . . . . . . . 10 ⊢ (𝑣 = (◡𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((◡𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
64	61, 63	rexrnmptw 7070	. . . . . . . . 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 7398	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
68	67	imaeq2d 6034	. . . . . . . . . . . . . 14 ⊢ (𝑑 = 𝑒 → (◡𝐷 “ (0[,)𝑑)) = (◡𝐷 “ (0[,)𝑒)))
69	68	cbvmptv 5214	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
70	69	rneqi 5904	. . . . . . . . . . . 12 ⊢ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑒)))
71	70	metustfbas 24452	. . . . . . . . . . 11 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72		ssfg 23766	. . . . . . . . . . 11 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
73	71, 72	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
74		metuval 24444	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
75	74	adantl 481	. . . . . . . . . 10 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))))
76	73, 75	sseqtrrd 3987	. . . . . . . . 9 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77		ssrexv 4019	. . . . . . . . 9 ⊢ (ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
78	76, 77	syl 17	. . . . . . . 8 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
79	78	ad2antrr 726	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
80	66, 79	mpd 15	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥 ∈ 𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
81	80	ralrimiva 3126	. . . . 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 591	. . 3 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
85	35, 84	impbida 800	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
86	85	eqrdv 2728	1 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  ∃wrex 3054  {crab 3408  Vcvv 3450   ⊆ wss 3917  ∅c0 4299  𝒫 cpw 4566  {csn 4592  ∪ cuni 4874   ↦ cmpt 5191   × cxp 5639  ^◡ccnv 5640  ran crn 5642   “ cima 5644  ‘cfv 6514  (class class class)co 7390  0cc0 11075  ℝ⁺crp 12958  [,)cico 13315  topGenctg 17407  PsMetcpsmet 21255  ballcbl 21258  fBascfbas 21259  filGencfg 21260  metUnifcmetu 21262  UnifOncust 24094  unifTopcutop 24125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152  ax-pre-sup 11153

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-er 8674  df-map 8804  df-en 8922  df-dom 8923  df-sdom 8924  df-sup 9400  df-inf 9401  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-div 11843  df-nn 12194  df-2 12256  df-n0 12450  df-z 12537  df-uz 12801  df-q 12915  df-rp 12959  df-xneg 13079  df-xadd 13080  df-xmul 13081  df-ico 13319  df-topgen 17413  df-psmet 21263  df-bl 21266  df-fbas 21268  df-fg 21269  df-metu 21270  df-fil 23740  df-ust 24095  df-utop 24126

This theorem is referenced by:  xmetutop  24463