Theorem int-eqtransd 45015

Description: EqualityTransitivity generator rule. (Contributed by Stanislas Polu, 7-Apr-2020.)

Hypotheses

Ref	Expression
int-eqtransd.1	⊢ (𝜑 → 𝐴 = 𝐵)
int-eqtransd.2	⊢ (𝜑 → 𝐵 = 𝐶)

Assertion

Ref	Expression
int-eqtransd	⊢ (𝜑 → 𝐴 = 𝐶)

Proof of Theorem int-eqtransd

Step	Hyp	Ref	Expression
1		int-eqtransd.1	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
2		int-eqtransd.2	. 2 ⊢ (𝜑 → 𝐵 = 𝐶)
3	1, 2	eqtrd 2797	1 ⊢ (𝜑 → 𝐴 = 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1570

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2754

This theorem is used by: (None)