HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fnfvrnss 2893
Description: An upper bound for range determined by function values.
Assertion
Ref Expression
fnfvrnss |- ((F Fn A /\ A.x e. A (F` x) e. B) -> ran F (_ B)
Distinct variable group(s):   x,A   x,B   x,F

Proof of Theorem fnfvrnss
StepHypRef Expression
1 ffnfv 2892 . 2 |- (F:A-->B <-> (F Fn A /\ A.x e. A (F` x) e. B))
2 frn 2757 . 2 |- (F:A-->B -> ran F (_ B)
31, 2sylbir 176 1 |- ((F Fn A /\ A.x e. A (F` x) e. B) -> ran F (_ B)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   e. wcel 1092  A.wral 1201   (_ wss 1487  ran crn 2411   Fn wfn 2417  -->wf 2418  ` cfv 2422
This theorem is referenced by:  seqrn 4673
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-fv 2438
metamath.org