ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  axpweq Unicode version

Theorem axpweq 3945
Description: Two equivalent ways to express the Power Set Axiom. Note that ax-pow 3948 is not used by the proof. (Contributed by NM, 22-Jun-2009.)
Hypothesis
Ref Expression
axpweq.1  |-  A  e. 
_V
Assertion
Ref Expression
axpweq  |-  ( ~P A  e.  _V  <->  E. x A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
Distinct variable group:    x, y, z, A

Proof of Theorem axpweq
StepHypRef Expression
1 pwidg 3395 . . . 4  |-  ( ~P A  e.  _V  ->  ~P A  e.  ~P ~P A )
2 pweq 3385 . . . . . 6  |-  ( x  =  ~P A  ->  ~P x  =  ~P ~P A )
32eleq2d 2148 . . . . 5  |-  ( x  =  ~P A  -> 
( ~P A  e. 
~P x  <->  ~P A  e.  ~P ~P A ) )
43spcegv 2686 . . . 4  |-  ( ~P A  e.  _V  ->  ( ~P A  e.  ~P ~P A  ->  E. x ~P A  e.  ~P x ) )
51, 4mpd 13 . . 3  |-  ( ~P A  e.  _V  ->  E. x ~P A  e. 
~P x )
6 elex 2610 . . . 4  |-  ( ~P A  e.  ~P x  ->  ~P A  e.  _V )
76exlimiv 1529 . . 3  |-  ( E. x ~P A  e. 
~P x  ->  ~P A  e.  _V )
85, 7impbii 124 . 2  |-  ( ~P A  e.  _V  <->  E. x ~P A  e.  ~P x )
9 vex 2604 . . . . 5  |-  x  e. 
_V
109elpw2 3932 . . . 4  |-  ( ~P A  e.  ~P x  <->  ~P A  C_  x )
11 pwss 3397 . . . . 5  |-  ( ~P A  C_  x  <->  A. y
( y  C_  A  ->  y  e.  x ) )
12 dfss2 2988 . . . . . . 7  |-  ( y 
C_  A  <->  A. z
( z  e.  y  ->  z  e.  A
) )
1312imbi1i 236 . . . . . 6  |-  ( ( y  C_  A  ->  y  e.  x )  <->  ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1413albii 1399 . . . . 5  |-  ( A. y ( y  C_  A  ->  y  e.  x
)  <->  A. y ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1511, 14bitri 182 . . . 4  |-  ( ~P A  C_  x  <->  A. y
( A. z ( z  e.  y  -> 
z  e.  A )  ->  y  e.  x
) )
1610, 15bitri 182 . . 3  |-  ( ~P A  e.  ~P x  <->  A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
1716exbii 1536 . 2  |-  ( E. x ~P A  e. 
~P x  <->  E. x A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
188, 17bitri 182 1  |-  ( ~P A  e.  _V  <->  E. x A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103   A.wal 1282    = wceq 1284   E.wex 1421    e. wcel 1433   _Vcvv 2601    C_ wss 2973   ~Pcpw 3382
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-in 2979  df-ss 2986  df-pw 3384
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator