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

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

Proof of Theorem 0elpw
StepHypRef Expression
1 0ss 2353 . 2 |- (/) (_ A
2 0ex 2766 . . 3 |- (/) e. V
32elpw 2456 . 2 |- ((/) e. P~A <-> (/) (_ A)
41, 3mpbir 197 1 |- (/) e. P~A
Colors of variables: wff set class
Syntax hints:   e. wcel 999   (_ wss 2098  (/)c0 2331  P~cpw 2453
This theorem is referenced by:  bcth 8117
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-10 1007  ax-11 1008  ax-12 1009  ax-14 1011  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-10o 1182  ax-16 1252  ax-11o 1260  ax-ext 1504  ax-nul 2765
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-ex 1022  df-sb 1214  df-eu 1424  df-mo 1425  df-clab 1510  df-cleq 1515  df-clel 1518  df-ne 1634  df-v 1859  df-dif 2100  df-in 2102  df-ss 2104  df-nul 2332  df-pw 2454
Copyright terms: Public domain