Theorem dssmapntrcls 44882

Description: The interior and closure operators on a topology are duals of each other. See also kur14lem2 35707. (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 5348	. . . . . . 7 ⊢ 𝒫 𝑡 ∈ V
2	1	inex2 5287	. . . . . 6 ⊢ (𝐽 ∩ 𝒫 𝑡) ∈ V
3	2	uniex 7739	. . . . 5 ⊢ ∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
4	3	rgenw 3083	. . . 4 ⊢ ∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V
5		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑡𝒫 𝑋
6	5	fnmptf 6671	. . . 4 ⊢ (∀𝑡 ∈ 𝒫 𝑋∪ (𝐽 ∩ 𝒫 𝑡) ∈ V → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
7	4, 6	mp1i 14	. . 3 ⊢ (𝐽 ∈ Top → (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)) Fn 𝒫 𝑋)
8		dssmapclsntr.i	. . . . 5 ⊢ 𝐼 = (int‘𝐽)
9		dssmapclsntr.x	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
10	9	ntrfval 23190	. . . . 5 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
11	8, 10	eqtrid 2810	. . . 4 ⊢ (𝐽 ∈ Top → 𝐼 = (𝑡 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑡)))
12	11	fneq1d 6628	. . 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 23072	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
17	14, 15, 16	dssmapf1od 44775	. . . . 5 ⊢ (𝐽 ∈ Top → 𝐷:(𝒫 𝑋 ↑m 𝒫 𝑋)–1-1-onto→(𝒫 𝑋 ↑m 𝒫 𝑋))
18		f1of 6820	. . . . 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 44881	. . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
22	19, 21	ffvelcdmd 7080	. . 3 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
23		elmapfn 8858	. . 3 ⊢ ((𝐷‘𝐾) ∈ (𝒫 𝑋 ↑m 𝒫 𝑋) → (𝐷‘𝐾) Fn 𝒫 𝑋)
24	22, 23	syl 18	. 2 ⊢ (𝐽 ∈ Top → (𝐷‘𝐾) Fn 𝒫 𝑋)
25		elpwi 4569	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝑋 → 𝑡 ⊆ 𝑋)
26	9	ntrval2 23217	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ⊆ 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
27	25, 26	sylan2 604	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((int‘𝐽)‘𝑡) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡))))
28	8	fveq1i 6882	. . . 4 ⊢ (𝐼‘𝑡) = ((int‘𝐽)‘𝑡)
29	20	fveq1i 6882	. . . . 5 ⊢ (𝐾‘(𝑋 ∖ 𝑡)) = ((cls‘𝐽)‘(𝑋 ∖ 𝑡))
30	29	difeq2i 4078	. . . 4 ⊢ (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑡)))
31	27, 28, 30	3eqtr4g 2823	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
32	16	adantr 485	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑋 ∈ 𝐽)
33	21	adantr 485	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝐾 ∈ (𝒫 𝑋 ↑m 𝒫 𝑋))
34		eqid 2763	. . . 4 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
35		simpr 489	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → 𝑡 ∈ 𝒫 𝑋)
36		eqid 2763	. . . 4 ⊢ ((𝐷‘𝐾)‘𝑡) = ((𝐷‘𝐾)‘𝑡)
37	14, 15, 32, 33, 34, 35, 36	dssmapfv3d 44773	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → ((𝐷‘𝐾)‘𝑡) = (𝑋 ∖ (𝐾‘(𝑋 ∖ 𝑡))))
38	31, 37	eqtr4d 2801	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑡 ∈ 𝒫 𝑋) → (𝐼‘𝑡) = ((𝐷‘𝐾)‘𝑡))
39	13, 24, 38	eqfnfvd 7028	1 ⊢ (𝐽 ∈ Top → 𝐼 = (𝐷‘𝐾))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  Vcvv 3455   ∖ cdif 3902   ∩ cin 3904   ⊆ wss 3905  𝒫 cpw 4562  ∪ cuni 4872   ↦ cmpt 5192   Fn wfn 6531  ⟶wf 6532  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8820  Topctop 23059  intcnt 23183  clsccl 23184

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-map 8822  df-top 23060  df-cld 23185  df-ntr 23186  df-cls 23187

This theorem is used by:  dssmapclsntr  44883