HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem pp0ex 3496
Description: The power set of the power set of the empty set (the ordinal 2) is a set.
Assertion
Ref Expression
pp0ex |- {(/), {(/)}} e. _V

Proof of Theorem pp0ex
StepHypRef Expression
1 pwpw0 3134 . 2 |- ~P{(/)} = {(/), {(/)}}
2 p0ex 3495 . . 3 |- {(/)} e. _V
32pwex 3487 . 2 |- ~P{(/)} e. _V
41, 3eqeltrri 1968 1 |- {(/), {(/)}} e. _V
Colors of variables: wff set class
Syntax hints:   e. wcel 1300  _Vcvv 2292  (/)c0 2875  ~Pcpw 3032  {csn 3044  {cpr 3045
This theorem is referenced by:  ord3ex 3497  zfpair 3522
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050
Copyright terms: Public domain