| 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 11169 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11537 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 (class class class)co 7391 ℂcc 11065 1c1 11068 + caddc 11070 − cmin 11408 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-po 5551 df-so 5552 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-ltxr 11215 df-sub 11410 |
| This theorem is referenced by: nn0split 13642 nn0disj 13643 elfzom1elp1fzo1 13767 sqoddm1div8 14250 wrdlenccats1lenm1 14630 ccats1pfxeq 14721 ltoddhalfle 16386 pwp1fsum 16416 flodddiv4 16440 prmop1 17065 psdpw 22223 cayhamlem1 22914 2lgslem1c 27445 2lgslem3a 27448 wlklenvm1 29779 wwlknp 30000 wwlknlsw 30004 0enwwlksnge1 30021 wlkiswwlks1 30024 wspthsnwspthsnon 30073 wspthsnonn0vne 30074 elwspths2spth 30127 wwlksext2clwwlk 30216 numclwwlk2lem1lem 30501 numclwlk2lem2f 30536 poimirlem4 38084 poimirlem10 38090 poimirlem19 38099 poimirlem28 38108 sumnnodd 46167 iccpartgtprec 47987 fmtnom1nn 48102 fmtnorec1 48107 sfprmdvdsmersenne 48173 proththdlem 48183 41prothprmlem1 48187 ppivalnnprm 48195 dfodd6 48220 evenp1odd 48223 perfectALTVlem1 48304 isubgr3stgrlem2 48550 gpgvtxedg0 48646 altgsumbcALT 48936 fllog2 49151 nnpw2blen 49163 dig2nn1st 49188 nn0sumshdiglemA 49202 nn0sumshdiglemB 49203 aacllem 50383 |
| Copyright terms: Public domain | W3C validator |