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

Theorem pwsnALT 3822
Description: The power set of a singleton (direct proof). TO DO - should we keep this? (Contributed by NM, 5-Jun-2006.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
pwsnALT  |-  ~P { A }  =  { (/)
,  { A } }

Proof of Theorem pwsnALT
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfss2 3169 . . . . . . . . 9  |-  ( x 
C_  { A }  <->  A. y ( y  e.  x  ->  y  e.  { A } ) )
2 elsn 3655 . . . . . . . . . . 11  |-  ( y  e.  { A }  <->  y  =  A )
32imbi2i 303 . . . . . . . . . 10  |-  ( ( y  e.  x  -> 
y  e.  { A } )  <->  ( y  e.  x  ->  y  =  A ) )
43albii 1553 . . . . . . . . 9  |-  ( A. y ( y  e.  x  ->  y  e.  { A } )  <->  A. y
( y  e.  x  ->  y  =  A ) )
51, 4bitri 240 . . . . . . . 8  |-  ( x 
C_  { A }  <->  A. y ( y  e.  x  ->  y  =  A ) )
6 neq0 3465 . . . . . . . . . 10  |-  ( -.  x  =  (/)  <->  E. y 
y  e.  x )
7 exintr 1601 . . . . . . . . . 10  |-  ( A. y ( y  e.  x  ->  y  =  A )  ->  ( E. y  y  e.  x  ->  E. y ( y  e.  x  /\  y  =  A ) ) )
86, 7syl5bi 208 . . . . . . . . 9  |-  ( A. y ( y  e.  x  ->  y  =  A )  ->  ( -.  x  =  (/)  ->  E. y
( y  e.  x  /\  y  =  A
) ) )
9 df-clel 2279 . . . . . . . . . . 11  |-  ( A  e.  x  <->  E. y
( y  =  A  /\  y  e.  x
) )
10 exancom 1573 . . . . . . . . . . 11  |-  ( E. y ( y  =  A  /\  y  e.  x )  <->  E. y
( y  e.  x  /\  y  =  A
) )
119, 10bitr2i 241 . . . . . . . . . 10  |-  ( E. y ( y  e.  x  /\  y  =  A )  <->  A  e.  x )
12 snssi 3759 . . . . . . . . . 10  |-  ( A  e.  x  ->  { A }  C_  x )
1311, 12sylbi 187 . . . . . . . . 9  |-  ( E. y ( y  e.  x  /\  y  =  A )  ->  { A }  C_  x )
148, 13syl6 29 . . . . . . . 8  |-  ( A. y ( y  e.  x  ->  y  =  A )  ->  ( -.  x  =  (/)  ->  { A }  C_  x ) )
155, 14sylbi 187 . . . . . . 7  |-  ( x 
C_  { A }  ->  ( -.  x  =  (/)  ->  { A }  C_  x ) )
1615anc2li 540 . . . . . 6  |-  ( x 
C_  { A }  ->  ( -.  x  =  (/)  ->  ( x  C_  { A }  /\  { A }  C_  x ) ) )
17 eqss 3194 . . . . . 6  |-  ( x  =  { A }  <->  ( x  C_  { A }  /\  { A }  C_  x ) )
1816, 17syl6ibr 218 . . . . 5  |-  ( x 
C_  { A }  ->  ( -.  x  =  (/)  ->  x  =  { A } ) )
1918orrd 367 . . . 4  |-  ( x 
C_  { A }  ->  ( x  =  (/)  \/  x  =  { A } ) )
20 0ss 3483 . . . . . 6  |-  (/)  C_  { A }
21 sseq1 3199 . . . . . 6  |-  ( x  =  (/)  ->  ( x 
C_  { A }  <->  (/)  C_ 
{ A } ) )
2220, 21mpbiri 224 . . . . 5  |-  ( x  =  (/)  ->  x  C_  { A } )
23 eqimss 3230 . . . . 5  |-  ( x  =  { A }  ->  x  C_  { A } )
2422, 23jaoi 368 . . . 4  |-  ( ( x  =  (/)  \/  x  =  { A } )  ->  x  C_  { A } )
2519, 24impbii 180 . . 3  |-  ( x 
C_  { A }  <->  ( x  =  (/)  \/  x  =  { A } ) )
2625abbii 2395 . 2  |-  { x  |  x  C_  { A } }  =  {
x  |  ( x  =  (/)  \/  x  =  { A } ) }
27 df-pw 3627 . 2  |-  ~P { A }  =  {
x  |  x  C_  { A } }
28 dfpr2 3656 . 2  |-  { (/) ,  { A } }  =  { x  |  ( x  =  (/)  \/  x  =  { A } ) }
2926, 27, 283eqtr4i 2313 1  |-  ~P { A }  =  { (/)
,  { A } }
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 357    /\ wa 358   A.wal 1527   E.wex 1528    = wceq 1623    e. wcel 1684   {cab 2269    C_ wss 3152   (/)c0 3455   ~Pcpw 3625   {csn 3640   {cpr 3641
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-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
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-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-pw 3627  df-sn 3646  df-pr 3647
  Copyright terms: Public domain W3C validator