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

Theorem spcgv 2851
Description: Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 22-Jun-1994.)
Hypothesis
Ref Expression
spcgv.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
spcgv  |-  ( A  e.  V  ->  ( A. x ph  ->  ps ) )
Distinct variable groups:    ps, x    x, A
Allowed substitution hints:    ph( x)    V( x)

Proof of Theorem spcgv
StepHypRef Expression
1 nfcv 2339 . 2  |-  F/_ x A
2 nfv 1542 . 2  |-  F/ x ps
3 spcgv.1 . 2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
41, 2, 3spcgf 2846 1  |-  ( A  e.  V  ->  ( A. x ph  ->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1362    = wceq 1364    e. wcel 2167
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765
This theorem is referenced by:  spcv  2858  mob2  2944  intss1  3890  dfiin2g  3950  exmidsssnc  4237  exmid1stab  4242  frirrg  4386  frind  4388  alxfr  4497  elirr  4578  en2lp  4591  tfisi  4624  mptfvex  5650  tfrcl  6431  rdgisucinc  6452  frecabex  6465  fisseneq  7004  mkvprop  7233  exmidfodomrlemr  7281  exmidfodomrlemrALT  7282  acfun  7290  exmidmotap  7344  ccfunen  7347  zfz1isolem1  10949  zfz1iso  10950  uniopn  14321  pw1nct  15734  sbthom  15757
  Copyright terms: Public domain W3C validator