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

Theorem preqr1g 4325
Description: Reverse equality lemma for unordered pairs. If two unordered pairs have the same second element, the first elements are equal. Closed form of preqr1 4319. (Contributed by AV, 29-Jan-2021.) (Revised by AV, 18-Sep-2021.)
Assertion
Ref Expression
preqr1g ((𝐴𝑉𝐵𝑊) → ({𝐴, 𝐶} = {𝐵, 𝐶} → 𝐴 = 𝐵))

Proof of Theorem preqr1g
StepHypRef Expression
1 simpl 472 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐴𝑉)
2 simpr 476 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
31, 2preq1b 4317 . 2 ((𝐴𝑉𝐵𝑊) → ({𝐴, 𝐶} = {𝐵, 𝐶} ↔ 𝐴 = 𝐵))
43biimpd 218 1 ((𝐴𝑉𝐵𝑊) → ({𝐴, 𝐶} = {𝐵, 𝐶} → 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  {cpr 4127
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  df-un 3545  df-sn 4126  df-pr 4128
This theorem is referenced by:  umgr2adedgspth  41155
  Copyright terms: Public domain W3C validator