| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tpidm12 | Structured version Visualization version 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 4595 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | 1 | uneq1i 4118 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = ({𝐴, 𝐴} ∪ {𝐵}) |
| 3 | df-pr 4585 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 4 | df-tp 4587 | . 2 ⊢ {𝐴, 𝐴, 𝐵} = ({𝐴, 𝐴} ∪ {𝐵}) | |
| 5 | 2, 3, 4 | 3eqtr4ri 2771 | 1 ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∪ cun 3901 {csn 4582 {cpr 4584 {ctp 4586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-v 3444 df-un 3908 df-pr 4585 df-tp 4587 |
| This theorem is referenced by: tpidm13 4715 tpidm23 4716 tpidm 4717 fntpb 7165 hashtpg 14420 hash3tpde 14428 |
| Copyright terms: Public domain | W3C validator |