| 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 8372 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | addcl 8200 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 5 | subadd 8424 | . . 3 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) | |
| 6 | 4, 1, 2, 5 | syl3anc 1274 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) |
| 7 | 3, 6 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 (class class class)co 6028 ℂcc 8073 + caddc 8078 − cmin 8392 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-setind 4641 ax-resscn 8167 ax-1cn 8168 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-sub 8394 |
| This theorem is referenced by: pncan2 8428 addsubass 8431 pncan3oi 8437 subid1 8441 nppcan2 8452 pncand 8533 nn1m1nn 9203 nnsub 9224 elnn0nn 9486 zrevaddcl 9574 nzadd 9576 elz2 9595 qrevaddcl 9922 irradd 9924 fzrev3 10367 elfzp1b 10377 fzrevral3 10387 fzval3 10495 seqf1oglem1 10827 seqf1oglem2 10828 subsq2 10955 bcp1nk 11070 bcp1m1 11073 bcpasc 11074 ccatalpha 11239 wrdind 11352 wrd2ind 11353 shftlem 11439 shftval5 11452 fsump1 12044 mptfzshft 12066 telfsumo 12090 fsumparts 12094 bcxmas 12113 isum1p 12116 geolim 12135 mertenslem2 12160 mertensabs 12161 eftlub 12314 effsumlt 12316 eirraplem 12401 dvdsadd 12460 prmind2 12755 fldivp1 12984 prmpwdvds 12991 pockthlem 12992 4sqlem11 13037 dvexp 15505 plyaddlem1 15541 plymullem1 15542 dvply1 15559 abssinper 15640 perfectlem1 15796 perfectlem2 15797 perfect 15798 lgsvalmod 15821 lgseisen 15876 lgsquadlem1 15879 lgsquad2lem1 15883 2sqlem10 15927 |
| Copyright terms: Public domain | W3C validator |