Theorem iunxsngf 4005

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 3931	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵)
2		rexsns 3672	. . . 4 ⊢ (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐵)
3		iunxsngf.1	. . . . . 6 ⊢ Ⅎ𝑥𝐶
4	3	nfcri 2342	. . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐶
5		iunxsngf.2	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
6	5	eleq2d 2275	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
7	4, 6	sbciegf 3030	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
8	2, 7	bitrid 192	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
9	1, 8	bitrid 192	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ 𝑦 ∈ 𝐶))
10	9	eqrdv 2203	1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶)

Syntax hints:   → wi 4   = wceq 1373   ∈ wcel 2176  Ⅎwnfc 2335  ∃wrex 2485  [wsbc 2998  {csn 3633  ∪ 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-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-3an 983  df-tru 1376  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-sbc 2999  df-sn 3639  df-iun 3929

This theorem is referenced by:  iunfidisj  7050  iuncld  14620