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

Theorem nff 5591
 Description: Bound-variable hypothesis builder for a mapping. (Contributed by NM, 29-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nff.1
nff.2
nff.3
Assertion
Ref Expression
nff

Proof of Theorem nff
StepHypRef Expression
1 df-f 5460 . 2
2 nff.1 . . . 4
3 nff.2 . . . 4
42, 3nffn 5543 . . 3
52nfrn 5114 . . . 4
6 nff.3 . . . 4
75, 6nfss 3343 . . 3
84, 7nfan 1847 . 2
91, 8nfxfr 1580 1
 Colors of variables: wff set class Syntax hints:   wa 360  wnf 1554  wnfc 2561   wss 3322   crn 4881   wfn 5451  wf 5452 This theorem is referenced by:  nff1  5639  nfwrd  11742  fcomptf  24079  esumfzf  24461  esumfsup  24462  sdclem1  26449  fmuldfeqlem1  27690  stoweidlem53  27780  stoweidlem54  27781  stoweidlem57  27784 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ral 2712  df-rab 2716  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-br 4215  df-opab 4269  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-fun 5458  df-fn 5459  df-f 5460
 Copyright terms: Public domain W3C validator