| 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 4589 | . . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
| 3 | dfss4 4249 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶) | |
| 4 | 2, 3 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶) |
| 5 | 4 | eqcomd 2742 | . . 3 ⊢ (𝜑 → 𝐶 = (𝐵 ∖ (𝐵 ∖ 𝐶))) |
| 6 | 5 | eqeq2d 2747 | . 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 44050 | . . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆)))) |
| 12 | 11 | eqeq1d 2738 | . 2 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶)) |
| 13 | 7, 8, 9 | ntrclskex 44045 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 14 | elmapi 8868 | . . . . . 6 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵) | |
| 15 | 13, 14 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵) |
| 16 | 8, 9 | ntrclsrcomplex 44026 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵) |
| 17 | 15, 16 | ffvelcdmd 7080 | . . . 4 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵) |
| 18 | 17 | elpwid 4589 | . . 3 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵) |
| 19 | difssd 4117 | . . 3 ⊢ (𝜑 → (𝐵 ∖ 𝐶) ⊆ 𝐵) | |
| 20 | rcompleq 4285 | . . 3 ⊢ (((𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝐶) ⊆ 𝐵) → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶)))) | |
| 21 | 18, 19, 20 | syl2anc 584 | . 2 ⊢ (𝜑 → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶)))) |
| 22 | 6, 12, 21 | 3bitr4d 311 | 1 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 Vcvv 3464 ∖ cdif 3928 ⊆ wss 3931 𝒫 cpw 4580 class class class wbr 5124 ↦ cmpt 5206 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ↑m cmap 8845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 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 6489 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 7993 df-2nd 7994 df-map 8847 |
| This theorem is referenced by: ntrclsfveq 44053 |
| Copyright terms: Public domain | W3C validator |