Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ustuqtop | Structured version Visualization version GIF version |
Description: For a given uniform structure 𝑈 on a set 𝑋, there is a unique topology 𝑗 such that the set ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) is the filter of the neighborhoods of 𝑝 for that topology. Proposition 1 of [BourbakiTop1] p. II.3. (Contributed by Thierry Arnoux, 11-Jan-2018.) |
Ref | Expression |
---|---|
utopustuq.1 | ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) |
Ref | Expression |
---|---|
ustuqtop | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∃!𝑗 ∈ (TopOn‘𝑋)∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6774 | . . . . . . 7 ⊢ (𝑝 = 𝑟 → (𝑁‘𝑝) = (𝑁‘𝑟)) | |
2 | 1 | eleq2d 2824 | . . . . . 6 ⊢ (𝑝 = 𝑟 → (𝑐 ∈ (𝑁‘𝑝) ↔ 𝑐 ∈ (𝑁‘𝑟))) |
3 | 2 | cbvralvw 3383 | . . . . 5 ⊢ (∀𝑝 ∈ 𝑐 𝑐 ∈ (𝑁‘𝑝) ↔ ∀𝑟 ∈ 𝑐 𝑐 ∈ (𝑁‘𝑟)) |
4 | eleq1w 2821 | . . . . . 6 ⊢ (𝑐 = 𝑎 → (𝑐 ∈ (𝑁‘𝑝) ↔ 𝑎 ∈ (𝑁‘𝑝))) | |
5 | 4 | raleqbi1dv 3340 | . . . . 5 ⊢ (𝑐 = 𝑎 → (∀𝑝 ∈ 𝑐 𝑐 ∈ (𝑁‘𝑝) ↔ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝))) |
6 | 3, 5 | bitr3id 285 | . . . 4 ⊢ (𝑐 = 𝑎 → (∀𝑟 ∈ 𝑐 𝑐 ∈ (𝑁‘𝑟) ↔ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝))) |
7 | 6 | cbvrabv 3426 | . . 3 ⊢ {𝑐 ∈ 𝒫 𝑋 ∣ ∀𝑟 ∈ 𝑐 𝑐 ∈ (𝑁‘𝑟)} = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} |
8 | utopustuq.1 | . . . 4 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) | |
9 | 8 | ustuqtop0 23392 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
10 | 8 | ustuqtop1 23393 | . . 3 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑏 ∈ (𝑁‘𝑝)) |
11 | 8 | ustuqtop2 23394 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝)) |
12 | 8 | ustuqtop3 23395 | . . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎) |
13 | 8 | ustuqtop4 23396 | . . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑏 ∈ (𝑁‘𝑝)∀𝑥 ∈ 𝑏 𝑎 ∈ (𝑁‘𝑥)) |
14 | 8 | ustuqtop5 23397 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝)) |
15 | 7, 9, 10, 11, 12, 13, 14 | neiptopreu 22284 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) |
16 | 9 | feqmptd 6837 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁 = (𝑝 ∈ 𝑋 ↦ (𝑁‘𝑝))) |
17 | 16 | eqeq1d 2740 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ (𝑝 ∈ 𝑋 ↦ (𝑁‘𝑝)) = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))) |
18 | fvex 6787 | . . . . . 6 ⊢ (𝑁‘𝑝) ∈ V | |
19 | 18 | rgenw 3076 | . . . . 5 ⊢ ∀𝑝 ∈ 𝑋 (𝑁‘𝑝) ∈ V |
20 | mpteqb 6894 | . . . . 5 ⊢ (∀𝑝 ∈ 𝑋 (𝑁‘𝑝) ∈ V → ((𝑝 ∈ 𝑋 ↦ (𝑁‘𝑝)) = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ ∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝}))) | |
21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ ((𝑝 ∈ 𝑋 ↦ (𝑁‘𝑝)) = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ ∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝})) |
22 | 17, 21 | bitrdi 287 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ ∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝}))) |
23 | 22 | reubidv 3323 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ ∃!𝑗 ∈ (TopOn‘𝑋)∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝}))) |
24 | 15, 23 | mpbid 231 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∃!𝑗 ∈ (TopOn‘𝑋)∀𝑝 ∈ 𝑋 (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∃!wreu 3066 {crab 3068 Vcvv 3432 𝒫 cpw 4533 {csn 4561 ↦ cmpt 5157 ran crn 5590 “ cima 5592 ‘cfv 6433 TopOnctopon 22059 neicnei 22248 UnifOncust 23351 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-om 7713 df-1o 8297 df-er 8498 df-en 8734 df-fin 8737 df-fi 9170 df-top 22043 df-topon 22060 df-ntr 22171 df-nei 22249 df-ust 23352 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |