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

Theorem lpval 18878
Description: The set of limit points of a subset of the base set of a topology. Alternate definition of limit point in [Munkres] p. 97. (Contributed by NM, 10-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
lpfval.1  |-  X  = 
U. J
Assertion
Ref Expression
lpval  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( limPt `  J
) `  S )  =  { x  |  x  e.  ( ( cls `  J ) `  ( S  \  { x }
) ) } )
Distinct variable groups:    x, J    x, S    x, X

Proof of Theorem lpval
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 lpfval.1 . . . . 5  |-  X  = 
U. J
21lpfval 18877 . . . 4  |-  ( J  e.  Top  ->  ( limPt `  J )  =  ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J ) `
 ( y  \  { x } ) ) } ) )
32fveq1d 5804 . . 3  |-  ( J  e.  Top  ->  (
( limPt `  J ) `  S )  =  ( ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J ) `
 ( y  \  { x } ) ) } ) `  S ) )
43adantr 465 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( limPt `  J
) `  S )  =  ( ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J
) `  ( y  \  { x } ) ) } ) `  S ) )
51topopn 18654 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
6 elpw2g 4566 . . . . 5  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
75, 6syl 16 . . . 4  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
87biimpar 485 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  e.  ~P X
)
95adantr 465 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  X  e.  J )
10 ssdifss 3598 . . . . . 6  |-  ( S 
C_  X  ->  ( S  \  { x }
)  C_  X )
111clsss3 18798 . . . . . . 7  |-  ( ( J  e.  Top  /\  ( S  \  { x } )  C_  X
)  ->  ( ( cls `  J ) `  ( S  \  { x } ) )  C_  X )
1211sseld 3466 . . . . . 6  |-  ( ( J  e.  Top  /\  ( S  \  { x } )  C_  X
)  ->  ( x  e.  ( ( cls `  J
) `  ( S  \  { x } ) )  ->  x  e.  X ) )
1310, 12sylan2 474 . . . . 5  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( x  e.  ( ( cls `  J
) `  ( S  \  { x } ) )  ->  x  e.  X ) )
1413abssdv 3537 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  { x  |  x  e.  ( ( cls `  J
) `  ( S  \  { x } ) ) }  C_  X
)
159, 14ssexd 4550 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  { x  |  x  e.  ( ( cls `  J
) `  ( S  \  { x } ) ) }  e.  _V )
16 difeq1 3578 . . . . . . 7  |-  ( y  =  S  ->  (
y  \  { x } )  =  ( S  \  { x } ) )
1716fveq2d 5806 . . . . . 6  |-  ( y  =  S  ->  (
( cls `  J
) `  ( y  \  { x } ) )  =  ( ( cls `  J ) `
 ( S  \  { x } ) ) )
1817eleq2d 2524 . . . . 5  |-  ( y  =  S  ->  (
x  e.  ( ( cls `  J ) `
 ( y  \  { x } ) )  <->  x  e.  (
( cls `  J
) `  ( S  \  { x } ) ) ) )
1918abbidv 2590 . . . 4  |-  ( y  =  S  ->  { x  |  x  e.  (
( cls `  J
) `  ( y  \  { x } ) ) }  =  {
x  |  x  e.  ( ( cls `  J
) `  ( S  \  { x } ) ) } )
20 eqid 2454 . . . 4  |-  ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J
) `  ( y  \  { x } ) ) } )  =  ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J ) `
 ( y  \  { x } ) ) } )
2119, 20fvmptg 5884 . . 3  |-  ( ( S  e.  ~P X  /\  { x  |  x  e.  ( ( cls `  J ) `  ( S  \  { x }
) ) }  e.  _V )  ->  ( ( y  e.  ~P X  |->  { x  |  x  e.  ( ( cls `  J ) `  (
y  \  { x } ) ) } ) `  S )  =  { x  |  x  e.  ( ( cls `  J ) `
 ( S  \  { x } ) ) } )
228, 15, 21syl2anc 661 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( y  e. 
~P X  |->  { x  |  x  e.  (
( cls `  J
) `  ( y  \  { x } ) ) } ) `  S )  =  {
x  |  x  e.  ( ( cls `  J
) `  ( S  \  { x } ) ) } )
234, 22eqtrd 2495 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( limPt `  J
) `  S )  =  { x  |  x  e.  ( ( cls `  J ) `  ( S  \  { x }
) ) } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1370    e. wcel 1758   {cab 2439   _Vcvv 3078    \ cdif 3436    C_ wss 3439   ~Pcpw 3971   {csn 3988   U.cuni 4202    |-> cmpt 4461   ` cfv 5529   Topctop 18633   clsccl 18757   limPtclp 18873
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-rep 4514  ax-sep 4524  ax-nul 4532  ax-pow 4581  ax-pr 4642  ax-un 6485
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-ral 2804  df-rex 2805  df-reu 2806  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3399  df-dif 3442  df-un 3444  df-in 3446  df-ss 3453  df-nul 3749  df-if 3903  df-pw 3973  df-sn 3989  df-pr 3991  df-op 3995  df-uni 4203  df-int 4240  df-iun 4284  df-iin 4285  df-br 4404  df-opab 4462  df-mpt 4463  df-id 4747  df-xp 4957  df-rel 4958  df-cnv 4959  df-co 4960  df-dm 4961  df-rn 4962  df-res 4963  df-ima 4964  df-iota 5492  df-fun 5531  df-fn 5532  df-f 5533  df-f1 5534  df-fo 5535  df-f1o 5536  df-fv 5537  df-top 18638  df-cld 18758  df-cls 18760  df-lp 18875
This theorem is referenced by:  islp  18879  lpsscls  18880
  Copyright terms: Public domain W3C validator