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

Theorem neicvgel2 40463
 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 40456 . . 3 (𝜑 → (𝐵𝑆) ∈ 𝒫 𝐵)
101, 2, 3, 4, 5, 6, 7, 8, 9neicvgel1 40462 . 2 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋)))
11 neicvgel.s . . . . . 6 (𝜑𝑆 ∈ 𝒫 𝐵)
1211elpwid 4553 . . . . 5 (𝜑𝑆𝐵)
13 dfss4 4235 . . . . 5 (𝑆𝐵 ↔ (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1412, 13sylib 220 . . . 4 (𝜑 → (𝐵 ∖ (𝐵𝑆)) = 𝑆)
1514eleq1d 2897 . . 3 (𝜑 → ((𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ 𝑆 ∈ (𝑀𝑋)))
1615notbid 320 . 2 (𝜑 → (¬ (𝐵 ∖ (𝐵𝑆)) ∈ (𝑀𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
1710, 16bitrd 281 1 (𝜑 → ((𝐵𝑆) ∈ (𝑁𝑋) ↔ ¬ 𝑆 ∈ (𝑀𝑋)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   = wceq 1533   ∈ wcel 2110  {crab 3142  Vcvv 3495   ∖ cdif 3933   ⊆ wss 3936  𝒫 cpw 4539   class class class wbr 5059   ↦ cmpt 5139   ∘ ccom 5554  ‘cfv 6350  (class class class)co 7150   ∈ cmpo 7152   ↑m cmap 8400 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-map 8402 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator