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

Theorem nffn 5351
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 5258 . 2  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
2 nffn.1 . . . 4  |-  F/_ x F
32nffun 5278 . . 3  |-  F/ x Fun  F
42nfdm 4907 . . . 4  |-  F/_ x dom  F
5 nffn.2 . . . 4  |-  F/_ x A
64, 5nfeq 2344 . . 3  |-  F/ x dom  F  =  A
73, 6nfan 1576 . 2  |-  F/ x
( Fun  F  /\  dom  F  =  A )
81, 7nfxfr 1485 1  |-  F/ x  F  Fn  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364   F/wnf 1471   F/_wnfc 2323   dom cdm 4660   Fun wfun 5249    Fn wfn 5250
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-v 2762  df-un 3158  df-in 3160  df-ss 3167  df-sn 3625  df-pr 3626  df-op 3628  df-br 4031  df-opab 4092  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-fun 5257  df-fn 5258
This theorem is referenced by:  nff  5401  nffo  5476  nfixpxy  6773  nfixp1  6774
  Copyright terms: Public domain W3C validator