| 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 6840 | . . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆)) | |
| 3 | 2 | eleq2d 2822 | . . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆))) |
| 4 | 3 | elrab3 3635 | . . 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 44500 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V) |
| 10 | 9 | pwexd 5321 | . . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
| 11 | 6, 7, 8 | ntrneiiex 44503 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 12 | eqid 2736 | . . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼) | |
| 13 | ntrnei.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | 6, 10, 9, 7, 11, 12, 13 | fsovfvfvd 44438 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)}) |
| 15 | 6, 7, 8 | ntrneifv1 44506 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
| 16 | 15 | fveq1d 6842 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋)) |
| 17 | 14, 16 | eqtr3d 2773 | . . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋)) |
| 18 | 17 | eleq2d 2822 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| 19 | 5, 18 | bitr3d 281 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 {crab 3389 Vcvv 3429 𝒫 cpw 4541 class class class wbr 5085 ↦ cmpt 5166 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 ↑m cmap 8773 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-map 8775 |
| This theorem is referenced by: ntrneifv3 44509 ntrneineine0lem 44510 ntrneineine1lem 44511 ntrneifv4 44512 ntrneiel2 44513 ntrneicls00 44516 ntrneicls11 44517 ntrneiiso 44518 ntrneik2 44519 ntrneix2 44520 ntrneikb 44521 ntrneixb 44522 ntrneik3 44523 ntrneix3 44524 ntrneik13 44525 ntrneix13 44526 ntrneik4w 44527 ntrneik4 44528 clsneiel1 44535 neicvgel1 44546 |
| Copyright terms: Public domain | W3C validator |