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

Theorem fnfvrnss 5676
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 5674 . 2 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵))
2 frn 5374 . 2 (𝐹:𝐴𝐵 → ran 𝐹𝐵)
31, 2sylbir 135 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵) → ran 𝐹𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wcel 2148  wral 2455  wss 3129  ran crn 4627   Fn wfn 5211  wf 5212  cfv 5216
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 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-fv 5224
This theorem is referenced by:  ffvresb  5679  inresflem  7058  srgfcl  13109  psmetxrge0  13725
  Copyright terms: Public domain W3C validator