| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrclsfveq2 | Structured version Visualization version GIF version | ||
| Description: If interior and closure functions are related then specific function values are complementary. (Contributed by RP, 27-Jun-2021.) |
| Ref | Expression |
|---|---|
| ntrcls.o | ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) |
| ntrcls.d | ⊢ 𝐷 = (𝑂‘𝐵) |
| ntrcls.r | ⊢ (𝜑 → 𝐼𝐷𝐾) |
| ntrclsfv.s | ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) |
| ntrclsfv.c | ⊢ (𝜑 → 𝐶 ∈ 𝒫 𝐵) |
| Ref | Expression |
|---|---|
| ntrclsfveq2 | ⊢ (𝜑 → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐾‘𝑆) = (𝐵 ∖ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ntrcls.o | . . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) | |
| 2 | ntrcls.d | . . . . . . 7 ⊢ 𝐷 = (𝑂‘𝐵) | |
| 3 | ntrcls.r | . . . . . . 7 ⊢ (𝜑 → 𝐼𝐷𝐾) | |
| 4 | 1, 2, 3 | ntrclsiex 44880 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 5 | elmapi 8851 | . . . . . 6 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵) |
| 7 | 2, 3 | ntrclsrcomplex 44862 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵) |
| 8 | 6, 7 | ffvelcdmd 7081 | . . . 4 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵) |
| 9 | 8 | elpwid 4569 | . . 3 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑆)) ⊆ 𝐵) |
| 10 | ntrclsfv.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝒫 𝐵) | |
| 11 | 10 | elpwid 4569 | . . 3 ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
| 12 | rcompleq 4254 | . . 3 ⊢ (((𝐼‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐵) → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ 𝐶))) | |
| 13 | 9, 11, 12 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ 𝐶))) |
| 14 | 1, 2, 3 | ntrclsnvobr 44879 | . . . 4 ⊢ (𝜑 → 𝐾𝐷𝐼) |
| 15 | ntrclsfv.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
| 16 | 1, 2, 14, 15 | ntrclsfv 44886 | . . 3 ⊢ (𝜑 → (𝐾‘𝑆) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆)))) |
| 17 | 16 | eqeq1d 2764 | . 2 ⊢ (𝜑 → ((𝐾‘𝑆) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ 𝐶))) |
| 18 | 13, 17 | bitr4d 285 | 1 ⊢ (𝜑 → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐾‘𝑆) = (𝐵 ∖ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∖ cdif 3899 ⊆ wss 3902 𝒫 cpw 4560 class class class wbr 5107 ↦ cmpt 5190 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 ↑m cmap 8829 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-map 8831 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |