| 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 12453 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 4 | 2, 3 | nn0addcli 12474 | . . . . . . 7 ⊢ (𝑌 + 1) ∈ ℕ0 |
| 5 | 1, 4 | eqeltri 2832 | . . . . . 6 ⊢ 𝑇 ∈ ℕ0 |
| 6 | 5 | nn0cni 12449 | . . . . 5 ⊢ 𝑇 ∈ ℂ |
| 7 | 6 | mulridi 11149 | . . . 4 ⊢ (𝑇 · 1) = 𝑇 |
| 8 | 7 | oveq2i 7378 | . . 3 ⊢ ((𝑇 · 𝐴) + (𝑇 · 1)) = ((𝑇 · 𝐴) + 𝑇) |
| 9 | numsucc.3 | . . . . 5 ⊢ 𝐴 ∈ ℕ0 | |
| 10 | 9 | nn0cni 12449 | . . . 4 ⊢ 𝐴 ∈ ℂ |
| 11 | ax-1cn 11096 | . . . 4 ⊢ 1 ∈ ℂ | |
| 12 | 6, 10, 11 | adddii 11157 | . . 3 ⊢ (𝑇 · (𝐴 + 1)) = ((𝑇 · 𝐴) + (𝑇 · 1)) |
| 13 | 1 | eqcomi 2745 | . . . 4 ⊢ (𝑌 + 1) = 𝑇 |
| 14 | numsucc.5 | . . . 4 ⊢ 𝑁 = ((𝑇 · 𝐴) + 𝑌) | |
| 15 | 5, 9, 2, 13, 14 | numsuc 12658 | . . 3 ⊢ (𝑁 + 1) = ((𝑇 · 𝐴) + 𝑇) |
| 16 | 8, 12, 15 | 3eqtr4ri 2770 | . 2 ⊢ (𝑁 + 1) = (𝑇 · (𝐴 + 1)) |
| 17 | numsucc.4 | . . 3 ⊢ (𝐴 + 1) = 𝐵 | |
| 18 | 17 | oveq2i 7378 | . 2 ⊢ (𝑇 · (𝐴 + 1)) = (𝑇 · 𝐵) |
| 19 | 9, 3 | nn0addcli 12474 | . . . 4 ⊢ (𝐴 + 1) ∈ ℕ0 |
| 20 | 17, 19 | eqeltrri 2833 | . . 3 ⊢ 𝐵 ∈ ℕ0 |
| 21 | 5, 20 | num0u 12655 | . 2 ⊢ (𝑇 · 𝐵) = ((𝑇 · 𝐵) + 0) |
| 22 | 16, 18, 21 | 3eqtri 2763 | 1 ⊢ (𝑁 + 1) = ((𝑇 · 𝐵) + 0) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 (class class class)co 7367 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 ℕ0cn0 12437 |
| 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-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 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-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 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-ov 7370 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-ltxr 11184 df-nn 12175 df-n0 12438 |
| This theorem is referenced by: decsucc 12685 |
| Copyright terms: Public domain | W3C validator |