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

Theorem reubidva 2794
Description: Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 13-Nov-2004.)
Hypothesis
Ref Expression
reubidva.1
Assertion
Ref Expression
reubidva
Distinct variable group:   ,
Allowed substitution hints:   ()   ()   ()

Proof of Theorem reubidva
StepHypRef Expression
1 nfv 1619 . 2  F/
2 reubidva.1 . 2
31, 2reubida 2793 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wa 358   wcel 1710  wreu 2616
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-11 1746
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1542  df-nf 1545  df-eu 2208  df-reu 2621
This theorem is referenced by:  reubidv  2795  f1ofveu  5480
  Copyright terms: Public domain W3C validator