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

Theorem 2ralbida 2345
 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 1421 . . . 4
42, 3nfan 1457 . . 3
5 2ralbida.3 . . . 4
65anassrs 380 . . 3
74, 6ralbida 2320 . 2
81, 7ralbida 2320 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 97   wb 98  wnf 1349   wcel 1393  wral 2306 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338  ax-4 1400  ax-17 1419 This theorem depends on definitions:  df-bi 110  df-nf 1350  df-ral 2311 This theorem is referenced by:  2ralbidva  2346
 Copyright terms: Public domain W3C validator