Theorem ntrclsfveq1 45136

Description: If interior and closure functions are related then specific function values are complementary. (Contributed by RP, 27-Jun-2021.)

Hypotheses

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

Assertion

Ref	Expression
ntrclsfveq1	⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶)))

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

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

Proof of Theorem ntrclsfveq1

Step	Hyp	Ref	Expression
1		ntrclsfv.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝒫 𝐵)
2	1	elpwid 4565	. . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)
3		dfss4 4214	. . . . 5 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶)
4	2, 3	sylib 221	. . . 4 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶)
5	4	eqcomd 2766	. . 3 ⊢ (𝜑 → 𝐶 = (𝐵 ∖ (𝐵 ∖ 𝐶)))
6	5	eqeq2d 2771	. 2 ⊢ (𝜑 → ((𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶))))
7		ntrcls.o	. . . 4 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
8		ntrcls.d	. . . 4 ⊢ 𝐷 = (𝑂‘𝐵)
9		ntrcls.r	. . . 4 ⊢ (𝜑 → 𝐼𝐷𝐾)
10		ntrclsfv.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
11	7, 8, 9, 10	ntrclsfv 45135	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
12	11	eqeq1d 2762	. 2 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶))
13	7, 8, 9	ntrclskex 45130	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
14		elmapi 8870	. . . . . 6 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
15	13, 14	syl 18	. . . . 5 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
16	8, 9	ntrclsrcomplex 45111	. . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵)
17	15, 16	ffvelcdmd 7085	. . . 4 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵)
18	17	elpwid 4565	. . 3 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵)
19		difssd 4073	. . 3 ⊢ (𝜑 → (𝐵 ∖ 𝐶) ⊆ 𝐵)
20		rcompleq 4250	. . 3 ⊢ (((𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝐶) ⊆ 𝐵) → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶))))
21	18, 19, 20	syl2anc 596	. 2 ⊢ (𝜑 → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶))))
22	6, 12, 21	3bitr4d 314	1 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045  𝒫 cpw 4556   class class class wbr 5102   ↦ cmpt 5185  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8848

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8850

This theorem is used by:  ntrclsfveq  45138