Theorem fvelrnb 5462

Description: A member of a function's range is a value of the function. (Contributed by NM, 31-Oct-1995.)

Assertion

Ref	Expression
fvelrnb	|- ( F Fn A -> ( B e. ran F <-> E. x e. A ( F ` x ) = B ) )

Distinct variable groups:   x, A   x, B   x, F

Proof of Theorem fvelrnb

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 2420	. . . 4 |- ( E. x e. A ( F ` x ) = B <-> E. x ( x e. A /\ ( F ` x ) = B ) )
2		19.41v 1874	. . . . 5 |- ( E. x ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) <-> ( E. x ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) )
3		simpl 108	. . . . . . . . . 10 |- ( ( x e. A /\ ( F ` x ) = B ) -> x e. A )
4	3	anim1i 338	. . . . . . . . 9 |- ( ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> ( x e. A /\ F Fn A ) )
5	4	ancomd 265	. . . . . . . 8 |- ( ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> ( F Fn A /\ x e. A ) )
6		funfvex 5431	. . . . . . . . 9 |- ( ( Fun F /\ x e. dom F ) -> ( F ` x ) e. _V )
7	6	funfni 5218	. . . . . . . 8 |- ( ( F Fn A /\ x e. A ) -> ( F ` x ) e. _V )
8	5, 7	syl 14	. . . . . . 7 |- ( ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> ( F ` x ) e. _V )
9		simpr 109	. . . . . . . . 9 |- ( ( x e. A /\ ( F ` x ) = B ) -> ( F ` x ) = B )
10	9	eleq1d 2206	. . . . . . . 8 |- ( ( x e. A /\ ( F ` x ) = B ) -> ( ( F ` x ) e. _V <-> B e. _V ) )
11	10	adantr 274	. . . . . . 7 |- ( ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> ( ( F ` x ) e. _V <-> B e. _V ) )
12	8, 11	mpbid 146	. . . . . 6 |- ( ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> B e. _V )
13	12	exlimiv 1577	. . . . 5 |- ( E. x ( ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> B e. _V )
14	2, 13	sylbir 134	. . . 4 |- ( ( E. x ( x e. A /\ ( F ` x ) = B ) /\ F Fn A ) -> B e. _V )
15	1, 14	sylanb 282	. . 3 |- ( ( E. x e. A ( F ` x ) = B /\ F Fn A ) -> B e. _V )
16	15	expcom 115	. 2 |- ( F Fn A -> ( E. x e. A ( F ` x ) = B -> B e. _V ) )
17		fnrnfv 5461	. . . 4 |- ( F Fn A -> ran F = { y | E. x e. A y = ( F ` x ) } )
18	17	eleq2d 2207	. . 3 |- ( F Fn A -> ( B e. ran F <-> B e. { y | E. x e. A y = ( F ` x ) } ) )
19		eqeq1 2144	. . . . . 6 |- ( y = B -> ( y = ( F ` x ) <-> B = ( F ` x ) ) )
20		eqcom 2139	. . . . . 6 |- ( B = ( F ` x ) <-> ( F ` x ) = B )
21	19, 20	syl6bb 195	. . . . 5 |- ( y = B -> ( y = ( F ` x ) <-> ( F ` x ) = B ) )
22	21	rexbidv 2436	. . . 4 |- ( y = B -> ( E. x e. A y = ( F ` x ) <-> E. x e. A ( F ` x ) = B ) )
23	22	elab3g 2830	. . 3 |- ( ( E. x e. A ( F ` x ) = B -> B e. _V ) -> ( B e. { y | E. x e. A y = ( F ` x ) } <-> E. x e. A ( F ` x ) = B ) )
24	18, 23	sylan9bbr 458	. 2 |- ( ( ( E. x e. A ( F ` x ) = B -> B e. _V ) /\ F Fn A ) -> ( B e. ran F <-> E. x e. A ( F ` x ) = B ) )
25	16, 24	mpancom 418	1 |- ( F Fn A -> ( B e. ran F <-> E. x e. A ( F ` x ) = B ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   E.wex 1468   e. wcel 1480   {cab 2123   E.wrex 2415   _Vcvv 2681   ran crn 4535   Fn wfn 5113   ` cfv 5118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-iota 5083  df-fun 5120  df-fn 5121  df-fv 5126

This theorem is referenced by:  chfnrn  5524  rexrn  5550  ralrn  5551  elrnrexdmb  5553  ffnfv  5571  fconstfvm  5631  elunirn  5660  isoini  5712  reldm  6077  ordiso2  6913  eldju  6946  ctssdc  6991  uzn0  9334  frec2uzrand  10171  frecuzrdgtcl  10178  frecuzrdgfunlem  10185  uzin2  10752