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 6771 | . . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆)) | |
3 | 2 | eleq2d 2826 | . . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆))) |
4 | 3 | elrab3 3627 | . . 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 41653 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V) |
10 | 9 | pwexd 5306 | . . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
11 | 6, 7, 8 | ntrneiiex 41656 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
12 | eqid 2740 | . . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼) | |
13 | ntrnei.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
14 | 6, 10, 9, 7, 11, 12, 13 | fsovfvfvd 41589 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)}) |
15 | 6, 7, 8 | ntrneifv1 41659 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
16 | 15 | fveq1d 6773 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋)) |
17 | 14, 16 | eqtr3d 2782 | . . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋)) |
18 | 17 | eleq2d 2826 | . 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋))) |
19 | 5, 18 | bitr3d 280 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1542 ∈ wcel 2110 {crab 3070 Vcvv 3431 𝒫 cpw 4539 class class class wbr 5079 ↦ cmpt 5162 ‘cfv 6432 (class class class)co 7271 ∈ cmpo 7273 ↑m cmap 8598 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5490 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-ov 7274 df-oprab 7275 df-mpo 7276 df-1st 7824 df-2nd 7825 df-map 8600 |
This theorem is referenced by: ntrneifv3 41662 ntrneineine0lem 41663 ntrneineine1lem 41664 ntrneifv4 41665 ntrneiel2 41666 ntrneicls00 41669 ntrneicls11 41670 ntrneiiso 41671 ntrneik2 41672 ntrneix2 41673 ntrneikb 41674 ntrneixb 41675 ntrneik3 41676 ntrneix3 41677 ntrneik13 41678 ntrneix13 41679 ntrneik4w 41680 ntrneik4 41681 clsneiel1 41688 neicvgel1 41699 |
Copyright terms: Public domain | W3C validator |