NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  pwpwpw0 Unicode version

Theorem pwpwpw0 3886
Description: Compute the power set of the power set of the power set of the empty set. (See also pw0 4161 and pwpw0 3856.) (Contributed by NM, 2-May-2009.)
Assertion
Ref Expression
pwpwpw0

Proof of Theorem pwpwpw0
StepHypRef Expression
1 pwpr 3884 1
Colors of variables: wff setvar class
Syntax hints:   wceq 1642   cun 3208  c0 3551  cpw 3723  csn 3738  cpr 3739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-ss 3260  df-nul 3552  df-pw 3725  df-sn 3742  df-pr 3743
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator