Theorem iununir 4011

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 3859	. . . . . 6 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∪ ∅)
2		uni0 3877	. . . . . 6 ⊢ ∪ ∅ = ∅
3	1, 2	eqtrdi 2254	. . . . 5 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∅)
4	3	uneq2d 3327	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∅))
5		un0 3494	. . . 4 ⊢ (𝐴 ∪ ∅) = 𝐴
6	4, 5	eqtrdi 2254	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = 𝐴)
7		iuneq1 3940	. . . 4 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥))
8		0iun 3985	. . . 4 ⊢ ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥) = ∅
9	7, 8	eqtrdi 2254	. . 3 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∅)
10	6, 9	eqeq12d 2220	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) ↔ 𝐴 = ∅))
11	10	biimpcd 159	1 ⊢ ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) → (𝐵 = ∅ → 𝐴 = ∅))

Syntax hints:   → wi 4   = wceq 1373   ∪ cun 3164  ∅c0 3460  ∪ cuni 3850  ∪ ciun 3927

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-sn 3639  df-uni 3851  df-iun 3929

This theorem is referenced by: (None)