Theorem iuneq12f 37487

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

Hypotheses

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

Assertion

Ref	Expression
iuneq12f	⊢ ((𝐴 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 = 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Proof of Theorem iuneq12f

Step	Hyp	Ref	Expression
1		iuneq2 5006	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐶 = 𝐷 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐴 𝐷)
2		iuneq12f.1	. . 3 ⊢ Ⅎ𝑥𝐴
3		iuneq12f.2	. . 3 ⊢ Ⅎ𝑥𝐵
4	2, 3	iuneq2f 37480	. 2 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐷 = ∪ 𝑥 ∈ 𝐵 𝐷)
5	1, 4	sylan9eqr 2786	1 ⊢ ((𝐴 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 = 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1533  Ⅎwnfc 2875  ∀wral 3053  ∪ ciun 4987

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ral 3054  df-rex 3063  df-v 3468  df-in 3947  df-ss 3957  df-iun 4989

This theorem is referenced by: (None)