Theorem nffn 6592

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 6496	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2		nffn.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3	2	nffun 6516	. . 3 ⊢ Ⅎ𝑥Fun 𝐹
4	2	nfdm 5901	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5		nffn.2	. . . 4 ⊢ Ⅎ𝑥𝐴
6	4, 5	nfeq 2913	. . 3 ⊢ Ⅎ𝑥dom 𝐹 = 𝐴
7	3, 6	nfan 1901	. 2 ⊢ Ⅎ𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
8	1, 7	nfxfr 1855	1 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴

Syntax hints:   ∧ wa 395   = wceq 1542  Ⅎwnf 1785  Ⅎwnfc 2884  dom cdm 5625  Fun wfun 6487   Fn wfn 6488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-fun 6495  df-fn 6496

This theorem is referenced by:  nff  6659  nffo  6746  feqmptdf  6905  nfixpw  8858  nfixp  8859  nfixp1  8860  bnj1463  35216  choicefi  45650  stoweidlem31  46480  stoweidlem35  46484  stoweidlem59  46508