Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  clsneiel2 Structured version   Visualization version   GIF version

Theorem clsneiel2 42292
Description: If a (pseudo-)closure function and a (pseudo-)neighborhood function are related by the 𝐻 operator, then membership in the closure of the complement of a subset is equivalent to 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
clsneiel2 (𝜑 → (𝑋 ∈ (𝐾‘(𝐵𝑆)) ↔ ¬ 𝑆 ∈ (𝑁𝑋)))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝐵,𝑛,𝑜,𝑝   𝐷,𝑖,𝑗,𝑘,𝑙,𝑚   𝐷,𝑛,𝑜,𝑝   𝑖,𝐹,𝑗,𝑘,𝑙   𝑛,𝐹,𝑜,𝑝   𝑖,𝐾,𝑗,𝑘,𝑙,𝑚   𝑛,𝐾,𝑜,𝑝   𝑖,𝑁,𝑗,𝑘,𝑙   𝑛,𝑁,𝑜,𝑝   𝑆,𝑚   𝑆,𝑜   𝑋,𝑙,𝑚   𝜑,𝑖,𝑗,𝑘,𝑙   𝜑,𝑛,𝑜,𝑝
Allowed substitution hints:   𝜑(𝑚)   𝑃(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑆(𝑖,𝑗,𝑘,𝑛,𝑝,𝑙)   𝐹(𝑚)   𝐻(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑁(𝑚)   𝑂(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑋(𝑖,𝑗,𝑘,𝑛,𝑜,𝑝)

Proof of Theorem clsneiel2
StepHypRef Expression
1 clsnei.o . . 3 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗m 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
2 clsnei.p . . 3 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛𝑜))))))
3 clsnei.d . . 3 𝐷 = (𝑃𝐵)
4 clsnei.f . . 3 𝐹 = (𝒫 𝐵𝑂𝐵)
5 clsnei.h . . 3 𝐻 = (𝐹𝐷)
6 clsnei.r . . 3 (𝜑𝐾𝐻𝑁)
7 clsneiel.x . . 3 (𝜑𝑋𝐵)
83, 5, 6clsneircomplex 42286 . . 3 (𝜑 → (𝐵𝑆) ∈ 𝒫 𝐵)
91, 2, 3, 4, 5, 6, 7, 8clsneiel1 42291 . 2 (𝜑 → (𝑋 ∈ (𝐾‘(𝐵𝑆)) ↔ ¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑁𝑋)))
10 clsneiel.s . . . . . 6 (𝜑𝑆 ∈ 𝒫 𝐵)
1110elpwid 4567 . . . . 5 (𝜑𝑆𝐵)
12 dfss4 4216 . . . . 5 (𝑆𝐵 ↔ (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1311, 12sylib 217 . . . 4 (𝜑 → (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1413eleq1d 2822 . . 3 (𝜑 → ((𝐵 ∖ (𝐵𝑆)) ∈ (𝑁𝑋) ↔ 𝑆 ∈ (𝑁𝑋)))
1514notbid 317 . 2 (𝜑 → (¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑁𝑋) ↔ ¬ 𝑆 ∈ (𝑁𝑋)))
169, 15bitrd 278 1 (𝜑 → (𝑋 ∈ (𝐾‘(𝐵𝑆)) ↔ ¬ 𝑆 ∈ (𝑁𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205   = wceq 1541  wcel 2106  {crab 3405  Vcvv 3443  cdif 3905  wss 3908  𝒫 cpw 4558   class class class wbr 5103  cmpt 5186  ccom 5635  cfv 6493  (class class class)co 7351  cmpo 7353  m cmap 8723
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-rep 5240  ax-sep 5254  ax-nul 5261  ax-pow 5318  ax-pr 5382  ax-un 7664
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-id 5529  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7354  df-oprab 7355  df-mpo 7356  df-1st 7913  df-2nd 7914  df-map 8725
This theorem is referenced by:  clsneifv3  42293
  Copyright terms: Public domain W3C validator