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

Theorem clslp 18711
Description: The closure of a subset of a topological space is the subset together with its limit points. Theorem 6.6 of [Munkres] p. 97. (Contributed by NM, 26-Feb-2007.)
Hypothesis
Ref Expression
lpfval.1  |-  X  = 
U. J
Assertion
Ref Expression
clslp  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  ( S  u.  ( ( limPt `  J
) `  S )
) )

Proof of Theorem clslp
Dummy variables  n  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lpfval.1 . . . . . . . . . . . . 13  |-  X  = 
U. J
21neindisj 18680 . . . . . . . . . . . 12  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  ( x  e.  ( ( cls `  J
) `  S )  /\  n  e.  (
( nei `  J
) `  { x } ) ) )  ->  ( n  i^i 
S )  =/=  (/) )
32expr 612 . . . . . . . . . . 11  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( n  e.  ( ( nei `  J
) `  { x } )  ->  (
n  i^i  S )  =/=  (/) ) )
43adantr 462 . . . . . . . . . 10  |-  ( ( ( ( J  e. 
Top  /\  S  C_  X
)  /\  x  e.  ( ( cls `  J
) `  S )
)  /\  -.  x  e.  S )  ->  (
n  e.  ( ( nei `  J ) `
 { x }
)  ->  ( n  i^i  S )  =/=  (/) ) )
5 difsn 4005 . . . . . . . . . . . . 13  |-  ( -.  x  e.  S  -> 
( S  \  {
x } )  =  S )
65ineq2d 3549 . . . . . . . . . . . 12  |-  ( -.  x  e.  S  -> 
( n  i^i  ( S  \  { x }
) )  =  ( n  i^i  S ) )
76neeq1d 2619 . . . . . . . . . . 11  |-  ( -.  x  e.  S  -> 
( ( n  i^i  ( S  \  {
x } ) )  =/=  (/)  <->  ( n  i^i 
S )  =/=  (/) ) )
87adantl 463 . . . . . . . . . 10  |-  ( ( ( ( J  e. 
Top  /\  S  C_  X
)  /\  x  e.  ( ( cls `  J
) `  S )
)  /\  -.  x  e.  S )  ->  (
( n  i^i  ( S  \  { x }
) )  =/=  (/)  <->  ( n  i^i  S )  =/=  (/) ) )
94, 8sylibrd 234 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  S  C_  X
)  /\  x  e.  ( ( cls `  J
) `  S )
)  /\  -.  x  e.  S )  ->  (
n  e.  ( ( nei `  J ) `
 { x }
)  ->  ( n  i^i  ( S  \  {
x } ) )  =/=  (/) ) )
109ex 434 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( -.  x  e.  S  ->  ( n  e.  ( ( nei `  J ) `
 { x }
)  ->  ( n  i^i  ( S  \  {
x } ) )  =/=  (/) ) ) )
1110ralrimdv 2803 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( -.  x  e.  S  ->  A. n  e.  ( ( nei `  J ) `
 { x }
) ( n  i^i  ( S  \  {
x } ) )  =/=  (/) ) )
12 simpll 748 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  J  e.  Top )
13 simplr 749 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  S  C_  X
)
141clsss3 18622 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  C_  X )
1514sselda 3353 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  x  e.  X )
161islp2 18708 . . . . . . . 8  |-  ( ( J  e.  Top  /\  S  C_  X  /\  x  e.  X )  ->  (
x  e.  ( (
limPt `  J ) `  S )  <->  A. n  e.  ( ( nei `  J
) `  { x } ) ( n  i^i  ( S  \  { x } ) )  =/=  (/) ) )
1712, 13, 15, 16syl3anc 1213 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( x  e.  ( ( limPt `  J
) `  S )  <->  A. n  e.  ( ( nei `  J ) `
 { x }
) ( n  i^i  ( S  \  {
x } ) )  =/=  (/) ) )
1811, 17sylibrd 234 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( -.  x  e.  S  ->  x  e.  ( ( limPt `  J ) `  S
) ) )
1918orrd 378 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( x  e.  S  \/  x  e.  ( ( limPt `  J
) `  S )
) )
20 elun 3494 . . . . 5  |-  ( x  e.  ( S  u.  ( ( limPt `  J
) `  S )
)  <->  ( x  e.  S  \/  x  e.  ( ( limPt `  J
) `  S )
) )
2119, 20sylibr 212 . . . 4  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  x  e.  ( S  u.  (
( limPt `  J ) `  S ) ) )
2221ex 434 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( x  e.  ( ( cls `  J
) `  S )  ->  x  e.  ( S  u.  ( ( limPt `  J ) `  S
) ) ) )
2322ssrdv 3359 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  C_  ( S  u.  (
( limPt `  J ) `  S ) ) )
241sscls 18619 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  C_  ( ( cls `  J ) `  S
) )
251lpsscls 18704 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( limPt `  J
) `  S )  C_  ( ( cls `  J
) `  S )
)
2624, 25unssd 3529 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( S  u.  (
( limPt `  J ) `  S ) )  C_  ( ( cls `  J
) `  S )
)
2723, 26eqssd 3370 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  ( S  u.  ( ( limPt `  J
) `  S )
) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    = wceq 1364    e. wcel 1761    =/= wne 2604   A.wral 2713    \ cdif 3322    u. cun 3323    i^i cin 3324    C_ wss 3325   (/)c0 3634   {csn 3874   U.cuni 4088   ` cfv 5415   Topctop 18457   clsccl 18581   neicnei 18660   limPtclp 18697
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-8 1763  ax-9 1765  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422  ax-rep 4400  ax-sep 4410  ax-nul 4418  ax-pow 4467  ax-pr 4528  ax-un 6371
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-eu 2261  df-mo 2262  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ne 2606  df-ral 2718  df-rex 2719  df-reu 2720  df-rab 2722  df-v 2972  df-sbc 3184  df-csb 3286  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-nul 3635  df-if 3789  df-pw 3859  df-sn 3875  df-pr 3877  df-op 3881  df-uni 4089  df-int 4126  df-iun 4170  df-iin 4171  df-br 4290  df-opab 4348  df-mpt 4349  df-id 4632  df-xp 4842  df-rel 4843  df-cnv 4844  df-co 4845  df-dm 4846  df-rn 4847  df-res 4848  df-ima 4849  df-iota 5378  df-fun 5417  df-fn 5418  df-f 5419  df-f1 5420  df-fo 5421  df-f1o 5422  df-fv 5423  df-top 18462  df-cld 18582  df-ntr 18583  df-cls 18584  df-nei 18661  df-lp 18699
This theorem is referenced by:  islpi  18712  cldlp  18713  perfcls  18928
  Copyright terms: Public domain W3C validator