ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  clsval Unicode version

Theorem clsval 13244
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 13234 . . . 4  |-  ( J  e.  Top  ->  ( cls `  J )  =  ( y  e.  ~P X  |->  |^| { x  e.  ( Clsd `  J
)  |  y  C_  x } ) )
32fveq1d 5512 . . 3  |-  ( J  e.  Top  ->  (
( cls `  J
) `  S )  =  ( ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
) `  S )
)
43adantr 276 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  ( ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
) `  S )
)
5 eqid 2177 . . 3  |-  ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
)  =  ( y  e.  ~P X  |->  |^|
{ x  e.  (
Clsd `  J )  |  y  C_  x }
)
6 sseq1 3178 . . . . 5  |-  ( y  =  S  ->  (
y  C_  x  <->  S  C_  x
) )
76rabbidv 2726 . . . 4  |-  ( y  =  S  ->  { x  e.  ( Clsd `  J
)  |  y  C_  x }  =  {
x  e.  ( Clsd `  J )  |  S  C_  x } )
87inteqd 3847 . . 3  |-  ( y  =  S  ->  |^| { x  e.  ( Clsd `  J
)  |  y  C_  x }  =  |^| { x  e.  ( Clsd `  J )  |  S  C_  x } )
91topopn 13139 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
10 elpw2g 4153 . . . . 5  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
119, 10syl 14 . . . 4  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
1211biimpar 297 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  e.  ~P X
)
131topcld 13242 . . . . 5  |-  ( J  e.  Top  ->  X  e.  ( Clsd `  J
) )
14 sseq2 3179 . . . . . 6  |-  ( x  =  X  ->  ( S  C_  x  <->  S  C_  X
) )
1514rspcev 2841 . . . . 5  |-  ( ( X  e.  ( Clsd `  J )  /\  S  C_  X )  ->  E. x  e.  ( Clsd `  J
) S  C_  x
)
1613, 15sylan 283 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  E. x  e.  ( Clsd `  J ) S 
C_  x )
17 intexrabim 4150 . . . 4  |-  ( E. x  e.  ( Clsd `  J ) S  C_  x  ->  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x }  e.  _V )
1816, 17syl 14 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  |^| { x  e.  (
Clsd `  J )  |  S  C_  x }  e.  _V )
195, 8, 12, 18fvmptd3 5604 . 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 } )
204, 19eqtrd 2210 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( cls `  J
) `  S )  =  |^| { x  e.  ( Clsd `  J
)  |  S  C_  x } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   E.wrex 2456   {crab 2459   _Vcvv 2737    C_ wss 3129   ~Pcpw 3574   U.cuni 3807   |^|cint 3842    |-> cmpt 4061   ` cfv 5211   Topctop 13128   Clsdccld 13225   clsccl 13227
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-pow 4171  ax-pr 4205
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4289  df-xp 4628  df-rel 4629  df-cnv 4630  df-co 4631  df-dm 4632  df-rn 4633  df-res 4634  df-ima 4635  df-iota 5173  df-fun 5213  df-fn 5214  df-f 5215  df-f1 5216  df-fo 5217  df-f1o 5218  df-fv 5219  df-top 13129  df-cld 13228  df-cls 13230
This theorem is referenced by:  cldcls  13247  clsss  13251  sscls  13253
  Copyright terms: Public domain W3C validator