Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  rab0 Structured version   Unicode version

Theorem rab0 3640
 Description: Any restricted class abstraction restricted to the empty set is empty. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
rab0

Proof of Theorem rab0
StepHypRef Expression
1 equid 1688 . . . . 5
2 noel 3624 . . . . . 6
32intnanr 882 . . . . 5
41, 32th 231 . . . 4
54con2bii 323 . . 3
65abbii 2547 . 2
7 df-rab 2706 . 2
8 dfnul2 3622 . 2
96, 7, 83eqtr4i 2465 1
 Colors of variables: wff set class Syntax hints:   wn 3   wa 359   wceq 1652   wcel 1725  cab 2421  crab 2701  c0 3620 This theorem is referenced by:  rabrsn  3866  scott0  7802  00lsp  16049  rrgval  16339  usgra0v  21383  vdgr0  21663  psgnfval  27391 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-rab 2706  df-v 2950  df-dif 3315  df-nul 3621
 Copyright terms: Public domain W3C validator