| Mathbox for Stanislas Polu |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > int-eqprincd | Structured version Visualization version GIF version | ||
| Description: PrincipleOfEquality generator rule. (Contributed by Stanislas Polu, 7-Apr-2020.) |
| Ref | Expression |
|---|---|
| int-eqprincd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| int-eqprincd.2 | ⊢ (𝜑 → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| int-eqprincd | ⊢ (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | int-eqprincd.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | int-eqprincd.2 | . 2 ⊢ (𝜑 → 𝐶 = 𝐷) | |
| 3 | 1, 2 | oveq12d 7438 | 1 ⊢ (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 (class class class)co 7420 + caddc 11203 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-iota 6494 df-fv 6546 df-ov 7423 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |