| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > neiss2 | Structured version Visualization version GIF version | ||
| Description: A set with a neighborhood is a subset of the base set of a topology. (This theorem depends on a function's value being empty outside of its domain, but it will make later theorems simpler to state.) (Contributed by NM, 12-Feb-2007.) |
| Ref | Expression |
|---|---|
| neifval.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| neiss2 | ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ⊆ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfvdm 6924 | . . . 4 ⊢ (𝑁 ∈ ((nei‘𝐽)‘𝑆) → 𝑆 ∈ dom (nei‘𝐽)) | |
| 2 | 1 | adantl 487 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ∈ dom (nei‘𝐽)) |
| 3 | neifval.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 4 | 3 | neif 23427 | . . . . . 6 ⊢ (𝐽 ∈ Top → (nei‘𝐽) Fn 𝒫 𝑋) |
| 5 | 4 | fndmd 6649 | . . . . 5 ⊢ (𝐽 ∈ Top → dom (nei‘𝐽) = 𝒫 𝑋) |
| 6 | 5 | eleq2d 2846 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ∈ dom (nei‘𝐽) ↔ 𝑆 ∈ 𝒫 𝑋)) |
| 7 | 6 | adantr 486 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → (𝑆 ∈ dom (nei‘𝐽) ↔ 𝑆 ∈ 𝒫 𝑋)) |
| 8 | 2, 7 | mpbid 235 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ∈ 𝒫 𝑋) |
| 9 | 8 | elpwid 4565 | 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 ⊆ wss 3896 𝒫 cpw 4556 ∪ cuni 4866 dom cdm 5651 ‘cfv 6543 Topctop 23220 neicnei 23424 |
| 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 5327 ax-pr 5391 |
| 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 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 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 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 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-top 23221 df-nei 23425 |
| This theorem is used by: neii1 23433 neii2 23435 neiss 23436 ssnei2 23443 topssnei 23451 innei 23452 neitx 23935 cvmlift2lem12 36197 neiin 37244 cnneiima 50167 |
| Copyright terms: Public domain | W3C validator |