| 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 6828 | . . . 4 ⊢ (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡)) | |
| 2 | 1 | eleq2d 2825 | . . 3 ⊢ (𝑠 = 𝑡 → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑋 ∈ (𝐼‘𝑡))) |
| 3 | 2 | cbvrexvw 3218 | . 2 ⊢ (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡)) |
| 4 | ntrcls.d | . . . . 5 ⊢ 𝐷 = (𝑂‘𝐵) | |
| 5 | ntrcls.r | . . . . 5 ⊢ (𝜑 → 𝐼𝐷𝐾) | |
| 6 | 4, 5 | ntrclsrcomplex 44488 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵) |
| 7 | 6 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵) |
| 8 | 4, 5 | ntrclsrcomplex 44488 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵) |
| 9 | 8 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵) |
| 10 | difeq2 4052 | . . . . . 6 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡))) | |
| 11 | 10 | adantl 482 | . . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡))) |
| 12 | elpwi 4537 | . . . . . . 7 ⊢ (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵) | |
| 13 | dfss4 4198 | . . . . . . 7 ⊢ (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) | |
| 14 | 12, 13 | sylib 219 | . . . . . 6 ⊢ (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) |
| 15 | 14 | ad2antlr 733 | . . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡) |
| 16 | 11, 15 | eqtr2d 2775 | . . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → 𝑡 = (𝐵 ∖ 𝑠)) |
| 17 | 9, 16 | rspcedeq2vd 3568 | . . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠)) |
| 18 | fveq2 6828 | . . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠))) | |
| 19 | 18 | eleq2d 2825 | . . . . 5 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)))) |
| 20 | 19 | 3ad2ant3 1141 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)))) |
| 21 | ntrcls.o | . . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) | |
| 22 | 5 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐷𝐾) |
| 23 | ntrclslem0.x | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 24 | 23 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵) |
| 25 | simpr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵) | |
| 26 | 21, 4, 22, 24, 25 | ntrclselnel2 44511 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 27 | 26 | 3adant3 1138 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 28 | 20, 27 | bitrd 280 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 29 | 7, 17, 28 | rexxfrd2 5343 | . 2 ⊢ (𝜑 → (∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| 30 | 3, 29 | bitrid 284 | 1 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∃wrex 3063 Vcvv 3431 ∖ cdif 3880 ⊆ wss 3883 𝒫 cpw 4530 class class class wbr 5073 ↦ cmpt 5154 ‘cfv 6486 (class class class)co 7357 ↑m cmap 8764 |
| 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 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7932 df-2nd 7933 df-map 8766 |
| This theorem is referenced by: ntrclsneine0 44518 |
| Copyright terms: Public domain | W3C validator |