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

Theorem nfs1v 1999
Description:  x is not free in  [
y  /  x ] ph when  x and  y are distinct. (Contributed by Mario Carneiro, 11-Aug-2016.)
Assertion
Ref Expression
nfs1v  |-  F/ x [ y  /  x ] ph
Distinct variable group:    x, y
Allowed substitution hints:    ph( x,  y)

Proof of Theorem nfs1v
StepHypRef Expression
1 hbs1 1998 . 2  |-  ( [ y  /  x ] ph  ->  A. x [ y  /  x ] ph )
21nfi 1515 1  |-  F/ x [ y  /  x ] ph
Colors of variables:    wff set class
This proof depends on syntax axioms:   F/wnf 1513   [wsb 1815
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587
This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816
This theorem is used by:  nfsbxy  2002  nfsbxyt  2003  sbco3v  2029  sbcomxyyz  2032  sbnf2  2041  mo2n  2114  mo23  2128  mor  2129  clelab  2366  cbvralf  2777  cbvrexf  2778  cbvralsv  2802  cbvrexsv  2803  cbvrab  2819  sbhypf  2872  mob2  3006  reu2  3014  sbcralt  3128  sbcrext  3129  sbcralg  3130  sbcreug  3132  sbcel12g  3162  sbceqg  3163  cbvreucsf  3212  cbvrabcsf  3213  disjiun  4125  cbvopab1  4205  cbvopab1s  4207  csbopabg  4210  cbvmptf  4227  cbvmpt  4228  opelopabsb  4404  frind  4499  tfis  4732  findes  4752  opeliunxp  4832  ralxpf  4928  rexxpf  4929  cbviota  5345  csbiotag  5373  isarep1  5470  cbvriota  6053  csbriotag  6055  abrexex2g  6353  abrexex2  6357  dfoprab4f  6431  modom  7112  finexdc  7211  ssfirab  7248  uzind4s  10006  zsupcllemstep  10679  bezoutlemmain  12800  nnwosdc  12841  cbvrald  17021  bj-bdfindes  17180  bj-findes  17212
  Copyright terms: Public domain W3C validator