| 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 23400 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((nei‘𝐽)‘𝑆) = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)}) |
| 3 | 2 | eleq2d 2847 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)})) |
| 4 | sseq2 3957 | . . . . . . 7 ⊢ (𝑣 = 𝑁 → (𝑔 ⊆ 𝑣 ↔ 𝑔 ⊆ 𝑁)) | |
| 5 | 4 | anbi2d 642 | . . . . . 6 ⊢ (𝑣 = 𝑁 → ((𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 6 | 5 | rexbidv 3187 | . . . . 5 ⊢ (𝑣 = 𝑁 → (∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣) ↔ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 7 | 6 | elrab 3645 | . . . 4 ⊢ (𝑁 ∈ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑣)} ↔ (𝑁 ∈ 𝒫 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))) |
| 8 | 1 | topopn 23204 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 9 | elpw2g 5295 | . . . . . 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 1570 ∈ wcel 2145 ∃wrex 3087 {crab 3413 ⊆ wss 3899 𝒫 cpw 4557 ∪ cuni 4867 ‘cfv 6531 Topctop 23191 neicnei 23395 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-top 23192 df-nei 23396 |
| This theorem is used by: neiint 23402 isneip 23403 neii1 23404 neii2 23406 neiss 23407 neips 23411 opnneissb 23412 opnssneib 23413 ssnei2 23414 innei 23423 neitr 23478 neitx 23906 neifg 37129 islptre 46575 sepfsepc 49980 |
| Copyright terms: Public domain | W3C validator |