| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > npcan | GIF version | ||
| Description: Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| npcan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 8488 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8440 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8497 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2267 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 (class class class)co 6058 ℂcc 8141 + caddc 8146 − cmin 8460 |
| 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 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-setind 4664 ax-resscn 8235 ax-1cn 8236 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-br 4115 df-opab 4177 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-iota 5317 df-fun 5359 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-sub 8462 |
| This theorem is referenced by: addsubass 8499 npncan 8510 nppcan 8511 nnpcan 8512 subcan2 8514 nnncan 8524 npcand 8604 nn1suc 9273 zlem1lt 9651 zltlem1 9652 peano5uzti 9704 nummac 9771 uzp1 9906 peano2uzr 9935 fz01en 10408 fzsuc2 10435 fseq1m1p1 10451 fzoss2 10530 fzoaddel2 10557 fzosplitsnm1 10576 fzosplitprm1 10602 modfzo0difsn 10781 seq3m1 10859 monoord2 10872 ser3mono 10873 seqf1oglem1 10905 seqf1oglem2 10906 expm1t 10953 expubnd 10982 bcm1k 11147 bcn2 11151 hashfzo 11212 hashfibclem 11231 seq3coll 11239 swrdfv2 11380 swrdspsleq 11384 swrdlsw 11386 ccatpfx 11418 shftlem 11526 shftfvalg 11528 shftfval 11531 iserex 12049 serf0 12062 fsumm1 12127 mptfzshft 12153 binomlem 12194 binom1dif 12198 isumsplit 12202 dvdssub2 12546 4sqlem19 13132 perfect1 15978 lgsquad2lem1 16066 clwwlknonex2lem2 16545 clwwlknonex2 16546 |
| Copyright terms: Public domain | W3C validator |