Theorem tpidm12 3792

Description: Unordered triple { A , A , B } is just an overlong way to write { A , B }. (Contributed by David A. Wheeler, 10-May-2015.)

Assertion

Ref	Expression
tpidm12	|- { A , A , B } = { A , B }

Proof of Theorem tpidm12

Step	Hyp	Ref	Expression
1		dfsn2 3705	. . 3 |- { A } = { A , A }
2	1	uneq1i 3371	. 2 |- ( { A } u. { B } ) = ( { A , A } u. { B } )
3		df-pr 3698	. 2 |- { A , B } = ( { A } u. { B } )
4		df-tp 3699	. 2 |- { A , A , B } = ( { A , A } u. { B } )
5	2, 3, 4	3eqtr4ri 2266	1 |- { A , A , B } = { A , B }

Syntax hints:   = wceq 1398   u. cun 3211   {csn 3691   {cpr 3692   {ctp 3693

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3217  df-pr 3698  df-tp 3699

This theorem is referenced by:  tpidm13  3793  tpidm23  3794  tpidm  3795