| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > negsub | GIF version | ||
| Description: Relationship between subtraction and negative. Theorem I.3 of [Apostol] p. 18. (Contributed by NM, 21-Jan-1997.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| negsub | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-neg 8246 | . . . 4 ⊢ -𝐵 = (0 − 𝐵) | |
| 2 | 1 | oveq2i 5955 | . . 3 ⊢ (𝐴 + -𝐵) = (𝐴 + (0 − 𝐵)) |
| 3 | 2 | a1i 9 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 + (0 − 𝐵))) |
| 4 | 0cn 8064 | . . 3 ⊢ 0 ∈ ℂ | |
| 5 | addsubass 8282 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 + (0 − 𝐵))) | |
| 6 | 4, 5 | mp3an2 1338 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 + (0 − 𝐵))) |
| 7 | simpl 109 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 8 | 7 | addridd 8221 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 0) = 𝐴) |
| 9 | 8 | oveq1d 5959 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 − 𝐵)) |
| 10 | 3, 6, 9 | 3eqtr2d 2244 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2176 (class class class)co 5944 ℂcc 7923 0cc0 7925 + caddc 7928 − cmin 8243 -cneg 8244 |
| 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 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-setind 4585 ax-resscn 8017 ax-1cn 8018 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-addcom 8025 ax-addass 8027 ax-distr 8029 ax-i2m1 8030 ax-0id 8033 ax-rnegex 8034 ax-cnre 8036 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-reu 2491 df-rab 2493 df-v 2774 df-sbc 2999 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4045 df-opab 4106 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-iota 5232 df-fun 5273 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-sub 8245 df-neg 8246 |
| This theorem is referenced by: negdi2 8330 negsubdi2 8331 resubcli 8335 resubcl 8336 negsubi 8350 negsubd 8389 submul2 8471 mulsub 8473 subap0 8716 divsubdirap 8781 zsubcl 9413 difgtsumgt 9442 elz2 9444 qsubcl 9759 rexsub 9975 fzsubel 10182 expsubap 10732 binom2sub 10798 resub 11181 imsub 11189 cjsub 11203 cjreim 11214 absdiflt 11403 absdifle 11404 abs2dif2 11418 subcn2 11622 efsub 11992 efi4p 12028 sinsub 12051 cossub 12052 demoivreALT 12085 dvdssub 12149 modgcd 12312 gzsubcl 12703 cnfldsub 14337 wilthlem1 15452 lgsvalmod 15496 |
| Copyright terms: Public domain | W3C validator |