Theorem iununi 5064

Description: A relationship involving union and indexed union. Exercise 25 of [Enderton] p. 33. (Contributed by NM, 25-Nov-2003.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)

Assertion

Ref	Expression
iununi	⊢ ((𝐵 = ∅ → 𝐴 = ∅) ↔ (𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem iununi

Step	Hyp	Ref	Expression
1		df-ne 2940	. . . . . . 7 ⊢ (𝐵 ≠ ∅ ↔ ¬ 𝐵 = ∅)
2		iunconst 4968	. . . . . . 7 ⊢ (𝐵 ≠ ∅ → ∪ 𝑥 ∈ 𝐵 𝐴 = 𝐴)
3	1, 2	sylbir 234	. . . . . 6 ⊢ (¬ 𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 𝐴 = 𝐴)
4		iun0 5027	. . . . . . 7 ⊢ ∪ 𝑥 ∈ 𝐵 ∅ = ∅
5		id 22	. . . . . . . 8 ⊢ (𝐴 = ∅ → 𝐴 = ∅)
6	5	iuneq2d 4988	. . . . . . 7 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐵 𝐴 = ∪ 𝑥 ∈ 𝐵 ∅)
7	4, 6, 5	3eqtr4a 2797	. . . . . 6 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐵 𝐴 = 𝐴)
8	3, 7	ja 186	. . . . 5 ⊢ ((𝐵 = ∅ → 𝐴 = ∅) → ∪ 𝑥 ∈ 𝐵 𝐴 = 𝐴)
9	8	eqcomd 2737	. . . 4 ⊢ ((𝐵 = ∅ → 𝐴 = ∅) → 𝐴 = ∪ 𝑥 ∈ 𝐵 𝐴)
10	9	uneq1d 4127	. . 3 ⊢ ((𝐵 = ∅ → 𝐴 = ∅) → (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 𝑥) = (∪ 𝑥 ∈ 𝐵 𝐴 ∪ ∪ 𝑥 ∈ 𝐵 𝑥))
11		uniiun 5023	. . . 4 ⊢ ∪ 𝐵 = ∪ 𝑥 ∈ 𝐵 𝑥
12	11	uneq2i 4125	. . 3 ⊢ (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 𝑥)
13		iunun 5058	. . 3 ⊢ ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = (∪ 𝑥 ∈ 𝐵 𝐴 ∪ ∪ 𝑥 ∈ 𝐵 𝑥)
14	10, 12, 13	3eqtr4g 2796	. 2 ⊢ ((𝐵 = ∅ → 𝐴 = ∅) → (𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥))
15		unieq 4881	. . . . . . 7 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∪ ∅)
16		uni0 4901	. . . . . . 7 ⊢ ∪ ∅ = ∅
17	15, 16	eqtrdi 2787	. . . . . 6 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∅)
18	17	uneq2d 4128	. . . . 5 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∅))
19		un0 4355	. . . . 5 ⊢ (𝐴 ∪ ∅) = 𝐴
20	18, 19	eqtrdi 2787	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = 𝐴)
21		iuneq1 4975	. . . . 5 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥))
22		0iun 5028	. . . . 5 ⊢ ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥) = ∅
23	21, 22	eqtrdi 2787	. . . 4 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∅)
24	20, 23	eqeq12d 2747	. . 3 ⊢ (𝐵 = ∅ → ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) ↔ 𝐴 = ∅))
25	24	biimpcd 248	. 2 ⊢ ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) → (𝐵 = ∅ → 𝐴 = ∅))
26	14, 25	impbii 208	1 ⊢ ((𝐵 = ∅ → 𝐴 = ∅) ↔ (𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1541   ≠ wne 2939   ∪ cun 3911  ∅c0 4287  ∪ cuni 4870  ∪ ciun 4959

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-12 2171  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-sn 4592  df-uni 4871  df-iun 4961

This theorem is referenced by: (None)