| 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 8478 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | addcl 8304 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 5 | subadd 8530 | . . 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 8177 + caddc 8182 − cmin 8498 |
| 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 8500 |
| This theorem is used by: pncan2 8534 addsubass 8537 pncan3oi 8543 subid1 8547 nppcan2 8558 pncand 8639 nn1m1nn 9324 nnsub 9345 elnn0nn 9609 zrevaddcl 9699 nzadd 9701 elz2 9720 qrevaddcl 10053 irradd 10055 fzrev3 10504 elfzp1b 10514 fzrevral3 10524 fzval3 10632 seqf1oglem1 10969 seqf1oglem2 10970 subsq2 11097 bcp1nk 11214 bcp1m1 11217 bcpasc 11218 hashfibclem 11296 ccatalpha 11395 wrdind 11508 wrd2ind 11509 shftlem 11595 shftval5 11608 fsump1 12203 mptfzshft 12225 telfsumo 12249 fsumparts 12253 bcxmas 12272 isum1p 12275 geolim 12294 mertenslem2 12319 mertensabs 12320 eftlub 12473 effsumlt 12475 eirraplem 12560 dvdsadd 12619 prmind2 12914 fldivp1 13147 prmpwdvds 13154 pockthlem 13155 4sqlem11 13200 dvexp 15861 plyaddlem1 15897 plymullem1 15898 dvply1 15915 abssinper 15997 ppiprm 16170 ppinprm 16171 perfectlem1 16197 perfectlem2 16198 perfect 16199 bcp1ctr 16204 lgsvalmod 16236 lgseisen 16291 lgsquadlem1 16294 lgsquad2lem1 16298 2sqlem10 16342 |
| Copyright terms: Public domain | W3C validator |