| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pncan | GIF version | ||
| Description: Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| pncan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 2 | simpl 109 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8479 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | addcl 8305 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 5 | subadd 8531 | . . 3 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) | |
| 6 | 4, 1, 2, 5 | syl3anc 1278 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) |
| 7 | 3, 6 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = 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: pncan2 8535 addsubass 8538 pncan3oi 8544 subid1 8548 nppcan2 8559 pncand 8640 nn1m1nn 9325 nnsub 9346 elnn0nn 9610 zrevaddcl 9700 nzadd 9702 elz2 9721 qrevaddcl 10054 irradd 10056 fzrev3 10505 elfzp1b 10515 fzrevral3 10525 fzval3 10633 seqf1oglem1 10971 seqf1oglem2 10972 subsq2 11099 bcp1nk 11216 bcp1m1 11219 bcpasc 11220 hashfibclem 11298 ccatalpha 11397 wrdind 11510 wrd2ind 11511 shftlem 11597 shftval5 11610 fsump1 12206 mptfzshft 12228 telfsumo 12252 fsumparts 12256 bcxmas 12275 isum1p 12278 geolim 12297 mertenslem2 12322 mertensabs 12323 eftlub 12476 effsumlt 12478 eirraplem 12563 dvdsadd 12622 prmind2 12917 fldivp1 13150 prmpwdvds 13157 pockthlem 13158 4sqlem11 13203 dvexp 15903 plyaddlem1 15939 plymullem1 15940 dvply1 15957 abssinper 16039 ppiprm 16220 ppinprm 16221 chtprm 16222 chtnprm 16223 chtqub 16257 perfectlem1 16260 perfectlem2 16261 perfect 16262 bcp1ctr 16267 lgsvalmod 16304 lgseisen 16359 lgsquadlem1 16362 lgsquad2lem1 16366 2sqlem10 16410 |
| Copyright terms: Public domain | W3C validator |