Theorem fnrnfv 6937

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 6936	. . 3 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
2		rneq 5920	. . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) → ran 𝐹 = ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
3	1, 2	sylbi 220	. 2 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
4		eqid 2760	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
5	4	rnmpt 5941	. 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
6	3, 5	eqtrdi 2811	1 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2738  ∃wrex 3086   ↦ cmpt 5186  ran crn 5656   Fn wfn 6528  ‘cfv 6533

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541

This theorem is used by:  fvelrnb  6938  fniinfv  6956  dffo3  7095  dffo3f  7099  fniunfv  7244  fnrnov  7587  pwcfsdom  10592  hauscmplem  23631  madef  28101  grpoinvf  31013  fpwrelmapffslem  33203  cshwrnid  33401  meascnbl  34730  omssubadd  34811  fvineqsneu  38165  fvineqsneq  38166  tfsconcatrn  44183  rnfdmpr  48169  fargshiftfo  48342