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

Theorem nffn 5433
Description: Bound-variable hypothesis builder for a function with domain. (Contributed by NM, 30-Jan-2004.)
Hypotheses
Ref Expression
nffn.1  |-  F/_ x F
nffn.2  |-  F/_ x A
Assertion
Ref Expression
nffn  |-  F/ x  F  Fn  A

Proof of Theorem nffn
StepHypRef Expression
1 df-fn 5336 . 2  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
2 nffn.1 . . . 4  |-  F/_ x F
32nffun 5356 . . 3  |-  F/ x Fun  F
42nfdm 4982 . . . 4  |-  F/_ x dom  F
5 nffn.2 . . . 4  |-  F/_ x A
64, 5nfeq 2383 . . 3  |-  F/ x dom  F  =  A
73, 6nfan 1614 . 2  |-  F/ x
( Fun  F  /\  dom  F  =  A )
81, 7nfxfr 1523 1  |-  F/ x  F  Fn  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1398   F/wnf 1509   F/_wnfc 2362   dom cdm 4731   Fun wfun 5327    Fn wfn 5328
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 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-fun 5335  df-fn 5336
This theorem is referenced by:  nff  5486  nffo  5567  nfixpxy  6929  nfixp1  6930
  Copyright terms: Public domain W3C validator