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

Theorem clslp 19776
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 19745 . . . . . . . . . . . 12  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  ( x  e.  ( ( cls `  J
) `  S )  /\  n  e.  (
( nei `  J
) `  { x } ) ) )  ->  ( n  i^i 
S )  =/=  (/) )
32expr 615 . . . . . . . . . . 11  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  ( n  e.  ( ( nei `  J
) `  { x } )  ->  (
n  i^i  S )  =/=  (/) ) )
43adantr 465 . . . . . . . . . 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 4166 . . . . . . . . . . . . 13  |-  ( -.  x  e.  S  -> 
( S  \  {
x } )  =  S )
65ineq2d 3696 . . . . . . . . . . . 12  |-  ( -.  x  e.  S  -> 
( n  i^i  ( S  \  { x }
) )  =  ( n  i^i  S ) )
76neeq1d 2734 . . . . . . . . . . 11  |-  ( -.  x  e.  S  -> 
( ( n  i^i  ( S  \  {
x } ) )  =/=  (/)  <->  ( n  i^i 
S )  =/=  (/) ) )
87adantl 466 . . . . . . . . . 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 2873 . . . . . . 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 753 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  J  e.  Top )
13 simplr 755 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  S  C_  X
)
141clsss3 19687 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  C_  X )
1514sselda 3499 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  x  e.  (
( cls `  J
) `  S )
)  ->  x  e.  X )
161islp2 19773 . . . . . . . 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 1228 . . . . . . 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 3641 . . . . 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 3505 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  C_  ( S  u.  (
( limPt `  J ) `  S ) ) )
241sscls 19684 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  C_  ( ( cls `  J ) `  S
) )
251lpsscls 19769 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( limPt `  J
) `  S )  C_  ( ( cls `  J
) `  S )
)
2624, 25unssd 3676 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( S  u.  (
( limPt `  J ) `  S ) )  C_  ( ( cls `  J
) `  S )
)
2723, 26eqssd 3516 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 1395    e. wcel 1819    =/= wne 2652   A.wral 2807    \ cdif 3468    u. cun 3469    i^i cin 3470    C_ wss 3471   (/)c0 3793   {csn 4032   U.cuni 4251   ` cfv 5594   Topctop 19521   clsccl 19646   neicnei 19725   limPtclp 19762
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-reu 2814  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-int 4289  df-iun 4334  df-iin 4335  df-br 4457  df-opab 4516  df-mpt 4517  df-id 4804  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-top 19526  df-cld 19647  df-ntr 19648  df-cls 19649  df-nei 19726  df-lp 19764
This theorem is referenced by:  islpi  19777  cldlp  19778  perfcls  19993
  Copyright terms: Public domain W3C validator