Theorem nffn 6584

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

Step	Hyp	Ref	Expression
1		df-fn 6488	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2		nffn.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3	2	nffun 6508	. . 3 ⊢ Ⅎ𝑥Fun 𝐹
4	2	nfdm 5893	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5		nffn.2	. . . 4 ⊢ Ⅎ𝑥𝐴
6	4, 5	nfeq 2914	. . 3 ⊢ Ⅎ𝑥dom 𝐹 = 𝐴
7	3, 6	nfan 1906	. 2 ⊢ Ⅎ𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
8	1, 7	nfxfr 1860	1 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴

Syntax hints:   ∧ wa 396   = wceq 1547  Ⅎwnf 1790  Ⅎwnfc 2886  dom cdm 5618  Fun wfun 6479   Fn wfn 6480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-opab 5135  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-fun 6487  df-fn 6488

This theorem is referenced by:  nff  6651  nffo  6738  feqmptdf  6897  nfixpw  8854  nfixp  8855  nfixp1  8856  bnj1463  35237  choicefi  45646  stoweidlem31  46474  stoweidlem35  46478  stoweidlem59  46502