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

Theorem psmetutop 22419
 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 22412 . . . . . . . . . . . 12 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2 utopval 22083 . . . . . . . . . . . 12 ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
31, 2syl 17 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
43eleq2d 2716 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5 rabid 3145 . . . . . . . . . 10 (𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
64, 5syl6bb 276 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)))
76biimpa 500 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
87simpld 474 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
98elpwid 4203 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎𝑋)
10 unirnblps 22271 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → ran (ball‘𝐷) = 𝑋)
1110ad2antlr 763 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ran (ball‘𝐷) = 𝑋)
129, 11sseqtr4d 3675 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ran (ball‘𝐷))
13 simpr 476 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14 simp-5r 826 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15 simplr 807 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
169ad3antrrr 766 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎𝑋)
17 simpllr 815 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑎)
1816, 17sseldd 3637 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑋)
19 metustbl 22418 . . . . . . . . 9 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
2014, 15, 18, 19syl3anc 1366 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
21 sstr 3644 . . . . . . . . . . 11 ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏𝑎)
2221expcom 450 . . . . . . . . . 10 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏𝑎))
2322anim2d 588 . . . . . . . . 9 ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥𝑏𝑏𝑎)))
2423reximdv 3045 . . . . . . . 8 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
2513, 20, 24sylc 65 . . . . . . 7 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
267simprd 478 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2726r19.21bi 2961 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2825, 27r19.29a 3107 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
2928ralrimiva 2995 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
3012, 29jca 553 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
31 fvex 6239 . . . . . 6 (ball‘𝐷) ∈ V
3231rnex 7142 . . . . 5 ran (ball‘𝐷) ∈ V
33 eltg2 20810 . . . . 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 247 . . 3 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ (topGen‘ran (ball‘𝐷)))
3632, 33mp1i 13 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (topGen‘ran (ball‘𝐷)) ↔ (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))))
3736biimpa 500 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
3837simpld 474 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ran (ball‘𝐷))
3910ad2antlr 763 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ran (ball‘𝐷) = 𝑋)
4038, 39sseqtrd 3674 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎𝑋)
41 elpwg 4199 . . . . . . 7 (𝑎 ∈ (topGen‘ran (ball‘𝐷)) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4241adantl 481 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4340, 42mpbird 247 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
44 simpllr 815 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝐷 ∈ (PsMet‘𝑋))
4540sselda 3636 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝑥𝑋)
4637simprd 478 . . . . . . . . . . 11 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
4746r19.21bi 2961 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
48 blssexps 22278 . . . . . . . . . . 11 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
4944, 45, 48syl2anc 694 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
5047, 49mpbid 222 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51 blval2 22414 . . . . . . . . . . . . 13 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
52513expa 1284 . . . . . . . . . . . 12 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
5352sseq1d 3665 . . . . . . . . . . 11 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5453rexbidva 3078 . . . . . . . . . 10 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5554biimpa 500 . . . . . . . . 9 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
5644, 45, 50, 55syl21anc 1365 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57 cnvexg 7154 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ V)
58 imaexg 7145 . . . . . . . . . . 11 (𝐷 ∈ V → (𝐷 “ (0[,)𝑑)) ∈ V)
5957, 58syl 17 . . . . . . . . . 10 (𝐷 ∈ (PsMet‘𝑋) → (𝐷 “ (0[,)𝑑)) ∈ V)
6059ralrimivw 2996 . . . . . . . . 9 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V)
61 eqid 2651 . . . . . . . . . 10 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))
62 imaeq1 5496 . . . . . . . . . . 11 (𝑣 = (𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
6362sseq1d 3665 . . . . . . . . . 10 (𝑣 = (𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6461, 63rexrnmpt 6409 . . . . . . . . 9 (∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6544, 60, 643syl 18 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6656, 65mpbird 247 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎)
67 oveq2 6698 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
6867imaeq2d 5501 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → (𝐷 “ (0[,)𝑑)) = (𝐷 “ (0[,)𝑒)))
6968cbvmptv 4783 . . . . . . . . . . . . 13 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7069rneqi 5384 . . . . . . . . . . . 12 ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7170metustfbas 22409 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72 ssfg 21723 . . . . . . . . . . 11 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7371, 72syl 17 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
74 metuval 22401 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7574adantl 481 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7673, 75sseqtr4d 3675 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77 ssrexv 3700 . . . . . . . . 9 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7876, 77syl 17 . . . . . . . 8 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7978ad2antrr 762 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
8066, 79mpd 15 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
8180ralrimiva 2995 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
8243, 81jca 553 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
836biimpar 501 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
8482, 83syldan 486 . . 3 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ (unifTop‘(metUnif‘𝐷)))
8535, 84impbida 895 . 2 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
8685eqrdv 2649 1 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523   ∈ wcel 2030   ≠ wne 2823  ∀wral 2941  ∃wrex 2942  {crab 2945  Vcvv 3231   ⊆ wss 3607  ∅c0 3948  𝒫 cpw 4191  {csn 4210  ∪ cuni 4468   ↦ cmpt 4762   × cxp 5141  ◡ccnv 5142  ran crn 5144   “ cima 5146  ‘cfv 5926  (class class class)co 6690  0cc0 9974  ℝ+crp 11870  [,)cico 12215  topGenctg 16145  PsMetcpsmet 19778  ballcbl 19781  fBascfbas 19782  filGencfg 19783  metUnifcmetu 19785  UnifOncust 22050  unifTopcutop 22081 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-er 7787  df-map 7901  df-en 7998  df-dom 7999  df-sdom 8000  df-sup 8389  df-inf 8390  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-n0 11331  df-z 11416  df-uz 11726  df-q 11827  df-rp 11871  df-xneg 11984  df-xadd 11985  df-xmul 11986  df-ico 12219  df-topgen 16151  df-psmet 19786  df-bl 19789  df-fbas 19791  df-fg 19792  df-metu 19793  df-fil 21697  df-ust 22051  df-utop 22082 This theorem is referenced by:  xmetutop  22420
 Copyright terms: Public domain W3C validator