Theorem ntrneiel 45342

Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the 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, 29-May-2021.)

Hypotheses

Ref	Expression
ntrnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
ntrnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r	⊢ (𝜑 → 𝐼𝐹𝑁)
ntrnei.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
ntrnei.s	⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)

Assertion

Ref	Expression
ntrneiel	⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋)))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝑘,𝐼,𝑙,𝑚   𝑆,𝑚   𝑋,𝑙,𝑚   𝜑,𝑖,𝑗,𝑘,𝑙

Allowed substitution hints:   𝜑(𝑚)   𝑆(𝑖, 𝑗, 𝑘, 𝑙)   𝐹(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝐼(𝑖, 𝑗)   𝑁(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝑂(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝑋(𝑖, 𝑗, 𝑘)

Proof of Theorem ntrneiel

Step	Hyp	Ref	Expression
1		ntrnei.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
2		fveq2 6916	. . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆))
3	2	eleq2d 2850	. . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆)))
4	3	elrab3 3649	. . 3 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆)))
5	1, 4	syl 18	. 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑋 ∈ (𝐼‘𝑆)))
6		ntrnei.o	. . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
7		ntrnei.f	. . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
8		ntrnei.r	. . . . . . 7 ⊢ (𝜑 → 𝐼𝐹𝑁)
9	6, 7, 8	ntrneibex 45334	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	pwexd 5348	. . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V)
11	6, 7, 8	ntrneiiex 45337	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
12		eqid 2763	. . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼)
13		ntrnei.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14	6, 10, 9, 7, 11, 12, 13	fsovfvfvd 45272	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)})
15	6, 7, 8	ntrneifv1 45340	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁)
16	15	fveq1d 6918	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋))
17	14, 16	eqtr3d 2800	. . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋))
18	17	eleq2d 2850	. 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋)))
19	5, 18	bitr3d 284	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  𝒫 cpw 4560   class class class wbr 5108   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   ↑_m cmap 8885

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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887

This theorem is used by:  ntrneifv3  45343  ntrneineine0lem  45344  ntrneineine1lem  45345  ntrneifv4  45346  ntrneiel2  45347  ntrneicls00  45350  ntrneicls11  45351  ntrneiiso  45352  ntrneik2  45353  ntrneix2  45354  ntrneikb  45355  ntrneixb  45356  ntrneik3  45357  ntrneix3  45358  ntrneik13  45359  ntrneix13  45360  ntrneik4w  45361  ntrneik4  45362  clsneiel1  45369  neicvgel1  45380