| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > numsucc | 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 8197 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 4 | 2, 3 | nn0addcli 8219 | . . . . . . 7 ⊢ (𝑌 + 1) ∈ ℕ0 |
| 5 | 1, 4 | eqeltri 2110 | . . . . . 6 ⊢ 𝑇 ∈ ℕ0 |
| 6 | 5 | nn0cni 8193 | . . . . 5 ⊢ 𝑇 ∈ ℂ |
| 7 | 6 | mulid1i 7029 | . . . 4 ⊢ (𝑇 · 1) = 𝑇 |
| 8 | 7 | oveq2i 5523 | . . 3 ⊢ ((𝑇 · 𝐴) + (𝑇 · 1)) = ((𝑇 · 𝐴) + 𝑇) |
| 9 | numsucc.3 | . . . . 5 ⊢ 𝐴 ∈ ℕ0 | |
| 10 | 9 | nn0cni 8193 | . . . 4 ⊢ 𝐴 ∈ ℂ |
| 11 | ax-1cn 6977 | . . . 4 ⊢ 1 ∈ ℂ | |
| 12 | 6, 10, 11 | adddii 7037 | . . 3 ⊢ (𝑇 · (𝐴 + 1)) = ((𝑇 · 𝐴) + (𝑇 · 1)) |
| 13 | 1 | eqcomi 2044 | . . . 4 ⊢ (𝑌 + 1) = 𝑇 |
| 14 | numsucc.5 | . . . 4 ⊢ 𝑁 = ((𝑇 · 𝐴) + 𝑌) | |
| 15 | 5, 9, 2, 13, 14 | numsuc 8379 | . . 3 ⊢ (𝑁 + 1) = ((𝑇 · 𝐴) + 𝑇) |
| 16 | 8, 12, 15 | 3eqtr4ri 2071 | . 2 ⊢ (𝑁 + 1) = (𝑇 · (𝐴 + 1)) |
| 17 | numsucc.4 | . . 3 ⊢ (𝐴 + 1) = 𝐵 | |
| 18 | 17 | oveq2i 5523 | . 2 ⊢ (𝑇 · (𝐴 + 1)) = (𝑇 · 𝐵) |
| 19 | 9, 3 | nn0addcli 8219 | . . . 4 ⊢ (𝐴 + 1) ∈ ℕ0 |
| 20 | 17, 19 | eqeltrri 2111 | . . 3 ⊢ 𝐵 ∈ ℕ0 |
| 21 | 5, 20 | num0u 8376 | . 2 ⊢ (𝑇 · 𝐵) = ((𝑇 · 𝐵) + 0) |
| 22 | 16, 18, 21 | 3eqtri 2064 | 1 ⊢ (𝑁 + 1) = ((𝑇 · 𝐵) + 0) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1243 ∈ wcel 1393 (class class class)co 5512 0cc0 6889 1c1 6890 + caddc 6892 · cmul 6894 ℕ0cn0 8181 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 ax-setind 4262 ax-cnex 6975 ax-resscn 6976 ax-1cn 6977 ax-1re 6978 ax-icn 6979 ax-addcl 6980 ax-addrcl 6981 ax-mulcl 6982 ax-addcom 6984 ax-mulcom 6985 ax-addass 6986 ax-mulass 6987 ax-distr 6988 ax-i2m1 6989 ax-1rid 6991 ax-0id 6992 ax-rnegex 6993 ax-cnre 6995 |
| This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-br 3765 df-opab 3819 df-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-iota 4867 df-fun 4904 df-fv 4910 df-riota 5468 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-sub 7184 df-inn 7915 df-n0 8182 |
| This theorem is referenced by: decsucc 8394 |
| Copyright terms: Public domain | W3C validator |