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

Theorem snelpw 1861
Description: A singleton of a set belongs to the power class of a class containing the set.
Hypothesis
Ref Expression
snelpw.1 |- A e. V
Assertion
Ref Expression
snelpw |- (A e. B <-> {A} e. P~B)

Proof of Theorem snelpw
StepHypRef Expression
1 snelpw.1 . . 3 |- A e. V
21snss 1849 . 2 |- (A e. B <-> {A} (_ B)
3 snex 1859 . . 3 |- {A} e. V
43elpw 1801 . 2 |- ({A} e. P~B <-> {A} (_ B)
52, 4bitr4 154 1 |- (A e. B <-> {A} e. P~B)
Colors of variables: wff set class
Syntax hints:   <-> wb 127   e. wcel 1092  Vcvv 1348   (_ wss 1487  P~cpw 1798  {csn 1808
This theorem is referenced by:  unipw 1960  canth2 3381
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811
metamath.org