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

Theorem nffv 5680
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 5360 . 2  |-  ( F `
 A )  =  ( iota y A F y )
2 nffv.2 . . . 4  |-  F/_ x A
3 nffv.1 . . . 4  |-  F/_ x F
4 nfcv 2384 . . . 4  |-  F/_ x
y
52, 3, 4nfbr 4156 . . 3  |-  F/ x  A F y
65nfiotaw 5316 . 2  |-  F/_ x
( iota y A F y )
71, 6nfcxfr 2381 1  |-  F/_ x
( F `  A
)
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2371   class class class wbr 4109   iotacio 5310   ` cfv 5352
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-iota 5312  df-fv 5360
This theorem is referenced by:  nffvmpt1  5681  nffvd  5682  dffn5imf  5732  fvmptssdm  5762  fvmptf  5770  eqfnfv2f  5779  ralrnmpt  5819  rexrnmpt  5820  ffnfvf  5836  funiunfvdmf  5937  dff13f  5943  nfiso  5979  nfrecs  6538  nffrec  6627  cc2  7581  nfseq  10819  seq3f1olemstep  10876  seq3f1olemp  10877  nfsum1  12041  nfsum  12042  fsumrelem  12157  nfcprod1  12240  nfcprod  12241  ctiunctlemfo  13190  ctiunct  13191  prdsbas3  13500  cnmpt11  15148  cnmpt21  15156  lgseisenlem2  15944
  Copyright terms: Public domain W3C validator