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

Theorem nffn 5189
Description: Bound-variable hypothesis builder for a function with domain. (Contributed by NM, 30-Jan-2004.)
Hypotheses
Ref Expression
nffn.1 𝑥𝐹
nffn.2 𝑥𝐴
Assertion
Ref Expression
nffn 𝑥 𝐹 Fn 𝐴

Proof of Theorem nffn
StepHypRef Expression
1 df-fn 5096 . 2 (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2 nffn.1 . . . 4 𝑥𝐹
32nffun 5116 . . 3 𝑥Fun 𝐹
42nfdm 4753 . . . 4 𝑥dom 𝐹
5 nffn.2 . . . 4 𝑥𝐴
64, 5nfeq 2266 . . 3 𝑥dom 𝐹 = 𝐴
73, 6nfan 1529 . 2 𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
81, 7nfxfr 1435 1 𝑥 𝐹 Fn 𝐴
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1316  wnf 1421  wnfc 2245  dom cdm 4509  Fun wfun 5087   Fn wfn 5088
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-v 2662  df-un 3045  df-in 3047  df-ss 3054  df-sn 3503  df-pr 3504  df-op 3506  df-br 3900  df-opab 3960  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-fun 5095  df-fn 5096
This theorem is referenced by:  nff  5239  nffo  5314  nfixpxy  6579  nfixp1  6580
  Copyright terms: Public domain W3C validator