| 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 11127 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11493 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 (class class class)co 7358 ℂcc 11024 1c1 11027 + caddc 11029 − cmin 11364 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-ltxr 11171 df-sub 11366 |
| This theorem is referenced by: nn0split 13559 nn0disj 13560 elfzom1elp1fzo1 13683 sqoddm1div8 14166 wrdlenccats1lenm1 14546 ccats1pfxeq 14637 ltoddhalfle 16288 pwp1fsum 16318 flodddiv4 16342 prmop1 16966 psdpw 22113 cayhamlem1 22810 2lgslem1c 27360 2lgslem3a 27363 wlklenvm1 29695 wwlknp 29916 wwlknlsw 29920 0enwwlksnge1 29937 wlkiswwlks1 29940 wspthsnwspthsnon 29989 wspthsnonn0vne 29990 elwspths2spth 30043 wwlksext2clwwlk 30132 numclwwlk2lem1lem 30417 numclwlk2lem2f 30452 poimirlem4 37825 poimirlem10 37831 poimirlem19 37840 poimirlem28 37849 sumnnodd 45876 iccpartgtprec 47666 fmtnom1nn 47778 fmtnorec1 47783 sfprmdvdsmersenne 47849 proththdlem 47859 41prothprmlem1 47863 dfodd6 47883 evenp1odd 47886 perfectALTVlem1 47967 isubgr3stgrlem2 48213 gpgvtxedg0 48309 altgsumbcALT 48599 fllog2 48814 nnpw2blen 48826 dig2nn1st 48851 nn0sumshdiglemA 48865 nn0sumshdiglemB 48866 aacllem 50046 |
| Copyright terms: Public domain | W3C validator |