Theorem fniunfv 5776

Description: The indexed union of a function's values is the union of its range. Compare Definition 5.4 of [Monk1] p. 50. (Contributed by NM, 27-Sep-2004.)

Assertion

Ref	Expression
fniunfv	⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ ran 𝐹)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem fniunfv

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfvex 5544	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V)
2	1	funfni 5328	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ V)
3	2	ralrimiva 2560	. . 3 ⊢ (𝐹 Fn 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V)
4		dfiun2g 3930	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
5	3, 4	syl 14	. 2 ⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
6		fnrnfv 5575	. . 3 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
7	6	unieqd 3832	. 2 ⊢ (𝐹 Fn 𝐴 → ∪ ran 𝐹 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
8	5, 7	eqtr4d 2223	1 ⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ ran 𝐹)

Syntax hints:   → wi 4   = wceq 1363   ∈ wcel 2158  {cab 2173  ∀wral 2465  ∃wrex 2466  Vcvv 2749  ∪ cuni 3821  ∪ ciun 3898  ran crn 4639   Fn wfn 5223  ‘cfv 5228

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-sbc 2975  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-iota 5190  df-fun 5230  df-fn 5231  df-fv 5236

This theorem is referenced by:  funiunfvdm  5777  ennnfonelemfun  12431  ennnfonelemf1  12432