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

Theorem nffn 5023
 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 4933 . 2 (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2 nffn.1 . . . 4 𝑥𝐹
32nffun 4952 . . 3 𝑥Fun 𝐹
42nfdm 4606 . . . 4 𝑥dom 𝐹
5 nffn.2 . . . 4 𝑥𝐴
64, 5nfeq 2201 . . 3 𝑥dom 𝐹 = 𝐴
73, 6nfan 1473 . 2 𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
81, 7nfxfr 1379 1 𝑥 𝐹 Fn 𝐴
 Colors of variables: wff set class Syntax hints:   ∧ wa 101   = wceq 1259  Ⅎwnf 1365  Ⅎwnfc 2181  dom cdm 4373  Fun wfun 4924   Fn wfn 4925 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-v 2576  df-un 2950  df-in 2952  df-ss 2959  df-sn 3409  df-pr 3410  df-op 3412  df-br 3793  df-opab 3847  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-fun 4932  df-fn 4933 This theorem is referenced by:  nff  5071  nffo  5133
 Copyright terms: Public domain W3C validator