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

Theorem rabn0 2288
Description: Non-empty restricted class abstraction.
Assertion
Ref Expression
rabn0 |- ({x e. A | ph} =/= (/) <-> E.x e. A ph)

Proof of Theorem rabn0
StepHypRef Expression
1 abn0 2286 . 2 |- ({x | (x e. A /\ ph)} =/= (/) <-> E.x(x e. A /\ ph))
2 df-rab 1649 . . 3 |- {x e. A | ph} = {x | (x e. A /\ ph)}
32neeq1i 1589 . 2 |- ({x e. A | ph} =/= (/) <-> {x | (x e. A /\ ph)} =/= (/))
4 df-rex 1647 . 2 |- (E.x e. A ph <-> E.x(x e. A /\ ph))
51, 3, 43bitr4 183 1 |- ({x e. A | ph} =/= (/) <-> E.x e. A ph)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   e. wcel 956  E.wex 978  {cab 1461   =/= wne 1582  E.wrex 1643  {crab 1645  (/)c0 2276
This theorem is referenced by:  rab0 2289  class2set 2729  exss 2764  onminsb 3004  onminesb 3005  tz9.12lem3 4641  rankval 4648  rankon 4651  rankr1 4654  scott0 4697  karden 4706  ac6lem 4734  kmlem3 4747  oncardval 4799  infm3 6009  uzwo3lem1 6172  ioo0t 6313  nnwos 6400  spwval3 8596  spwnex3 8597  ococint 9235  spanclt 9242  shsumval2 9298  nmcopexlem4 9892  nmcfnexlem4 9921
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-rex 1647  df-rab 1649  df-v 1808  df-dif 2045  df-nul 2277
Copyright terms: Public domain