| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > npcan | GIF version | ||
| Description: Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| npcan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 8333 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8285 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8342 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2262 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 (class class class)co 5994 ℂcc 7985 + caddc 7990 − cmin 8305 |
| 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 4201 ax-pow 4257 ax-pr 4292 ax-setind 4626 ax-resscn 8079 ax-1cn 8080 ax-icn 8082 ax-addcl 8083 ax-addrcl 8084 ax-mulcl 8085 ax-addcom 8087 ax-addass 8089 ax-distr 8091 ax-i2m1 8092 ax-0id 8095 ax-rnegex 8096 ax-cnre 8098 |
| 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 3888 df-br 4083 df-opab 4145 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-iota 5274 df-fun 5316 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-sub 8307 |
| This theorem is referenced by: addsubass 8344 npncan 8355 nppcan 8356 nnpcan 8357 subcan2 8359 nnncan 8369 npcand 8449 nn1suc 9117 zlem1lt 9491 zltlem1 9492 peano5uzti 9543 nummac 9610 uzp1 9744 peano2uzr 9768 fz01en 10237 fzsuc2 10263 fseq1m1p1 10279 fzoss2 10358 fzoaddel2 10383 fzosplitsnm1 10402 fzosplitprm1 10427 modfzo0difsn 10604 seq3m1 10682 monoord2 10695 ser3mono 10696 seqf1oglem1 10728 seqf1oglem2 10729 expm1t 10776 expubnd 10805 bcm1k 10969 bcn2 10973 hashfzo 11031 seq3coll 11051 swrdfv2 11181 swrdspsleq 11185 swrdlsw 11187 ccatpfx 11219 shftlem 11313 shftfvalg 11315 shftfval 11318 iserex 11836 serf0 11849 fsumm1 11913 mptfzshft 11939 binomlem 11980 binom1dif 11984 isumsplit 11988 dvdssub2 12332 4sqlem19 12918 perfect1 15657 lgsquad2lem1 15745 |
| Copyright terms: Public domain | W3C validator |