Theorem nffn 6632

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 6536	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2		nffn.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3	2	nffun 6556	. . 3 ⊢ Ⅎ𝑥Fun 𝐹
4	2	nfdm 5935	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5		nffn.2	. . . 4 ⊢ Ⅎ𝑥𝐴
6	4, 5	nfeq 2935	. . 3 ⊢ Ⅎ𝑥dom 𝐹 = 𝐴
7	3, 6	nfan 1932	. 2 ⊢ Ⅎ𝑥(Fun 𝐹 ∧ dom 𝐹 = 𝐴)
8	1, 7	nfxfr 1886	1 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  Ⅎwnf 1816  Ⅎwnfc 2907  dom cdm 5655  Fun wfun 6527   Fn wfn 6528

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-fun 6535  df-fn 6536

This theorem is used by:  nff  6699  nffo  6789  feqmptdf  6949  nfixpw  8924  nfixp  8925  nfixp1  8926  bnj1463  35565  choicefi  46032  stoweidlem31  46860  stoweidlem35  46864  stoweidlem59  46888