MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  islp2 Structured version   Visualization version   GIF version

Theorem islp2 23008
Description: The predicate "𝑃 is a limit point of 𝑆 " in terms of neighborhoods. Definition of limit point in [Munkres] p. 97. Although Munkres uses open neighborhoods, it also works for our more general neighborhoods. (Contributed by NM, 26-Feb-2007.) (Proof shortened by Mario Carneiro, 25-Dec-2016.)
Hypothesis
Ref Expression
lpfval.1 𝑋 = 𝐽
Assertion
Ref Expression
islp2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑃𝑋) → (𝑃 ∈ ((limPt‘𝐽)‘𝑆) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑃})(𝑛 ∩ (𝑆 ∖ {𝑃})) ≠ ∅))
Distinct variable groups:   𝑛,𝐽   𝑃,𝑛   𝑆,𝑛   𝑛,𝑋

Proof of Theorem islp2
StepHypRef Expression
1 lpfval.1 . . . 4 𝑋 = 𝐽
21islp 23003 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑃 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑃 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑃}))))
323adant3 1132 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑃𝑋) → (𝑃 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑃 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑃}))))
4 ssdifss 4099 . . 3 (𝑆𝑋 → (𝑆 ∖ {𝑃}) ⊆ 𝑋)
51neindisj2 22986 . . 3 ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑃}) ⊆ 𝑋𝑃𝑋) → (𝑃 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑃})) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑃})(𝑛 ∩ (𝑆 ∖ {𝑃})) ≠ ∅))
64, 5syl3an2 1164 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑃𝑋) → (𝑃 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑃})) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑃})(𝑛 ∩ (𝑆 ∖ {𝑃})) ≠ ∅))
73, 6bitrd 279 1 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑃𝑋) → (𝑃 ∈ ((limPt‘𝐽)‘𝑆) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑃})(𝑛 ∩ (𝑆 ∖ {𝑃})) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  w3a 1086   = wceq 1540  wcel 2109  wne 2925  wral 3044  cdif 3908  cin 3910  wss 3911  c0 4292  {csn 4585   cuni 4867  cfv 6499  Topctop 22756  clsccl 22881  neicnei 22960  limPtclp 22997
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-int 4907  df-iun 4953  df-iin 4954  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-top 22757  df-cld 22882  df-ntr 22883  df-cls 22884  df-nei 22961  df-lp 22999
This theorem is referenced by:  clslp  23011  lpbl  24367  reperflem  24683  islptre  45590  islpcn  45610
  Copyright terms: Public domain W3C validator