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

Theorem equtr2 2000
 Description: Equality is a left-Euclidean binary relation. Uncurried (imported) form of equeucl 1997. (Contributed by NM, 12-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by BJ, 11-Apr-2021.)
Assertion
Ref Expression
equtr2 ((𝑥 = 𝑧𝑦 = 𝑧) → 𝑥 = 𝑦)

Proof of Theorem equtr2
StepHypRef Expression
1 equeucl 1997 . 2 (𝑥 = 𝑧 → (𝑦 = 𝑧𝑥 = 𝑦))
21imp 444 1 ((𝑥 = 𝑧𝑦 = 𝑧) → 𝑥 = 𝑦)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981 This theorem depends on definitions:  df-bi 197  df-an 385  df-ex 1745 This theorem is referenced by:  nfeqf  2337  mo3  2536  madurid  20498  dchrisumlema  25222  funpartfun  32175  bj-ssbequ1  32769  bj-mo3OLD  32957  wl-mo3t  33488
 Copyright terms: Public domain W3C validator