| 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 8330 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | addcl 8157 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 5 | subadd 8382 | . . 3 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) | |
| 6 | 4, 1, 2, 5 | syl3anc 1273 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) − 𝐵) = 𝐴 ↔ (𝐵 + 𝐴) = (𝐴 + 𝐵))) |
| 7 | 3, 6 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 (class class class)co 6018 ℂcc 8030 + caddc 8035 − cmin 8350 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-setind 4635 ax-resscn 8124 ax-1cn 8125 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-sub 8352 |
| This theorem is referenced by: pncan2 8386 addsubass 8389 pncan3oi 8395 subid1 8399 nppcan2 8410 pncand 8491 nn1m1nn 9161 nnsub 9182 elnn0nn 9444 zrevaddcl 9530 nzadd 9532 elz2 9551 qrevaddcl 9878 irradd 9880 fzrev3 10322 elfzp1b 10332 fzrevral3 10342 fzval3 10450 seqf1oglem1 10782 seqf1oglem2 10783 subsq2 10910 bcp1nk 11025 bcp1m1 11028 bcpasc 11029 ccatalpha 11194 wrdind 11307 wrd2ind 11308 shftlem 11381 shftval5 11394 fsump1 11986 mptfzshft 12008 telfsumo 12032 fsumparts 12036 bcxmas 12055 isum1p 12058 geolim 12077 mertenslem2 12102 mertensabs 12103 eftlub 12256 effsumlt 12258 eirraplem 12343 dvdsadd 12402 prmind2 12697 fldivp1 12926 prmpwdvds 12933 pockthlem 12934 4sqlem11 12979 dvexp 15441 plyaddlem1 15477 plymullem1 15478 dvply1 15495 abssinper 15576 perfectlem1 15729 perfectlem2 15730 perfect 15731 lgsvalmod 15754 lgseisen 15809 lgsquadlem1 15812 lgsquad2lem1 15816 2sqlem10 15860 |
| Copyright terms: Public domain | W3C validator |