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

Theorem axpow3 5328
Description: A variant of the Axiom of Power Sets ax-pow 5325. For any set 𝑥, there exists a set 𝑦 whose members are exactly the subsets of 𝑥 i.e. the power set of 𝑥. Axiom Pow of [BellMachover] p. 466. (Contributed by NM, 4-Jun-2006.)
Assertion
Ref Expression
axpow3 𝑦𝑧(𝑧𝑥𝑧𝑦)
Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem axpow3
StepHypRef Expression
1 axpow2 5327 . . 3 𝑦𝑧(𝑧𝑥𝑧𝑦)
21bm1.3ii 5264 . 2 𝑦𝑧(𝑧𝑦𝑧𝑥)
3 bicom 221 . . . 4 ((𝑧𝑥𝑧𝑦) ↔ (𝑧𝑦𝑧𝑥))
43albii 1821 . . 3 (∀𝑧(𝑧𝑥𝑧𝑦) ↔ ∀𝑧(𝑧𝑦𝑧𝑥))
54exbii 1850 . 2 (∃𝑦𝑧(𝑧𝑥𝑧𝑦) ↔ ∃𝑦𝑧(𝑧𝑦𝑧𝑥))
62, 5mpbir 230 1 𝑦𝑧(𝑧𝑥𝑧𝑦)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wal 1539  wex 1781  wss 3913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702  ax-sep 5261  ax-pow 5325
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-v 3448  df-in 3920  df-ss 3930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator