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

Theorem fnrnfv 5533
Description: The range of a function expressed as a collection of the function's values. (Contributed by NM, 20-Oct-2005.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
fnrnfv (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦

Proof of Theorem fnrnfv
StepHypRef Expression
1 dffn5im 5532 . . 3 (𝐹 Fn 𝐴𝐹 = (𝑥𝐴 ↦ (𝐹𝑥)))
21rneqd 4833 . 2 (𝐹 Fn 𝐴 → ran 𝐹 = ran (𝑥𝐴 ↦ (𝐹𝑥)))
3 eqid 2165 . . 3 (𝑥𝐴 ↦ (𝐹𝑥)) = (𝑥𝐴 ↦ (𝐹𝑥))
43rnmpt 4852 . 2 ran (𝑥𝐴 ↦ (𝐹𝑥)) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)}
52, 4eqtrdi 2215 1 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)})
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1343  {cab 2151  wrex 2445  cmpt 4043  ran crn 4605   Fn wfn 5183  cfv 5188
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-iota 5153  df-fun 5190  df-fn 5191  df-fv 5196
This theorem is referenced by:  fvelrnb  5534  fniinfv  5544  dffo3  5632  fniunfv  5730  fnrnov  5987
  Copyright terms: Public domain W3C validator