Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > neival | Structured version Visualization version GIF version |
Description: Value of the set of neighborhoods of a subset of the base set of a topology. (Contributed by NM, 11-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.) |
Ref | Expression |
---|---|
neifval.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
neival | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neifval.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
2 | 1 | neifval 21701 | . . . 4 ⊢ (𝐽 ∈ Top → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})) |
3 | 2 | fveq1d 6666 | . . 3 ⊢ (𝐽 ∈ Top → ((nei‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})‘𝑆)) |
4 | 3 | adantr 483 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})‘𝑆)) |
5 | eqid 2821 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) | |
6 | cleq1lem 14336 | . . . . 5 ⊢ (𝑥 = 𝑆 → ((𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣))) | |
7 | 6 | rexbidv 3297 | . . . 4 ⊢ (𝑥 = 𝑆 → (∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣))) |
8 | 7 | rabbidv 3480 | . . 3 ⊢ (𝑥 = 𝑆 → {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
9 | 1 | topopn 21508 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
10 | elpw2g 5239 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
12 | 11 | biimpar 480 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ∈ 𝒫 𝑋) |
13 | pwexg 5271 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V) | |
14 | rabexg 5226 | . . . . 5 ⊢ (𝒫 𝑋 ∈ V → {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ∈ V) | |
15 | 9, 13, 14 | 3syl 18 | . . . 4 ⊢ (𝐽 ∈ Top → {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ∈ V) |
16 | 15 | adantr 483 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ∈ V) |
17 | 5, 8, 12, 16 | fvmptd3 6785 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
18 | 4, 17 | eqtrd 2856 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 {crab 3142 Vcvv 3494 ⊆ wss 3935 𝒫 cpw 4538 ∪ cuni 4831 ↦ cmpt 5138 ‘cfv 6349 Topctop 21495 neicnei 21699 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-top 21496 df-nei 21700 |
This theorem is referenced by: isnei 21705 |
Copyright terms: Public domain | W3C validator |