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 10630 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
3 | 1, 2 | pncand 10992 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 (class class class)co 7150 ℂcc 10529 1c1 10532 + caddc 10534 − cmin 10864 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-po 5469 df-so 5470 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-ltxr 10674 df-sub 10866 |
This theorem is referenced by: nn0split 13016 nn0disj 13017 elfzom1elp1fzo1 13131 sqoddm1div8 13598 wrdlenccats1lenm1 13970 ccats1pfxeq 14070 ltoddhalfle 15704 pwp1fsum 15736 flodddiv4 15758 prmop1 16368 cayhamlem1 21468 2lgslem1c 25963 2lgslem3a 25966 wlklenvm1 27397 wwlknp 27615 wwlknlsw 27619 0enwwlksnge1 27636 wlkiswwlks1 27639 wspthsnwspthsnon 27689 wspthsnonn0vne 27690 elwspths2spth 27740 wwlksext2clwwlk 27830 numclwwlk2lem1lem 28115 numclwlk2lem2f 28150 poimirlem4 34890 poimirlem10 34896 poimirlem19 34905 poimirlem28 34914 sumnnodd 41903 iccpartgtprec 43573 fmtnom1nn 43687 fmtnorec1 43692 sfprmdvdsmersenne 43761 proththdlem 43771 41prothprmlem1 43775 dfodd6 43795 evenp1odd 43798 perfectALTVlem1 43879 altgsumbcALT 44394 fllog2 44621 nnpw2blen 44633 dig2nn1st 44658 nn0sumshdiglemA 44672 nn0sumshdiglemB 44673 aacllem 44895 |
Copyright terms: Public domain | W3C validator |