| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subsub4 | GIF version | ||
| Description: Law for double subtraction. (Contributed by NM, 19-Aug-2005.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| subsub4 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) − 𝐶) = (𝐴 − (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nppcan2 8285 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − (𝐵 + 𝐶)) + 𝐶) = (𝐴 − 𝐵)) | |
| 2 | simp1 999 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 3 | simp2 1000 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 4 | subcl 8253 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 5 | 2, 3, 4 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) |
| 6 | simp3 1001 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
| 7 | 3, 6 | addcld 8074 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + 𝐶) ∈ ℂ) |
| 8 | subcl 8253 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 + 𝐶) ∈ ℂ) → (𝐴 − (𝐵 + 𝐶)) ∈ ℂ) | |
| 9 | 2, 7, 8 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 + 𝐶)) ∈ ℂ) |
| 10 | subadd2 8258 | . . 3 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ (𝐴 − (𝐵 + 𝐶)) ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) = (𝐴 − (𝐵 + 𝐶)) ↔ ((𝐴 − (𝐵 + 𝐶)) + 𝐶) = (𝐴 − 𝐵))) | |
| 11 | 5, 6, 9, 10 | syl3anc 1249 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) = (𝐴 − (𝐵 + 𝐶)) ↔ ((𝐴 − (𝐵 + 𝐶)) + 𝐶) = (𝐴 − 𝐵))) |
| 12 | 1, 11 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) − 𝐶) = (𝐴 − (𝐵 + 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 980 = wceq 1372 ∈ wcel 2175 (class class class)co 5934 ℂcc 7905 + caddc 7910 − cmin 8225 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-setind 4583 ax-resscn 7999 ax-1cn 8000 ax-icn 8002 ax-addcl 8003 ax-addrcl 8004 ax-mulcl 8005 ax-addcom 8007 ax-addass 8009 ax-distr 8011 ax-i2m1 8012 ax-0id 8015 ax-rnegex 8016 ax-cnre 8018 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-id 4338 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-iota 5229 df-fun 5270 df-fv 5276 df-riota 5889 df-ov 5937 df-oprab 5938 df-mpo 5939 df-sub 8227 |
| This theorem is referenced by: sub32 8288 nnncan 8289 pnpcan 8293 addsub4 8297 subsub4d 8396 2shfti 11061 nn0seqcvgd 12282 |
| Copyright terms: Public domain | W3C validator |