Theorem iunxsngf 3815

Description: A singleton index picks out an instance of an indexed union's argument. (Contributed by Mario Carneiro, 25-Jun-2016.) (Revised by Thierry Arnoux, 2-May-2020.)

Hypotheses

Ref	Expression
iunxsngf.1	⊢ Ⅎ𝑥𝐶
iunxsngf.2	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)

Assertion

Ref	Expression
iunxsngf	⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶)

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝑉(𝑥)

Proof of Theorem iunxsngf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eliun 3742	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵)
2		rexsns 3488	. . . 4 ⊢ (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐵)
3		iunxsngf.1	. . . . . 6 ⊢ Ⅎ𝑥𝐶
4	3	nfcri 2223	. . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐶
5		iunxsngf.2	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
6	5	eleq2d 2158	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
7	4, 6	sbciegf 2873	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
8	2, 7	syl5bb 191	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
9	1, 8	syl5bb 191	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ 𝑦 ∈ 𝐶))
10	9	eqrdv 2087	1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶)

Syntax hints:   → wi 4   = wceq 1290   ∈ wcel 1439  Ⅎwnfc 2216  ∃wrex 2361  [wsbc 2843  {csn 3452  ∪ ciun 3738

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071

This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-rex 2366  df-v 2624  df-sbc 2844  df-sn 3458  df-iun 3740

This theorem is referenced by:  iunfidisj  6711  iuncld  11878