| 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 11139 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2 | pncand 11506 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7367 ℂcc 11036 1c1 11039 + caddc 11041 − cmin 11377 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-ltxr 11184 df-sub 11379 |
| This theorem is referenced by: nn0split 13597 nn0disj 13598 elfzom1elp1fzo1 13722 sqoddm1div8 14205 wrdlenccats1lenm1 14585 ccats1pfxeq 14676 ltoddhalfle 16330 pwp1fsum 16360 flodddiv4 16384 prmop1 17009 psdpw 22136 cayhamlem1 22831 2lgslem1c 27356 2lgslem3a 27359 wlklenvm1 29690 wwlknp 29911 wwlknlsw 29915 0enwwlksnge1 29932 wlkiswwlks1 29935 wspthsnwspthsnon 29984 wspthsnonn0vne 29985 elwspths2spth 30038 wwlksext2clwwlk 30127 numclwwlk2lem1lem 30412 numclwlk2lem2f 30447 poimirlem4 37945 poimirlem10 37951 poimirlem19 37960 poimirlem28 37969 sumnnodd 46060 iccpartgtprec 47880 fmtnom1nn 47995 fmtnorec1 48000 sfprmdvdsmersenne 48066 proththdlem 48076 41prothprmlem1 48080 ppivalnnprm 48088 dfodd6 48113 evenp1odd 48116 perfectALTVlem1 48197 isubgr3stgrlem2 48443 gpgvtxedg0 48539 altgsumbcALT 48829 fllog2 49044 nnpw2blen 49056 dig2nn1st 49081 nn0sumshdiglemA 49095 nn0sumshdiglemB 49096 aacllem 50276 |
| Copyright terms: Public domain | W3C validator |