MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tpidm23 Structured version   Unicode version

Theorem tpidm23 3907
Description: Unordered triple  { A ,  B ,  B } is just an overlong way to write  { A ,  B }. (Contributed by David A. Wheeler, 10-May-2015.)
Assertion
Ref Expression
tpidm23  |-  { A ,  B ,  B }  =  { A ,  B }

Proof of Theorem tpidm23
StepHypRef Expression
1 tprot 3899 . 2  |-  { A ,  B ,  B }  =  { B ,  B ,  A }
2 tpidm12 3905 . 2  |-  { B ,  B ,  A }  =  { B ,  A }
3 prcom 3882 . 2  |-  { B ,  A }  =  { A ,  B }
41, 2, 33eqtri 2460 1  |-  { A ,  B ,  B }  =  { A ,  B }
Colors of variables: wff set class
Syntax hints:    = wceq 1652   {cpr 3815   {ctp 3816
This theorem is referenced by:  tppreq3  3909  hashtpg  11691
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-v 2958  df-un 3325  df-sn 3820  df-pr 3821  df-tp 3822
  Copyright terms: Public domain W3C validator