Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  rab0 Unicode version

Theorem rab0 3274
 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 noel 3256 . . . . 5
21intnanr 850 . . . 4
3 equid 1605 . . . . 5
43notnoti 584 . . . 4
52, 42false 627 . . 3
65abbii 2169 . 2
7 df-rab 2332 . 2
8 dfnul2 3254 . 2
96, 7, 83eqtr4i 2086 1
 Colors of variables: wff set class Syntax hints:   wn 3   wa 101   wceq 1259   wcel 1409  cab 2042  crab 2327  c0 3252 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038 This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-rab 2332  df-v 2576  df-dif 2948  df-nul 3253 This theorem is referenced by:  sup00  6407
 Copyright terms: Public domain W3C validator