Theorem iununir 3996

Description: A relationship involving union and indexed union. Exercise 25 of [Enderton] p. 33 but with biconditional changed to implication. (Contributed by Jim Kingdon, 19-Aug-2018.)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem iununir

Step	Hyp	Ref	Expression
1		unieq 3844	. . . . . 6 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∪ ∅)
2		uni0 3862	. . . . . 6 ⊢ ∪ ∅ = ∅
3	1, 2	eqtrdi 2242	. . . . 5 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∅)
4	3	uneq2d 3313	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∅))
5		un0 3480	. . . 4 ⊢ (𝐴 ∪ ∅) = 𝐴
6	4, 5	eqtrdi 2242	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = 𝐴)
7		iuneq1 3925	. . . 4 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥))
8		0iun 3970	. . . 4 ⊢ ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥) = ∅
9	7, 8	eqtrdi 2242	. . 3 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∅)
10	6, 9	eqeq12d 2208	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) ↔ 𝐴 = ∅))
11	10	biimpcd 159	1 ⊢ ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) → (𝐵 = ∅ → 𝐴 = ∅))

Syntax hints:   → wi 4   = wceq 1364   ∪ cun 3151  ∅c0 3446  ∪ cuni 3835  ∪ ciun 3912

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-sn 3624  df-uni 3836  df-iun 3914

This theorem is referenced by: (None)