Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > unidm | Unicode version |
Description: Idempotent law for union of classes. Theorem 23 of [Suppes] p. 27. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
unidm |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oridm 706 | . 2 | |
2 | 1 | uneqri 3114 | 1 |
Colors of variables: wff set class |
Syntax hints: wceq 1284 wcel 1433 cun 2971 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 df-un 2977 |
This theorem is referenced by: unundi 3133 unundir 3134 uneqin 3215 difabs 3228 dfsn2 3412 diftpsn3 3527 unisn 3617 dfdm2 4872 fun2 5084 resasplitss 5089 xpiderm 6200 pm54.43 6459 |
Copyright terms: Public domain | W3C validator |