| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pncan1 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for addition and subtraction with 1. (Contributed by Alexander van der Vekens, 3-Oct-2018.) |
| Ref | Expression |
|---|---|
| pncan1 | ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . 2 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
| 2 | 1cnd 11118 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11484 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 (class class class)co 7355 ℂcc 11015 1c1 11018 + caddc 11020 − cmin 11355 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11159 df-mnf 11160 df-ltxr 11162 df-sub 11357 |
| This theorem is referenced by: nn0split 13550 nn0disj 13551 elfzom1elp1fzo1 13674 sqoddm1div8 14157 wrdlenccats1lenm1 14537 ccats1pfxeq 14628 ltoddhalfle 16279 pwp1fsum 16309 flodddiv4 16333 prmop1 16957 psdpw 22104 cayhamlem1 22801 2lgslem1c 27351 2lgslem3a 27354 wlklenvm1 29621 wwlknp 29842 wwlknlsw 29846 0enwwlksnge1 29863 wlkiswwlks1 29866 wspthsnwspthsnon 29915 wspthsnonn0vne 29916 elwspths2spth 29969 wwlksext2clwwlk 30058 numclwwlk2lem1lem 30343 numclwlk2lem2f 30378 poimirlem4 37737 poimirlem10 37743 poimirlem19 37752 poimirlem28 37761 sumnnodd 45792 iccpartgtprec 47582 fmtnom1nn 47694 fmtnorec1 47699 sfprmdvdsmersenne 47765 proththdlem 47775 41prothprmlem1 47779 dfodd6 47799 evenp1odd 47802 perfectALTVlem1 47883 isubgr3stgrlem2 48129 gpgvtxedg0 48225 altgsumbcALT 48515 fllog2 48730 nnpw2blen 48742 dig2nn1st 48767 nn0sumshdiglemA 48781 nn0sumshdiglemB 48782 aacllem 49962 |
| Copyright terms: Public domain | W3C validator |