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

Theorem rspccva 2954
Description: Restricted specialization, using implicit substitution. (Contributed by NM, 26-Jul-2006.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
Hypothesis
Ref Expression
rspcv.1
Assertion
Ref Expression
rspccva
Distinct variable groups:   ,   ,   ,
Allowed substitution hint:   ()

Proof of Theorem rspccva
StepHypRef Expression
1 rspcv.1 . . 3
21rspcv 2951 . 2
32impcom 419 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wa 358   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:  disjne  3596  foelrn  5425  fconstfv  5456  nchoicelem17  6305
  Copyright terms: Public domain W3C validator