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 44046
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 6840 . . . 4 (𝑠 = 𝑡 → (𝐼𝑠) = (𝐼𝑡))
21eleq2d 2814 . . 3 (𝑠 = 𝑡 → (𝑋 ∈ (𝐼𝑠) ↔ 𝑋 ∈ (𝐼𝑡)))
32cbvrexvw 3214 . 2 (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑠) ↔ ∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑡))
4 ntrcls.d . . . . 5 𝐷 = (𝑂𝐵)
5 ntrcls.r . . . . 5 (𝜑𝐼𝐷𝐾)
64, 5ntrclsrcomplex 44017 . . . 4 (𝜑 → (𝐵𝑠) ∈ 𝒫 𝐵)
76adantr 480 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝐵𝑠) ∈ 𝒫 𝐵)
84, 5ntrclsrcomplex 44017 . . . . 5 (𝜑 → (𝐵𝑡) ∈ 𝒫 𝐵)
98adantr 480 . . . 4 ((𝜑𝑡 ∈ 𝒫 𝐵) → (𝐵𝑡) ∈ 𝒫 𝐵)
10 difeq2 4079 . . . . . 6 (𝑠 = (𝐵𝑡) → (𝐵𝑠) = (𝐵 ∖ (𝐵𝑡)))
1110adantl 481 . . . . 5 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → (𝐵𝑠) = (𝐵 ∖ (𝐵𝑡)))
12 elpwi 4566 . . . . . . 7 (𝑡 ∈ 𝒫 𝐵𝑡𝐵)
13 dfss4 4228 . . . . . . 7 (𝑡𝐵 ↔ (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1412, 13sylib 218 . . . . . 6 (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1514ad2antlr 727 . . . . 5 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1611, 15eqtr2d 2765 . . . 4 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → 𝑡 = (𝐵𝑠))
179, 16rspcedeq2vd 3593 . . 3 ((𝜑𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠))
18 fveq2 6840 . . . . . 6 (𝑡 = (𝐵𝑠) → (𝐼𝑡) = (𝐼‘(𝐵𝑠)))
1918eleq2d 2814 . . . . 5 (𝑡 = (𝐵𝑠) → (𝑋 ∈ (𝐼𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵𝑠))))
20193ad2ant3 1135 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵𝑠))))
21 ntrcls.o . . . . . 6 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
225adantr 480 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝐼𝐷𝐾)
23 ntrclslem0.x . . . . . . 7 (𝜑𝑋𝐵)
2423adantr 480 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝑋𝐵)
25 simpr 484 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
2621, 4, 22, 24, 25ntrclselnel2 44040 . . . . 5 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘(𝐵𝑠)) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
27263adant3 1132 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼‘(𝐵𝑠)) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
2820, 27bitrd 279 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑋 ∈ (𝐼𝑡) ↔ ¬ 𝑋 ∈ (𝐾𝑠)))
297, 17, 28rexxfrd2 5363 . 2 (𝜑 → (∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑡) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾𝑠)))
303, 29bitrid 283 1 (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾𝑠)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wrex 3053  Vcvv 3444  cdif 3908  wss 3911  𝒫 cpw 4559   class class class wbr 5102  cmpt 5183  cfv 6499  (class class class)co 7369  m cmap 8776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  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 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-map 8778
This theorem is referenced by:  ntrclsneine0  44047
  Copyright terms: Public domain W3C validator