Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > add4d | GIF version |
Description: Rearrangement of 4 terms in a sum. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
addd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
addd.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
addd.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
add4d.4 | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
Ref | Expression |
---|---|
add4d | ⊢ (𝜑 → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | addd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | addd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
3 | addd.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
4 | add4d.4 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
5 | add4 8051 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) | |
6 | 1, 2, 3, 4, 5 | syl22anc 1228 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1342 ∈ wcel 2135 (class class class)co 5837 ℂcc 7743 + caddc 7748 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 ax-addcl 7841 ax-addcom 7845 ax-addass 7847 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-rex 2448 df-v 2724 df-un 3116 df-sn 3577 df-pr 3578 df-op 3580 df-uni 3785 df-br 3978 df-iota 5148 df-fv 5191 df-ov 5840 |
This theorem is referenced by: apadd1 8498 binom3 10562 readd 10801 imadd 10809 max0addsup 11151 bdtri 11171 efi4p 11648 binom4 13464 |
Copyright terms: Public domain | W3C validator |