Metamath Proof Explorer
Description: Unordered triple { A , A , B } is just an overlong way to write
{ A , B } . (Contributed by David A. Wheeler, 10-May-2015)
|
|
Ref |
Expression |
|
Assertion |
tpidm12 |
|
Proof
Step |
Hyp |
Ref |
Expression |
1 |
|
dfsn2 |
|
2 |
1
|
uneq1i |
|
3 |
|
df-pr |
|
4 |
|
df-tp |
|
5 |
2 3 4
|
3eqtr4ri |
|