| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnei | Structured version Visualization version GIF version | ||
| Description: The predicate "the class 𝑁 is a neighborhood of 𝑆". (Contributed by FL, 25-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
| Ref | Expression |
|---|---|
| neifval.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| isnei | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neifval.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | neival 23142 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
| 3 | 2 | eleq2d 2847 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})) |
| 4 | sseq2 3962 | . . . . . . 7 ⊢ (𝑣 = 𝑁 → (𝑔 ⊆ 𝑣 ↔ 𝑔 ⊆ 𝑁)) | |
| 5 | 4 | anbi2d 639 | . . . . . 6 ⊢ (𝑣 = 𝑁 → ((𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 6 | 5 | rexbidv 3185 | . . . . 5 ⊢ (𝑣 = 𝑁 → (∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 7 | 6 | elrab 3650 | . . . 4 ⊢ (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ∈ 𝒫 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 8 | 1 | topopn 22946 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 9 | elpw2g 5288 | . . . . . 6 ⊢ (𝑋 ∈ 𝐽 → (𝑁 ∈ 𝒫 𝑋 ↔ 𝑁 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 17 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝑁 ∈ 𝒫 𝑋 ↔ 𝑁 ⊆ 𝑋)) |
| 11 | 10 | anbi1d 640 | . . . 4 ⊢ (𝐽 ∈ Top → ((𝑁 ∈ 𝒫 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 12 | 7, 11 | bitrid 285 | . . 3 ⊢ (𝐽 ∈ Top → (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 13 | 12 | adantr 484 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 14 | 3, 13 | bitrd 281 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∃wrex 3085 {crab 3413 ⊆ wss 3904 𝒫 cpw 4554 ∪ cuni 4864 ‘cfv 6517 Topctop 22933 neicnei 23137 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-top 22934 df-nei 23138 |
| This theorem is referenced by: neiint 23144 isneip 23145 neii1 23146 neii2 23148 neiss 23149 neips 23153 opnneissb 23154 opnssneib 23155 ssnei2 23156 innei 23165 neitr 23220 neitx 23647 neifg 36695 islptre 46159 sepfsepc 49513 |
| Copyright terms: Public domain | W3C validator |