| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrclsfveq1 | 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 |
|---|---|
| ntrclsfveq1 | ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ntrclsfv.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝒫 𝐵) | |
| 2 | 1 | elpwid 4570 | . . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
| 3 | dfss4 4221 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶) | |
| 4 | 2, 3 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶) |
| 5 | 4 | eqcomd 2767 | . . 3 ⊢ (𝜑 → 𝐶 = (𝐵 ∖ (𝐵 ∖ 𝐶))) |
| 6 | 5 | eqeq2d 2772 | . 2 ⊢ (𝜑 → ((𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶)))) |
| 7 | ntrcls.o | . . . 4 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) | |
| 8 | ntrcls.d | . . . 4 ⊢ 𝐷 = (𝑂‘𝐵) | |
| 9 | ntrcls.r | . . . 4 ⊢ (𝜑 → 𝐼𝐷𝐾) | |
| 10 | ntrclsfv.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
| 11 | 7, 8, 9, 10 | ntrclsfv 44755 | . . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆)))) |
| 12 | 11 | eqeq1d 2763 | . 2 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶)) |
| 13 | 7, 8, 9 | ntrclskex 44750 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 14 | elmapi 8845 | . . . . . 6 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵) | |
| 15 | 13, 14 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵) |
| 16 | 8, 9 | ntrclsrcomplex 44731 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵) |
| 17 | 15, 16 | ffvelcdmd 7080 | . . . 4 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵) |
| 18 | 17 | elpwid 4570 | . . 3 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵) |
| 19 | difssd 4090 | . . 3 ⊢ (𝜑 → (𝐵 ∖ 𝐶) ⊆ 𝐵) | |
| 20 | rcompleq 4257 | . . 3 ⊢ (((𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝐶) ⊆ 𝐵) → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶)))) | |
| 21 | 18, 19, 20 | syl2anc 595 | . 2 ⊢ (𝜑 → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶)))) |
| 22 | 6, 12, 21 | 3bitr4d 314 | 1 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1568 ∈ wcel 2141 Vcvv 3453 ∖ cdif 3901 ⊆ wss 3904 𝒫 cpw 4561 class class class wbr 5108 ↦ cmpt 5191 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ↑m cmap 8823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7985 df-2nd 7986 df-map 8825 |
| This theorem is referenced by: ntrclsfveq 44758 |
| Copyright terms: Public domain | W3C validator |