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

Theorem inrab 3527
Description: Intersection of two restricted class abstractions. (Contributed by NM, 1-Sep-2006.)
Assertion
Ref Expression
inrab

Proof of Theorem inrab
StepHypRef Expression
1 df-rab 2623 . . 3
2 df-rab 2623 . . 3
31, 2ineq12i 3455 . 2
4 df-rab 2623 . . 3
5 inab 3522 . . . 4
6 anandi 801 . . . . 5
76abbii 2465 . . . 4
85, 7eqtr4i 2376 . . 3
94, 8eqtr4i 2376 . 2
103, 9eqtr4i 2376 1
Colors of variables: wff setvar class
Syntax hints:   wa 358   wceq 1642   wcel 1710  cab 2339  crab 2618   cin 3208
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 2478  df-rab 2623  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213
This theorem is referenced by:  rabnc  3574
  Copyright terms: Public domain W3C validator