| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > deccarry | Structured version Visualization version GIF version | ||
| Description: Add 1 to a 2 digit number with carry. This is a special case of decsucc 12646, but in closed form. As observed by ML, this theorem allows for carrying the 1 down multiple decimal constructors, so we can carry the 1 multiple times down a multi-digit number, e.g., by applying this theorem three times we get (;;999 + 1) = ;;;1000. (Contributed by AV, 4-Aug-2020.) (Revised by ML, 8-Aug-2020.) (Proof shortened by AV, 10-Sep-2021.) |
| Ref | Expression |
|---|---|
| deccarry | ⊢ (𝐴 ∈ ℕ → (;𝐴9 + 1) = ;(𝐴 + 1)0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-dec 12606 | . 2 ⊢ ;(𝐴 + 1)0 = (((9 + 1) · (𝐴 + 1)) + 0) | |
| 2 | 9nn 12241 | . . . . . . . 8 ⊢ 9 ∈ ℕ | |
| 3 | peano2nn 12155 | . . . . . . . 8 ⊢ (9 ∈ ℕ → (9 + 1) ∈ ℕ) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . 7 ⊢ (9 + 1) ∈ ℕ |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → (9 + 1) ∈ ℕ) |
| 6 | peano2nn 12155 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ) | |
| 7 | 5, 6 | nnmulcld 12196 | . . . . 5 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · (𝐴 + 1)) ∈ ℕ) |
| 8 | 7 | nncnd 12159 | . . . 4 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · (𝐴 + 1)) ∈ ℂ) |
| 9 | 8 | addridd 11331 | . . 3 ⊢ (𝐴 ∈ ℕ → (((9 + 1) · (𝐴 + 1)) + 0) = ((9 + 1) · (𝐴 + 1))) |
| 10 | 4 | nncni 12153 | . . . . . 6 ⊢ (9 + 1) ∈ ℂ |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ ℕ → (9 + 1) ∈ ℂ) |
| 12 | nncn 12151 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
| 13 | 1cnd 11125 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 1 ∈ ℂ) | |
| 14 | 11, 12, 13 | adddid 11154 | . . . 4 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · (𝐴 + 1)) = (((9 + 1) · 𝐴) + ((9 + 1) · 1))) |
| 15 | 11 | mulridd 11147 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · 1) = (9 + 1)) |
| 16 | 15 | oveq2d 7372 | . . . . 5 ⊢ (𝐴 ∈ ℕ → (((9 + 1) · 𝐴) + ((9 + 1) · 1)) = (((9 + 1) · 𝐴) + (9 + 1))) |
| 17 | df-dec 12606 | . . . . . . 7 ⊢ ;𝐴9 = (((9 + 1) · 𝐴) + 9) | |
| 18 | 17 | oveq1i 7366 | . . . . . 6 ⊢ (;𝐴9 + 1) = ((((9 + 1) · 𝐴) + 9) + 1) |
| 19 | id 22 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℕ) | |
| 20 | 5, 19 | nnmulcld 12196 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · 𝐴) ∈ ℕ) |
| 21 | 20 | nncnd 12159 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · 𝐴) ∈ ℂ) |
| 22 | 2 | nncni 12153 | . . . . . . . 8 ⊢ 9 ∈ ℂ |
| 23 | 22 | a1i 11 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → 9 ∈ ℂ) |
| 24 | 21, 23, 13 | addassd 11152 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((((9 + 1) · 𝐴) + 9) + 1) = (((9 + 1) · 𝐴) + (9 + 1))) |
| 25 | 18, 24 | eqtr2id 2782 | . . . . 5 ⊢ (𝐴 ∈ ℕ → (((9 + 1) · 𝐴) + (9 + 1)) = (;𝐴9 + 1)) |
| 26 | 16, 25 | eqtrd 2769 | . . . 4 ⊢ (𝐴 ∈ ℕ → (((9 + 1) · 𝐴) + ((9 + 1) · 1)) = (;𝐴9 + 1)) |
| 27 | 14, 26 | eqtrd 2769 | . . 3 ⊢ (𝐴 ∈ ℕ → ((9 + 1) · (𝐴 + 1)) = (;𝐴9 + 1)) |
| 28 | 9, 27 | eqtrd 2769 | . 2 ⊢ (𝐴 ∈ ℕ → (((9 + 1) · (𝐴 + 1)) + 0) = (;𝐴9 + 1)) |
| 29 | 1, 28 | eqtr2id 2782 | 1 ⊢ (𝐴 ∈ ℕ → (;𝐴9 + 1) = ;(𝐴 + 1)0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 (class class class)co 7356 ℂcc 11022 0cc0 11024 1c1 11025 + caddc 11027 · cmul 11029 ℕcn 12143 9c9 12205 ;cdc 12605 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-ltxr 11169 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 df-dec 12606 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |