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

Theorem isacs 13569
Description: A set is an algebraic closure system iff it is specified by some function of the finite subsets, such that a set is closed iff it does not expand under the operation. (Contributed by Stefan O'Rear, 2-Apr-2015.)
Assertion
Ref Expression
isacs  |-  ( C  e.  (ACS `  X
)  <->  ( C  e.  (Moore `  X )  /\  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) )
Distinct variable groups:    C, f,
s    f, X, s

Proof of Theorem isacs
Dummy variables  c  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 5571 . 2  |-  ( C  e.  (ACS `  X
)  ->  X  e.  _V )
2 elfvex 5571 . . 3  |-  ( C  e.  (Moore `  X
)  ->  X  e.  _V )
32adantr 451 . 2  |-  ( ( C  e.  (Moore `  X )  /\  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) )  ->  X  e.  _V )
4 fveq2 5541 . . . . . 6  |-  ( x  =  X  ->  (Moore `  x )  =  (Moore `  X ) )
5 pweq 3641 . . . . . . . . 9  |-  ( x  =  X  ->  ~P x  =  ~P X
)
65, 5feq23d 5402 . . . . . . . 8  |-  ( x  =  X  ->  (
f : ~P x --> ~P x  <->  f : ~P X
--> ~P X ) )
75raleqdv 2755 . . . . . . . 8  |-  ( x  =  X  ->  ( A. s  e.  ~P  x ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s )  <->  A. s  e.  ~P  X ( s  e.  c  <->  U. (
f " ( ~P s  i^i  Fin )
)  C_  s )
) )
86, 7anbi12d 691 . . . . . . 7  |-  ( x  =  X  ->  (
( f : ~P x
--> ~P x  /\  A. s  e.  ~P  x
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
)  <->  ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) )
98exbidv 1616 . . . . . 6  |-  ( x  =  X  ->  ( E. f ( f : ~P x --> ~P x  /\  A. s  e.  ~P  x ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) )  <->  E. f
( f : ~P X
--> ~P X  /\  A. s  e.  ~P  X
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
) ) )
104, 9rabeqbidv 2796 . . . . 5  |-  ( x  =  X  ->  { c  e.  (Moore `  x
)  |  E. f
( f : ~P x
--> ~P x  /\  A. s  e.  ~P  x
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
) }  =  {
c  e.  (Moore `  X )  |  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) } )
11 df-acs 13507 . . . . 5  |- ACS  =  ( x  e.  _V  |->  { c  e.  (Moore `  x )  |  E. f ( f : ~P x --> ~P x  /\  A. s  e.  ~P  x ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) } )
12 fvex 5555 . . . . . 6  |-  (Moore `  X )  e.  _V
1312rabex 4181 . . . . 5  |-  { c  e.  (Moore `  X
)  |  E. f
( f : ~P X
--> ~P X  /\  A. s  e.  ~P  X
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
) }  e.  _V
1410, 11, 13fvmpt 5618 . . . 4  |-  ( X  e.  _V  ->  (ACS `  X )  =  {
c  e.  (Moore `  X )  |  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) } )
1514eleq2d 2363 . . 3  |-  ( X  e.  _V  ->  ( C  e.  (ACS `  X
)  <->  C  e.  { c  e.  (Moore `  X
)  |  E. f
( f : ~P X
--> ~P X  /\  A. s  e.  ~P  X
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
) } ) )
16 eleq2 2357 . . . . . . . 8  |-  ( c  =  C  ->  (
s  e.  c  <->  s  e.  C ) )
1716bibi1d 310 . . . . . . 7  |-  ( c  =  C  ->  (
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )  <->  ( s  e.  C  <->  U. (
f " ( ~P s  i^i  Fin )
)  C_  s )
) )
1817ralbidv 2576 . . . . . 6  |-  ( c  =  C  ->  ( A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s )  <->  A. s  e.  ~P  X ( s  e.  C  <->  U. (
f " ( ~P s  i^i  Fin )
)  C_  s )
) )
1918anbi2d 684 . . . . 5  |-  ( c  =  C  ->  (
( f : ~P X
--> ~P X  /\  A. s  e.  ~P  X
( s  e.  c  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
)  <->  ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) )
2019exbidv 1616 . . . 4  |-  ( c  =  C  ->  ( E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) )  <->  E. f
( f : ~P X
--> ~P X  /\  A. s  e.  ~P  X
( s  e.  C  <->  U. ( f " ( ~P s  i^i  Fin )
)  C_  s )
) ) )
2120elrab 2936 . . 3  |-  ( C  e.  { c  e.  (Moore `  X )  |  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  c  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) }  <-> 
( C  e.  (Moore `  X )  /\  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) )
2215, 21syl6bb 252 . 2  |-  ( X  e.  _V  ->  ( C  e.  (ACS `  X
)  <->  ( C  e.  (Moore `  X )  /\  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) ) )
231, 3, 22pm5.21nii 342 1  |-  ( C  e.  (ACS `  X
)  <->  ( C  e.  (Moore `  X )  /\  E. f ( f : ~P X --> ~P X  /\  A. s  e.  ~P  X ( s  e.  C  <->  U. ( f "
( ~P s  i^i 
Fin ) )  C_  s ) ) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358   E.wex 1531    = wceq 1632    e. wcel 1696   A.wral 2556   {crab 2560   _Vcvv 2801    i^i cin 3164    C_ wss 3165   ~Pcpw 3638   U.cuni 3843   "cima 4708   -->wf 5267   ` cfv 5271   Fincfn 6879  Moorecmre 13500  ACScacs 13503
This theorem is referenced by:  acsmre  13570  isacs2  13571  isacs1i  13575  mreacs  13576
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-acs 13507
  Copyright terms: Public domain W3C validator