![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dssmapclsntr | Structured version Visualization version GIF version |
Description: The closure and interior operators on a topology are duals of each other. See also kur14lem2 35175. (Contributed by RP, 22-Apr-2021.) |
Ref | Expression |
---|---|
dssmapclsntr.x | ⊢ 𝑋 = ∪ 𝐽 |
dssmapclsntr.k | ⊢ 𝐾 = (cls‘𝐽) |
dssmapclsntr.i | ⊢ 𝐼 = (int‘𝐽) |
dssmapclsntr.o | ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) |
dssmapclsntr.d | ⊢ 𝐷 = (𝑂‘𝑋) |
Ref | Expression |
---|---|
dssmapclsntr | ⊢ (𝐽 ∈ Top → 𝐾 = (𝐷‘𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dssmapclsntr.x | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
2 | dssmapclsntr.k | . . . . 5 ⊢ 𝐾 = (cls‘𝐽) | |
3 | dssmapclsntr.i | . . . . 5 ⊢ 𝐼 = (int‘𝐽) | |
4 | dssmapclsntr.o | . . . . 5 ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) | |
5 | dssmapclsntr.d | . . . . 5 ⊢ 𝐷 = (𝑂‘𝑋) | |
6 | 1, 2, 3, 4, 5 | dssmapntrcls 44090 | . . . 4 ⊢ (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾)) |
7 | 6 | eqcomd 2746 | . . 3 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) = 𝐼) |
8 | 1 | topopn 22933 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
9 | 4, 5, 8 | dssmapf1od 43983 | . . . 4 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋)) |
10 | 1, 2 | clselmap 44089 | . . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋)) |
11 | f1ocnvfv 7314 | . . . 4 ⊢ ((𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋) ∧ 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋)) → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾)) | |
12 | 9, 10, 11 | syl2anc 583 | . . 3 ⊢ (𝐽 ∈ Top → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾)) |
13 | 7, 12 | mpd 15 | . 2 ⊢ (𝐽 ∈ Top → (◡𝐷‘𝐼) = 𝐾) |
14 | 4, 5, 8 | dssmapnvod 43982 | . . 3 ⊢ (𝐽 ∈ Top → ◡𝐷 = 𝐷) |
15 | 14 | fveq1d 6922 | . 2 ⊢ (𝐽 ∈ Top → (◡𝐷‘𝐼) = (𝐷‘𝐼)) |
16 | 13, 15 | eqtr3d 2782 | 1 ⊢ (𝐽 ∈ Top → 𝐾 = (𝐷‘𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∖ cdif 3973 𝒫 cpw 4622 ∪ cuni 4931 ↦ cmpt 5249 ◡ccnv 5699 –1-1-onto→wf1o 6572 ‘cfv 6573 (class class class)co 7448 ↑m cmap 8884 Topctop 22920 intcnt 23046 clsccl 23047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-map 8886 df-top 22921 df-cld 23048 df-ntr 23049 df-cls 23050 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |