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

Theorem psmetutop 22182
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 22175 . . . . . . . . . . . 12 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) ∈ (UnifOn‘𝑋))
2 utopval 21846 . . . . . . . . . . . 12 ((metUnif‘𝐷) ∈ (UnifOn‘𝑋) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
31, 2syl 17 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎})
43eleq2d 2673 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎}))
5 rabid 3095 . . . . . . . . . 10 (𝑎 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
64, 5syl6bb 275 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)))
76biimpa 500 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
87simpld 474 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
98elpwid 4118 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎𝑋)
10 unirnblps 22034 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → ran (ball‘𝐷) = 𝑋)
1110ad2antlr 759 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ran (ball‘𝐷) = 𝑋)
129, 11sseqtr4d 3605 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → 𝑎 ran (ball‘𝐷))
13 simpr 476 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → (𝑣 “ {𝑥}) ⊆ 𝑎)
14 simp-5r 805 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝐷 ∈ (PsMet‘𝑋))
15 simplr 788 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑣 ∈ (metUnif‘𝐷))
169ad3antrrr 762 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑎𝑋)
17 simpllr 795 . . . . . . . . . 10 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑎)
1816, 17sseldd 3569 . . . . . . . . 9 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑥𝑋)
19 metustbl 22181 . . . . . . . . 9 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑣 ∈ (metUnif‘𝐷) ∧ 𝑥𝑋) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
2014, 15, 18, 19syl3anc 1318 . . . . . . . 8 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})))
21 sstr 3576 . . . . . . . . . . 11 ((𝑏 ⊆ (𝑣 “ {𝑥}) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → 𝑏𝑎)
2221expcom 450 . . . . . . . . . 10 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (𝑏 ⊆ (𝑣 “ {𝑥}) → 𝑏𝑎))
2322anim2d 587 . . . . . . . . 9 ((𝑣 “ {𝑥}) ⊆ 𝑎 → ((𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → (𝑥𝑏𝑏𝑎)))
2423reximdv 2999 . . . . . . . 8 ((𝑣 “ {𝑥}) ⊆ 𝑎 → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏 ⊆ (𝑣 “ {𝑥})) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
2513, 20, 24sylc 63 . . . . . . 7 ((((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) ∧ 𝑣 ∈ (metUnif‘𝐷)) ∧ (𝑣 “ {𝑥}) ⊆ 𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
267simprd 478 . . . . . . . 8 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2726r19.21bi 2916 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
2825, 27r19.29a 3060 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
2928ralrimiva 2949 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
3012, 29jca 553 . . . 4 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (unifTop‘(metUnif‘𝐷))) → (𝑎 ran (ball‘𝐷) ∧ ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎)))
31 fvex 6113 . . . . . 6 (ball‘𝐷) ∈ V
3231rnex 6992 . . . . 5 ran (ball‘𝐷) ∈ V
33 eltg2 20573 . . . . 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 246 . . 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 759 . . . . . . 7 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ran (ball‘𝐷) = 𝑋)
4038, 39sseqtrd 3604 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎𝑋)
41 elpwg 4116 . . . . . . 7 (𝑎 ∈ (topGen‘ran (ball‘𝐷)) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4241adantl 481 . . . . . 6 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → (𝑎 ∈ 𝒫 𝑋𝑎𝑋))
4340, 42mpbird 246 . . . . 5 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → 𝑎 ∈ 𝒫 𝑋)
44 simpllr 795 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝐷 ∈ (PsMet‘𝑋))
4540sselda 3568 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → 𝑥𝑋)
4637simprd 478 . . . . . . . . . . 11 (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) → ∀𝑥𝑎𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
4746r19.21bi 2916 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎))
48 blssexps 22041 . . . . . . . . . . 11 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
4944, 45, 48syl2anc 691 . . . . . . . . . 10 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑏 ∈ ran (ball‘𝐷)(𝑥𝑏𝑏𝑎) ↔ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎))
5047, 49mpbid 221 . . . . . . . . 9 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎)
51 blval2 22177 . . . . . . . . . . . . 13 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
52513expa 1257 . . . . . . . . . . . 12 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → (𝑥(ball‘𝐷)𝑑) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
5352sseq1d 3595 . . . . . . . . . . 11 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ 𝑑 ∈ ℝ+) → ((𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5453rexbidva 3031 . . . . . . . . . 10 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) → (∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
5554biimpa 500 . . . . . . . . 9 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥𝑋) ∧ ∃𝑑 ∈ ℝ+ (𝑥(ball‘𝐷)𝑑) ⊆ 𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
5644, 45, 50, 55syl21anc 1317 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎)
57 cnvexg 7005 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ V)
58 imaexg 6995 . . . . . . . . . . 11 (𝐷 ∈ V → (𝐷 “ (0[,)𝑑)) ∈ V)
5957, 58syl 17 . . . . . . . . . 10 (𝐷 ∈ (PsMet‘𝑋) → (𝐷 “ (0[,)𝑑)) ∈ V)
6059ralrimivw 2950 . . . . . . . . 9 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V)
61 eqid 2610 . . . . . . . . . 10 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))
62 imaeq1 5380 . . . . . . . . . . 11 (𝑣 = (𝐷 “ (0[,)𝑑)) → (𝑣 “ {𝑥}) = ((𝐷 “ (0[,)𝑑)) “ {𝑥}))
6362sseq1d 3595 . . . . . . . . . 10 (𝑣 = (𝐷 “ (0[,)𝑑)) → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6461, 63rexrnmpt 6277 . . . . . . . . 9 (∀𝑑 ∈ ℝ+ (𝐷 “ (0[,)𝑑)) ∈ V → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6544, 60, 643syl 18 . . . . . . . 8 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑑 ∈ ℝ+ ((𝐷 “ (0[,)𝑑)) “ {𝑥}) ⊆ 𝑎))
6656, 65mpbird 246 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎)
67 oveq2 6557 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 → (0[,)𝑑) = (0[,)𝑒))
6867imaeq2d 5385 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → (𝐷 “ (0[,)𝑑)) = (𝐷 “ (0[,)𝑒)))
6968cbvmptv 4678 . . . . . . . . . . . . 13 (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7069rneqi 5273 . . . . . . . . . . . 12 ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) = ran (𝑒 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑒)))
7170metustfbas 22172 . . . . . . . . . . 11 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)))
72 ssfg 21486 . . . . . . . . . . 11 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ∈ (fBas‘(𝑋 × 𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7371, 72syl 17 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
74 metuval 22164 . . . . . . . . . . 11 (𝐷 ∈ (PsMet‘𝑋) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7574adantl 481 . . . . . . . . . 10 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (metUnif‘𝐷) = ((𝑋 × 𝑋)filGenran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))))
7673, 75sseqtr4d 3605 . . . . . . . . 9 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷))
77 ssrexv 3630 . . . . . . . . 9 (ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑))) ⊆ (metUnif‘𝐷) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7876, 77syl 17 . . . . . . . 8 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
7978ad2antrr 758 . . . . . . 7 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → (∃𝑣 ∈ ran (𝑑 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑑)))(𝑣 “ {𝑥}) ⊆ 𝑎 → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎))
8066, 79mpd 15 . . . . . 6 ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑎 ∈ (topGen‘ran (ball‘𝐷))) ∧ 𝑥𝑎) → ∃𝑣 ∈ (metUnif‘𝐷)(𝑣 “ {𝑥}) ⊆ 𝑎)
8180ralrimiva 2949 . . . . 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 873 . 2 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑎 ∈ (unifTop‘(metUnif‘𝐷)) ↔ 𝑎 ∈ (topGen‘ran (ball‘𝐷))))
8685eqrdv 2608 1 ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (unifTop‘(metUnif‘𝐷)) = (topGen‘ran (ball‘𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wne 2780  wral 2896  wrex 2897  {crab 2900  Vcvv 3173  wss 3540  c0 3874  𝒫 cpw 4108  {csn 4125   cuni 4372  cmpt 4643   × cxp 5036  ccnv 5037  ran crn 5039  cima 5041  cfv 5804  (class class class)co 6549  0cc0 9815  +crp 11708  [,)cico 12048  topGenctg 15921  PsMetcpsmet 19551  ballcbl 19554  fBascfbas 19555  filGencfg 19556  metUnifcmetu 19558  UnifOncust 21813  unifTopcutop 21844
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-sup 8231  df-inf 8232  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-xneg 11822  df-xadd 11823  df-xmul 11824  df-ico 12052  df-topgen 15927  df-psmet 19559  df-bl 19562  df-fbas 19564  df-fg 19565  df-metu 19566  df-fil 21460  df-ust 21814  df-utop 21845
This theorem is referenced by:  xmetutop  22183
  Copyright terms: Public domain W3C validator