| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrclsneine0lem | Structured version Visualization version GIF version | ||
| Description: If (pseudo-)interior and (pseudo-)closure functions are related by the duality operator then conditions equal to claiming that at least one (pseudo-)neighborbood of a particular point exists hold equally. (Contributed by RP, 21-May-2021.) |
| Ref | Expression |
|---|---|
| ntrcls.o | ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) |
| ntrcls.d | ⊢ 𝐷 = (𝑂‘𝐵) |
| ntrcls.r | ⊢ (𝜑 → 𝐼𝐷𝐾) |
| ntrclslem0.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ntrclsneine0lem | ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6882 | . . . 4 ⊢ (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡)) | |
| 2 | 1 | eleq2d 2855 | . . 3 ⊢ (𝑠 = 𝑡 → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑋 ∈ (𝐼‘𝑡))) |
| 3 | 2 | cbvrexvw 3250 | . 2 ⊢ (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡)) |
| 4 | ntrcls.d | . . . . 5 ⊢ 𝐷 = (𝑂‘𝐵) | |
| 5 | ntrcls.r | . . . . 5 ⊢ (𝜑 → 𝐼𝐷𝐾) | |
| 6 | 4, 5 | ntrclsrcomplex 44687 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵) |
| 7 | 6 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵) |
| 8 | 4, 5 | ntrclsrcomplex 44687 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵) |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵) |
| 10 | difeq2 4083 | . . . . . 6 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡))) | |
| 11 | 10 | adantl 486 | . . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡))) |
| 12 | elpwi 4574 | . . . . . . 7 ⊢ (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵) | |
| 13 | dfss4 4230 | . . . . . . 7 ⊢ (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) | |
| 14 | 12, 13 | sylib 221 | . . . . . 6 ⊢ (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) |
| 15 | 14 | ad2antlr 739 | . . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) |
| 16 | 11, 15 | eqtr2d 2805 | . . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → 𝑡 = (𝐵 ∖ 𝑠)) |
| 17 | 9, 16 | rspcedeq2vd 3598 | . . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠)) |
| 18 | fveq2 6882 | . . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠))) | |
| 19 | 18 | eleq2d 2855 | . . . . 5 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)))) |
| 20 | 19 | 3ad2ant3 1151 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)))) |
| 21 | ntrcls.o | . . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) | |
| 22 | 5 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐷𝐾) |
| 23 | ntrclslem0.x | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 24 | 23 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵) |
| 25 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵) | |
| 26 | 21, 4, 22, 24, 25 | ntrclselnel2 44710 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 27 | 26 | 3adant3 1148 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 28 | 20, 27 | bitrd 282 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 29 | 7, 17, 28 | rexxfrd2 5385 | . 2 ⊢ (𝜑 → (∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 30 | 3, 29 | bitrid 286 | 1 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 Vcvv 3463 ∖ cdif 3910 ⊆ wss 3913 𝒫 cpw 4567 class class class wbr 5113 ↦ cmpt 5196 ‘cfv 6537 (class class class)co 7411 ↑m cmap 8824 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-map 8826 |
| This theorem is referenced by: ntrclsneine0 44717 |
| Copyright terms: Public domain | W3C validator |