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

Theorem psmetutop 23465
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.
StepHypRef Expression
1 metuust 23458 . . . . . . . . . . . 12 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2 utopval 23130 . . . . . . . . . . . 12 ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
31, 2syl 17 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
43eleq2d 2823 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5 rabid 3290 . . . . . . . . . 10 (𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
64, 5bitrdi 290 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)))
76biimpa 480 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
87simpld 498 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
98elpwid 4524 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎𝑋)
10 unirnblps 23317 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → ran (ball‘𝐷) = 𝑋)
1110ad2antlr 727 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ran (ball‘𝐷) = 𝑋)
129, 11sseqtrrd 3942 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ran (ball‘𝐷))
13 simpr 488 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14 simp-5r 786 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15 simplr 769 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
169ad3antrrr 730 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎𝑋)
17 simpllr 776 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑎)
1816, 17sseldd 3902 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑋)
19 metustbl 23464 . . . . . . . . 9 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
2014, 15, 18, 19syl3anc 1373 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
21 sstr 3909 . . . . . . . . . . 11 ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏𝑎)
2221expcom 417 . . . . . . . . . 10 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏𝑎))
2322anim2d 615 . . . . . . . . 9 ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥𝑏𝑏𝑎)))
2423reximdv 3192 . . . . . . . 8 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
2513, 20, 24sylc 65 . . . . . . 7 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
267simprd 499 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2726r19.21bi 3130 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2825, 27r19.29a 3208 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
2928ralrimiva 3105 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
3012, 29jca 515 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
31 fvex 6730 . . . . . 6 (ball‘𝐷) ∈ V
3231rnex 7690 . . . . 5 ran (ball‘𝐷) ∈ V
33 eltg2 21855 . . . . 5 (ran (ball‘𝐷) ∈ V → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))))
3432, 33mp1i 13 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))))
3530, 34mpbird 260 . . 3 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ (topGen‘ran (ball‘𝐷)))
3632, 33mp1i 13 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))))
3736biimpa 480 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
3837simpld 498 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ran (ball‘𝐷))
3910ad2antlr 727 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ran (ball‘𝐷) = 𝑋)
4038, 39sseqtrd 3941 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎𝑋)
41 elpwg 4516 . . . . . . 7 (𝑎 ∈ (topGen‘ran (ball‘𝐷)) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4241adantl 485 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4340, 42mpbird 260 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
44 simpllr 776 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝐷 ∈ (PsMet‘𝑋))
4540sselda 3901 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝑥𝑋)
4637simprd 499 . . . . . . . . . . 11 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
4746r19.21bi 3130 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
48 blssexps 23324 . . . . . . . . . . 11 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
4944, 45, 48syl2anc 587 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
5047, 49mpbid 235 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51 blval2 23460 . . . . . . . . . . . . 13 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
52513expa 1120 . . . . . . . . . . . 12 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
5352sseq1d 3932 . . . . . . . . . . 11 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5453rexbidva 3215 . . . . . . . . . 10 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5554biimpa 480 . . . . . . . . 9 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
5644, 45, 50, 55syl21anc 838 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57 cnvexg 7702 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ V)
58 imaexg 7693 . . . . . . . . . . 11 (𝐷 ∈ V → (𝐷 “ (0[,)𝑑)) ∈ V)
5957, 58syl 17 . . . . . . . . . 10 (𝐷 ∈ (PsMet‘𝑋) → (𝐷 “ (0[,)𝑑)) ∈ V)
6059ralrimivw 3106 . . . . . . . . 9 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V)
61 eqid 2737 . . . . . . . . . 10 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))
62 imaeq1 5924 . . . . . . . . . . 11 (𝑣 = (𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
6362sseq1d 3932 . . . . . . . . . 10 (𝑣 = (𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6461, 63rexrnmptw 6914 . . . . . . . . 9 (∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6544, 60, 643syl 18 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6656, 65mpbird 260 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎)
67 oveq2 7221 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
6867imaeq2d 5929 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → (𝐷 “ (0[,)𝑑)) = (𝐷 “ (0[,)𝑒)))
6968cbvmptv 5158 . . . . . . . . . . . . 13 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7069rneqi 5806 . . . . . . . . . . . 12 ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7170metustfbas 23455 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72 ssfg 22769 . . . . . . . . . . 11 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7371, 72syl 17 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
74 metuval 23447 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7574adantl 485 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7673, 75sseqtrrd 3942 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77 ssrexv 3968 . . . . . . . . 9 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7876, 77syl 17 . . . . . . . 8 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7978ad2antrr 726 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
8066, 79mpd 15 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
8180ralrimiva 3105 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
8243, 81jca 515 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
836biimpar 481 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
8482, 83syldan 594 . . 3 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
8535, 84impbida 801 . 2 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
8685eqrdv 2735 1 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1543  wcel 2110  wne 2940  wral 3061  wrex 3062  {crab 3065  Vcvv 3408  wss 3866  c0 4237  𝒫 cpw 4513  {csn 4541   cuni 4819  cmpt 5135   × cxp 5549  ccnv 5550  ran crn 5552  cima 5554  cfv 6380  (class class class)co 7213  0cc0 10729  +crp 12586  [,)cico 12937  topGenctg 16942  PsMetcpsmet 20347  ballcbl 20350  fBascfbas 20351  filGencfg 20352  metUnifcmetu 20354  UnifOncust 23097  unifTopcutop 23128
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523  ax-cnex 10785  ax-resscn 10786  ax-1cn 10787  ax-icn 10788  ax-addcl 10789  ax-addrcl 10790  ax-mulcl 10791  ax-mulrcl 10792  ax-mulcom 10793  ax-addass 10794  ax-mulass 10795  ax-distr 10796  ax-i2m1 10797  ax-1ne0 10798  ax-1rid 10799  ax-rnegex 10800  ax-rrecex 10801  ax-cnre 10802  ax-pre-lttri 10803  ax-pre-lttrn 10804  ax-pre-ltadd 10805  ax-pre-mulgt0 10806  ax-pre-sup 10807
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-pred 6160  df-ord 6216  df-on 6217  df-lim 6218  df-suc 6219  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-om 7645  df-1st 7761  df-2nd 7762  df-wrecs 8047  df-recs 8108  df-rdg 8146  df-er 8391  df-map 8510  df-en 8627  df-dom 8628  df-sdom 8629  df-sup 9058  df-inf 9059  df-pnf 10869  df-mnf 10870  df-xr 10871  df-ltxr 10872  df-le 10873  df-sub 11064  df-neg 11065  df-div 11490  df-nn 11831  df-2 11893  df-n0 12091  df-z 12177  df-uz 12439  df-q 12545  df-rp 12587  df-xneg 12704  df-xadd 12705  df-xmul 12706  df-ico 12941  df-topgen 16948  df-psmet 20355  df-bl 20358  df-fbas 20360  df-fg 20361  df-metu 20362  df-fil 22743  df-ust 23098  df-utop 23129
This theorem is referenced by:  xmetutop  23466
  Copyright terms: Public domain W3C validator