| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subadd4 | GIF version | ||
| Description: Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by NM, 24-Aug-2006.) |
| Ref | Expression |
|---|---|
| subadd4 | ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 − 𝐵) − (𝐶 − 𝐷)) = ((𝐴 + 𝐷) − (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 8356 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | subsub2 8385 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → ((𝐴 − 𝐵) − (𝐶 − 𝐷)) = ((𝐴 − 𝐵) + (𝐷 − 𝐶))) | |
| 3 | 2 | 3expb 1228 | . . 3 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 − 𝐵) − (𝐶 − 𝐷)) = ((𝐴 − 𝐵) + (𝐷 − 𝐶))) |
| 4 | 1, 3 | sylan 283 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 − 𝐵) − (𝐶 − 𝐷)) = ((𝐴 − 𝐵) + (𝐷 − 𝐶))) |
| 5 | addsub4 8400 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐷 ∈ ℂ) ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → ((𝐴 + 𝐷) − (𝐵 + 𝐶)) = ((𝐴 − 𝐵) + (𝐷 − 𝐶))) | |
| 6 | 5 | an42s 591 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐷) − (𝐵 + 𝐶)) = ((𝐴 − 𝐵) + (𝐷 − 𝐶))) |
| 7 | 4, 6 | eqtr4d 2265 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 − 𝐵) − (𝐶 − 𝐷)) = ((𝐴 + 𝐷) − (𝐵 + 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 (class class class)co 6007 ℂcc 8008 + caddc 8013 − cmin 8328 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-setind 4629 ax-resscn 8102 ax-1cn 8103 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-sub 8330 |
| This theorem is referenced by: sub4 8402 subadd4d 8516 |
| Copyright terms: Public domain | W3C validator |