NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  notrab Unicode version

Theorem notrab 3533
Description: Complementation of restricted class abstractions. (Contributed by Mario Carneiro, 3-Sep-2015.)
Assertion
Ref Expression
notrab
Distinct variable group:   ,
Allowed substitution hint:   ()

Proof of Theorem notrab
StepHypRef Expression
1 difab 3524 . 2
2 difin 3493 . . 3
3 dfrab3 3532 . . . 4
43difeq2i 3383 . . 3
5 abid2 2471 . . . 4
65difeq1i 3382 . . 3
72, 4, 63eqtr4i 2383 . 2
8 df-rab 2624 . 2
91, 7, 83eqtr4i 2383 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wa 358   wceq 1642   wcel 1710  cab 2339  crab 2619   cdif 3207   cin 3209
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-rab 2624  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-dif 3216
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator