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

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

Proof of Theorem dssmapntrcls
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 vpwex 5324 . . . . . . 7 𝒫 𝑡 ∈ V
21inex2 5265 . . . . . 6 (𝐽 ∩ 𝒫 𝑡) ∈ V
32uniex 7696 . . . . 5 (𝐽 ∩ 𝒫 𝑡) ∈ V
43rgenw 3056 . . . 4 𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡) ∈ V
5 nfcv 2899 . . . . 5 𝑡𝒫 𝑋
65fnmptf 6636 . . . 4 (∀𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡) ∈ V → (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
74, 6mp1i 13 . . 3 (𝐽 ∈ Top → (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
8 dssmapclsntr.i . . . . 5 𝐼 = (int‘𝐽)
9 dssmapclsntr.x . . . . . 6 𝑋 = 𝐽
109ntrfval 22980 . . . . 5 (𝐽 ∈ Top → (int‘𝐽) = (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)))
118, 10eqtrid 2784 . . . 4 (𝐽 ∈ Top → 𝐼 = (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)))
1211fneq1d 6593 . . 3 (𝐽 ∈ Top → (𝐼 Fn 𝒫 𝑋 ↔ (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋))
137, 12mpbird 257 . 2 (𝐽 ∈ Top → 𝐼 Fn 𝒫 𝑋)
14 dssmapclsntr.o . . . . . 6 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
15 dssmapclsntr.d . . . . . 6 𝐷 = (𝑂𝑋)
169topopn 22862 . . . . . 6 (𝐽 ∈ Top → 𝑋𝐽)
1714, 15, 16dssmapf1od 44366 . . . . 5 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋m 𝒫 𝑋))
18 f1of 6782 . . . . 5 (𝐷:(𝒫 𝑋m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋m 𝒫 𝑋) → 𝐷:(𝒫 𝑋m 𝒫 𝑋)⟶(𝒫 𝑋m 𝒫 𝑋))
1917, 18syl 17 . . . 4 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋m 𝒫 𝑋)⟶(𝒫 𝑋m 𝒫 𝑋))
20 dssmapclsntr.k . . . . 5 𝐾 = (cls‘𝐽)
219, 20clselmap 44472 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋m 𝒫 𝑋))
2219, 21ffvelcdmd 7039 . . 3 (𝐽 ∈ Top → (𝐷𝐾) ∈ (𝒫 𝑋m 𝒫 𝑋))
23 elmapfn 8814 . . 3 ((𝐷𝐾) ∈ (𝒫 𝑋m 𝒫 𝑋) → (𝐷𝐾) Fn 𝒫 𝑋)
2422, 23syl 17 . 2 (𝐽 ∈ Top → (𝐷𝐾) Fn 𝒫 𝑋)
25 elpwi 4563 . . . . 5 (𝑡 ∈ 𝒫 𝑋𝑡𝑋)
269ntrval2 23007 . . . . 5 ((𝐽 ∈ Top ∧ 𝑡𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡))))
2725, 26sylan2 594 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡))))
288fveq1i 6843 . . . 4 (𝐼𝑡) = ((int‘𝐽)‘𝑡)
2920fveq1i 6843 . . . . 5 (𝐾‘(𝑋𝑡)) = ((cls‘𝐽)‘(𝑋𝑡))
3029difeq2i 4077 . . . 4 (𝑋 ∖ (𝐾‘(𝑋𝑡))) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡)))
3127, 28, 303eqtr4g 2797 . . 3 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼𝑡) = (𝑋 ∖ (𝐾‘(𝑋𝑡))))
3216adantr 480 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑋𝐽)
3321adantr 480 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝐾 ∈ (𝒫 𝑋m 𝒫 𝑋))
34 eqid 2737 . . . 4 (𝐷𝐾) = (𝐷𝐾)
35 simpr 484 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑡 ∈ 𝒫 𝑋)
36 eqid 2737 . . . 4 ((𝐷𝐾)‘𝑡) = ((𝐷𝐾)‘𝑡)
3714, 15, 32, 33, 34, 35, 36dssmapfv3d 44364 . . 3 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((𝐷𝐾)‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋𝑡))))
3831, 37eqtr4d 2775 . 2 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼𝑡) = ((𝐷𝐾)‘𝑡))
3913, 24, 38eqfnfvd 6988 1 (𝐽 ∈ Top → 𝐼 = (𝐷𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3442  cdif 3900  cin 3902  wss 3903  𝒫 cpw 4556   cuni 4865  cmpt 5181   Fn wfn 6495  wf 6496  1-1-ontowf1o 6499  cfv 6500  (class class class)co 7368  m cmap 8775  Topctop 22849  intcnt 22973  clsccl 22974
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-map 8777  df-top 22850  df-cld 22975  df-ntr 22976  df-cls 22977
This theorem is referenced by:  dssmapclsntr  44474
  Copyright terms: Public domain W3C validator