| 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 11505 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7368 ℂcc 11036 1c1 11039 + caddc 11041 − cmin 11376 |
| 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 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-ltxr 11183 df-sub 11378 |
| This theorem is referenced by: nn0split 13571 nn0disj 13572 elfzom1elp1fzo1 13695 sqoddm1div8 14178 wrdlenccats1lenm1 14558 ccats1pfxeq 14649 ltoddhalfle 16300 pwp1fsum 16330 flodddiv4 16354 prmop1 16978 psdpw 22125 cayhamlem1 22822 2lgslem1c 27372 2lgslem3a 27375 wlklenvm1 29707 wwlknp 29928 wwlknlsw 29932 0enwwlksnge1 29949 wlkiswwlks1 29952 wspthsnwspthsnon 30001 wspthsnonn0vne 30002 elwspths2spth 30055 wwlksext2clwwlk 30144 numclwwlk2lem1lem 30429 numclwlk2lem2f 30464 poimirlem4 37875 poimirlem10 37881 poimirlem19 37890 poimirlem28 37899 sumnnodd 45990 iccpartgtprec 47780 fmtnom1nn 47892 fmtnorec1 47897 sfprmdvdsmersenne 47963 proththdlem 47973 41prothprmlem1 47977 dfodd6 47997 evenp1odd 48000 perfectALTVlem1 48081 isubgr3stgrlem2 48327 gpgvtxedg0 48423 altgsumbcALT 48713 fllog2 48928 nnpw2blen 48940 dig2nn1st 48965 nn0sumshdiglemA 48979 nn0sumshdiglemB 48980 aacllem 50160 |
| Copyright terms: Public domain | W3C validator |