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

Theorem islp2 16804
Description: The predicate " P is a limit point of  S," 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  |-  X  = 
U. J
Assertion
Ref Expression
islp2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( limPt `  J ) `  S )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  ( S  \  { P } ) )  =/=  (/) ) )
Distinct variable groups:    n, J    P, n    S, n    n, X

Proof of Theorem islp2
StepHypRef Expression
1 lpfval.1 . . . 4  |-  X  = 
U. J
21islp 16799 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( P  e.  ( ( limPt `  J ) `  S )  <->  P  e.  ( ( cls `  J
) `  ( S  \  { P } ) ) ) )
323adant3 980 . 2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( limPt `  J ) `  S )  <->  P  e.  ( ( cls `  J
) `  ( S  \  { P } ) ) ) )
4 ssdifss 3249 . . 3  |-  ( S 
C_  X  ->  ( S  \  { P }
)  C_  X )
51neindisj2 16787 . . 3  |-  ( ( J  e.  Top  /\  ( S  \  { P } )  C_  X  /\  P  e.  X
)  ->  ( P  e.  ( ( cls `  J
) `  ( S  \  { P } ) )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  ( S  \  { P } ) )  =/=  (/) ) )
64, 5syl3an2 1221 . 2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( cls `  J ) `  ( S  \  { P } ) )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  ( S  \  { P } ) )  =/=  (/) ) )
73, 6bitrd 246 1  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( limPt `  J ) `  S )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  ( S  \  { P } ) )  =/=  (/) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    /\ w3a 939    = wceq 1619    e. wcel 1621    =/= wne 2419   A.wral 2516    \ cdif 3091    i^i cin 3093    C_ wss 3094   (/)c0 3397   {csn 3581   U.cuni 3768   ` cfv 4638   Topctop 16558   clsccl 16682   neicnei 16761   limPtclp 16793
This theorem is referenced by:  clslp  16806  lpbl  17976  reperflem  18250
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237  ax-rep 4071  ax-sep 4081  ax-nul 4089  ax-pow 4126  ax-pr 4152  ax-un 4449
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-ral 2520  df-rex 2521  df-reu 2522  df-rab 2523  df-v 2742  df-sbc 2936  df-csb 3024  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-pw 3568  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-int 3804  df-iun 3848  df-iin 3849  df-br 3964  df-opab 4018  df-mpt 4019  df-id 4246  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-f1 4651  df-fo 4652  df-f1o 4653  df-fv 4654  df-top 16563  df-cld 16683  df-ntr 16684  df-cls 16685  df-nei 16762  df-lp 16795
  Copyright terms: Public domain W3C validator