Theorem iunid 2603

Description: An indexed union of singletons recovers the index set.

Assertion

Ref	Expression
iunid	|- U_x e. A {x} = A

Distinct variable group:   x,A

Proof of Theorem iunid

Step	Hyp	Ref	Expression
1		eliun 2570	. . 3 |- (y e. U_x e. A {x} <-> E.x e. A y e. {x})
2		df-rex 1650	. . . 4 |- (E.x e. A y e. {x} <-> E.x(x e. A /\ y e. {x}))
3		ancom 435	. . . . . 6 |- ((x e. A /\ y e. {x}) <-> (y e. {x} /\ x e. A))
4		elsn 2421	. . . . . . . 8 |- (y e. {x} <-> y = x)
5		equcom 1129	. . . . . . . 8 |- (y = x <-> x = y)
6	4, 5	bitr 173	. . . . . . 7 |- (y e. {x} <-> x = y)
7	6	anbi1i 481	. . . . . 6 |- ((y e. {x} /\ x e. A) <-> (x = y /\ x e. A))
8	3, 7	bitr 173	. . . . 5 |- ((x e. A /\ y e. {x}) <-> (x = y /\ x e. A))
9	8	exbii 1051	. . . 4 |- (E.x(x e. A /\ y e. {x}) <-> E.x(x = y /\ x e. A))
10		ax-17 971	. . . . 5 |- (y e. A -> A.x y e. A)
11		eleq1 1534	. . . . 5 |- (x = y -> (x e. A <-> y e. A))
12	10, 11	equsex 1152	. . . 4 |- (E.x(x = y /\ x e. A) <-> y e. A)
13	2, 9, 12	3bitr 177	. . 3 |- (E.x e. A y e. {x} <-> y e. A)
14	1, 13	bitr 173	. 2 |- (y e. U_x e. A {x} <-> y e. A)
15	14	eqriv 1474	1 |- U_x e. A {x} = A

Syntax hints:   /\ wa 223   = wceq 956   e. wcel 958  E.wex 980  E.wrex 1646  {csn 2409  U_ciun 2566

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-rex 1650  df-v 1812  df-sn 2412  df-iun 2568

Copyright terms: Public domain