Theorem unidm 3350

Description: Idempotent law for union of classes. Theorem 23 of [Suppes] p. 27. (Contributed by NM, 5-Aug-1993.)

Assertion

Ref	Expression
unidm	|- ( A u. A ) = A

Proof of Theorem unidm

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oridm 764	. 2 |- ( ( x e. A \/ x e. A ) <-> x e. A )
2	1	uneqri 3349	1 |- ( A u. A ) = A

Syntax hints:   = wceq 1397   e. wcel 2202   u. cun 3198

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204

This theorem is referenced by:  unundi  3368  unundir  3369  uneqin  3458  difabs  3471  ifidss  3621  dfsn2  3683  diftpsn3  3814  unisn  3909  dfdm2  5271  fun2  5509  resasplitss  5516  xpider  6774  pm54.43  7394  plyun0  15459