ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fnfvrnss GIF version

Theorem fnfvrnss 5586
Description: An upper bound for range determined by function values. (Contributed by NM, 8-Oct-2004.)
Assertion
Ref Expression
fnfvrnss ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵) → ran 𝐹𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem fnfvrnss
StepHypRef Expression
1 ffnfv 5584 . 2 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵))
2 frn 5287 . 2 (𝐹:𝐴𝐵 → ran 𝐹𝐵)
31, 2sylbir 134 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵) → ran 𝐹𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wcel 1481  wral 2417  wss 3074  ran crn 4546   Fn wfn 5124  wf 5125  cfv 5129
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4052  ax-pow 4104  ax-pr 4137
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2913  df-un 3078  df-in 3080  df-ss 3087  df-pw 3515  df-sn 3536  df-pr 3537  df-op 3539  df-uni 3743  df-br 3936  df-opab 3996  df-mpt 3997  df-id 4221  df-xp 4551  df-rel 4552  df-cnv 4553  df-co 4554  df-dm 4555  df-rn 4556  df-iota 5094  df-fun 5131  df-fn 5132  df-f 5133  df-fv 5137
This theorem is referenced by:  ffvresb  5589  inresflem  6951  psmetxrge0  12533
  Copyright terms: Public domain W3C validator