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 45321
Description: The closure and interior operators on a topology are duals of each other. See also kur14lem2 36139. (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 45320 . . . 4 (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾))
76eqcomd 2769 . . 3 (𝐽 ∈ Top → (𝐷‘𝐾) = 𝐼)
81topopn 23254 . . . . 5 (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
94, 5, 8dssmapf1od 45213 . . . 4 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶1-1onto(𝒫 𝑋 ↑m 𝒫 𝑋))
101, 2clselmap 45319 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
11 f1ocnvfv 7309 . . . 4 ((𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶1-1onto(𝒫 𝑋 ↑m 𝒫 𝑋) ∧ 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋)) → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾))
129, 10, 11syl2anc 596 . . 3 (𝐽 ∈ Top → ((𝐷‘𝐾) = 𝐼 → (◡𝐷‘𝐼) = 𝐾))
137, 12mpd 16 . 2 (𝐽 ∈ Top → (◡𝐷‘𝐼) = 𝐾)
144, 5, 8dssmapnvod 45212 . . 3 (𝐽 ∈ Top → ◡𝐷 = 𝐷)
1514fveq1d 6910 . 2 (𝐽 ∈ Top → (◡𝐷‘𝐼) = (𝐷‘𝐼))
1613, 15eqtr3d 2800 1 (𝐽 ∈ Top → 𝐾 = (𝐷‘𝐼))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  𝒫 cpw 4560  ∪ cuni 4870   ↦ cmpt 5189  ◡ccnv 5654  ⟶1-1ontowf1o 6557  ‘cfv 6558  (class class class)co 7443   ↑m cmap 8875  Topctop 23241  intcnt 23365  clsccl 23366
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-top 23242  df-cld 23367  df-ntr 23368  df-cls 23369
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator