Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cldregopn Unicode version

Theorem cldregopn 26249
Description: A set if regularly open iff it is the interior of some closed set. (Contributed by Jeff Hankins, 27-Sep-2009.)
Hypothesis
Ref Expression
opnregcld.1  |-  X  = 
U. J
Assertion
Ref Expression
cldregopn  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( ( int `  J ) `  (
( cls `  J
) `  A )
)  =  A  <->  E. c  e.  ( Clsd `  J
) A  =  ( ( int `  J
) `  c )
) )
Distinct variable groups:    A, c    J, c    X, c

Proof of Theorem cldregopn
StepHypRef Expression
1 opnregcld.1 . . . . 5  |-  X  = 
U. J
21clscld 16784 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( cls `  J
) `  A )  e.  ( Clsd `  J
) )
3 eqcom 2285 . . . . 5  |-  ( ( ( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A  <->  A  =  (
( int `  J
) `  ( ( cls `  J ) `  A ) ) )
43biimpi 186 . . . 4  |-  ( ( ( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A  ->  A  =  ( ( int `  J
) `  ( ( cls `  J ) `  A ) ) )
5 fveq2 5525 . . . . . 6  |-  ( c  =  ( ( cls `  J ) `  A
)  ->  ( ( int `  J ) `  c )  =  ( ( int `  J
) `  ( ( cls `  J ) `  A ) ) )
65eqeq2d 2294 . . . . 5  |-  ( c  =  ( ( cls `  J ) `  A
)  ->  ( A  =  ( ( int `  J ) `  c
)  <->  A  =  (
( int `  J
) `  ( ( cls `  J ) `  A ) ) ) )
76rspcev 2884 . . . 4  |-  ( ( ( ( cls `  J
) `  A )  e.  ( Clsd `  J
)  /\  A  =  ( ( int `  J
) `  ( ( cls `  J ) `  A ) ) )  ->  E. c  e.  (
Clsd `  J ) A  =  ( ( int `  J ) `  c ) )
82, 4, 7syl2an 463 . . 3  |-  ( ( ( J  e.  Top  /\  A  C_  X )  /\  ( ( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A )  ->  E. c  e.  ( Clsd `  J
) A  =  ( ( int `  J
) `  c )
)
98ex 423 . 2  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( ( int `  J ) `  (
( cls `  J
) `  A )
)  =  A  ->  E. c  e.  ( Clsd `  J ) A  =  ( ( int `  J ) `  c
) ) )
10 cldrcl 16763 . . . . . . 7  |-  ( c  e.  ( Clsd `  J
)  ->  J  e.  Top )
111cldss 16766 . . . . . . 7  |-  ( c  e.  ( Clsd `  J
)  ->  c  C_  X )
121ntrss2 16794 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  c  C_  X )  -> 
( ( int `  J
) `  c )  C_  c )
1310, 11, 12syl2anc 642 . . . . . . . 8  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  c )  C_  c
)
141clsss2 16809 . . . . . . . 8  |-  ( ( c  e.  ( Clsd `  J )  /\  (
( int `  J
) `  c )  C_  c )  ->  (
( cls `  J
) `  ( ( int `  J ) `  c ) )  C_  c )
1513, 14mpdan 649 . . . . . . 7  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( cls `  J ) `  ( ( int `  J
) `  c )
)  C_  c )
161ntrss 16792 . . . . . . 7  |-  ( ( J  e.  Top  /\  c  C_  X  /\  (
( cls `  J
) `  ( ( int `  J ) `  c ) )  C_  c )  ->  (
( int `  J
) `  ( ( cls `  J ) `  ( ( int `  J
) `  c )
) )  C_  (
( int `  J
) `  c )
)
1710, 11, 15, 16syl3anc 1182 . . . . . 6  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  ( ( cls `  J
) `  ( ( int `  J ) `  c ) ) ) 
C_  ( ( int `  J ) `  c
) )
181ntridm 16805 . . . . . . . 8  |-  ( ( J  e.  Top  /\  c  C_  X )  -> 
( ( int `  J
) `  ( ( int `  J ) `  c ) )  =  ( ( int `  J
) `  c )
)
1910, 11, 18syl2anc 642 . . . . . . 7  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  ( ( int `  J
) `  c )
)  =  ( ( int `  J ) `
 c ) )
201ntrss3 16797 . . . . . . . . . 10  |-  ( ( J  e.  Top  /\  c  C_  X )  -> 
( ( int `  J
) `  c )  C_  X )
2110, 11, 20syl2anc 642 . . . . . . . . 9  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  c )  C_  X
)
221clsss3 16796 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  ( ( int `  J
) `  c )  C_  X )  ->  (
( cls `  J
) `  ( ( int `  J ) `  c ) )  C_  X )
2310, 21, 22syl2anc 642 . . . . . . . 8  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( cls `  J ) `  ( ( int `  J
) `  c )
)  C_  X )
241sscls 16793 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  ( ( int `  J
) `  c )  C_  X )  ->  (
( int `  J
) `  c )  C_  ( ( cls `  J
) `  ( ( int `  J ) `  c ) ) )
2510, 21, 24syl2anc 642 . . . . . . . 8  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  c )  C_  (
( cls `  J
) `  ( ( int `  J ) `  c ) ) )
261ntrss 16792 . . . . . . . 8  |-  ( ( J  e.  Top  /\  ( ( cls `  J
) `  ( ( int `  J ) `  c ) )  C_  X  /\  ( ( int `  J ) `  c
)  C_  ( ( cls `  J ) `  ( ( int `  J
) `  c )
) )  ->  (
( int `  J
) `  ( ( int `  J ) `  c ) )  C_  ( ( int `  J
) `  ( ( cls `  J ) `  ( ( int `  J
) `  c )
) ) )
2710, 23, 25, 26syl3anc 1182 . . . . . . 7  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  ( ( int `  J
) `  c )
)  C_  ( ( int `  J ) `  ( ( cls `  J
) `  ( ( int `  J ) `  c ) ) ) )
2819, 27eqsstr3d 3213 . . . . . 6  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  c )  C_  (
( int `  J
) `  ( ( cls `  J ) `  ( ( int `  J
) `  c )
) ) )
2917, 28eqssd 3196 . . . . 5  |-  ( c  e.  ( Clsd `  J
)  ->  ( ( int `  J ) `  ( ( cls `  J
) `  ( ( int `  J ) `  c ) ) )  =  ( ( int `  J ) `  c
) )
3029adantl 452 . . . 4  |-  ( ( ( J  e.  Top  /\  A  C_  X )  /\  c  e.  ( Clsd `  J ) )  ->  ( ( int `  J ) `  (
( cls `  J
) `  ( ( int `  J ) `  c ) ) )  =  ( ( int `  J ) `  c
) )
31 fveq2 5525 . . . . . 6  |-  ( A  =  ( ( int `  J ) `  c
)  ->  ( ( cls `  J ) `  A )  =  ( ( cls `  J
) `  ( ( int `  J ) `  c ) ) )
3231fveq2d 5529 . . . . 5  |-  ( A  =  ( ( int `  J ) `  c
)  ->  ( ( int `  J ) `  ( ( cls `  J
) `  A )
)  =  ( ( int `  J ) `
 ( ( cls `  J ) `  (
( int `  J
) `  c )
) ) )
33 id 19 . . . . 5  |-  ( A  =  ( ( int `  J ) `  c
)  ->  A  =  ( ( int `  J
) `  c )
)
3432, 33eqeq12d 2297 . . . 4  |-  ( A  =  ( ( int `  J ) `  c
)  ->  ( (
( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A  <->  ( ( int `  J ) `  (
( cls `  J
) `  ( ( int `  J ) `  c ) ) )  =  ( ( int `  J ) `  c
) ) )
3530, 34syl5ibrcom 213 . . 3  |-  ( ( ( J  e.  Top  /\  A  C_  X )  /\  c  e.  ( Clsd `  J ) )  ->  ( A  =  ( ( int `  J
) `  c )  ->  ( ( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A ) )
3635rexlimdva 2667 . 2  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( E. c  e.  ( Clsd `  J
) A  =  ( ( int `  J
) `  c )  ->  ( ( int `  J
) `  ( ( cls `  J ) `  A ) )  =  A ) )
379, 36impbid 183 1  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( ( int `  J ) `  (
( cls `  J
) `  A )
)  =  A  <->  E. c  e.  ( Clsd `  J
) A  =  ( ( int `  J
) `  c )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   E.wrex 2544    C_ wss 3152   U.cuni 3827   ` cfv 5255   Topctop 16631   Clsdccld 16753   intcnt 16754   clsccl 16755
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-int 3863  df-iun 3907  df-iin 3908  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-top 16636  df-cld 16756  df-ntr 16757  df-cls 16758
  Copyright terms: Public domain W3C validator