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

Theorem nrmsep3 17373
Description: In a normal space, given a closed set  B inside an open set  A, there is an open set  x such that  B  C_  x  C_  cls ( x )  C_  A. (Contributed by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
nrmsep3  |-  ( ( J  e.  Nrm  /\  ( A  e.  J  /\  B  e.  ( Clsd `  J )  /\  B  C_  A ) )  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) )
Distinct variable groups:    x, A    x, B    x, J

Proof of Theorem nrmsep3
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isnrm 17353 . . . . . 6  |-  ( J  e.  Nrm  <->  ( J  e.  Top  /\  A. y  e.  J  A. z  e.  ( ( Clsd `  J
)  i^i  ~P y
) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J ) `  x
)  C_  y )
) )
21simprbi 451 . . . . 5  |-  ( J  e.  Nrm  ->  A. y  e.  J  A. z  e.  ( ( Clsd `  J
)  i^i  ~P y
) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J ) `  x
)  C_  y )
)
3 pweq 3762 . . . . . . . 8  |-  ( y  =  A  ->  ~P y  =  ~P A
)
43ineq2d 3502 . . . . . . 7  |-  ( y  =  A  ->  (
( Clsd `  J )  i^i  ~P y )  =  ( ( Clsd `  J
)  i^i  ~P A
) )
5 sseq2 3330 . . . . . . . . 9  |-  ( y  =  A  ->  (
( ( cls `  J
) `  x )  C_  y  <->  ( ( cls `  J ) `  x
)  C_  A )
)
65anbi2d 685 . . . . . . . 8  |-  ( y  =  A  ->  (
( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  y )  <->  ( z  C_  x  /\  ( ( cls `  J ) `
 x )  C_  A ) ) )
76rexbidv 2687 . . . . . . 7  |-  ( y  =  A  ->  ( E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  y )  <->  E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J ) `
 x )  C_  A ) ) )
84, 7raleqbidv 2876 . . . . . 6  |-  ( y  =  A  ->  ( A. z  e.  (
( Clsd `  J )  i^i  ~P y ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  y )  <->  A. z  e.  ( ( Clsd `  J
)  i^i  ~P A
) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J ) `  x
)  C_  A )
) )
98rspccv 3009 . . . . 5  |-  ( A. y  e.  J  A. z  e.  ( ( Clsd `  J )  i^i 
~P y ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  y )  ->  ( A  e.  J  ->  A. z  e.  ( (
Clsd `  J )  i^i  ~P A ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) ) )
102, 9syl 16 . . . 4  |-  ( J  e.  Nrm  ->  ( A  e.  J  ->  A. z  e.  ( (
Clsd `  J )  i^i  ~P A ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) ) )
11 elin 3490 . . . . . 6  |-  ( B  e.  ( ( Clsd `  J )  i^i  ~P A )  <->  ( B  e.  ( Clsd `  J
)  /\  B  e.  ~P A ) )
12 elpwg 3766 . . . . . . 7  |-  ( B  e.  ( Clsd `  J
)  ->  ( B  e.  ~P A  <->  B  C_  A
) )
1312pm5.32i 619 . . . . . 6  |-  ( ( B  e.  ( Clsd `  J )  /\  B  e.  ~P A )  <->  ( B  e.  ( Clsd `  J
)  /\  B  C_  A
) )
1411, 13bitri 241 . . . . 5  |-  ( B  e.  ( ( Clsd `  J )  i^i  ~P A )  <->  ( B  e.  ( Clsd `  J
)  /\  B  C_  A
) )
15 sseq1 3329 . . . . . . . 8  |-  ( z  =  B  ->  (
z  C_  x  <->  B  C_  x
) )
1615anbi1d 686 . . . . . . 7  |-  ( z  =  B  ->  (
( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A )  <->  ( B  C_  x  /\  ( ( cls `  J ) `
 x )  C_  A ) ) )
1716rexbidv 2687 . . . . . 6  |-  ( z  =  B  ->  ( E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A )  <->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J ) `
 x )  C_  A ) ) )
1817rspccv 3009 . . . . 5  |-  ( A. z  e.  ( ( Clsd `  J )  i^i 
~P A ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A )  ->  ( B  e.  ( ( Clsd `  J )  i^i 
~P A )  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) ) )
1914, 18syl5bir 210 . . . 4  |-  ( A. z  e.  ( ( Clsd `  J )  i^i 
~P A ) E. x  e.  J  ( z  C_  x  /\  ( ( cls `  J
) `  x )  C_  A )  ->  (
( B  e.  (
Clsd `  J )  /\  B  C_  A )  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) ) )
2010, 19syl6 31 . . 3  |-  ( J  e.  Nrm  ->  ( A  e.  J  ->  ( ( B  e.  (
Clsd `  J )  /\  B  C_  A )  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) ) ) )
2120exp4a 590 . 2  |-  ( J  e.  Nrm  ->  ( A  e.  J  ->  ( B  e.  ( Clsd `  J )  ->  ( B  C_  A  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J ) `
 x )  C_  A ) ) ) ) )
22213imp2 1168 1  |-  ( ( J  e.  Nrm  /\  ( A  e.  J  /\  B  e.  ( Clsd `  J )  /\  B  C_  A ) )  ->  E. x  e.  J  ( B  C_  x  /\  ( ( cls `  J
) `  x )  C_  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721   A.wral 2666   E.wrex 2667    i^i cin 3279    C_ wss 3280   ~Pcpw 3759   ` cfv 5413   Topctop 16913   Clsdccld 17035   clsccl 17037   Nrmcnrm 17328
This theorem is referenced by:  nrmsep2  17374  kqnrmlem1  17728  kqnrmlem2  17729  nrmr0reg  17734  nrmhmph  17779
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-br 4173  df-iota 5377  df-fv 5421  df-nrm 17335
  Copyright terms: Public domain W3C validator