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

Theorem axpweq 3924
Description: Two equivalent ways to express the Power Set Axiom. Note that ax-pow 3927 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 3372 . . . 4  |-  ( ~P A  e.  _V  ->  ~P A  e.  ~P ~P A )
2 pweq 3362 . . . . . 6  |-  ( x  =  ~P A  ->  ~P x  =  ~P ~P A )
32eleq2d 2107 . . . . 5  |-  ( x  =  ~P A  -> 
( ~P A  e. 
~P x  <->  ~P A  e.  ~P ~P A ) )
43spcegv 2641 . . . 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 2566 . . . 4  |-  ( ~P A  e.  ~P x  ->  ~P A  e.  _V )
76exlimiv 1489 . . 3  |-  ( E. x ~P A  e. 
~P x  ->  ~P A  e.  _V )
85, 7impbii 117 . 2  |-  ( ~P A  e.  _V  <->  E. x ~P A  e.  ~P x )
9 vex 2560 . . . . 5  |-  x  e. 
_V
109elpw2 3911 . . . 4  |-  ( ~P A  e.  ~P x  <->  ~P A  C_  x )
11 pwss 3374 . . . . 5  |-  ( ~P A  C_  x  <->  A. y
( y  C_  A  ->  y  e.  x ) )
12 dfss2 2934 . . . . . . 7  |-  ( y 
C_  A  <->  A. z
( z  e.  y  ->  z  e.  A
) )
1312imbi1i 227 . . . . . 6  |-  ( ( y  C_  A  ->  y  e.  x )  <->  ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1413albii 1359 . . . . 5  |-  ( A. y ( y  C_  A  ->  y  e.  x
)  <->  A. y ( A. z ( z  e.  y  ->  z  e.  A )  ->  y  e.  x ) )
1511, 14bitri 173 . . . 4  |-  ( ~P A  C_  x  <->  A. y
( A. z ( z  e.  y  -> 
z  e.  A )  ->  y  e.  x
) )
1610, 15bitri 173 . . 3  |-  ( ~P A  e.  ~P x  <->  A. y ( A. z
( z  e.  y  ->  z  e.  A
)  ->  y  e.  x ) )
1716exbii 1496 . 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 173 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 98   A.wal 1241    = wceq 1243   E.wex 1381    e. wcel 1393   _Vcvv 2557    C_ wss 2917   ~Pcpw 3359
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-in 2924  df-ss 2931  df-pw 3361
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator