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

Theorem 0elpw 4083
Description: Every power class contains the empty set. (Contributed by NM, 25-Oct-2007.)
Assertion
Ref Expression
0elpw  |-  (/)  e.  ~P A

Proof of Theorem 0elpw
StepHypRef Expression
1 0ss 3396 . 2  |-  (/)  C_  A
2 0ex 4050 . . 3  |-  (/)  e.  _V
32elpw 3511 . 2  |-  ( (/)  e.  ~P A  <->  (/)  C_  A
)
41, 3mpbir 145 1  |-  (/)  e.  ~P A
Colors of variables: wff set class
Syntax hints:    e. wcel 1480    C_ wss 3066   (/)c0 3358   ~Pcpw 3505
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-nul 4049
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-dif 3068  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507
This theorem is referenced by:  ordpwsucexmid  4480
  Copyright terms: Public domain W3C validator