Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrclsfveq | Structured version Visualization version GIF version |
Description: If interior and closure functions are related then equality of a pair of function values is equivalent to equality of a pair of the other function's values. (Contributed by RP, 27-Jun-2021.) |
Ref | Expression |
---|---|
ntrcls.o | ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) |
ntrcls.d | ⊢ 𝐷 = (𝑂‘𝐵) |
ntrcls.r | ⊢ (𝜑 → 𝐼𝐷𝐾) |
ntrclsfv.s | ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) |
ntrclsfv.t | ⊢ (𝜑 → 𝑇 ∈ 𝒫 𝐵) |
Ref | Expression |
---|---|
ntrclsfveq | ⊢ (𝜑 → ((𝐼‘𝑆) = (𝐼‘𝑇) ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐾‘(𝐵 ∖ 𝑇)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ntrcls.o | . . . 4 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗)))))) | |
2 | ntrcls.d | . . . 4 ⊢ 𝐷 = (𝑂‘𝐵) | |
3 | ntrcls.r | . . . 4 ⊢ (𝜑 → 𝐼𝐷𝐾) | |
4 | ntrclsfv.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝒫 𝐵) | |
5 | 1, 2, 3, 4 | ntrclsfv 40416 | . . 3 ⊢ (𝜑 → (𝐼‘𝑇) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇)))) |
6 | 5 | eqeq2d 2834 | . 2 ⊢ (𝜑 → ((𝐼‘𝑆) = (𝐼‘𝑇) ↔ (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇))))) |
7 | ntrclsfv.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
8 | 2, 3 | ntrclsrcomplex 40392 | . . 3 ⊢ (𝜑 → (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇))) ∈ 𝒫 𝐵) |
9 | 1, 2, 3, 7, 8 | ntrclsfveq1 40417 | . 2 ⊢ (𝜑 → ((𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇))) ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇)))))) |
10 | 1, 2, 3 | ntrclskex 40411 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
11 | elmapi 8430 | . . . . . . 7 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵) | |
12 | 10, 11 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵) |
13 | 2, 3 | ntrclsrcomplex 40392 | . . . . . 6 ⊢ (𝜑 → (𝐵 ∖ 𝑇) ∈ 𝒫 𝐵) |
14 | 12, 13 | ffvelrnd 6854 | . . . . 5 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑇)) ∈ 𝒫 𝐵) |
15 | 14 | elpwid 4552 | . . . 4 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑇)) ⊆ 𝐵) |
16 | dfss4 4237 | . . . 4 ⊢ ((𝐾‘(𝐵 ∖ 𝑇)) ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇)))) = (𝐾‘(𝐵 ∖ 𝑇))) | |
17 | 15, 16 | sylib 220 | . . 3 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇)))) = (𝐾‘(𝐵 ∖ 𝑇))) |
18 | 17 | eqeq2d 2834 | . 2 ⊢ (𝜑 → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑇)))) ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐾‘(𝐵 ∖ 𝑇)))) |
19 | 6, 9, 18 | 3bitrd 307 | 1 ⊢ (𝜑 → ((𝐼‘𝑆) = (𝐼‘𝑇) ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐾‘(𝐵 ∖ 𝑇)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ∖ cdif 3935 ⊆ wss 3938 𝒫 cpw 4541 class class class wbr 5068 ↦ cmpt 5148 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ↑m cmap 8408 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-1st 7691 df-2nd 7692 df-map 8410 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |