Theorem iunxprg 5051

Description: A pair index picks out two instances of an indexed union's argument. (Contributed by Alexander van der Vekens, 2-Feb-2018.)

Hypotheses

Ref	Expression
iunxprg.1	⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷)
iunxprg.2	⊢ (𝑥 = 𝐵 → 𝐶 = 𝐸)

Assertion

Ref	Expression
iunxprg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∪ 𝐸))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝐸

Allowed substitution hints:   𝐶(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem iunxprg

Step	Hyp	Ref	Expression
1		df-pr 4583	. . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2		iuneq1 4963	. . . 4 ⊢ ({𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) → ∪ 𝑥 ∈ {𝐴, 𝐵}𝐶 = ∪ 𝑥 ∈ ({𝐴} ∪ {𝐵})𝐶)
3	1, 2	ax-mp 5	. . 3 ⊢ ∪ 𝑥 ∈ {𝐴, 𝐵}𝐶 = ∪ 𝑥 ∈ ({𝐴} ∪ {𝐵})𝐶
4		iunxun 5049	. . 3 ⊢ ∪ 𝑥 ∈ ({𝐴} ∪ {𝐵})𝐶 = (∪ 𝑥 ∈ {𝐴}𝐶 ∪ ∪ 𝑥 ∈ {𝐵}𝐶)
5	3, 4	eqtri 2759	. 2 ⊢ ∪ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (∪ 𝑥 ∈ {𝐴}𝐶 ∪ ∪ 𝑥 ∈ {𝐵}𝐶)
6		iunxprg.1	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷)
7	6	iunxsng 5045	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐶 = 𝐷)
8	7	adantr 480	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ {𝐴}𝐶 = 𝐷)
9		iunxprg.2	. . . . 5 ⊢ (𝑥 = 𝐵 → 𝐶 = 𝐸)
10	9	iunxsng 5045	. . . 4 ⊢ (𝐵 ∈ 𝑊 → ∪ 𝑥 ∈ {𝐵}𝐶 = 𝐸)
11	10	adantl 481	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ {𝐵}𝐶 = 𝐸)
12	8, 11	uneq12d 4121	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∪ 𝑥 ∈ {𝐴}𝐶 ∪ ∪ 𝑥 ∈ {𝐵}𝐶) = (𝐷 ∪ 𝐸))
13	5, 12	eqtrid 2783	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∪ 𝐸))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113   ∪ cun 3899  {csn 4580  {cpr 4582  ∪ ciun 4946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-v 3442  df-un 3906  df-ss 3918  df-sn 4581  df-pr 4583  df-iun 4948

This theorem is referenced by:  iunxunpr  32642  ovnsubadd2lem  46889  rnfdmpr  47527