Theorem fnfvrnss 5668

Description: An upper bound for range determined by function values. (Contributed by NM, 8-Oct-2004.)

Assertion

Ref	Expression
fnfvrnss	|- ( ( F Fn A /\ A. x e. A ( F ` x ) e. B ) -> ran F C_ B )

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

Proof of Theorem fnfvrnss

Step	Hyp	Ref	Expression
1		ffnfv 5666	. 2 |- ( F : A --> B <-> ( F Fn A /\ A. x e. A ( F ` x ) e. B ) )
2		frn 5366	. 2 |- ( F : A --> B -> ran F C_ B )
3	1, 2	sylbir 135	1 |- ( ( F Fn A /\ A. x e. A ( F ` x ) e. B ) -> ran F C_ B )

Syntax hints:   -> wi 4   /\ wa 104   e. wcel 2146   A.wral 2453   C_ wss 3127   ran crn 4621   Fn wfn 5203   -->wf 5204   ` cfv 5208

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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737  df-sbc 2961  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-fv 5216

This theorem is referenced by:  ffvresb  5671  inresflem  7049  srgfcl  12953  psmetxrge0  13403