HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem 0elpw 3473
Description: Every power class contains the empty set.
Assertion
Ref Expression
0elpw |- (/) e. ~PA

Proof of Theorem 0elpw
StepHypRef Expression
1 0ss 2900 . 2 |- (/) C_ A
2 0ex 3446 . . 3 |- (/) e. _V
32elpw 3037 . 2 |- ((/) e. ~PA <-> (/) C_ A)
41, 3mpbir 207 1 |- (/) e. ~PA
Colors of variables: wff set class
Syntax hints:   e. wcel 1300   C_ wss 2593  (/)c0 2875  ~Pcpw 3032
This theorem is referenced by:  bcth 9310  sallnei 14873  emptar 15231  compfipin0lem 15435  alexsublem2 15438  alexsublem4 15440  comppfsc 15517  heiborlem21 15975
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-nul 3445
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035
Copyright terms: Public domain