MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nffvmpt1 Unicode version

Theorem nffvmpt1 5640
Description: Bound-variable hypothesis builder for mapping, special case. (Contributed by Mario Carneiro, 25-Dec-2016.)
Assertion
Ref Expression
nffvmpt1  |-  F/_ x
( ( x  e.  A  |->  B ) `  C )
Distinct variable group:    x, C
Allowed substitution hints:    A( x)    B( x)

Proof of Theorem nffvmpt1
StepHypRef Expression
1 nfmpt1 4211 . 2  |-  F/_ x
( x  e.  A  |->  B )
2 nfcv 2502 . 2  |-  F/_ x C
31, 2nffv 5639 1  |-  F/_ x
( ( x  e.  A  |->  B ) `  C )
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2489    e. cmpt 4179   ` cfv 5358
This theorem is referenced by:  seqof2  11268  invfuc  14058  yonedalem4b  14260  limcmpt  19448  lhop2  19577  lgamgulmlem2  24262  lgamgulmlem6  24266  fprod  24751  fprodmul  24768  fproddiv  24769  itggt0cn  25695  fmuldfeq  27219
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1551  ax-5 1562  ax-17 1621  ax-9 1659  ax-8 1680  ax-6 1734  ax-7 1739  ax-11 1751  ax-12 1937  ax-ext 2347
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 937  df-tru 1324  df-ex 1547  df-nf 1550  df-sb 1654  df-clab 2353  df-cleq 2359  df-clel 2362  df-nfc 2491  df-ral 2633  df-rex 2634  df-rab 2637  df-v 2875  df-dif 3241  df-un 3243  df-in 3245  df-ss 3252  df-nul 3544  df-if 3655  df-sn 3735  df-pr 3736  df-op 3738  df-uni 3930  df-br 4126  df-opab 4180  df-mpt 4181  df-iota 5322  df-fv 5366
  Copyright terms: Public domain W3C validator