| 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 23425 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
| 3 | 2 | eleq2d 2846 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})) |
| 4 | sseq2 3934 | . . . . . . 7 ⊢ (𝑣 = 𝑁 → (𝑔 ⊆ 𝑣 ↔ 𝑔 ⊆ 𝑁)) | |
| 5 | 4 | anbi2d 642 | . . . . . 6 ⊢ (𝑣 = 𝑁 → ((𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 6 | 5 | rexbidv 3186 | . . . . 5 ⊢ (𝑣 = 𝑁 → (∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 7 | 6 | elrab 3644 | . . . 4 ⊢ (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ∈ 𝒫 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 8 | 1 | topopn 23229 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 9 | elpw2g 5294 | . . . . . 6 ⊢ (𝑋 ∈ 𝐽 → (𝑁 ∈ 𝒫 𝑋 ↔ 𝑁 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 18 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝑁 ∈ 𝒫 𝑋 ↔ 𝑁 ⊆ 𝑋)) |
| 11 | 10 | anbi1d 643 | . . . 4 ⊢ (𝐽 ∈ Top → ((𝑁 ∈ 𝒫 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 12 | 7, 11 | bitrid 286 | . . 3 ⊢ (𝐽 ∈ Top → (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 13 | 12 | adantr 486 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| 14 | 3, 13 | bitrd 282 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 {crab 3412 ⊆ wss 3895 𝒫 cpw 4556 ∪ cuni 4866 ‘cfv 6538 Topctop 23216 neicnei 23420 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-top 23217 df-nei 23421 |
| This theorem is used by: neiint 23427 isneip 23428 neii1 23429 neii2 23431 neiss 23432 neips 23436 opnneissb 23437 opnssneib 23438 ssnei2 23439 innei 23448 neitr 23503 neitx 23931 neifg 37251 islptre 46724 sepfsepc 50135 |
| Copyright terms: Public domain | W3C validator |