![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > utopval | Structured version Visualization version GIF version |
Description: The topology induced by a uniform structure 𝑈. (Contributed by Thierry Arnoux, 30-Nov-2017.) |
Ref | Expression |
---|---|
utopval | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-utop 22082 | . . 3 ⊢ unifTop = (𝑢 ∈ ∪ ran UnifOn ↦ {𝑎 ∈ 𝒫 dom ∪ 𝑢 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑢 (𝑣 “ {𝑥}) ⊆ 𝑎}) | |
2 | 1 | a1i 11 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → unifTop = (𝑢 ∈ ∪ ran UnifOn ↦ {𝑎 ∈ 𝒫 dom ∪ 𝑢 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑢 (𝑣 “ {𝑥}) ⊆ 𝑎})) |
3 | simpr 476 | . . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈) | |
4 | 3 | unieqd 4478 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ∪ 𝑢 = ∪ 𝑈) |
5 | 4 | dmeqd 5358 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → dom ∪ 𝑢 = dom ∪ 𝑈) |
6 | ustbas2 22076 | . . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = dom ∪ 𝑈) | |
7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑋 = dom ∪ 𝑈) |
8 | 5, 7 | eqtr4d 2688 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → dom ∪ 𝑢 = 𝑋) |
9 | 8 | pweqd 4196 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝒫 dom ∪ 𝑢 = 𝒫 𝑋) |
10 | 3 | rexeqdv 3175 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → (∃𝑣 ∈ 𝑢 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎)) |
11 | 10 | ralbidv 3015 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → (∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑢 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎)) |
12 | 9, 11 | rabeqbidv 3226 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → {𝑎 ∈ 𝒫 dom ∪ 𝑢 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑢 (𝑣 “ {𝑥}) ⊆ 𝑎} = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎}) |
13 | elrnust 22075 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn) | |
14 | elfvex 6259 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V) | |
15 | pwexg 4880 | . . 3 ⊢ (𝑋 ∈ V → 𝒫 𝑋 ∈ V) | |
16 | rabexg 4844 | . . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎} ∈ V) | |
17 | 14, 15, 16 | 3syl 18 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎} ∈ V) |
18 | 2, 12, 13, 17 | fvmptd 6327 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 ∈ wcel 2030 ∀wral 2941 ∃wrex 2942 {crab 2945 Vcvv 3231 ⊆ wss 3607 𝒫 cpw 4191 {csn 4210 ∪ cuni 4468 ↦ cmpt 4762 dom cdm 5143 ran crn 5144 “ cima 5146 ‘cfv 5926 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 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 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-ral 2946 df-rex 2947 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-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-iota 5889 df-fun 5928 df-fn 5929 df-fv 5934 df-ust 22051 df-utop 22082 |
This theorem is referenced by: elutop 22084 utoptop 22085 utopbas 22086 utopsnneiplem 22098 psmetutop 22419 |
Copyright terms: Public domain | W3C validator |