Theorem ntrclsfveq1 44379

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 4564	. . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)
3		dfss4 4222	. . . . 5 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶)
4	2, 3	sylib 218	. . . 4 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ 𝐶)) = 𝐶)
5	4	eqcomd 2743	. . 3 ⊢ (𝜑 → 𝐶 = (𝐵 ∖ (𝐵 ∖ 𝐶)))
6	5	eqeq2d 2748	. 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 44378	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
12	11	eqeq1d 2739	. 2 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = 𝐶))
13	7, 8, 9	ntrclskex 44373	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
14		elmapi 8791	. . . . . 6 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
15	13, 14	syl 17	. . . . 5 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
16	8, 9	ntrclsrcomplex 44354	. . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵)
17	15, 16	ffvelcdmd 7032	. . . 4 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ∈ 𝒫 𝐵)
18	17	elpwid 4564	. . 3 ⊢ (𝜑 → (𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵)
19		difssd 4090	. . 3 ⊢ (𝜑 → (𝐵 ∖ 𝐶) ⊆ 𝐵)
20		rcompleq 4258	. . 3 ⊢ (((𝐾‘(𝐵 ∖ 𝑆)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝐶) ⊆ 𝐵) → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶))))
21	18, 19, 20	syl2anc 585	. 2 ⊢ (𝜑 → ((𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) = (𝐵 ∖ (𝐵 ∖ 𝐶))))
22	6, 12, 21	3bitr4d 311	1 ⊢ (𝜑 → ((𝐼‘𝑆) = 𝐶 ↔ (𝐾‘(𝐵 ∖ 𝑆)) = (𝐵 ∖ 𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114  Vcvv 3441   ∖ cdif 3899   ⊆ wss 3902  𝒫 cpw 4555   class class class wbr 5099   ↦ cmpt 5180  ⟶wf 6489  ‘cfv 6493  (class class class)co 7361   ↑_m cmap 8768

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-map 8770

This theorem is referenced by:  ntrclsfveq  44381