Theorem ntrneiel 45080

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 6885	. . . . 5 ⊢ (𝑚 = 𝑆 → (𝐼‘𝑚) = (𝐼‘𝑆))
3	2	eleq2d 2847	. . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆)))
4	3	elrab3 3646	. . 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 45072	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	pwexd 5341	. . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V)
11	6, 7, 8	ntrneiiex 45075	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
12		eqid 2761	. . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼)
13		ntrnei.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14	6, 10, 9, 7, 11, 12, 13	fsovfvfvd 45010	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)})
15	6, 7, 8	ntrneifv1 45078	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁)
16	15	fveq1d 6887	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋))
17	14, 16	eqtr3d 2798	. . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋))
18	17	eleq2d 2847	. 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋)))
19	5, 18	bitr3d 284	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451  𝒫 cpw 4557   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ↑_m cmap 8847

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849

This theorem is used by:  ntrneifv3  45081  ntrneineine0lem  45082  ntrneineine1lem  45083  ntrneifv4  45084  ntrneiel2  45085  ntrneicls00  45088  ntrneicls11  45089  ntrneiiso  45090  ntrneik2  45091  ntrneix2  45092  ntrneikb  45093  ntrneixb  45094  ntrneik3  45095  ntrneix3  45096  ntrneik13  45097  ntrneix13  45098  ntrneik4w  45099  ntrneik4  45100  clsneiel1  45107  neicvgel1  45118