HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem unidm 2743
Description: Idempotent law for union of classes. Theorem 23 of [Suppes] p. 27.
Assertion
Ref Expression
unidm |- (A u. A) = A

Proof of Theorem unidm
StepHypRef Expression
1 oridm 262 . 2 |- ((x e. A \/ x e. A) <-> x e. A)
21uneqri 2742 1 |- (A u. A) = A
Colors of variables: wff set class
Syntax hints:   = wceq 1298   e. wcel 1300   u. cun 2591
This theorem is referenced by:  unundi 2765  unundir 2766  uneqin 2845  uneqinOLD 2846  dfsn2 3057  unisn 3193  dfdm2 4421  ac6sfilem3 5508  mapunen 5596  pm54.43 5662  hausfillim 10303  domfldref 14365  fldsqcp2 14378  sqpeq 14383  remcon 14387  inposet 14620  dispos 14632  elfiun 15369  refssfne 15504  fclsfnflim 15614  flimfnfcls 15615  erreft2 16261
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-v 2294  df-un 2600
Copyright terms: Public domain