| 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 8308 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | addcl 8135 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 5 | subadd 8360 | . . 3 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) | |
| 6 | 4, 1, 2, 5 | syl3anc 1271 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) |
| 7 | 3, 6 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 (class class class)co 6007 ℂcc 8008 + caddc 8013 − cmin 8328 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-setind 4629 ax-resscn 8102 ax-1cn 8103 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-sub 8330 |
| This theorem is referenced by: pncan2 8364 addsubass 8367 pncan3oi 8373 subid1 8377 nppcan2 8388 pncand 8469 nn1m1nn 9139 nnsub 9160 elnn0nn 9422 zrevaddcl 9508 nzadd 9510 elz2 9529 qrevaddcl 9851 irradd 9853 fzrev3 10295 elfzp1b 10305 fzrevral3 10315 fzval3 10422 seqf1oglem1 10753 seqf1oglem2 10754 subsq2 10881 bcp1nk 10996 bcp1m1 10999 bcpasc 11000 ccatalpha 11161 wrdind 11269 wrd2ind 11270 shftlem 11342 shftval5 11355 fsump1 11946 mptfzshft 11968 telfsumo 11992 fsumparts 11996 bcxmas 12015 isum1p 12018 geolim 12037 mertenslem2 12062 mertensabs 12063 eftlub 12216 effsumlt 12218 eirraplem 12303 dvdsadd 12362 prmind2 12657 fldivp1 12886 prmpwdvds 12893 pockthlem 12894 4sqlem11 12939 dvexp 15400 plyaddlem1 15436 plymullem1 15437 dvply1 15454 abssinper 15535 perfectlem1 15688 perfectlem2 15689 perfect 15690 lgsvalmod 15713 lgseisen 15768 lgsquadlem1 15771 lgsquad2lem1 15775 2sqlem10 15819 |
| Copyright terms: Public domain | W3C validator |