Theorem iuneq12f 36248

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 4940	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐶 = 𝐷 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐴 𝐷)
2		iuneq12f.1	. . 3 ⊢ Ⅎ𝑥𝐴
3		iuneq12f.2	. . 3 ⊢ Ⅎ𝑥𝐵
4	2, 3	iuneq2f 36241	. 2 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐷 = ∪ 𝑥 ∈ 𝐵 𝐷)
5	1, 4	sylan9eqr 2801	1 ⊢ ((𝐴 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 = 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539  Ⅎwnfc 2886  ∀wral 3063  ∪ ciun 4921

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-v 3424  df-in 3890  df-ss 3900  df-iun 4923

This theorem is referenced by: (None)