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

Theorem nfres 4886
Description: Bound-variable hypothesis builder for restriction. (Contributed by NM, 15-Sep-2003.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
nfres.1  |-  F/_ x A
nfres.2  |-  F/_ x B
Assertion
Ref Expression
nfres  |-  F/_ x
( A  |`  B )

Proof of Theorem nfres
StepHypRef Expression
1 df-res 4616 . 2  |-  ( A  |`  B )  =  ( A  i^i  ( B  X.  _V ) )
2 nfres.1 . . 3  |-  F/_ x A
3 nfres.2 . . . 4  |-  F/_ x B
4 nfcv 2308 . . . 4  |-  F/_ x _V
53, 4nfxp 4631 . . 3  |-  F/_ x
( B  X.  _V )
62, 5nfin 3328 . 2  |-  F/_ x
( A  i^i  ( B  X.  _V ) )
71, 6nfcxfr 2305 1  |-  F/_ x
( A  |`  B )
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2295   _Vcvv 2726    i^i cin 3115    X. cxp 4602    |` cres 4606
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rab 2453  df-in 3122  df-opab 4044  df-xp 4610  df-res 4616
This theorem is referenced by:  nfima  4954  nffrec  6364
  Copyright terms: Public domain W3C validator