Theorem nff 6651

Description: Bound-variable hypothesis builder for a mapping. (Contributed by NM, 29-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
nff.1	⊢ Ⅎ𝑥𝐹
nff.2	⊢ Ⅎ𝑥𝐴
nff.3	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
nff	⊢ Ⅎ𝑥 𝐹:𝐴⟶𝐵

Proof of Theorem nff

Step	Hyp	Ref	Expression
1		df-f 6489	. 2 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
2		nff.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3		nff.2	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	nffn 6584	. . 3 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴
5	2	nfrn 5894	. . . 4 ⊢ Ⅎ𝑥ran 𝐹
6		nff.3	. . . 4 ⊢ Ⅎ𝑥𝐵
7	5, 6	nfss 3908	. . 3 ⊢ Ⅎ𝑥ran 𝐹 ⊆ 𝐵
8	4, 7	nfan 1906	. 2 ⊢ Ⅎ𝑥(𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)
9	1, 8	nfxfr 1860	1 ⊢ Ⅎ𝑥 𝐹:𝐴⟶𝐵

Syntax hints:   ∧ wa 396  Ⅎwnf 1790  Ⅎwnfc 2886   ⊆ wss 3883  ran crn 5619   Fn wfn 6480  ⟶wf 6481

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-rn 5629  df-fun 6487  df-fn 6488  df-f 6489

This theorem is referenced by:  nff1  6721  dffo3f  7047  nfwrd  14496  lfgrnloop  29212  fcomptf  32750  aciunf1lem  32754  fnpreimac  32762  esumfzf  34253  esumfsup  34254  poimirlem24  38011  sdclem1  38110  nfrelp  45393  fmuldfeqlem1  46027  fnlimfvre  46117  dvnmul  46386  stoweidlem53  46496  stoweidlem54  46497  stoweidlem57  46500  sge0iunmpt  46861