Theorem fnrnfv 6893

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

Step	Hyp	Ref	Expression
1		dffn5 6892	. . 3 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
2		rneq 5885	. . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) → ran 𝐹 = ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
3	1, 2	sylbi 217	. 2 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
4		eqid 2737	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
5	4	rnmpt 5906	. 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
6	3, 5	eqtrdi 2788	1 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})

Syntax hints:   → wi 4   = wceq 1542  {cab 2715  ∃wrex 3062   ↦ cmpt 5167  ran crn 5625   Fn wfn 6487  ‘cfv 6492

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500

This theorem is referenced by:  fvelrnb  6894  fniinfv  6912  dffo3  7048  dffo3f  7052  fniunfv  7195  fnrnov  7533  pwcfsdom  10497  hauscmplem  23381  madef  27842  grpoinvf  30618  fpwrelmapffslem  32820  cshwrnid  33036  meascnbl  34379  omssubadd  34460  fvineqsneu  37741  fvineqsneq  37742  tfsconcatrn  43788  rnfdmpr  47741  fargshiftfo  47914