| 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 8471 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8423 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
| 4 | pncan3 8480 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
| 5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
| 6 | 3, 5 | eqtrd 2265 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 (class class class)co 6049 ℂcc 8124 + caddc 8129 − cmin 8443 |
| 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 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-setind 4658 ax-resscn 8218 ax-1cn 8219 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-addass 8228 ax-distr 8230 ax-i2m1 8231 ax-0id 8234 ax-rnegex 8235 ax-cnre 8237 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-opab 4171 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-iota 5311 df-fun 5353 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-sub 8445 |
| This theorem is referenced by: addsubass 8482 npncan 8493 nppcan 8494 nnpcan 8495 subcan2 8497 nnncan 8507 npcand 8587 nn1suc 9255 zlem1lt 9633 zltlem1 9634 peano5uzti 9685 nummac 9752 uzp1 9887 peano2uzr 9916 fz01en 10386 fzsuc2 10412 fseq1m1p1 10428 fzoss2 10507 fzoaddel2 10534 fzosplitsnm1 10553 fzosplitprm1 10579 modfzo0difsn 10756 seq3m1 10834 monoord2 10847 ser3mono 10848 seqf1oglem1 10880 seqf1oglem2 10881 expm1t 10928 expubnd 10957 bcm1k 11121 bcn2 11125 hashfzo 11185 hashfibclem 11202 seq3coll 11210 swrdfv2 11351 swrdspsleq 11355 swrdlsw 11357 ccatpfx 11389 shftlem 11497 shftfvalg 11499 shftfval 11502 iserex 12020 serf0 12033 fsumm1 12098 mptfzshft 12124 binomlem 12165 binom1dif 12169 isumsplit 12173 dvdssub2 12517 4sqlem19 13103 perfect1 15858 lgsquad2lem1 15946 clwwlknonex2lem2 16425 clwwlknonex2 16426 |
| Copyright terms: Public domain | W3C validator |