Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  clsneinex Structured version   Visualization version   Unicode version

Theorem clsneinex 38405
Description: If closure and neighborhoods functions are related, the neighborhoods function exists. (Contributed by RP, 27-Jun-2021.)
Hypotheses
Ref Expression
clsnei.o  |-  O  =  ( i  e.  _V ,  j  e.  _V  |->  ( k  e.  ( ~P j  ^m  i
)  |->  ( l  e.  j  |->  { m  e.  i  |  l  e.  ( k `  m
) } ) ) )
clsnei.p  |-  P  =  ( n  e.  _V  |->  ( p  e.  ( ~P n  ^m  ~P n
)  |->  ( o  e. 
~P n  |->  ( n 
\  ( p `  ( n  \  o
) ) ) ) ) )
clsnei.d  |-  D  =  ( P `  B
)
clsnei.f  |-  F  =  ( ~P B O B )
clsnei.h  |-  H  =  ( F  o.  D
)
clsnei.r  |-  ( ph  ->  K H N )
Assertion
Ref Expression
clsneinex  |-  ( ph  ->  N  e.  ( ~P ~P B  ^m  B
) )
Distinct variable groups:    B, i,
j, k, l, m    B, n, o, p    ph, i,
j, k, l    ph, n, o, p
Allowed substitution hints:    ph( m)    D( i, j, k, m, n, o, p, l)    P( i, j, k, m, n, o, p, l)    F( i, j, k, m, n, o, p, l)    H( i, j, k, m, n, o, p, l)    K( i, j, k, m, n, o, p, l)    N( i, j, k, m, n, o, p, l)    O( i, j, k, m, n, o, p, l)

Proof of Theorem clsneinex
StepHypRef Expression
1 clsnei.o . 2  |-  O  =  ( i  e.  _V ,  j  e.  _V  |->  ( k  e.  ( ~P j  ^m  i
)  |->  ( l  e.  j  |->  { m  e.  i  |  l  e.  ( k `  m
) } ) ) )
2 clsnei.f . 2  |-  F  =  ( ~P B O B )
3 clsnei.d . . . . 5  |-  D  =  ( P `  B
)
4 clsnei.h . . . . 5  |-  H  =  ( F  o.  D
)
5 clsnei.r . . . . 5  |-  ( ph  ->  K H N )
63, 4, 5clsneibex 38400 . . . 4  |-  ( ph  ->  B  e.  _V )
7 pwexg 4850 . . . . . . . 8  |-  ( B  e.  _V  ->  ~P B  e.  _V )
87adantl 482 . . . . . . 7  |-  ( (
ph  /\  B  e.  _V )  ->  ~P B  e.  _V )
9 simpr 477 . . . . . . 7  |-  ( (
ph  /\  B  e.  _V )  ->  B  e. 
_V )
101, 8, 9, 2fsovf1od 38310 . . . . . 6  |-  ( (
ph  /\  B  e.  _V )  ->  F :
( ~P B  ^m  ~P B ) -1-1-onto-> ( ~P ~P B  ^m  B ) )
11 f1ofn 6138 . . . . . 6  |-  ( F : ( ~P B  ^m  ~P B ) -1-1-onto-> ( ~P ~P B  ^m  B
)  ->  F  Fn  ( ~P B  ^m  ~P B ) )
1210, 11syl 17 . . . . 5  |-  ( (
ph  /\  B  e.  _V )  ->  F  Fn  ( ~P B  ^m  ~P B ) )
13 clsnei.p . . . . . . 7  |-  P  =  ( n  e.  _V  |->  ( p  e.  ( ~P n  ^m  ~P n
)  |->  ( o  e. 
~P n  |->  ( n 
\  ( p `  ( n  \  o
) ) ) ) ) )
1413, 3, 9dssmapf1od 38315 . . . . . 6  |-  ( (
ph  /\  B  e.  _V )  ->  D :
( ~P B  ^m  ~P B ) -1-1-onto-> ( ~P B  ^m  ~P B ) )
15 f1of 6137 . . . . . 6  |-  ( D : ( ~P B  ^m  ~P B ) -1-1-onto-> ( ~P B  ^m  ~P B
)  ->  D :
( ~P B  ^m  ~P B ) --> ( ~P B  ^m  ~P B
) )
1614, 15syl 17 . . . . 5  |-  ( (
ph  /\  B  e.  _V )  ->  D :
( ~P B  ^m  ~P B ) --> ( ~P B  ^m  ~P B
) )
175adantr 481 . . . . . 6  |-  ( (
ph  /\  B  e.  _V )  ->  K H N )
184breqi 4659 . . . . . 6  |-  ( K H N  <->  K ( F  o.  D ) N )
1917, 18sylib 208 . . . . 5  |-  ( (
ph  /\  B  e.  _V )  ->  K ( F  o.  D ) N )
2012, 16, 19brcoffn 38328 . . . 4  |-  ( (
ph  /\  B  e.  _V )  ->  ( K D ( D `  K )  /\  ( D `  K ) F N ) )
216, 20mpdan 702 . . 3  |-  ( ph  ->  ( K D ( D `  K )  /\  ( D `  K ) F N ) )
2221simprd 479 . 2  |-  ( ph  ->  ( D `  K
) F N )
231, 2, 22ntrneinex 38375 1  |-  ( ph  ->  N  e.  ( ~P ~P B  ^m  B
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   {crab 2916   _Vcvv 3200    \ cdif 3571   ~Pcpw 4158   class class class wbr 4653    |-> cmpt 4729    o. ccom 5118    Fn wfn 5883   -->wf 5884   -1-1-onto->wf1o 5887   ` cfv 5888  (class class class)co 6650    |-> cmpt2 6652    ^m cmap 7857
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-iun 4522  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-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-map 7859
This theorem is referenced by:  clsneifv3  38408
  Copyright terms: Public domain W3C validator