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

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

Proof of Theorem tpidm23
StepHypRef Expression
1 tprot 4700 . 2 {𝐴, 𝐵, 𝐵} = {𝐵, 𝐵, 𝐴}
2 tpidm12 4706 . 2 {𝐵, 𝐵, 𝐴} = {𝐵, 𝐴}
3 prcom 4683 . 2 {𝐵, 𝐴} = {𝐴, 𝐵}
41, 2, 33eqtri 2757 1 {𝐴, 𝐵, 𝐵} = {𝐴, 𝐵}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  {cpr 4576  {ctp 4578
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-tru 1544  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3436  df-un 3905  df-sn 4575  df-pr 4577  df-tp 4579
This theorem is referenced by:  tppreq3  4710  fntpb  7138  hashtpg  14384  hash3tpde  14392
  Copyright terms: Public domain W3C validator