Theorem tpidm13 3733

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

Assertion

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

Proof of Theorem tpidm13

Step	Hyp	Ref	Expression
1		tprot 3726	. 2 |- { A , A , B } = { A , B , A }
2		tpidm12 3732	. 2 |- { A , A , B } = { A , B }
3	1, 2	eqtr3i 2228	1 |- { A , B , A } = { A , B }

Syntax hints:   = wceq 1373   {cpr 3634   {ctp 3635

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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3or 982  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-tp 3641

This theorem is referenced by: (None)