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

Theorem neicvgel2 42871
Description: The complement of a subset being an element of a neighborhood at a point is equivalent to that subset not being a element of the convergent at that point. (Contributed by RP, 12-Jun-2021.)
Hypotheses
Ref Expression
neicvg.o 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗m 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
neicvg.p 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛𝑜))))))
neicvg.d 𝐷 = (𝑃𝐵)
neicvg.f 𝐹 = (𝒫 𝐵𝑂𝐵)
neicvg.g 𝐺 = (𝐵𝑂𝒫 𝐵)
neicvg.h 𝐻 = (𝐹 ∘ (𝐷𝐺))
neicvg.r (𝜑𝑁𝐻𝑀)
neicvgel.x (𝜑𝑋𝐵)
neicvgel.s (𝜑𝑆 ∈ 𝒫 𝐵)
Assertion
Ref Expression
neicvgel2 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝐵,𝑛,𝑜,𝑝   𝐷,𝑖,𝑗,𝑘,𝑙,𝑚   𝐷,𝑛,𝑜,𝑝   𝑖,𝐹,𝑗,𝑘,𝑙   𝑛,𝐹,𝑜,𝑝   𝑖,𝐺,𝑗,𝑘,𝑙,𝑚   𝑛,𝐺,𝑜,𝑝   𝑖,𝑀,𝑗,𝑘,𝑙   𝑛,𝑀,𝑜,𝑝   𝑖,𝑁,𝑗,𝑘,𝑙,𝑚   𝑛,𝑁,𝑜,𝑝   𝑆,𝑚   𝑆,𝑜   𝑋,𝑙,𝑚   𝜑,𝑖,𝑗,𝑘,𝑙   𝜑,𝑛,𝑜,𝑝
Allowed substitution hints:   𝜑(𝑚)   𝑃(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑆(𝑖,𝑗,𝑘,𝑛,𝑝,𝑙)   𝐹(𝑚)   𝐻(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑀(𝑚)   𝑂(𝑖,𝑗,𝑘,𝑚,𝑛,𝑜,𝑝,𝑙)   𝑋(𝑖,𝑗,𝑘,𝑛,𝑜,𝑝)

Proof of Theorem neicvgel2
StepHypRef Expression
1 neicvg.o . . 3 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗m 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
2 neicvg.p . . 3 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛𝑜))))))
3 neicvg.d . . 3 𝐷 = (𝑃𝐵)
4 neicvg.f . . 3 𝐹 = (𝒫 𝐵𝑂𝐵)
5 neicvg.g . . 3 𝐺 = (𝐵𝑂𝒫 𝐵)
6 neicvg.h . . 3 𝐻 = (𝐹 ∘ (𝐷𝐺))
7 neicvg.r . . 3 (𝜑𝑁𝐻𝑀)
8 neicvgel.x . . 3 (𝜑𝑋𝐵)
93, 6, 7neicvgrcomplex 42864 . . 3 (𝜑 → (𝐵𝑆) ∈ 𝒫 𝐵)
101, 2, 3, 4, 5, 6, 7, 8, 9neicvgel1 42870 . 2 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋)))
11 neicvgel.s . . . . . 6 (𝜑𝑆 ∈ 𝒫 𝐵)
1211elpwid 4612 . . . . 5 (𝜑𝑆𝐵)
13 dfss4 4259 . . . . 5 (𝑆𝐵 ↔ (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1412, 13sylib 217 . . . 4 (𝜑 → (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1514eleq1d 2819 . . 3 (𝜑 → ((𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ 𝑆 ∈ (𝑀𝑋)))
1615notbid 318 . 2 (𝜑 → (¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
1710, 16bitrd 279 1 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205   = wceq 1542  wcel 2107  {crab 3433  Vcvv 3475  cdif 3946  wss 3949  𝒫 cpw 4603   class class class wbr 5149  cmpt 5232  ccom 5681  cfv 6544  (class class class)co 7409  cmpo 7411  m cmap 8820
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-1st 7975  df-2nd 7976  df-map 8822
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator