| 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 8361 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8313 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8370 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2262 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 (class class class)co 6010 ℂcc 8013 + caddc 8018 − cmin 8333 |
| 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 4259 ax-pr 4294 ax-setind 4630 ax-resscn 8107 ax-1cn 8108 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-addass 8117 ax-distr 8119 ax-i2m1 8120 ax-0id 8123 ax-rnegex 8124 ax-cnre 8126 |
| 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 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-iota 5281 df-fun 5323 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-sub 8335 |
| This theorem is referenced by: addsubass 8372 npncan 8383 nppcan 8384 nnpcan 8385 subcan2 8387 nnncan 8397 npcand 8477 nn1suc 9145 zlem1lt 9519 zltlem1 9520 peano5uzti 9571 nummac 9638 uzp1 9773 peano2uzr 9797 fz01en 10266 fzsuc2 10292 fseq1m1p1 10308 fzoss2 10387 fzoaddel2 10413 fzosplitsnm1 10432 fzosplitprm1 10457 modfzo0difsn 10634 seq3m1 10712 monoord2 10725 ser3mono 10726 seqf1oglem1 10758 seqf1oglem2 10759 expm1t 10806 expubnd 10835 bcm1k 10999 bcn2 11003 hashfzo 11062 seq3coll 11082 swrdfv2 11216 swrdspsleq 11220 swrdlsw 11222 ccatpfx 11254 shftlem 11348 shftfvalg 11350 shftfval 11353 iserex 11871 serf0 11884 fsumm1 11948 mptfzshft 11974 binomlem 12015 binom1dif 12019 isumsplit 12023 dvdssub2 12367 4sqlem19 12953 perfect1 15693 lgsquad2lem1 15781 |
| Copyright terms: Public domain | W3C validator |