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

Theorem nffv 5649
Description: Bound-variable hypothesis builder for function value. (Contributed by NM, 14-Nov-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nffv.1  |-  F/_ x F
nffv.2  |-  F/_ x A
Assertion
Ref Expression
nffv  |-  F/_ x
( F `  A
)

Proof of Theorem nffv
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 df-fv 5334 . 2  |-  ( F `
 A )  =  ( iota y A F y )
2 nffv.2 . . . 4  |-  F/_ x A
3 nffv.1 . . . 4  |-  F/_ x F
4 nfcv 2374 . . . 4  |-  F/_ x
y
52, 3, 4nfbr 4135 . . 3  |-  F/ x  A F y
65nfiotaw 5290 . 2  |-  F/_ x
( iota y A F y )
71, 6nfcxfr 2371 1  |-  F/_ x
( F `  A
)
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2361   class class class wbr 4088   iotacio 5284   ` cfv 5326
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334
This theorem is referenced by:  nffvmpt1  5650  nffvd  5651  dffn5imf  5701  fvmptssdm  5731  fvmptf  5739  eqfnfv2f  5748  ralrnmpt  5789  rexrnmpt  5790  ffnfvf  5806  funiunfvdmf  5905  dff13f  5911  nfiso  5947  nfrecs  6473  nffrec  6562  cc2  7486  nfseq  10720  seq3f1olemstep  10777  seq3f1olemp  10778  nfsum1  11934  nfsum  11935  fsumrelem  12050  nfcprod1  12133  nfcprod  12134  ctiunctlemfo  13078  ctiunct  13079  prdsbas3  13388  cnmpt11  15026  cnmpt21  15034  lgseisenlem2  15819
  Copyright terms: Public domain W3C validator