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 38426
Description: The interior and closure operators on a topology are duals of each other. See also kur14lem2 31189. (Contributed by RP, 21-Apr-2021.)
Hypotheses
Ref Expression
dssmapclsntr.x 𝑋 = 𝐽
dssmapclsntr.k 𝐾 = (cls‘𝐽)
dssmapclsntr.i 𝐼 = (int‘𝐽)
dssmapclsntr.o 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏𝑚 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
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 4849 . . . . . . 7 𝒫 𝑡 ∈ V
21inex2 4800 . . . . . 6 (𝐽 ∩ 𝒫 𝑡) ∈ V
32uniex 6953 . . . . 5 (𝐽 ∩ 𝒫 𝑡) ∈ V
43rgenw 2924 . . . 4 𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡) ∈ V
5 nfcv 2764 . . . . 5 𝑡𝒫 𝑋
65fnmptf 6016 . . . 4 (∀𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡) ∈ V → (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
74, 6mp1i 13 . . 3 (𝐽 ∈ Top → (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
8 dssmapclsntr.i . . . . 5 𝐼 = (int‘𝐽)
9 dssmapclsntr.x . . . . . 6 𝑋 = 𝐽
109ntrfval 20828 . . . . 5 (𝐽 ∈ Top → (int‘𝐽) = (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)))
118, 10syl5eq 2668 . . . 4 (𝐽 ∈ Top → 𝐼 = (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)))
1211fneq1d 5981 . . 3 (𝐽 ∈ Top → (𝐼 Fn 𝒫 𝑋 ↔ (𝑡 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋))
137, 12mpbird 247 . 2 (𝐽 ∈ Top → 𝐼 Fn 𝒫 𝑋)
14 dssmapclsntr.o . . . . . 6 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏𝑚 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
15 dssmapclsntr.d . . . . . 6 𝐷 = (𝑂𝑋)
169topopn 20711 . . . . . 6 (𝐽 ∈ Top → 𝑋𝐽)
1714, 15, 16dssmapf1od 38315 . . . . 5 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋𝑚 𝒫 𝑋)–1-1-onto→(𝒫 𝑋𝑚 𝒫 𝑋))
18 f1of 6137 . . . . 5 (𝐷:(𝒫 𝑋𝑚 𝒫 𝑋)–1-1-onto→(𝒫 𝑋𝑚 𝒫 𝑋) → 𝐷:(𝒫 𝑋𝑚 𝒫 𝑋)⟶(𝒫 𝑋𝑚 𝒫 𝑋))
1917, 18syl 17 . . . 4 (𝐽 ∈ Top → 𝐷:(𝒫 𝑋𝑚 𝒫 𝑋)⟶(𝒫 𝑋𝑚 𝒫 𝑋))
20 dssmapclsntr.k . . . . 5 𝐾 = (cls‘𝐽)
219, 20clselmap 38425 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋𝑚 𝒫 𝑋))
2219, 21ffvelrnd 6360 . . 3 (𝐽 ∈ Top → (𝐷𝐾) ∈ (𝒫 𝑋𝑚 𝒫 𝑋))
23 elmapfn 7880 . . 3 ((𝐷𝐾) ∈ (𝒫 𝑋𝑚 𝒫 𝑋) → (𝐷𝐾) Fn 𝒫 𝑋)
2422, 23syl 17 . 2 (𝐽 ∈ Top → (𝐷𝐾) Fn 𝒫 𝑋)
25 elpwi 4168 . . . . 5 (𝑡 ∈ 𝒫 𝑋𝑡𝑋)
269ntrval2 20855 . . . . 5 ((𝐽 ∈ Top ∧ 𝑡𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡))))
2725, 26sylan2 491 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡))))
288fveq1i 6192 . . . 4 (𝐼𝑡) = ((int‘𝐽)‘𝑡)
2920fveq1i 6192 . . . . 5 (𝐾‘(𝑋𝑡)) = ((cls‘𝐽)‘(𝑋𝑡))
3029difeq2i 3725 . . . 4 (𝑋 ∖ (𝐾‘(𝑋𝑡))) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑡)))
3127, 28, 303eqtr4g 2681 . . 3 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼𝑡) = (𝑋 ∖ (𝐾‘(𝑋𝑡))))
3216adantr 481 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑋𝐽)
3321adantr 481 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝐾 ∈ (𝒫 𝑋𝑚 𝒫 𝑋))
34 eqid 2622 . . . 4 (𝐷𝐾) = (𝐷𝐾)
35 simpr 477 . . . 4 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑡 ∈ 𝒫 𝑋)
36 eqid 2622 . . . 4 ((𝐷𝐾)‘𝑡) = ((𝐷𝐾)‘𝑡)
3714, 15, 32, 33, 34, 35, 36dssmapfv3d 38313 . . 3 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((𝐷𝐾)‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋𝑡))))
3831, 37eqtr4d 2659 . 2 ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼𝑡) = ((𝐷𝐾)‘𝑡))
3913, 24, 38eqfnfvd 6314 1 (𝐽 ∈ Top → 𝐼 = (𝐷𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  wral 2912  Vcvv 3200  cdif 3571  cin 3573  wss 3574  𝒫 cpw 4158   cuni 4436  cmpt 4729   Fn wfn 5883  wf 5884  1-1-ontowf1o 5887  cfv 5888  (class class class)co 6650  𝑚 cmap 7857  Topctop 20698  intcnt 20821  clsccl 20822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-map 7859  df-top 20699  df-cld 20823  df-ntr 20824  df-cls 20825
This theorem is referenced by:  dssmapclsntr  38427
  Copyright terms: Public domain W3C validator