| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > add4 | Structured version Visualization version GIF version | ||
| Description: Rearrangement of 4 terms in a sum. (Contributed by NM, 13-Nov-1999.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| add4 | ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | add12 11399 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐵 + (𝐶 + 𝐷)) = (𝐶 + (𝐵 + 𝐷))) | |
| 2 | 1 | 3expb 1120 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐵 + (𝐶 + 𝐷)) = (𝐶 + (𝐵 + 𝐷))) |
| 3 | 2 | oveq2d 7406 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐴 + (𝐵 + (𝐶 + 𝐷))) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
| 4 | 3 | adantll 714 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐴 + (𝐵 + (𝐶 + 𝐷))) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
| 5 | addcl 11157 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 + 𝐷) ∈ ℂ) | |
| 6 | addass 11162 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) | |
| 7 | 6 | 3expa 1118 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) |
| 8 | 5, 7 | sylan2 593 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) |
| 9 | addcl 11157 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐵 + 𝐷) ∈ ℂ) | |
| 10 | addass 11162 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ (𝐵 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) | |
| 11 | 10 | 3expa 1118 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐵 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
| 12 | 9, 11 | sylan2 593 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐵 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
| 13 | 12 | an4s 660 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
| 14 | 4, 8, 13 | 3eqtr4d 2775 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 (class class class)co 7390 ℂcc 11073 + caddc 11078 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-ov 7393 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-ltxr 11220 |
| This theorem is referenced by: add42 11403 add4i 11406 add4d 11410 3dvds2dec 16310 opoe 16340 ptolemy 26412 |
| Copyright terms: Public domain | W3C validator |