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

Theorem 2ralbida 2653
 Description: Formula-building rule for restricted universal quantifier (deduction rule). (Contributed by NM, 24-Feb-2004.)
Hypotheses
Ref Expression
2ralbida.1
2ralbida.2
2ralbida.3
Assertion
Ref Expression
2ralbida
Distinct variable groups:   ,   ,
Allowed substitution hints:   (,)   (,)   (,)   ()   (,)

Proof of Theorem 2ralbida
StepHypRef Expression
1 2ralbida.1 . 2
2 2ralbida.2 . . . 4
3 nfv 1619 . . . 4
42, 3nfan 1824 . . 3
5 2ralbida.3 . . . 4
65anassrs 629 . . 3
74, 6ralbida 2628 . 2
81, 7ralbida 2628 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358  wnf 1544   wcel 1710  wral 2614 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-11 1746 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-ral 2619 This theorem is referenced by:  2ralbidva  2654
 Copyright terms: Public domain W3C validator