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

Theorem reubidva 2486
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 1418 . 2  F/
2 reubidva.1 . 2
31, 2reubida 2485 1
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wb 98   wcel 1390  wreu 2302
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 1333  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-4 1397  ax-17 1416  ax-ial 1424
This theorem depends on definitions:  df-bi 110  df-nf 1347  df-eu 1900  df-reu 2307
This theorem is referenced by:  reubidv  2487  f1ofveu  5443  icoshftf1o  8629
  Copyright terms: Public domain W3C validator