| 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 8519 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8471 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8528 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2271 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 (class class class)co 6079 ℂcc 8171 + caddc 8176 − cmin 8491 |
| 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 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 4247 ax-pow 4309 ax-pr 4344 ax-setind 4682 ax-resscn 8265 ax-1cn 8266 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 |
| This theorem 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 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-iota 5335 df-fun 5377 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-sub 8493 |
| This theorem is referenced by: addsubass 8530 npncan 8541 nppcan 8542 nnpcan 8543 subcan2 8545 nnncan 8555 npcand 8635 nn1suc 9306 zlem1lt 9684 zltlem1 9685 peano5uzti 9737 nummac 9804 uzp1 9939 peano2uzr 9968 fz01en 10442 fzsuc2 10469 fseq1m1p1 10485 fzoss2 10564 fzoaddel2 10591 fzosplitsnm1 10610 fzosplitprm1 10636 modfzo0difsn 10815 seq3m1 10893 monoord2 10906 ser3mono 10907 seqf1oglem1 10939 seqf1oglem2 10940 expm1t 10987 expubnd 11016 bcm1k 11181 bcn2 11185 hashfzo 11246 hashfibclem 11265 hashf1 11270 seq3coll 11277 swrdfv2 11418 swrdspsleq 11422 swrdlsw 11424 ccatpfx 11456 shftlem 11564 shftfvalg 11566 shftfval 11569 iserex 12088 serf0 12101 fsumm1 12166 mptfzshft 12192 binomlem 12233 binom1dif 12237 isumsplit 12241 dvdssub2 12585 4sqlem19 13171 perfect1 16095 lgsquad2lem1 16183 clwwlknonex2lem2 16662 clwwlknonex2 16663 |
| Copyright terms: Public domain | W3C validator |