| 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 8527 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8479 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8536 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2271 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 (class class class)co 6085 ℂcc 8178 + caddc 8183 − cmin 8499 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-setind 4684 ax-resscn 8272 ax-1cn 8273 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-addcom 8280 ax-addass 8282 ax-distr 8284 ax-i2m1 8285 ax-0id 8288 ax-rnegex 8289 ax-cnre 8291 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-sub 8501 |
| This theorem is used by: addsubass 8538 npncan 8549 nppcan 8550 nnpcan 8551 subcan2 8553 nnncan 8563 npcand 8643 nn1suc 9326 zlem1lt 9706 zltlem1 9707 peano5uzti 9759 nummac 9831 uzp1 9966 peano2uzr 9995 fz01en 10470 fzsuc2 10497 fseq1m1p1 10513 fzoss2 10592 fzoaddel2 10619 fzosplitsnm1 10638 fzosplitprm1 10664 modfzo0difsn 10846 seq3m1 10924 monoord2 10937 ser3mono 10938 seqf1oglem1 10970 seqf1oglem2 10971 expm1t 11018 expubnd 11047 bcm1k 11213 bcn2 11217 hashfzo 11278 hashfibclem 11297 hashf1 11302 seq3coll 11309 swrdfv2 11450 swrdspsleq 11454 swrdlsw 11456 ccatpfx 11488 shftlem 11596 shftfvalg 11598 shftfval 11601 iserex 12123 serf0 12136 fsumm1 12201 mptfzshft 12227 binomlem 12268 binom1dif 12272 isumsplit 12276 dvdssub2 12620 4sqlem19 13210 1259lem4 13267 1259prm 13269 ppiqub 16215 perfect1 16220 lgsquad2lem1 16322 clwwlknonex2lem2 16801 clwwlknonex2 16802 |
| Copyright terms: Public domain | W3C validator |