Metamath Proof Explorer


Theorem tpidm13

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

Ref Expression
Assertion tpidm13 { 𝐴 , 𝐵 , 𝐴 } = { 𝐴 , 𝐵 }

Proof

Step Hyp Ref Expression
1 tprot { 𝐴 , 𝐴 , 𝐵 } = { 𝐴 , 𝐵 , 𝐴 }
2 tpidm12 { 𝐴 , 𝐴 , 𝐵 } = { 𝐴 , 𝐵 }
3 1 2 eqtr3i { 𝐴 , 𝐵 , 𝐴 } = { 𝐴 , 𝐵 }