Theorem int-eqprincd 44941

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

Hypotheses

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

Assertion

Ref	Expression
int-eqprincd	⊢ (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐷))

Proof of Theorem int-eqprincd

Step	Hyp	Ref	Expression
1		int-eqprincd.1	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
2		int-eqprincd.2	. 2 ⊢ (𝜑 → 𝐶 = 𝐷)
3	1, 2	oveq12d 7428	1 ⊢ (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐷))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  (class class class)co 7410   + caddc 11107

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-ov 7413

This theorem is used by: (None)