Theorem ntrclselnel1 44811

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 44810	. . . . . 6 ⊢ (𝜑 → (𝐷‘𝐾) = 𝐼)
5	4	eqcomd 2768	. . . . 5 ⊢ (𝜑 → 𝐼 = (𝐷‘𝐾))
6	5	fveq1d 6883	. . . 4 ⊢ (𝜑 → (𝐼‘𝑆) = ((𝐷‘𝐾)‘𝑆))
7	2, 3	ntrclsbex 44788	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
8	1, 2, 3	ntrclskex 44808	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
9		eqid 2762	. . . . 5 ⊢ (𝐷‘𝐾) = (𝐷‘𝐾)
10		ntrcls.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
11		eqid 2762	. . . . 5 ⊢ ((𝐷‘𝐾)‘𝑆) = ((𝐷‘𝐾)‘𝑆)
12	1, 2, 7, 8, 9, 10, 11	dssmapfv3d 44773	. . . 4 ⊢ (𝜑 → ((𝐷‘𝐾)‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
13	6, 12	eqtrd 2797	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))))
14	13	eleq2d 2848	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆)))))
15		ntrcls.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
16		eldif 3914	. . . 4 ⊢ (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))
17	16	a1i 11	. . 3 ⊢ (𝜑 → (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆)))))
18	15, 17	mpbirand 719	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐵 ∖ (𝐾‘(𝐵 ∖ 𝑆))) ↔ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))
19	14, 18	bitrd 282	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ ¬ 𝑋 ∈ (𝐾‘(𝐵 ∖ 𝑆))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454   ∖ cdif 3901  𝒫 cpw 4561   class class class wbr 5108   ↦ cmpt 5191  ‘cfv 6536  (class class class)co 7412   ↑_m cmap 8822

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-map 8824

This theorem is used by:  ntrclselnel2  44812  clsneiel1  44862  neicvgel1  44873