| 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 6858 | . . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆)) | |
| 3 | 2 | eleq2d 2814 | . . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 4 | 3 | elrab3 3660 | . . 3 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 5 | 1, 4 | syl 17 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 6 | ntrnei.o | . . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
| 7 | ntrnei.f | . . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
| 8 | ntrnei.r | . . . . . . 7 ⊢ (𝜑 → 𝐼𝐹𝑁) | |
| 9 | 6, 7, 8 | ntrneibex 44062 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V) |
| 10 | 9 | pwexd 5334 | . . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
| 11 | 6, 7, 8 | ntrneiiex 44065 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 12 | eqid 2729 | . . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼) | |
| 13 | ntrnei.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | 6, 10, 9, 7, 11, 12, 13 | fsovfvfvd 44000 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)}) |
| 15 | 6, 7, 8 | ntrneifv1 44068 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
| 16 | 15 | fveq1d 6860 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋)) |
| 17 | 14, 16 | eqtr3d 2766 | . . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋)) |
| 18 | 17 | eleq2d 2814 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| 19 | 5, 18 | bitr3d 281 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 {crab 3405 Vcvv 3447 𝒫 cpw 4563 class class class wbr 5107 ↦ cmpt 5188 ‘cfv 6511 (class class class)co 7387 ∈ cmpo 7389 ↑m cmap 8799 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-1st 7968 df-2nd 7969 df-map 8801 |
| This theorem is referenced by: ntrneifv3 44071 ntrneineine0lem 44072 ntrneineine1lem 44073 ntrneifv4 44074 ntrneiel2 44075 ntrneicls00 44078 ntrneicls11 44079 ntrneiiso 44080 ntrneik2 44081 ntrneix2 44082 ntrneikb 44083 ntrneixb 44084 ntrneik3 44085 ntrneix3 44086 ntrneik13 44087 ntrneix13 44088 ntrneik4w 44089 ntrneik4 44090 clsneiel1 44097 neicvgel1 44108 |
| Copyright terms: Public domain | W3C validator |