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

Theorem rspcv 2951
Description: Restricted specialization, using implicit substitution. (Contributed by NM, 26-May-1998.)
Hypothesis
Ref Expression
rspcv.1
Assertion
Ref Expression
rspcv
Distinct variable groups:   ,   ,   ,
Allowed substitution hint:   ()

Proof of Theorem rspcv
StepHypRef Expression
1 nfv 1619 . 2  F/
2 rspcv.1 . 2
31, 2rspc 2949 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wceq 1642   wcel 1710  wral 2614
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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-v 2861
This theorem is referenced by:  rspccv  2952  rspcva  2953  rspccva  2954  rspc3v  2964  rr19.3v  2980  rr19.28v  2981  rspsbc  3124  intmin  3946  evenodddisj  4516  nnadjoin  4520  tfinnn  4534  spfinsfincl  4539  funcnvuni  5161  nnc3n3p1  6278  nchoicelem12  6300  nchoicelem19  6307
  Copyright terms: Public domain W3C validator