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 45386
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 6916 . . . 4 (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡))
21eleq2d 2850 . . 3 (𝑠 = 𝑡 → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑋 ∈ (𝐼‘𝑡)))
32cbvrexvw 3245 . 2 (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡))
4 ntrcls.d . . . . 5 𝐷 = (𝑂‘𝐵)
5 ntrcls.r . . . . 5 (𝜑 → 𝐼𝐷𝐾)
64, 5ntrclsrcomplex 45357 . . . 4 (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
76adantr 486 . . 3 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
84, 5ntrclsrcomplex 45357 . . . . 5 (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
98adantr 486 . . . 4 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
10 difeq2 4060 . . . . . 6 (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡)))
1110adantl 487 . . . . 5 (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡)))
12 elpwi 4567 . . . . . . 7 (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵)
13 dfss4 4217 . . . . . . 7 (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1412, 13sylib 221 . . . . . 6 (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1514ad2antlr 740 . . . . 5 (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1611, 15eqtr2d 2799 . . . 4 (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → 𝑡 = (𝐵 ∖ 𝑠))
179, 16rspcedeqvd 3587 . . 3 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠))
18 fveq2 6916 . . . . . 6 (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠)))
1918eleq2d 2850 . . . . 5 (𝑡 = (𝐵 ∖ 𝑠) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠))))
20193ad2ant3 1153 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ 𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠))))
21 ntrcls.o . . . . . 6 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
225adantr 486 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐷𝐾)
23 ntrclslem0.x . . . . . . 7 (𝜑 → 𝑋 ∈ 𝐵)
2423adantr 486 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵)
25 simpr 490 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
2621, 4, 22, 24, 25ntrclselnel2 45380 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠)))
27263adant3 1150 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘(𝐵 ∖ 𝑠)) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠)))
2820, 27bitrd 282 . . 3 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑋 ∈ (𝐼‘𝑡) ↔ ¬ 𝑋 ∈ (𝐾‘𝑠)))
297, 17, 28rexxfrd2 5382 . 2 (𝜑 → (∃𝑡 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑡) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠)))
303, 29bitrid 286 1 (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐾‘𝑠)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  𝒫 cpw 4560   class class class wbr 5108   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887
This theorem is used by:  ntrclsneine0  45387
  Copyright terms: Public domain W3C validator