Theorem dssmapntrcls 45320

Description: The interior and closure operators on a topology are duals of each other. See also kur14lem2 36139. (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.

Step	Hyp	Ref	Expression
1		vpwex 5343	. . . . . . 7 ⊢ 𝒫 𝑡 ∈ V
2	1	inex2 5282	. . . . . 6 ⊢ (𝐽 ∩ 𝒫 𝑡) ∈ V
3	2	uniex 7782	. . . . 5 ⊢ ∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
4	3	rgenw 3084	. . . 4 ⊢ ∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
5		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑡𝒫 𝑋
6	5	fnmptf 6697	. . . 4 ⊢ (∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
7	4, 6	mp1i 14	. . 3 ⊢ (𝐽 ∈ Top → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
8		dssmapclsntr.i	. . . . 5 ⊢ 𝐼 = (int‘𝐽)
9		dssmapclsntr.x	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
10	9	ntrfval 23372	. . . . 5 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
11	8, 10	eqtrid 2810	. . . 4 ⊢ (𝐽 ∈ Top → 𝐼 = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
12	11	fneq1d 6654	. . 3 ⊢ (𝐽 ∈ Top → (𝐼 Fn 𝒫 𝑋 ↔ (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋))
13	7, 12	mpbird 260	. 2 ⊢ (𝐽 ∈ Top → 𝐼 Fn 𝒫 𝑋)
14		dssmapclsntr.o	. . . . . 6 ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠))))))
15		dssmapclsntr.d	. . . . . 6 ⊢ 𝐷 = (𝑂‘𝑋)
16	9	topopn 23254	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
17	14, 15, 16	dssmapf1od 45213	. . . . 5 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶1-1onto(𝒫 𝑋 ↑m 𝒫 𝑋))
18		f1of 6846	. . . . 5 ⊢ (𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶1-1onto(𝒫 𝑋 ↑m 𝒫 𝑋) → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶(𝒫 𝑋 ↑m 𝒫 𝑋))
19	17, 18	syl 18	. . . 4 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶(𝒫 𝑋 ↑m 𝒫 𝑋))
20		dssmapclsntr.k	. . . . 5 ⊢ 𝐾 = (cls‘𝐽)
21	9, 20	clselmap 45319	. . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
22	19, 21	ffvelcdmd 7109	. . 3 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
23		elmapfn 8915	. . 3 ⊢ ((𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋) → (𝐷‘𝐾) Fn 𝒫 𝑋)
24	22, 23	syl 18	. 2 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) Fn 𝒫 𝑋)
25		elpwi 4567	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝑋 → 𝑡 ⊆ 𝑋)
26	9	ntrval2 23399	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ⊆ 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
27	25, 26	sylan2 605	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
28	8	fveq1i 6909	. . . 4 ⊢ (𝐼‘𝑡) = ((int‘𝐽)‘𝑡)
29	20	fveq1i 6909	. . . . 5 ⊢ (𝐾‘(𝑋 ∖ 𝑡)) = ((cls‘𝐽)‘(𝑋 ∖ 𝑡))
30	29	difeq2i 4063	. . . 4 ⊢ (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡)))
31	27, 28, 30	3eqtr4g 2823	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
32	16	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑋 ∈ 𝐽)
33	21	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
34		eqid 2763	. . . 4 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
35		simpr 490	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑡 ∈ 𝒫 𝑋)
36		eqid 2763	. . . 4 ⊢ ((𝐷‘𝐾)‘𝑡) = ((𝐷‘𝐾)‘𝑡)
37	14, 15, 32, 33, 34, 35, 36	dssmapfv3d 45211	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((𝐷‘𝐾)‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
38	31, 37	eqtr4d 2801	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = ((𝐷‘𝐾)‘𝑡))
39	13, 24, 38	eqfnfvd 7055	1 ⊢ (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4870   ↦ cmpt 5189   Fn wfn 6553  ⟶wf 6554  ⟶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:  dssmapclsntr  45321