Theorem unisng 3915

Description: A set equals the union of its singleton. Theorem 8.2 of [Quine] p. 53. (Contributed by NM, 13-Aug-2002.)

Assertion

Ref	Expression
unisng	⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)

Proof of Theorem unisng

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 3684	. . . 4 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
2	1	unieqd 3909	. . 3 ⊢ (𝑥 = 𝐴 → ∪ {𝑥} = ∪ {𝐴})
3		id 19	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
4	2, 3	eqeq12d 2246	. 2 ⊢ (𝑥 = 𝐴 → (∪ {𝑥} = 𝑥 ↔ ∪ {𝐴} = 𝐴))
5		vex 2806	. . 3 ⊢ 𝑥 ∈ V
6	5	unisn 3914	. 2 ⊢ ∪ {𝑥} = 𝑥
7	4, 6	vtoclg 2865	1 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)

Syntax hints:   → wi 4   = wceq 1398   ∈ wcel 2202  {csn 3673  ∪ cuni 3898

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 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 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-uni 3899

This theorem is referenced by:  dfnfc2  3916  unisucg  4517  unisn3  4548  opswapg  5230  funfvdm  5718  en2other2  7450  lspuni0  14500  lss0v  14506