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

Theorem pwpwpw0ss 3912
Description: Compute the power set of the power set of the power set of the empty set. (See also pw0 3841 and pwpw0ss 3909.) (Contributed by Jim Kingdon, 13-Aug-2018.)
Assertion
Ref Expression
pwpwpw0ss  |-  ( {
(/) ,  { (/) } }  u.  { { { (/) } } ,  { (/) ,  { (/) } } }
)  C_  ~P { (/) ,  { (/) } }

Proof of Theorem pwpwpw0ss
StepHypRef Expression
1 pwprss 3910 1  |-  ( {
(/) ,  { (/) } }  u.  { { { (/) } } ,  { (/) ,  { (/) } } }
)  C_  ~P { (/) ,  { (/) } }
Colors of variables: wff set class
Syntax hints:    u. cun 3209    C_ wss 3211   (/)c0 3508   ~Pcpw 3669   {csn 3689   {cpr 3690
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator