Theorem tpidm 4764

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

Assertion

Ref	Expression
tpidm	⊢ {𝐴, 𝐴, 𝐴} = {𝐴}

Proof of Theorem tpidm

Step	Hyp	Ref	Expression
1		tpidm12 4761	. 2 ⊢ {𝐴, 𝐴, 𝐴} = {𝐴, 𝐴}
2		dfsn2 4645	. 2 ⊢ {𝐴} = {𝐴, 𝐴}
3	1, 2	eqtr4i 2767	1 ⊢ {𝐴, 𝐴, 𝐴} = {𝐴}

Syntax hints:   = wceq 1538  {csn 4632  {cpr 4634  {ctp 4636

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1541  df-ex 1778  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-v 3481  df-un 3969  df-pr 4635  df-tp 4637

This theorem is referenced by: (None)