Theorem iununir 4096

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 3944	. . . . . 6 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∪ ∅)
2		uni0 3962	. . . . . 6 ⊢ ∪ ∅ = ∅
3	1, 2	eqtrdi 2287	. . . . 5 ⊢ (𝐵 = ∅ → ∪ 𝐵 = ∅)
4	3	uneq2d 3383	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = (𝐴 ∪ ∅))
5		un0 3556	. . . 4 ⊢ (𝐴 ∪ ∅) = 𝐴
6	4, 5	eqtrdi 2287	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ∪ ∪ 𝐵) = 𝐴)
7		iuneq1 4025	. . . 4 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥))
8		0iun 4070	. . . 4 ⊢ ∪ 𝑥 ∈ ∅ (𝐴 ∪ 𝑥) = ∅
9	7, 8	eqtrdi 2287	. . 3 ⊢ (𝐵 = ∅ → ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) = ∅)
10	6, 9	eqeq12d 2253	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) ↔ 𝐴 = ∅))
11	10	biimpcd 159	1 ⊢ ((𝐴 ∪ ∪ 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ∪ 𝑥) → (𝐵 = ∅ → 𝐴 = ∅))

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∪ cun 3218  ∅c0 3520  ∪ cuni 3935  ∪ ciun 4012

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-sn 3715  df-uni 3936  df-iun 4014

This theorem is used by: (None)