| 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 8525 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8477 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8534 | . . 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 8177 + caddc 8182 − cmin 8497 |
| 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 8271 ax-1cn 8272 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 |
| 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 8499 |
| This theorem is used by: addsubass 8536 npncan 8547 nppcan 8548 nnpcan 8549 subcan2 8551 nnncan 8561 npcand 8641 nn1suc 9324 zlem1lt 9703 zltlem1 9704 peano5uzti 9756 nummac 9823 uzp1 9958 peano2uzr 9987 fz01en 10461 fzsuc2 10488 fseq1m1p1 10504 fzoss2 10583 fzoaddel2 10610 fzosplitsnm1 10629 fzosplitprm1 10655 modfzo0difsn 10834 seq3m1 10912 monoord2 10925 ser3mono 10926 seqf1oglem1 10958 seqf1oglem2 10959 expm1t 11006 expubnd 11035 bcm1k 11200 bcn2 11204 hashfzo 11265 hashfibclem 11284 hashf1 11289 seq3coll 11296 swrdfv2 11437 swrdspsleq 11441 swrdlsw 11443 ccatpfx 11475 shftlem 11583 shftfvalg 11585 shftfval 11588 iserex 12107 serf0 12120 fsumm1 12185 mptfzshft 12211 binomlem 12252 binom1dif 12256 isumsplit 12260 dvdssub2 12604 4sqlem19 13190 perfect1 16118 lgsquad2lem1 16212 clwwlknonex2lem2 16691 clwwlknonex2 16692 |
| Copyright terms: Public domain | W3C validator |