Theorem ntrneiel 44865

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 2851	. . . 4 ⊢ (𝑚 = 𝑆 → (𝑋 ∈ (𝐼‘𝑚) ↔ 𝑋 ∈ (𝐼‘𝑆)))
4	3	elrab3 3653	. . 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 44857	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	pwexd 5352	. . . . 5 ⊢ (𝜑 → 𝒫 𝐵 ∈ V)
11	6, 7, 8	ntrneiiex 44860	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
12		eqid 2765	. . . . 5 ⊢ (𝐹‘𝐼) = (𝐹‘𝐼)
13		ntrnei.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14	6, 10, 9, 7, 11, 12, 13	fsovfvfvd 44795	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)})
15	6, 7, 8	ntrneifv1 44863	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁)
16	15	fveq1d 6887	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐼)‘𝑋) = (𝑁‘𝑋))
17	14, 16	eqtr3d 2802	. . 3 ⊢ (𝜑 → {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} = (𝑁‘𝑋))
18	17	eleq2d 2851	. 2 ⊢ (𝜑 → (𝑆 ∈ {𝑚 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑚)} ↔ 𝑆 ∈ (𝑁‘𝑋)))
19	5, 18	bitr3d 284	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑋)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  {crab 3418  Vcvv 3457  𝒫 cpw 4564   class class class wbr 5111   ↦ cmpt 5194  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421   ↑_m cmap 8830

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-map 8832

This theorem is used by:  ntrneifv3  44866  ntrneineine0lem  44867  ntrneineine1lem  44868  ntrneifv4  44869  ntrneiel2  44870  ntrneicls00  44873  ntrneicls11  44874  ntrneiiso  44875  ntrneik2  44876  ntrneix2  44877  ntrneikb  44878  ntrneixb  44879  ntrneik3  44880  ntrneix3  44881  ntrneik13  44882  ntrneix13  44883  ntrneik4w  44884  ntrneik4  44885  clsneiel1  44892  neicvgel1  44903