| 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 11341 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11709 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 (class class class)co 7451 ℂcc 11237 1c1 11240 + caddc 11242 − cmin 11580 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 |
| This theorem is used by: nn0split 13817 nn0disj 13818 elfzom1elp1fzo1 13942 sqoddm1div8 14428 wrdlenccats1lenm1 14812 ccats1pfxeq 14905 ltoddhalfle 16575 pwp1fsum 16605 flodddiv4 16629 prmop1 17260 psdpw 22546 cayhamlem1 23239 2lgslem1c 27777 2lgslem3a 27780 wlklenvm1 30259 wwlknp 30489 wwlknlsw 30493 0enwwlksnge1 30510 wlkiswwlks1 30513 wspthsnwspthsnon 30562 wspthsnonn0vne 30563 elwspths2spth 30616 wwlksext2clwwlk 30705 numclwwlk2lem1lem 31000 numclwlk2lem2f 31035 poimirlem4 38810 poimirlem10 38816 poimirlem19 38825 poimirlem28 38834 sumnnodd 46915 iccpartgtprec 48775 fmtnom1nn 48890 fmtnorec1 48895 sfprmdvdsmersenne 48961 proththdlem 48971 41prothprmlem1 48975 ppivalnnprm 48983 dfodd6 49008 evenp1odd 49011 perfectALTVlem1 49092 isubgr3stgrlem2 49338 gpgvtxedg0 49434 altgsumbcALT 49796 fllog2 50011 nnpw2blen 50023 dig2nn1st 50048 nn0sumshdiglemA 50062 nn0sumshdiglemB 50063 aacllem 51367 |
| Copyright terms: Public domain | W3C validator |