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 10845 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐵 + (𝐶 + 𝐷)) = (𝐶 + (𝐵 + 𝐷))) | |
2 | 1 | 3expb 1112 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐵 + (𝐶 + 𝐷)) = (𝐶 + (𝐵 + 𝐷))) |
3 | 2 | oveq2d 7161 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐴 + (𝐵 + (𝐶 + 𝐷))) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
4 | 3 | adantll 710 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐴 + (𝐵 + (𝐶 + 𝐷))) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
5 | addcl 10607 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 + 𝐷) ∈ ℂ) | |
6 | addass 10612 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) | |
7 | 6 | 3expa 1110 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) |
8 | 5, 7 | sylan2 592 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = (𝐴 + (𝐵 + (𝐶 + 𝐷)))) |
9 | addcl 10607 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐵 + 𝐷) ∈ ℂ) | |
10 | addass 10612 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ (𝐵 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) | |
11 | 10 | 3expa 1110 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐵 + 𝐷) ∈ ℂ) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
12 | 9, 11 | sylan2 592 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐵 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
13 | 12 | an4s 656 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐶) + (𝐵 + 𝐷)) = (𝐴 + (𝐶 + (𝐵 + 𝐷)))) |
14 | 4, 8, 13 | 3eqtr4d 2863 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 (class class class)co 7145 ℂcc 10523 + caddc 10528 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-ltxr 10668 |
This theorem is referenced by: add42 10849 add4i 10852 add4d 10856 3dvds2dec 15670 opoe 15700 ptolemy 25009 |
Copyright terms: Public domain | W3C validator |