Theorem iuneq2f 35594

Description: Equality deduction for indexed union. (Contributed by Giovanni Mascellani, 9-Apr-2018.)

Hypotheses

Ref	Expression
iuneq2f.1	⊢ Ⅎ𝑥𝐴
iuneq2f.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
iuneq2f	⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶)

Proof of Theorem iuneq2f

Step	Hyp	Ref	Expression
1		iuneq2f.1	. . 3 ⊢ Ⅎ𝑥𝐴
2		iuneq2f.2	. . 3 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2968	. 2 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		id 22	. 2 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
5		eqidd 2799	. 2 ⊢ (𝐴 = 𝐵 → 𝐶 = 𝐶)
6	3, 1, 2, 4, 5	iuneq12df 4907	1 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶)

Syntax hints:   → wi 4   = wceq 1538  Ⅎwnfc 2936  ∪ ciun 4881

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-rex 3112  df-iun 4883

This theorem is referenced by:  iuneq12f  35601