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

Theorem axpow3 4210
Description: A variant of the Axiom of Power Sets ax-pow 4207. For any set  x, there exists a set  y whose members are exactly the subsets of  x i.e. the power set of  x. Axiom Pow of [BellMachover] p. 466. (Contributed by NM, 4-Jun-2006.)
Assertion
Ref Expression
axpow3  |-  E. y A. z ( z  C_  x 
<->  z  e.  y )
Distinct variable group:    x, y, z

Proof of Theorem axpow3
StepHypRef Expression
1 axpow2 4209 . . 3  |-  E. y A. z ( z  C_  x  ->  z  e.  y )
21bm1.3ii 4154 . 2  |-  E. y A. z ( z  e.  y  <->  z  C_  x
)
3 bicom 140 . . . 4  |-  ( ( z  C_  x  <->  z  e.  y )  <->  ( z  e.  y  <->  z  C_  x
) )
43albii 1484 . . 3  |-  ( A. z ( z  C_  x 
<->  z  e.  y )  <->  A. z ( z  e.  y  <->  z  C_  x
) )
54exbii 1619 . 2  |-  ( E. y A. z ( z  C_  x  <->  z  e.  y )  <->  E. y A. z ( z  e.  y  <->  z  C_  x
) )
62, 5mpbir 146 1  |-  E. y A. z ( z  C_  x 
<->  z  e.  y )
Colors of variables: wff set class
Syntax hints:    <-> wb 105   A.wal 1362   E.wex 1506    C_ wss 3157
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-11 1520  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207
This theorem depends on definitions:  df-bi 117  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-in 3163  df-ss 3170
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator