Theorem funiunfvf 7247

Description: The indexed union of a function's values is the union of its image under the index class. This version of funiunfv 7246 uses a bound-variable hypothesis in place of a distinct variable condition. (Contributed by NM, 26-Mar-2006.) (Revised by David Abernethy, 15-Apr-2013.)

Hypothesis

Ref	Expression
funiunfvf.1	⊢ Ⅎ𝑥𝐹

Assertion

Ref	Expression
funiunfvf	⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ (𝐹 “ 𝐴))

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem funiunfvf

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funiunfvf.1	. . . 4 ⊢ Ⅎ𝑥𝐹
2		nfcv 2924	. . . 4 ⊢ Ⅎ𝑥𝑧
3	1, 2	nffv 6891	. . 3 ⊢ Ⅎ𝑥(𝐹‘𝑧)
4		nfcv 2924	. . 3 ⊢ Ⅎ𝑧(𝐹‘𝑥)
5		fveq2 6881	. . 3 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
6	3, 4, 5	cbviun 4998	. 2 ⊢ ∪ 𝑧 ∈ 𝐴 (𝐹‘𝑧) = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)
7		funiunfv 7246	. 2 ⊢ (Fun 𝐹 → ∪ 𝑧 ∈ 𝐴 (𝐹‘𝑧) = ∪ (𝐹 “ 𝐴))
8	6, 7	eqtr3id 2811	1 ⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ (𝐹 “ 𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1569  Ⅎwnfc 2909  ∪ cuni 4871  ∪ ciun 4955   “ cima 5663  Fun wfun 6530  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544

This theorem is used by: (None)