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

Theorem neindisj2 20927
Description: A point  P belongs to the closure of a set  S iff every neighborhood of  P meets  S. (Contributed by FL, 15-Sep-2013.)
Hypothesis
Ref Expression
tpnei.1  |-  X  = 
U. J
Assertion
Ref Expression
neindisj2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( cls `  J ) `  S )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) ) )
Distinct variable groups:    n, J    P, n    S, n    n, X

Proof of Theorem neindisj2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 tpnei.1 . . 3  |-  X  = 
U. J
21elcls 20877 . 2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( cls `  J ) `  S )  <->  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) )
31isneip 20909 . . . . . . . 8  |-  ( ( J  e.  Top  /\  P  e.  X )  ->  ( n  e.  ( ( nei `  J
) `  { P } )  <->  ( n  C_  X  /\  E. x  e.  J  ( P  e.  x  /\  x  C_  n ) ) ) )
4 r19.29r 3073 . . . . . . . . . . 11  |-  ( ( E. x  e.  J  ( P  e.  x  /\  x  C_  n )  /\  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) )  ->  E. x  e.  J  ( ( P  e.  x  /\  x  C_  n )  /\  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) )
5 pm3.35 611 . . . . . . . . . . . . . . . 16  |-  ( ( P  e.  x  /\  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) ) )  ->  ( x  i^i 
S )  =/=  (/) )
6 ssrin 3838 . . . . . . . . . . . . . . . . . 18  |-  ( x 
C_  n  ->  (
x  i^i  S )  C_  ( n  i^i  S
) )
7 sseq2 3627 . . . . . . . . . . . . . . . . . . 19  |-  ( ( n  i^i  S )  =  (/)  ->  ( ( x  i^i  S ) 
C_  ( n  i^i 
S )  <->  ( x  i^i  S )  C_  (/) ) )
8 ss0 3974 . . . . . . . . . . . . . . . . . . 19  |-  ( ( x  i^i  S ) 
C_  (/)  ->  ( x  i^i  S )  =  (/) )
97, 8syl6bi 243 . . . . . . . . . . . . . . . . . 18  |-  ( ( n  i^i  S )  =  (/)  ->  ( ( x  i^i  S ) 
C_  ( n  i^i 
S )  ->  (
x  i^i  S )  =  (/) ) )
106, 9syl5com 31 . . . . . . . . . . . . . . . . 17  |-  ( x 
C_  n  ->  (
( n  i^i  S
)  =  (/)  ->  (
x  i^i  S )  =  (/) ) )
1110necon3d 2815 . . . . . . . . . . . . . . . 16  |-  ( x 
C_  n  ->  (
( x  i^i  S
)  =/=  (/)  ->  (
n  i^i  S )  =/=  (/) ) )
125, 11syl5com 31 . . . . . . . . . . . . . . 15  |-  ( ( P  e.  x  /\  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) ) )  ->  ( x  C_  n  ->  ( n  i^i 
S )  =/=  (/) ) )
1312ex 450 . . . . . . . . . . . . . 14  |-  ( P  e.  x  ->  (
( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) )  -> 
( x  C_  n  ->  ( n  i^i  S
)  =/=  (/) ) ) )
1413com23 86 . . . . . . . . . . . . 13  |-  ( P  e.  x  ->  (
x  C_  n  ->  ( ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) )  -> 
( n  i^i  S
)  =/=  (/) ) ) )
1514imp31 448 . . . . . . . . . . . 12  |-  ( ( ( P  e.  x  /\  x  C_  n )  /\  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) )  ->  ( n  i^i 
S )  =/=  (/) )
1615rexlimivw 3029 . . . . . . . . . . 11  |-  ( E. x  e.  J  ( ( P  e.  x  /\  x  C_  n )  /\  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) )  ->  ( n  i^i 
S )  =/=  (/) )
174, 16syl 17 . . . . . . . . . 10  |-  ( ( E. x  e.  J  ( P  e.  x  /\  x  C_  n )  /\  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) )  ->  ( n  i^i 
S )  =/=  (/) )
1817ex 450 . . . . . . . . 9  |-  ( E. x  e.  J  ( P  e.  x  /\  x  C_  n )  -> 
( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) )  -> 
( n  i^i  S
)  =/=  (/) ) )
1918adantl 482 . . . . . . . 8  |-  ( ( n  C_  X  /\  E. x  e.  J  ( P  e.  x  /\  x  C_  n ) )  ->  ( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) )  ->  ( n  i^i  S )  =/=  (/) ) )
203, 19syl6bi 243 . . . . . . 7  |-  ( ( J  e.  Top  /\  P  e.  X )  ->  ( n  e.  ( ( nei `  J
) `  { P } )  ->  ( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) )  -> 
( n  i^i  S
)  =/=  (/) ) ) )
21203adant2 1080 . . . . . 6  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  (
n  e.  ( ( nei `  J ) `
 { P }
)  ->  ( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) )  ->  (
n  i^i  S )  =/=  (/) ) ) )
2221com23 86 . . . . 5  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) )  -> 
( n  e.  ( ( nei `  J
) `  { P } )  ->  (
n  i^i  S )  =/=  (/) ) ) )
2322imp 445 . . . 4  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  /\  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) ) )  ->  ( n  e.  ( ( nei `  J
) `  { P } )  ->  (
n  i^i  S )  =/=  (/) ) )
2423ralrimiv 2965 . . 3  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  /\  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) ) )  ->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) )
25 opnneip 20923 . . . . . . . . . 10  |-  ( ( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  x  e.  ( ( nei `  J ) `
 { P }
) )
26 ineq1 3807 . . . . . . . . . . . . . . 15  |-  ( n  =  x  ->  (
n  i^i  S )  =  ( x  i^i 
S ) )
2726neeq1d 2853 . . . . . . . . . . . . . 14  |-  ( n  =  x  ->  (
( n  i^i  S
)  =/=  (/)  <->  ( x  i^i  S )  =/=  (/) ) )
2827rspccva 3308 . . . . . . . . . . . . 13  |-  ( ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  /\  x  e.  ( ( nei `  J
) `  { P } ) )  -> 
( x  i^i  S
)  =/=  (/) )
29 idd 24 . . . . . . . . . . . . . . 15  |-  ( ( P  e.  X  /\  ( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  /\  S  C_  X )  ->  ( ( x  i^i  S )  =/=  (/)  ->  ( x  i^i 
S )  =/=  (/) ) )
30293exp 1264 . . . . . . . . . . . . . 14  |-  ( P  e.  X  ->  (
( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  ( S  C_  X  ->  ( ( x  i^i 
S )  =/=  (/)  ->  (
x  i^i  S )  =/=  (/) ) ) ) )
3130com14 96 . . . . . . . . . . . . 13  |-  ( ( x  i^i  S )  =/=  (/)  ->  ( ( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S )  =/=  (/) ) ) ) )
3228, 31syl 17 . . . . . . . . . . . 12  |-  ( ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  /\  x  e.  ( ( nei `  J
) `  { P } ) )  -> 
( ( J  e. 
Top  /\  x  e.  J  /\  P  e.  x
)  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S )  =/=  (/) ) ) ) )
3332ex 450 . . . . . . . . . . 11  |-  ( A. n  e.  ( ( nei `  J ) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( x  e.  ( ( nei `  J
) `  { P } )  ->  (
( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S
)  =/=  (/) ) ) ) ) )
3433com3l 89 . . . . . . . . . 10  |-  ( x  e.  ( ( nei `  J ) `  { P } )  ->  (
( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S )  =/=  (/) ) ) ) ) )
3525, 34mpcom 38 . . . . . . . . 9  |-  ( ( J  e.  Top  /\  x  e.  J  /\  P  e.  x )  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S )  =/=  (/) ) ) ) )
36353expia 1267 . . . . . . . 8  |-  ( ( J  e.  Top  /\  x  e.  J )  ->  ( P  e.  x  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( x  i^i  S )  =/=  (/) ) ) ) ) )
3736com25 99 . . . . . . 7  |-  ( ( J  e.  Top  /\  x  e.  J )  ->  ( P  e.  X  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( S  C_  X  ->  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) ) ) )
3837ex 450 . . . . . 6  |-  ( J  e.  Top  ->  (
x  e.  J  -> 
( P  e.  X  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( S  C_  X  ->  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) ) ) ) )
3938com25 99 . . . . 5  |-  ( J  e.  Top  ->  ( S  C_  X  ->  ( P  e.  X  ->  ( A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/)  ->  ( x  e.  J  ->  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) ) ) ) )
40393imp1 1280 . . . 4  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  /\  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) )  ->  ( x  e.  J  ->  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) ) )
4140ralrimiv 2965 . . 3  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  /\  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) )  ->  A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S )  =/=  (/) ) )
4224, 41impbida 877 . 2  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( A. x  e.  J  ( P  e.  x  ->  ( x  i^i  S
)  =/=  (/) )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) ) )
432, 42bitrd 268 1  |-  ( ( J  e.  Top  /\  S  C_  X  /\  P  e.  X )  ->  ( P  e.  ( ( cls `  J ) `  S )  <->  A. n  e.  ( ( nei `  J
) `  { P } ) ( n  i^i  S )  =/=  (/) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990    =/= wne 2794   A.wral 2912   E.wrex 2913    i^i cin 3573    C_ wss 3574   (/)c0 3915   {csn 4177   U.cuni 4436   ` cfv 5888   Topctop 20698   clsccl 20822   neicnei 20901
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-top 20699  df-cld 20823  df-ntr 20824  df-cls 20825  df-nei 20902
This theorem is referenced by:  islp2  20949  trnei  21696  flimclsi  21782
  Copyright terms: Public domain W3C validator