Theorem unidm 3372

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 769	. 2 |- ( ( x e. A \/ x e. A ) <-> x e. A )
2	1	uneqri 3371	1 |- ( A u. A ) = A

Syntax hints:   = wceq 1402   e. wcel 2209   u. cun 3218

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224

This theorem is referenced by:  unundi  3390  unundir  3391  uneqin  3482  difabs  3495  ifidss  3653  dfsn2  3719  diftpsn3  3851  unisn  3946  dfdm2  5317  fun2  5557  resasplitss  5564  xpider  6870  pm54.43  7526  plyun0  15760