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

Theorem nffn 5426
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 5329 . 2 (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2 nffn.1 . . . 4 𝑥𝐹
32nffun 5349 . . 3 𝑥Fun 𝐹
42nfdm 4976 . . . 4 𝑥dom 𝐹
5 nffn.2 . . . 4 𝑥𝐴
64, 5nfeq 2382 . . 3 𝑥dom 𝐹 = 𝐴
73, 6nfan 1613 . 2 𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
81, 7nfxfr 1522 1 𝑥 𝐹 Fn 𝐴
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1397  wnf 1508  wnfc 2361  dom cdm 4725  Fun wfun 5320   Fn wfn 5321
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-fun 5328  df-fn 5329
This theorem is referenced by:  nff  5479  nffo  5558  nfixpxy  6885  nfixp1  6886
  Copyright terms: Public domain W3C validator