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

Theorem tppreq3 4695
Description: An unordered triple is an unordered pair if one of its elements is identical with another element. (Contributed by Alexander van der Vekens, 6-Oct-2017.)
Assertion
Ref Expression
tppreq3 (𝐵 = 𝐶 → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})

Proof of Theorem tppreq3
StepHypRef Expression
1 tpeq3 4680 . . 3 (𝐶 = 𝐵 → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵, 𝐵})
21eqcoms 2746 . 2 (𝐵 = 𝐶 → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵, 𝐵})
3 tpidm23 4693 . 2 {𝐴, 𝐵, 𝐵} = {𝐴, 𝐵}
42, 3eqtrdi 2794 1 (𝐵 = 𝐶 → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  {cpr 4563  {ctp 4565
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-un 3892  df-sn 4562  df-pr 4564  df-tp 4566
This theorem is referenced by:  tpprceq3  4737  1to3vfriswmgr  28644
  Copyright terms: Public domain W3C validator