Theorem nffn 5379

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 5283	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2		nffn.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3	2	nffun 5303	. . 3 ⊢ Ⅎ𝑥Fun 𝐹
4	2	nfdm 4931	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5		nffn.2	. . . 4 ⊢ Ⅎ𝑥𝐴
6	4, 5	nfeq 2357	. . 3 ⊢ Ⅎ𝑥dom 𝐹 = 𝐴
7	3, 6	nfan 1589	. 2 ⊢ Ⅎ𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
8	1, 7	nfxfr 1498	1 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴

Syntax hints:   ∧ wa 104   = wceq 1373  Ⅎwnf 1484  Ⅎwnfc 2336  dom cdm 4683  Fun wfun 5274   Fn wfn 5275

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-sn 3644  df-pr 3645  df-op 3647  df-br 4052  df-opab 4114  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-fun 5282  df-fn 5283

This theorem is referenced by:  nff  5432  nffo  5509  nfixpxy  6817  nfixp1  6818