| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > numsucc | Structured version Visualization version GIF version | ||
| Description: The successor of a decimal integer (with carry). (Contributed by Mario Carneiro, 18-Feb-2014.) |
| Ref | Expression |
|---|---|
| numsucc.1 | ⊢ 𝑌 ∈ ℕ0 |
| numsucc.2 | ⊢ 𝑇 = (𝑌 + 1) |
| numsucc.3 | ⊢ 𝐴 ∈ ℕ0 |
| numsucc.4 | ⊢ (𝐴 + 1) = 𝐵 |
| numsucc.5 | ⊢ 𝑁 = ((𝑇 · 𝐴) + 𝑌) |
| Ref | Expression |
|---|---|
| numsucc | ⊢ (𝑁 + 1) = ((𝑇 · 𝐵) + 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | numsucc.2 | . . . . . . 7 ⊢ 𝑇 = (𝑌 + 1) | |
| 2 | numsucc.1 | . . . . . . . 8 ⊢ 𝑌 ∈ ℕ0 | |
| 3 | 1nn0 12521 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 4 | 2, 3 | nn0addcli 12542 | . . . . . . 7 ⊢ (𝑌 + 1) ∈ ℕ0 |
| 5 | 1, 4 | eqeltri 2859 | . . . . . 6 ⊢ 𝑇 ∈ ℕ0 |
| 6 | 5 | nn0cni 12517 | . . . . 5 ⊢ 𝑇 ∈ ℂ |
| 7 | 6 | mulridi 11214 | . . . 4 ⊢ (𝑇 · 1) = 𝑇 |
| 8 | 7 | oveq2i 7423 | . . 3 ⊢ ((𝑇 · 𝐴) + (𝑇 · 1)) = ((𝑇 · 𝐴) + 𝑇) |
| 9 | numsucc.3 | . . . . 5 ⊢ 𝐴 ∈ ℕ0 | |
| 10 | 9 | nn0cni 12517 | . . . 4 ⊢ 𝐴 ∈ ℂ |
| 11 | ax-1cn 11159 | . . . 4 ⊢ 1 ∈ ℂ | |
| 12 | 6, 10, 11 | adddii 11222 | . . 3 ⊢ (𝑇 · (𝐴 + 1)) = ((𝑇 · 𝐴) + (𝑇 · 1)) |
| 13 | 1 | eqcomi 2772 | . . . 4 ⊢ (𝑌 + 1) = 𝑇 |
| 14 | numsucc.5 | . . . 4 ⊢ 𝑁 = ((𝑇 · 𝐴) + 𝑌) | |
| 15 | 5, 9, 2, 13, 14 | numsuc 12726 | . . 3 ⊢ (𝑁 + 1) = ((𝑇 · 𝐴) + 𝑇) |
| 16 | 8, 12, 15 | 3eqtr4ri 2797 | . 2 ⊢ (𝑁 + 1) = (𝑇 · (𝐴 + 1)) |
| 17 | numsucc.4 | . . 3 ⊢ (𝐴 + 1) = 𝐵 | |
| 18 | 17 | oveq2i 7423 | . 2 ⊢ (𝑇 · (𝐴 + 1)) = (𝑇 · 𝐵) |
| 19 | 9, 3 | nn0addcli 12542 | . . . 4 ⊢ (𝐴 + 1) ∈ ℕ0 |
| 20 | 17, 19 | eqeltrri 2860 | . . 3 ⊢ 𝐵 ∈ ℕ0 |
| 21 | 5, 20 | num0u 12723 | . 2 ⊢ (𝑇 · 𝐵) = ((𝑇 · 𝐵) + 0) |
| 22 | 16, 18, 21 | 3eqtri 2790 | 1 ⊢ (𝑁 + 1) = ((𝑇 · 𝐵) + 0) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 (class class class)co 7412 0cc0 11101 1c1 11102 + caddc 11104 · cmul 11106 ℕ0cn0 12505 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-ltxr 11249 df-nn 12235 df-n0 12506 |
| This theorem is referenced by: decsucc 12758 |
| Copyright terms: Public domain | W3C validator |