Theorem clsneiel1 45093

Description: If a (pseudo-)closure function and a (pseudo-)neighborhood function are related by the 𝐻 operator, then membership in the closure of a subset is equivalent to the complement of the subset not being a neighborhood of the point. (Contributed by RP, 7-Jun-2021.)

Hypotheses

Ref	Expression
clsnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
clsnei.p	⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
clsnei.d	⊢ 𝐷 = (𝑃‘𝐵)
clsnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
clsnei.h	⊢ 𝐻 = (𝐹 ∘ 𝐷)
clsnei.r	⊢ (𝜑 → 𝐾𝐻𝑁)
clsneiel.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
clsneiel.s	⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)

Assertion

Ref	Expression
clsneiel1	⊢ (𝜑 → (𝑋 ∈ (𝐾‘𝑆) ↔ ¬ (𝐵 ∖ 𝑆) ∈ (𝑁‘𝑋)))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝐵,𝑛,𝑜,𝑝   𝐷,𝑖,𝑗,𝑘,𝑙,𝑚   𝐷,𝑛,𝑜,𝑝   𝑖,𝐹,𝑗,𝑘,𝑙   𝑛,𝐹,𝑜,𝑝   𝑖,𝐾,𝑗,𝑘,𝑙,𝑚   𝑛,𝐾,𝑜,𝑝   𝑖,𝑁,𝑗,𝑘,𝑙   𝑛,𝑁,𝑜,𝑝   𝑆,𝑚   𝑆,𝑜   𝑋,𝑙,𝑚   𝜑,𝑖,𝑗,𝑘,𝑙   𝜑,𝑛,𝑜,𝑝

Allowed substitution hints:   𝜑(𝑚)   𝑃(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑆(𝑖, 𝑗, 𝑘, 𝑛, 𝑝, 𝑙)   𝐹(𝑚)   𝐻(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑁(𝑚)   𝑂(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑋(𝑖, 𝑗, 𝑘, 𝑛, 𝑜, 𝑝)

Proof of Theorem clsneiel1

Step	Hyp	Ref	Expression
1		clsnei.d	. . . 4 ⊢ 𝐷 = (𝑃‘𝐵)
2		clsnei.h	. . . 4 ⊢ 𝐻 = (𝐹 ∘ 𝐷)
3		clsnei.r	. . . 4 ⊢ (𝜑 → 𝐾𝐻𝑁)
4	1, 2, 3	clsneibex 45087	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
5	4	ancli 558	. 2 ⊢ (𝜑 → (𝜑 ∧ 𝐵 ∈ V))
6		clsnei.o	. . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
7		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐵 ∈ V)
8	7	pwexd 5341	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝒫 𝐵 ∈ V)
9		clsnei.f	. . . . 5 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
10	6, 8, 7, 9	fsovfd 44997	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)⟶(𝒫 𝒫 𝐵 ↑m 𝐵))
11	10	ffnd 6708	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))
12		clsnei.p	. . . . 5 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
13	12, 1, 7	dssmapf1od 45006	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
14		f1of 6822	. . . 4 ⊢ (𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)⟶(𝒫 𝐵 ↑m 𝒫 𝐵))
15	13, 14	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)⟶(𝒫 𝐵 ↑m 𝒫 𝐵))
16	2	breqi 5109	. . . . 5 ⊢ (𝐾𝐻𝑁 ↔ 𝐾(𝐹 ∘ 𝐷)𝑁)
17	3, 16	sylib 221	. . . 4 ⊢ (𝜑 → 𝐾(𝐹 ∘ 𝐷)𝑁)
18	17	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐾(𝐹 ∘ 𝐷)𝑁)
19	11, 15, 18	brcoffn 45015	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁))
20		simprl 783	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → 𝐾𝐷(𝐷‘𝐾))
21		clsneiel.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
22	21	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → 𝑋 ∈ 𝐵)
23		clsneiel.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
24	23	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → 𝑆 ∈ 𝒫 𝐵)
25	12, 1, 20, 22, 24	ntrclselnel1 45042	. . 3 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝑋 ∈ (𝐾‘𝑆) ↔ ¬ 𝑋 ∈ ((𝐷‘𝐾)‘(𝐵 ∖ 𝑆))))
26		simprr 785	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝐷‘𝐾)𝐹𝑁)
27		simplr 781	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → 𝐵 ∈ V)
28		difssd 4084	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝐵 ∖ 𝑆) ⊆ 𝐵)
29	27, 28	sselpwd 5290	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝐵 ∖ 𝑆) ∈ 𝒫 𝐵)
30	6, 9, 26, 22, 29	ntrneiel 45066	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝑋 ∈ ((𝐷‘𝐾)‘(𝐵 ∖ 𝑆)) ↔ (𝐵 ∖ 𝑆) ∈ (𝑁‘𝑋)))
31	30	notbid 321	. . 3 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (¬ 𝑋 ∈ ((𝐷‘𝐾)‘(𝐵 ∖ 𝑆)) ↔ ¬ (𝐵 ∖ 𝑆) ∈ (𝑁‘𝑋)))
32	25, 31	bitrd 282	. 2 ⊢ (((𝜑 ∧ 𝐵 ∈ V) ∧ (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) → (𝑋 ∈ (𝐾‘𝑆) ↔ ¬ (𝐵 ∖ 𝑆) ∈ (𝑁‘𝑋)))
33	5, 19, 32	syl2anc2 597	1 ⊢ (𝜑 → (𝑋 ∈ (𝐾‘𝑆) ↔ ¬ (𝐵 ∖ 𝑆) ∈ (𝑁‘𝑋)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ∖ cdif 3896  𝒫 cpw 4557   class class class wbr 5103   ↦ cmpt 5186   ∘ ccom 5655  ⟶wf 6533  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420   ↑_m cmap 8840

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 7749

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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842

This theorem is used by:  clsneiel2  45094  clsneifv4  45096