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

Theorem rspc 2949
 Description: Restricted specialization, using implicit substitution. (Contributed by NM, 19-Apr-2005.) (Revised by Mario Carneiro, 11-Oct-2016.)
Hypotheses
Ref Expression
rspc.1
rspc.2
Assertion
Ref Expression
rspc
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem rspc
StepHypRef Expression
1 df-ral 2619 . 2
2 nfcv 2489 . . . 4
3 nfv 1619 . . . . 5
4 rspc.1 . . . . 5
53, 4nfim 1813 . . . 4
6 eleq1 2413 . . . . 5
7 rspc.2 . . . . 5
86, 7imbi12d 311 . . . 4
92, 5, 8spcgf 2934 . . 3
109pm2.43a 45 . 2
111, 10syl5bi 208 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wal 1540  wnf 1544   wceq 1642   wcel 1710  wral 2614 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-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:  rspcv  2951  rspc2  2960
 Copyright terms: Public domain W3C validator