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 7176 | 1 ⊢ (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 (class class class)co 7158 + caddc 10542 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-iota 6316 df-fv 6365 df-ov 7161 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |