Theorem dssmapntrcls 45072

Description: The interior and closure operators on a topology are duals of each other. See also kur14lem2 35893. (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 5338	. . . . . . 7 ⊢ 𝒫 𝑡 ∈ V
2	1	inex2 5277	. . . . . 6 ⊢ (𝐽 ∩ 𝒫 𝑡) ∈ V
3	2	uniex 7741	. . . . 5 ⊢ ∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
4	3	rgenw 3080	. . . 4 ⊢ ∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
5		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑡𝒫 𝑋
6	5	fnmptf 6663	. . . 4 ⊢ (∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
7	4, 6	mp1i 14	. . 3 ⊢ (𝐽 ∈ Top → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
8		dssmapclsntr.i	. . . . 5 ⊢ 𝐼 = (int‘𝐽)
9		dssmapclsntr.x	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
10	9	ntrfval 23304	. . . . 5 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
11	8, 10	eqtrid 2807	. . . 4 ⊢ (𝐽 ∈ Top → 𝐼 = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
12	11	fneq1d 6620	. . 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 23186	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
17	14, 15, 16	dssmapf1od 44965	. . . . 5 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋))
18		f1of 6812	. . . . 5 ⊢ (𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋) → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶(𝒫 𝑋 ↑m 𝒫 𝑋))
19	17, 18	syl 18	. . . 4 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)⟶(𝒫 𝑋 ↑m 𝒫 𝑋))
20		dssmapclsntr.k	. . . . 5 ⊢ 𝐾 = (cls‘𝐽)
21	9, 20	clselmap 45071	. . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
22	19, 21	ffvelcdmd 7073	. . 3 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
23		elmapfn 8865	. . 3 ⊢ ((𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋) → (𝐷‘𝐾) Fn 𝒫 𝑋)
24	22, 23	syl 18	. 2 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) Fn 𝒫 𝑋)
25		elpwi 4563	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝑋 → 𝑡 ⊆ 𝑋)
26	9	ntrval2 23331	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ⊆ 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
27	25, 26	sylan2 605	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
28	8	fveq1i 6874	. . . 4 ⊢ (𝐼‘𝑡) = ((int‘𝐽)‘𝑡)
29	20	fveq1i 6874	. . . . 5 ⊢ (𝐾‘(𝑋 ∖ 𝑡)) = ((cls‘𝐽)‘(𝑋 ∖ 𝑡))
30	29	difeq2i 4070	. . . 4 ⊢ (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡)))
31	27, 28, 30	3eqtr4g 2820	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
32	16	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑋 ∈ 𝐽)
33	21	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
34		eqid 2760	. . . 4 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
35		simpr 490	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑡 ∈ 𝒫 𝑋)
36		eqid 2760	. . . 4 ⊢ ((𝐷‘𝐾)‘𝑡) = ((𝐷‘𝐾)‘𝑡)
37	14, 15, 32, 33, 34, 35, 36	dssmapfv3d 44963	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((𝐷‘𝐾)‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
38	31, 37	eqtr4d 2798	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = ((𝐷‘𝐾)‘𝑡))
39	13, 24, 38	eqfnfvd 7020	1 ⊢ (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  Vcvv 3450   ∖ cdif 3895   ∩ cin 3897   ⊆ wss 3898  𝒫 cpw 4556  ∪ cuni 4866   ↦ cmpt 5185   Fn wfn 6522  ⟶wf 6523  –1-1-onto→wf1o 6526  ‘cfv 6527  (class class class)co 7408   ↑_m cmap 8825  Topctop 23173  intcnt 23297  clsccl 23298

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  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-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-map 8827  df-top 23174  df-cld 23299  df-ntr 23300  df-cls 23301

This theorem is used by:  dssmapclsntr  45073