Theorem fniunfv 5579

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 5357	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V)
2	1	funfni 5148	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ V)
3	2	ralrimiva 2458	. . 3 ⊢ (𝐹 Fn 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V)
4		dfiun2g 3784	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
5	3, 4	syl 14	. 2 ⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
6		fnrnfv 5386	. . 3 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
7	6	unieqd 3686	. 2 ⊢ (𝐹 Fn 𝐴 → ∪ ran 𝐹 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
8	5, 7	eqtr4d 2130	1 ⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ ran 𝐹)

Syntax hints:   → wi 4   = wceq 1296   ∈ wcel 1445  {cab 2081  ∀wral 2370  ∃wrex 2371  Vcvv 2633  ∪ cuni 3675  ∪ ciun 3752  ran crn 4468   Fn wfn 5044  ‘cfv 5049

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-sep 3978  ax-pow 4030  ax-pr 4060

This theorem depends on definitions:  df-bi 116  df-3an 929  df-tru 1299  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ral 2375  df-rex 2376  df-v 2635  df-sbc 2855  df-un 3017  df-in 3019  df-ss 3026  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-iun 3754  df-br 3868  df-opab 3922  df-mpt 3923  df-id 4144  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-iota 5014  df-fun 5051  df-fn 5052  df-fv 5057

This theorem is referenced by:  funiunfvdm  5580