| 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 45054 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 5 | elmapi 8870 | . . . . . 6 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵) |
| 7 | 2, 3 | ntrclsrcomplex 45036 | . . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵) |
| 8 | 6, 7 | ffvelcdmd 7086 | . . . 4 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵) |
| 9 | 8 | elpwid 4566 | . . 3 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑆)) ⊆ 𝐵) |
| 10 | ntrclsfv.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝒫 𝐵) | |
| 11 | 10 | elpwid 4566 | . . 3 ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
| 12 | rcompleq 4251 | . . 3 ⊢ (((𝐼‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐵) → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ 𝐶))) | |
| 13 | 9, 11, 12 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝐼‘(𝐵 ∖ 𝑆)) = 𝐶 ↔ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ 𝐶))) |
| 14 | 1, 2, 3 | ntrclsnvobr 45053 | . . . 4 ⊢ (𝜑 → 𝐾𝐷𝐼) |
| 15 | ntrclsfv.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
| 16 | 1, 2, 14, 15 | ntrclsfv 45060 | . . 3 ⊢ (𝜑 → (𝐾‘𝑆) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑆)))) |
| 17 | 16 | eqeq1d 2763 | . 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 3451 ∖ cdif 3896 ⊆ wss 3914 𝒫 cpw 4557 class class class wbr 5103 ↦ cmpt 5186 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 ↑m cmap 8848 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7752 |
| 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 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 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3900 df-un 3902 df-in 3904 df-ss 3915 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-map 8850 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |