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

Theorem ralrab 2998
 Description: Universal quantification over a restricted class abstraction. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypothesis
Ref Expression
ralab.1
Assertion
Ref Expression
ralrab
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   (,)   ()   (,)   ()

Proof of Theorem ralrab
StepHypRef Expression
1 ralab.1 . . . . 5
21elrab 2994 . . . 4
32imbi1i 315 . . 3
4 impexp 433 . . 3
53, 4bitri 240 . 2
65ralbii2 2642 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358   wcel 1710  wral 2614  crab 2618 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-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-rab 2623  df-v 2861 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator