Theorem iunsuc 6476

Description: Inductive definition for the indexed union at a successor. (Contributed by Mario Carneiro, 4-Feb-2013.) (Proof shortened by Mario Carneiro, 18-Nov-2016.)

Hypotheses

Ref	Expression
iunsuc.1	⊢ 𝐴 ∈ V
iunsuc.2	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)

Assertion

Ref	Expression
iunsuc	⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunsuc

Step	Hyp	Ref	Expression
1		df-suc 6394	. . 3 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴})
2		iuneq1 4973	. . 3 ⊢ (suc 𝐴 = (𝐴 ∪ {𝐴}) → ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵)
3	1, 2	ax-mp 5	. 2 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵
4		iunxun 5059	. 2 ⊢ ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵)
5		iunsuc.1	. . . 4 ⊢ 𝐴 ∈ V
6		iunsuc.2	. . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
7	5, 6	iunxsn 5056	. . 3 ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶
8	7	uneq2i 4167	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶)
9	3, 4, 8	3eqtri 2790	1 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  {csn 4588  ∪ ciun 4956  suc csuc 6390

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-iun 4958  df-suc 6394

This theorem is used by:  pwsdompw  10320