Theorem tpidm23 4717

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

Step	Hyp	Ref	Expression
1		tprot 4709	. 2 ⊢ {𝐴, 𝐵, 𝐵} = {𝐵, 𝐵, 𝐴}
2		tpidm12 4715	. 2 ⊢ {𝐵, 𝐵, 𝐴} = {𝐵, 𝐴}
3		prcom 4692	. 2 ⊢ {𝐵, 𝐴} = {𝐴, 𝐵}
4	1, 2, 3	3eqtri 2787	1 ⊢ {𝐴, 𝐵, 𝐵} = {𝐴, 𝐵}

This proof depends on syntax axioms:   = wceq 1570  {cpr 4585  {ctp 4587

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 3903  df-sn 4584  df-pr 4586  df-tp 4588

This theorem is used by:  tppreq3  4719  fntpb  7203  hashtpg  14597  hash3tpde  14605  degenmgm2opdm  19099