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

Theorem class2set 1747
Description: Construct, from any class A, a set equal to it when the class exists and equal to the empty set when the class is proper. This theorem shows that the constructed set always exists.
Assertion
Ref Expression
class2set |- {x e. A | A e. V} e. V
Distinct variable group(s):   x,A

Proof of Theorem class2set
StepHypRef Expression
1 rabexg 1705 . 2 |- (A e. V -> {x e. A | A e. V} e. V)
2 0ex 1745 . . 3 |- (/) e. V
3 pm3.26 256 . . . . . 6 |- ((-. A e. V /\ x e. A) -> -. A e. V)
43nrexdv 1271 . . . . 5 |- (-. A e. V -> -. E.x e. A A e. V)
5 rabn0 1716 . . . . . 6 |- (-. {x e. A | A e. V} = (/) <-> E.x e. A A e. V)
65bicon1i 193 . . . . 5 |- (-. E.x e. A A e. V <-> {x e. A | A e. V} = (/))
74, 6sylib 173 . . . 4 |- (-. A e. V -> {x e. A | A e. V} = (/))
87eleq1d 1155 . . 3 |- (-. A e. V -> ({x e. A | A e. V} e. V <-> (/) e. V))
92, 8mpbiri 169 . 2 |- (-. A e. V -> {x e. A | A e. V} e. V)
101, 9pm2.61i 110 1 |- {x e. A | A e. V} e. V
Colors of variables: wff set class
Syntax hints:  -. wn 1   = wceq 1091   e. wcel 1092  E.wrex 1202  {crab 1204  Vcvv 1348  (/)c0 1707
This theorem is referenced by:  abrexex 2912
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-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075
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-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-dif 1489  df-in 1491  df-ss 1492  df-nul 1708
metamath.org