Theorem fnex 5937

Description: If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of resfunexg 5936. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fnex	|- ( ( F Fn A /\ A e. B ) -> F e. _V )

Proof of Theorem fnex

Step	Hyp	Ref	Expression
1		fnrel 5479	. . 3 |- ( F Fn A -> Rel F )
2	1	adantr 276	. 2 |- ( ( F Fn A /\ A e. B ) -> Rel F )
3		df-fn 5380	. . 3 |- ( F Fn A <-> ( Fun F /\ dom F = A ) )
4		eleq1a 2310	. . . . . 6 |- ( A e. B -> ( dom F = A -> dom F e. B ) )
5	4	impcom 125	. . . . 5 |- ( ( dom F = A /\ A e. B ) -> dom F e. B )
6		resfunexg 5936	. . . . 5 |- ( ( Fun F /\ dom F e. B ) -> ( F |` dom F ) e. _V )
7	5, 6	sylan2 286	. . . 4 |- ( ( Fun F /\ ( dom F = A /\ A e. B ) ) -> ( F |` dom F ) e. _V )
8	7	anassrs 404	. . 3 |- ( ( ( Fun F /\ dom F = A ) /\ A e. B ) -> ( F |` dom F ) e. _V )
9	3, 8	sylanb 284	. 2 |- ( ( F Fn A /\ A e. B ) -> ( F |` dom F ) e. _V )
10		resdm 5102	. . . 4 |- ( Rel F -> ( F |` dom F ) = F )
11	10	eleq1d 2307	. . 3 |- ( Rel F -> ( ( F |` dom F ) e. _V <-> F e. _V ) )
12	11	biimpa 296	. 2 |- ( ( Rel F /\ ( F |` dom F ) e. _V ) -> F e. _V )
13	2, 9, 12	syl2anc 415	1 |- ( ( F Fn A /\ A e. B ) -> F e. _V )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   dom cdm 4774   |` cres 4776   Rel wrel 4779   Fun wfun 5371   Fn wfn 5372

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385

This theorem is used by:  fndmexb  5938  funex  5940  fex  5947  offval  6310  ofrfval  6311  uchoice  6371  suppvalfn  6481  suppfnss  6497  tfrlemibex  6600  tfr1onlembex  6616  fndmeng  7098  cc2lem  7632  frecfzennn  10863  xpscf  13668  mulgval  13925  mulgfng  13927  prdsbas2  14179  prdsplusgval  14183  prdsplusgfval  14184  prdsmulrval  14185  prdsmulrfval  14186  invrfvald  14429