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

Theorem nffn 5370
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 5274 . 2  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
2 nffn.1 . . . 4  |-  F/_ x F
32nffun 5294 . . 3  |-  F/ x Fun  F
42nfdm 4922 . . . 4  |-  F/_ x dom  F
5 nffn.2 . . . 4  |-  F/_ x A
64, 5nfeq 2356 . . 3  |-  F/ x dom  F  =  A
73, 6nfan 1588 . 2  |-  F/ x
( Fun  F  /\  dom  F  =  A )
81, 7nfxfr 1497 1  |-  F/ x  F  Fn  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373   F/wnf 1483   F/_wnfc 2335   dom cdm 4675   Fun wfun 5265    Fn wfn 5266
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-fun 5273  df-fn 5274
This theorem is referenced by:  nff  5422  nffo  5497  nfixpxy  6804  nfixp1  6805
  Copyright terms: Public domain W3C validator