Theorem ntrclscls00 40769

Description: If (pseudo-)interior and (pseudo-)closure functions are related by the duality operator then conditions equal to claiming that the closure of the empty set is the empty set hold equally. (Contributed by RP, 1-Jun-2021.)

Hypotheses

Ref	Expression
ntrcls.o	⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
ntrcls.d	⊢ 𝐷 = (𝑂‘𝐵)
ntrcls.r	⊢ (𝜑 → 𝐼𝐷𝐾)

Assertion

Ref	Expression
ntrclscls00	⊢ (𝜑 → ((𝐼‘𝐵) = 𝐵 ↔ (𝐾‘∅) = ∅))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘   𝑗,𝐼,𝑘   𝑗,𝐾,𝑘   𝜑,𝑖,𝑗,𝑘

Allowed substitution hints:   𝐷(𝑖,𝑗,𝑘)   𝐼(𝑖)   𝐾(𝑖)   𝑂(𝑖,𝑗,𝑘)

Proof of Theorem ntrclscls00

Step	Hyp	Ref	Expression
1		ntrcls.o	. . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
2		ntrcls.d	. . . . . 6 ⊢ 𝐷 = (𝑂‘𝐵)
3		ntrcls.r	. . . . . 6 ⊢ (𝜑 → 𝐼𝐷𝐾)
4	1, 2, 3	ntrclsfv1 40758	. . . . 5 ⊢ (𝜑 → (𝐷‘𝐼) = 𝐾)
5	4	fveq1d 6647	. . . 4 ⊢ (𝜑 → ((𝐷‘𝐼)‘∅) = (𝐾‘∅))
6	2, 3	ntrclsbex 40737	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
7	1, 2, 3	ntrclsiex 40756	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
8		eqid 2798	. . . . 5 ⊢ (𝐷‘𝐼) = (𝐷‘𝐼)
9		0elpw 5221	. . . . . 6 ⊢ ∅ ∈ 𝒫 𝐵
10	9	a1i 11	. . . . 5 ⊢ (𝜑 → ∅ ∈ 𝒫 𝐵)
11		eqid 2798	. . . . 5 ⊢ ((𝐷‘𝐼)‘∅) = ((𝐷‘𝐼)‘∅)
12	1, 2, 6, 7, 8, 10, 11	dssmapfv3d 40720	. . . 4 ⊢ (𝜑 → ((𝐷‘𝐼)‘∅) = (𝐵 ∖ (𝐼‘(𝐵 ∖ ∅))))
13	5, 12	eqtr3d 2835	. . 3 ⊢ (𝜑 → (𝐾‘∅) = (𝐵 ∖ (𝐼‘(𝐵 ∖ ∅))))
14		dif0 4286	. . . . . . 7 ⊢ (𝐵 ∖ ∅) = 𝐵
15	14	fveq2i 6648	. . . . . 6 ⊢ (𝐼‘(𝐵 ∖ ∅)) = (𝐼‘𝐵)
16		id 22	. . . . . 6 ⊢ ((𝐼‘𝐵) = 𝐵 → (𝐼‘𝐵) = 𝐵)
17	15, 16	syl5eq 2845	. . . . 5 ⊢ ((𝐼‘𝐵) = 𝐵 → (𝐼‘(𝐵 ∖ ∅)) = 𝐵)
18	17	difeq2d 4050	. . . 4 ⊢ ((𝐼‘𝐵) = 𝐵 → (𝐵 ∖ (𝐼‘(𝐵 ∖ ∅))) = (𝐵 ∖ 𝐵))
19		difid 4284	. . . 4 ⊢ (𝐵 ∖ 𝐵) = ∅
20	18, 19	eqtrdi 2849	. . 3 ⊢ ((𝐼‘𝐵) = 𝐵 → (𝐵 ∖ (𝐼‘(𝐵 ∖ ∅))) = ∅)
21	13, 20	sylan9eq 2853	. 2 ⊢ ((𝜑 ∧ (𝐼‘𝐵) = 𝐵) → (𝐾‘∅) = ∅)
22		pwidg 4519	. . . . 5 ⊢ (𝐵 ∈ V → 𝐵 ∈ 𝒫 𝐵)
23	6, 22	syl 17	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝒫 𝐵)
24	1, 2, 3, 23	ntrclsfv 40762	. . 3 ⊢ (𝜑 → (𝐼‘𝐵) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝐵))))
25	19	fveq2i 6648	. . . . . 6 ⊢ (𝐾‘(𝐵 ∖ 𝐵)) = (𝐾‘∅)
26		id 22	. . . . . 6 ⊢ ((𝐾‘∅) = ∅ → (𝐾‘∅) = ∅)
27	25, 26	syl5eq 2845	. . . . 5 ⊢ ((𝐾‘∅) = ∅ → (𝐾‘(𝐵 ∖ 𝐵)) = ∅)
28	27	difeq2d 4050	. . . 4 ⊢ ((𝐾‘∅) = ∅ → (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝐵))) = (𝐵 ∖ ∅))
29	28, 14	eqtrdi 2849	. . 3 ⊢ ((𝐾‘∅) = ∅ → (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝐵))) = 𝐵)
30	24, 29	sylan9eq 2853	. 2 ⊢ ((𝜑 ∧ (𝐾‘∅) = ∅) → (𝐼‘𝐵) = 𝐵)
31	21, 30	impbida 800	1 ⊢ (𝜑 → ((𝐼‘𝐵) = 𝐵 ↔ (𝐾‘∅) = ∅))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  Vcvv 3441   ∖ cdif 3878  ∅c0 4243  𝒫 cpw 4497   class class class wbr 5030   ↦ cmpt 5110  ‘cfv 6324  (class class class)co 7135   ↑_m cmap 8389

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-map 8391

This theorem is referenced by: (None)