| 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 23 | . 2 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
| 2 | 1cnd 11198 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11566 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 (class class class)co 7408 ℂcc 11094 1c1 11097 + caddc 11099 − cmin 11437 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11241 df-mnf 11242 df-ltxr 11244 df-sub 11439 |
| This theorem is referenced by: nn0split 13667 nn0disj 13668 elfzom1elp1fzo1 13792 sqoddm1div8 14275 wrdlenccats1lenm1 14656 ccats1pfxeq 14747 ltoddhalfle 16415 pwp1fsum 16445 flodddiv4 16469 prmop1 17094 psdpw 22298 cayhamlem1 22988 2lgslem1c 27519 2lgslem3a 27522 wlklenvm1 29908 wwlknp 30129 wwlknlsw 30133 0enwwlksnge1 30150 wlkiswwlks1 30153 wspthsnwspthsnon 30202 wspthsnonn0vne 30203 elwspths2spth 30256 wwlksext2clwwlk 30345 numclwwlk2lem1lem 30630 numclwlk2lem2f 30665 poimirlem4 38158 poimirlem10 38164 poimirlem19 38173 poimirlem28 38182 sumnnodd 46233 iccpartgtprec 48053 fmtnom1nn 48168 fmtnorec1 48173 sfprmdvdsmersenne 48239 proththdlem 48249 41prothprmlem1 48253 ppivalnnprm 48261 dfodd6 48286 evenp1odd 48289 perfectALTVlem1 48370 isubgr3stgrlem2 48616 gpgvtxedg0 48712 altgsumbcALT 49013 fllog2 49228 nnpw2blen 49240 dig2nn1st 49265 nn0sumshdiglemA 49279 nn0sumshdiglemB 49280 aacllem 50470 |
| Copyright terms: Public domain | W3C validator |