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 44133
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 44126 . . 3 (𝜑 → (𝐵𝑆) ∈ 𝒫 𝐵)
101, 2, 3, 4, 5, 6, 7, 8, 9neicvgel1 44132 . 2 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋)))
11 neicvgel.s . . . . . 6 (𝜑𝑆 ∈ 𝒫 𝐵)
1211elpwid 4609 . . . . 5 (𝜑𝑆𝐵)
13 dfss4 4269 . . . . 5 (𝑆𝐵 ↔ (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1412, 13sylib 218 . . . 4 (𝜑 → (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1514eleq1d 2826 . . 3 (𝜑 → ((𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ 𝑆 ∈ (𝑀𝑋)))
1615notbid 318 . 2 (𝜑 → (¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
1710, 16bitrd 279 1 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206   = wceq 1540  wcel 2108  {crab 3436  Vcvv 3480  cdif 3948  wss 3951  𝒫 cpw 4600   class class class wbr 5143  cmpt 5225  ccom 5689  cfv 6561  (class class class)co 7431  cmpo 7433  m cmap 8866
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-map 8868
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator