Theorem ntrclselnel1 44884

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 44883	. . . . . 6 ⊢ (𝜑 → (𝐷‘𝐾) = 𝐼)
5	4	eqcomd 2768	. . . . 5 ⊢ (𝜑 → 𝐼 = (𝐷‘𝐾))
6	5	fveq1d 6884	. . . 4 ⊢ (𝜑 → (𝐼‘𝑆) = ((𝐷‘𝐾)‘𝑆))
7	2, 3	ntrclsbex 44861	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
8	1, 2, 3	ntrclskex 44881	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
9		eqid 2762	. . . . 5 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
10		ntrcls.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
11		eqid 2762	. . . . 5 ⊢ ((𝐷‘𝐾)‘𝑆) = ((𝐷‘𝐾)‘𝑆)
12	1, 2, 7, 8, 9, 10, 11	dssmapfv3d 44846	. . . 4 ⊢ (𝜑 → ((𝐷‘𝐾)‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
13	6, 12	eqtrd 2797	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
14	13	eleq2d 2848	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆)))))
15		ntrcls.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
16		eldif 3912	. . . 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 2145  Vcvv 3453   ∖ cdif 3899  𝒫 cpw 4560   class class class wbr 5107   ↦ cmpt 5190  ‘cfv 6537  (class class class)co 7416   ↑_m cmap 8829

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831

This theorem is used by:  ntrclselnel2  44885  clsneiel1  44935  neicvgel1  44946