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

Theorem clsval 18766
Description: The closure of a subset of a topology's base set is the intersection of all the closed sets that include it. Definition of closure of [Munkres] p. 94. (Contributed by NM, 10-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
iscld.1  |-  X  = 
U. J
Assertion
Ref Expression
clsval  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x } )
Distinct variable groups:    x, J    x, S    x, X

Proof of Theorem clsval
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 iscld.1 . . . . 5  |-  X  = 
U. J
21clsfval 18754 . . . 4  |-  ( J  e.  Top  ->  ( cls `  J )  =  ( y  e.  ~P X  |->  |^| { x  e.  ( Clsd `  J
)  |  y  C_  x } ) )
32fveq1d 5794 . . 3  |-  ( J  e.  Top  ->  (
( cls `  J
) `  S )  =  ( ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
) `  S )
)
43adantr 465 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  ( ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
) `  S )
)
51topopn 18644 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
6 elpw2g 4556 . . . . 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
)
91topcld 18764 . . . . 5  |-  ( J  e.  Top  ->  X  e.  ( Clsd `  J
) )
10 sseq2 3479 . . . . . 6  |-  ( x  =  X  ->  ( S  C_  x  <->  S  C_  X
) )
1110rspcev 3172 . . . . 5  |-  ( ( X  e.  ( Clsd `  J )  /\  S  C_  X )  ->  E. x  e.  ( Clsd `  J
) S  C_  x
)
129, 11sylan 471 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  E. x  e.  ( Clsd `  J ) S 
C_  x )
13 intexrab 4552 . . . 4  |-  ( E. x  e.  ( Clsd `  J ) S  C_  x 
<-> 
|^| { x  e.  (
Clsd `  J )  |  S  C_  x }  e.  _V )
1412, 13sylib 196 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  |^| { x  e.  (
Clsd `  J )  |  S  C_  x }  e.  _V )
15 sseq1 3478 . . . . . 6  |-  ( y  =  S  ->  (
y  C_  x  <->  S  C_  x
) )
1615rabbidv 3063 . . . . 5  |-  ( y  =  S  ->  { x  e.  ( Clsd `  J
)  |  y  C_  x }  =  {
x  e.  ( Clsd `  J )  |  S  C_  x } )
1716inteqd 4234 . . . 4  |-  ( y  =  S  ->  |^| { x  e.  ( Clsd `  J
)  |  y  C_  x }  =  |^| { x  e.  ( Clsd `  J )  |  S  C_  x } )
18 eqid 2451 . . . 4  |-  ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
)  =  ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
)
1917, 18fvmptg 5874 . . 3  |-  ( ( S  e.  ~P X  /\  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x }  e.  _V )  ->  ( ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
) `  S )  =  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x } )
208, 14, 19syl2anc 661 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( y  e. 
~P X  |->  |^| { x  e.  ( Clsd `  J
)  |  y  C_  x } ) `  S
)  =  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x } )
214, 20eqtrd 2492 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1370    e. wcel 1758   E.wrex 2796   {crab 2799   _Vcvv 3071    C_ wss 3429   ~Pcpw 3961   U.cuni 4192   |^|cint 4229    |-> cmpt 4451   ` cfv 5519   Topctop 18623   Clsdccld 18745   clsccl 18747
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 1952  ax-ext 2430  ax-rep 4504  ax-sep 4514  ax-nul 4522  ax-pow 4571  ax-pr 4632
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 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-ral 2800  df-rex 2801  df-reu 2802  df-rab 2804  df-v 3073  df-sbc 3288  df-csb 3390  df-dif 3432  df-un 3434  df-in 3436  df-ss 3443  df-nul 3739  df-if 3893  df-pw 3963  df-sn 3979  df-pr 3981  df-op 3985  df-uni 4193  df-int 4230  df-iun 4274  df-br 4394  df-opab 4452  df-mpt 4453  df-id 4737  df-xp 4947  df-rel 4948  df-cnv 4949  df-co 4950  df-dm 4951  df-rn 4952  df-res 4953  df-ima 4954  df-iota 5482  df-fun 5521  df-fn 5522  df-f 5523  df-f1 5524  df-fo 5525  df-f1o 5526  df-fv 5527  df-top 18628  df-cld 18748  df-cls 18750
This theorem is referenced by:  cldcls  18771  clscld  18776  clsf  18777  clsval2  18779  clsss  18783  sscls  18785
  Copyright terms: Public domain W3C validator