Theorem ntrclselnel1 45249

Description: If (pseudo-)interior and (pseudo-)closure functions are related by the duality operator then there is an equivalence between membership in the interior of a set and non-membership in the closure of the complement of the set. (Contributed by RP, 28-May-2021.)

Hypotheses

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

Assertion

Ref	Expression
ntrclselnel1	⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))

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

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

Proof of Theorem ntrclselnel1

Step	Hyp	Ref	Expression
1		ntrcls.o	. . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
2		ntrcls.d	. . . . . . 7 ⊢ 𝐷 = (𝑂‘𝐵)
3		ntrcls.r	. . . . . . 7 ⊢ (𝜑 → 𝐼𝐷𝐾)
4	1, 2, 3	ntrclsfv2 45248	. . . . . 6 ⊢ (𝜑 → (𝐷‘𝐾) = 𝐼)
5	4	eqcomd 2769	. . . . 5 ⊢ (𝜑 → 𝐼 = (𝐷‘𝐾))
6	5	fveq1d 6910	. . . 4 ⊢ (𝜑 → (𝐼‘𝑆) = ((𝐷‘𝐾)‘𝑆))
7	2, 3	ntrclsbex 45226	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
8	1, 2, 3	ntrclskex 45246	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
9		eqid 2763	. . . . 5 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
10		ntrcls.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
11		eqid 2763	. . . . 5 ⊢ ((𝐷‘𝐾)‘𝑆) = ((𝐷‘𝐾)‘𝑆)
12	1, 2, 7, 8, 9, 10, 11	dssmapfv3d 45211	. . . 4 ⊢ (𝜑 → ((𝐷‘𝐾)‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
13	6, 12	eqtrd 2798	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
14	13	eleq2d 2850	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆)))))
15		ntrcls.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
16		eldif 4052	. . . 4 ⊢ (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))
17	16	a1i 11	. . 3 ⊢ (𝜑 → (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆)))))
18	15, 17	mpbirand 720	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))
19	14, 18	bitrd 282	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  𝒫 cpw 4560   class class class wbr 5106   ↦ cmpt 5189  ‘cfv 6558  (class class class)co 7443   ↑_m cmap 8875

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877

This theorem is used by:  ntrclselnel2  45250  clsneiel1  45300  neicvgel1  45311