Theorem iununir 4077

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 3925	. . . . . 6 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∪ ∅)
2		uni0 3943	. . . . . 6 ⊢ ∪ ∅ = ∅
3	1, 2	eqtrdi 2283	. . . . 5 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∅)
4	3	uneq2d 3375	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∅))
5		un0 3544	. . . 4 ⊢ (𝐴 ∪ ∅) = 𝐴
6	4, 5	eqtrdi 2283	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = 𝐴)
7		iuneq1 4006	. . . 4 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥))
8		0iun 4051	. . . 4 ⊢ ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥) = ∅
9	7, 8	eqtrdi 2283	. . 3 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∅)
10	6, 9	eqeq12d 2249	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) ↔ 𝐴 = ∅))
11	10	biimpcd 159	1 ⊢ ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) → (𝐵 = ∅ → 𝐴 = ∅))

Syntax hints:   → wi 4   = wceq 1398   ∪ cun 3211  ∅c0 3510  ∪ cuni 3916  ∪ ciun 3993

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-sn 3697  df-uni 3917  df-iun 3995

This theorem is referenced by: (None)