Theorem equtr2 2030

Description: Equality is a left-Euclidean binary relation. Uncurried (imported) form of equeucl 2027. (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

Step	Hyp	Ref	Expression
1		equeucl 2027	. 2 ⊢ (𝑥 = 𝑧 → (𝑦 = 𝑧 → 𝑥 = 𝑦))
2	1	imp 407	1 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → 𝑥 = 𝑦)

Syntax hints:   → wi 4   ∧ wa 396

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

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783

This theorem is referenced by:  nfeqf  2381  mo3  2564  mo4  2566  madurid  21793  dchrisumlema  26636  funpartfun  34245  wl-mo3t  35731