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 7936 | . . . 4 ⊢ -𝐵 = (0 − 𝐵) | |
2 | 1 | oveq2i 5785 | . . 3 ⊢ (𝐴 + -𝐵) = (𝐴 + (0 − 𝐵)) |
3 | 2 | a1i 9 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 + (0 − 𝐵))) |
4 | 0cn 7758 | . . 3 ⊢ 0 ∈ ℂ | |
5 | addsubass 7972 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 + (0 − 𝐵))) | |
6 | 4, 5 | mp3an2 1303 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 + (0 − 𝐵))) |
7 | simpl 108 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
8 | 7 | addid1d 7911 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 0) = 𝐴) |
9 | 8 | oveq1d 5789 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 0) − 𝐵) = (𝐴 − 𝐵)) |
10 | 3, 6, 9 | 3eqtr2d 2178 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 (class class class)co 5774 ℂcc 7618 0cc0 7620 + caddc 7623 − cmin 7933 -cneg 7934 |
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-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-setind 4452 ax-resscn 7712 ax-1cn 7713 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-sub 7935 df-neg 7936 |
This theorem is referenced by: negdi2 8020 negsubdi2 8021 resubcli 8025 resubcl 8026 negsubi 8040 negsubd 8079 submul2 8161 mulsub 8163 subap0 8405 divsubdirap 8468 zsubcl 9095 elz2 9122 qsubcl 9430 rexsub 9636 fzsubel 9840 expsubap 10341 binom2sub 10405 resub 10642 imsub 10650 cjsub 10664 cjreim 10675 absdiflt 10864 absdifle 10865 abs2dif2 10879 subcn2 11080 efsub 11387 efi4p 11424 sinsub 11447 cossub 11448 demoivreALT 11480 dvdssub 11538 modgcd 11679 |
Copyright terms: Public domain | W3C validator |