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

Theorem p0exALT 4198
Description: The power set of the empty set (the ordinal 1) is a set. Alternate proof which is longer and quite different from the proof of p0ex 4197 if snexALT 4196 is expanded. (Contributed by NM, 23-Dec-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
p0exALT  |-  { (/) }  e.  _V

Proof of Theorem p0exALT
StepHypRef Expression
1 snexALT 4196 1  |-  { (/) }  e.  _V
Colors of variables: wff set class
Syntax hints:    e. wcel 1684   _Vcvv 2788   (/)c0 3455   {csn 3640
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-v 2790  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3456  df-pw 3627  df-sn 3646
  Copyright terms: Public domain W3C validator