Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dssmapclsntr Structured version   Visualization version   GIF version

Theorem dssmapclsntr 45205
Description: The closure and interior operators on a topology are duals of each other. See also kur14lem2 36041. (Contributed by RP, 22-Apr-2021.)
Hypotheses
Ref Expression
dssmapclsntr.x 𝑋 = ∪ 𝐽
dssmapclsntr.k 𝐾 = (cls‘𝐽)
dssmapclsntr.i 𝐼 = (int‘𝐽)
dssmapclsntr.o 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠))))))
dssmapclsntr.d 𝐷 = (𝑂‘𝑋)
Assertion
Ref Expression
dssmapclsntr (𝐽 ∈ Top → 𝐾 = (𝐷‘𝐼))
Distinct variable groups:   𝐽,𝑏,𝑓,𝑠   𝑓,𝐾,𝑠   𝑋,𝑏,𝑓,𝑠
Allowed substitution hints:   𝐷(𝑓, 𝑠, 𝑏)   𝐼(𝑓, 𝑠, 𝑏)   𝐾(𝑏)   𝑂(𝑓, 𝑠, 𝑏)

Proof of Theorem dssmapclsntr
StepHypRef 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 𝐷 = (𝑂‘𝑋)
61, 2, 3, 4, 5dssmapntrcls 45204 . . . 4 (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾))
76eqcomd 2766 . . 3 (𝐽 ∈ Top → (𝐷‘𝐾) = 𝐼)
81topopn 23225 . . . . 5 (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
94, 5, 8dssmapf1od 45097 . . . 4 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋))
101, 2clselmap 45203 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
11 f1ocnvfv 7286 . . . 4 ((𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋) ∧ 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋)) → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾))
129, 10, 11syl2anc 596 . . 3 (𝐽 ∈ Top → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾))
137, 12mpd 16 . 2 (𝐽 ∈ Top → (◡𝐷‘𝐼) = 𝐾)
144, 5, 8dssmapnvod 45096 . . 3 (𝐽 ∈ Top → ◡𝐷 = 𝐷)
1514fveq1d 6887 . 2 (𝐽 ∈ Top → (◡𝐷‘𝐼) = (𝐷‘𝐼))
1613, 15eqtr3d 2797 1 (𝐽 ∈ Top → 𝐾 = (𝐷‘𝐼))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4045  𝒫 cpw 4556  ∪ cuni 4866   ↦ cmpt 5185  ◡ccnv 5649  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   ↑m cmap 8848  Topctop 23212  intcnt 23336  clsccl 23337
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8850  df-top 23213  df-cld 23338  df-ntr 23339  df-cls 23340
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator