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

Theorem axpweq 4842
Description: Two equivalent ways to express the Power Set Axiom. Note that ax-pow 4843 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 4173 . . . 4  |-  ( ~P A  e.  _V  ->  ~P A  e.  ~P ~P A )
2 pweq 4161 . . . . . 6  |-  ( x  =  ~P A  ->  ~P x  =  ~P ~P A )
32eleq2d 2687 . . . . 5  |-  ( x  =  ~P A  -> 
( ~P A  e. 
~P x  <->  ~P A  e.  ~P ~P A ) )
43spcegv 3294 . . . 4  |-  ( ~P A  e.  _V  ->  ( ~P A  e.  ~P ~P A  ->  E. x ~P A  e.  ~P x ) )
51, 4mpd 15 . . 3  |-  ( ~P A  e.  _V  ->  E. x ~P A  e. 
~P x )
6 elex 3212 . . . 4  |-  ( ~P A  e.  ~P x  ->  ~P A  e.  _V )
76exlimiv 1858 . . 3  |-  ( E. x ~P A  e. 
~P x  ->  ~P A  e.  _V )
85, 7impbii 199 . 2  |-  ( ~P A  e.  _V  <->  E. x ~P A  e.  ~P x )
9 vex 3203 . . . . 5  |-  x  e. 
_V
109elpw2 4828 . . . 4  |-  ( ~P A  e.  ~P x  <->  ~P A  C_  x )
11 pwss 4175 . . . . 5  |-  ( ~P A  C_  x  <->  A. y
( y  C_  A  ->  y  e.  x ) )
12 dfss2 3591 . . . . . . 7  |-  ( y 
C_  A  <->  A. z
( z  e.  y  ->  z  e.  A
) )
1312imbi1i 339 . . . . . 6  |-  ( ( y  C_  A  ->  y  e.  x )  <->  ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1413albii 1747 . . . . 5  |-  ( A. y ( y  C_  A  ->  y  e.  x
)  <->  A. y ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1511, 14bitri 264 . . . 4  |-  ( ~P A  C_  x  <->  A. y
( A. z ( z  e.  y  -> 
z  e.  A )  ->  y  e.  x
) )
1610, 15bitri 264 . . 3  |-  ( ~P A  e.  ~P x  <->  A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
1716exbii 1774 . 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 264 1  |-  ( ~P A  e.  _V  <->  E. x A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196   A.wal 1481    = wceq 1483   E.wex 1704    e. wcel 1990   _Vcvv 3200    C_ wss 3574   ~Pcpw 4158
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-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-in 3581  df-ss 3588  df-pw 4160
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator