| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tpidm12 | GIF version | ||
| Description: Unordered triple {𝐴, 𝐴, 𝐵} is just an overlong way to write {𝐴, 𝐵}. (Contributed by David A. Wheeler, 10-May-2015.) |
| Ref | Expression |
|---|---|
| tpidm12 | ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsn2 3652 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | 1 | uneq1i 3327 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = ({𝐴, 𝐴} ∪ {𝐵}) |
| 3 | df-pr 3645 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 4 | df-tp 3646 | . 2 ⊢ {𝐴, 𝐴, 𝐵} = ({𝐴, 𝐴} ∪ {𝐵}) | |
| 5 | 2, 3, 4 | 3eqtr4ri 2238 | 1 ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1373 ∪ cun 3168 {csn 3638 {cpr 3639 {ctp 3640 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-v 2775 df-un 3174 df-pr 3645 df-tp 3646 |
| This theorem is referenced by: tpidm13 3738 tpidm23 3739 tpidm 3740 |
| Copyright terms: Public domain | W3C validator |