Theorem nffn 6648

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 6546	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2		nffn.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3	2	nffun 6571	. . 3 ⊢ Ⅎ𝑥Fun 𝐹
4	2	nfdm 5950	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5		nffn.2	. . . 4 ⊢ Ⅎ𝑥𝐴
6	4, 5	nfeq 2916	. . 3 ⊢ Ⅎ𝑥dom 𝐹 = 𝐴
7	3, 6	nfan 1902	. 2 ⊢ Ⅎ𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
8	1, 7	nfxfr 1855	1 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴

Syntax hints:   ∧ wa 396   = wceq 1541  Ⅎwnf 1785  Ⅎwnfc 2883  dom cdm 5676  Fun wfun 6537   Fn wfn 6538

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-fun 6545  df-fn 6546

This theorem is referenced by:  nff  6713  nffo  6804  feqmptdf  6962  nfixpw  8912  nfixp  8913  nfixp1  8914  bnj1463  34135  choicefi  43984  stoweidlem31  44832  stoweidlem35  44836  stoweidlem59  44860