| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrneiel | Structured version Visualization version GIF version | ||
| Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then there is an equivalence between membership in the interior of a set and non-membership in the closure of the complement of the set. (Contributed by RP, 29-May-2021.) |
| Ref | Expression |
|---|---|
| ntrnei.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
| ntrnei.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
| ntrnei.r | ⊢ (𝜑 → 𝐼𝐹𝑁) |
| ntrnei.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ntrnei.s | ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) |
| Ref | Expression |
|---|---|
| ntrneiel | ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ntrnei.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
| 2 | fveq2 6881 | . . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆)) | |
| 3 | 2 | eleq2d 2849 | . . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 4 | 3 | elrab3 3651 | . . 3 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 5 | 1, 4 | syl 18 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 6 | ntrnei.o | . . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
| 7 | ntrnei.f | . . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
| 8 | ntrnei.r | . . . . . . 7 ⊢ (𝜑 → 𝐼𝐹𝑁) | |
| 9 | 6, 7, 8 | ntrneibex 44799 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V) |
| 10 | 9 | pwexd 5350 | . . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
| 11 | 6, 7, 8 | ntrneiiex 44802 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 12 | eqid 2763 | . . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼) | |
| 13 | ntrnei.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | 6, 10, 9, 7, 11, 12, 13 | fsovfvfvd 44737 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)}) |
| 15 | 6, 7, 8 | ntrneifv1 44805 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
| 16 | 15 | fveq1d 6883 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋)) |
| 17 | 14, 16 | eqtr3d 2800 | . . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋)) |
| 18 | 17 | eleq2d 2849 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| 19 | 5, 18 | bitr3d 284 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2143 {crab 3416 Vcvv 3455 𝒫 cpw 4562 class class class wbr 5109 ↦ cmpt 5192 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 ↑m cmap 8820 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-map 8822 |
| This theorem is referenced by: ntrneifv3 44808 ntrneineine0lem 44809 ntrneineine1lem 44810 ntrneifv4 44811 ntrneiel2 44812 ntrneicls00 44815 ntrneicls11 44816 ntrneiiso 44817 ntrneik2 44818 ntrneix2 44819 ntrneikb 44820 ntrneixb 44821 ntrneik3 44822 ntrneix3 44823 ntrneik13 44824 ntrneix13 44825 ntrneik4w 44826 ntrneik4 44827 clsneiel1 44834 neicvgel1 44845 |
| Copyright terms: Public domain | W3C validator |