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

Theorem ntrclsneine0lem 42491
Description: If (pseudo-)interior and (pseudo-)closure functions are related by the duality operator then conditions equal to claiming that at least one (pseudo-)neighborbood of a particular point exists hold equally. (Contributed by RP, 21-May-2021.)
Hypotheses
Ref Expression
ntrcls.o 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
ntrcls.d 𝐷 = (𝑂𝐵)
ntrcls.r (𝜑𝐼𝐷𝐾)
ntrclslem0.x (𝜑𝑋𝐵)
Assertion
Ref Expression
ntrclsneine0lem (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾𝑠)))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑠   𝑗,𝐼,𝑘,𝑠   𝑋,𝑠   𝜑,𝑖,𝑗,𝑘,𝑠
Allowed substitution hints:   𝐷(𝑖,𝑗,𝑘,𝑠)   𝐼(𝑖)   𝐾(𝑖,𝑗,𝑘,𝑠)   𝑂(𝑖,𝑗,𝑘,𝑠)   𝑋(𝑖,𝑗,𝑘)

Proof of Theorem ntrclsneine0lem
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6862 . . . 4 (𝑠 = 𝑡 → (𝐼𝑠) = (𝐼𝑡))
21eleq2d 2818 . . 3 (𝑠 = 𝑡 → (𝑋 ∈ (𝐼𝑠) ↔ 𝑋 ∈ (𝐼𝑡)))
32cbvrexvw 3234 . 2 (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑠) ↔ ∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑡))
4 ntrcls.d . . . . 5 𝐷 = (𝑂𝐵)
5 ntrcls.r . . . . 5 (𝜑𝐼𝐷𝐾)
64, 5ntrclsrcomplex 42462 . . . 4 (𝜑 → (𝐵𝑠) ∈ 𝒫 𝐵)
76adantr 481 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝐵𝑠) ∈ 𝒫 𝐵)
84, 5ntrclsrcomplex 42462 . . . . 5 (𝜑 → (𝐵𝑡) ∈ 𝒫 𝐵)
98adantr 481 . . . 4 ((𝜑𝑡 ∈ 𝒫 𝐵) → (𝐵𝑡) ∈ 𝒫 𝐵)
10 difeq2 4096 . . . . . 6 (𝑠 = (𝐵𝑡) → (𝐵𝑠) = (𝐵 ∖ (𝐵𝑡)))
1110adantl 482 . . . . 5 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → (𝐵𝑠) = (𝐵 ∖ (𝐵𝑡)))
12 elpwi 4587 . . . . . . 7 (𝑡 ∈ 𝒫 𝐵𝑡𝐵)
13 dfss4 4238 . . . . . . 7 (𝑡𝐵 ↔ (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1412, 13sylib 217 . . . . . 6 (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1514ad2antlr 725 . . . . 5 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1611, 15eqtr2d 2772 . . . 4 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → 𝑡 = (𝐵𝑠))
179, 16rspcedeq2vd 3601 . . 3 ((𝜑𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠))
18 fveq2 6862 . . . . . 6 (𝑡 = (𝐵𝑠) → (𝐼𝑡) = (𝐼‘(𝐵𝑠)))
1918eleq2d 2818 . . . . 5 (𝑡 = (𝐵𝑠) → (𝑋 ∈ (𝐼𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵𝑠))))
20193ad2ant3 1135 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵𝑠))))
21 ntrcls.o . . . . . 6 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
225adantr 481 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝐼𝐷𝐾)
23 ntrclslem0.x . . . . . . 7 (𝜑𝑋𝐵)
2423adantr 481 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝑋𝐵)
25 simpr 485 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
2621, 4, 22, 24, 25ntrclselnel2 42485 . . . . 5 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘(𝐵𝑠)) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
27263adant3 1132 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼‘(𝐵𝑠)) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
2820, 27bitrd 278 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼𝑡) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
297, 17, 28rexxfrd2 5388 . 2 (𝜑 → (∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑡) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾𝑠)))
303, 29bitrid 282 1 (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾𝑠)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wrex 3069  Vcvv 3459  cdif 3925  wss 3928  𝒫 cpw 4580   class class class wbr 5125  cmpt 5208  cfv 6516  (class class class)co 7377  m cmap 8787
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 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pow 5340  ax-pr 5404  ax-un 7692
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 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-1st 7941  df-2nd 7942  df-map 8789
This theorem is referenced by:  ntrclsneine0  42492
  Copyright terms: Public domain W3C validator