Theorem tpidm 4730

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 4727	. 2 ⊢ {𝐴, 𝐴, 𝐴} = {𝐴, 𝐴}
2		dfsn2 4610	. 2 ⊢ {𝐴} = {𝐴, 𝐴}
3	1, 2	eqtr4i 2756	1 ⊢ {𝐴, 𝐴, 𝐴} = {𝐴}

Syntax hints:   = wceq 1540  {csn 4597  {cpr 4599  {ctp 4601

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3457  df-un 3927  df-pr 4600  df-tp 4602

This theorem is referenced by: (None)