![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > numaddc | GIF version |
Description: Add two decimal integers 𝑀 and 𝑁 (with carry). (Contributed by Mario Carneiro, 18-Feb-2014.) |
Ref | Expression |
---|---|
numma.1 | ⊢ 𝑇 ∈ ℕ0 |
numma.2 | ⊢ 𝐴 ∈ ℕ0 |
numma.3 | ⊢ 𝐵 ∈ ℕ0 |
numma.4 | ⊢ 𝐶 ∈ ℕ0 |
numma.5 | ⊢ 𝐷 ∈ ℕ0 |
numma.6 | ⊢ 𝑀 = ((𝑇 · 𝐴) + 𝐵) |
numma.7 | ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) |
numaddc.8 | ⊢ 𝐹 ∈ ℕ0 |
numaddc.9 | ⊢ ((𝐴 + 𝐶) + 1) = 𝐸 |
numaddc.10 | ⊢ (𝐵 + 𝐷) = ((𝑇 · 1) + 𝐹) |
Ref | Expression |
---|---|
numaddc | ⊢ (𝑀 + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | numma.6 | . . . . . 6 ⊢ 𝑀 = ((𝑇 · 𝐴) + 𝐵) | |
2 | numma.1 | . . . . . . 7 ⊢ 𝑇 ∈ ℕ0 | |
3 | numma.2 | . . . . . . 7 ⊢ 𝐴 ∈ ℕ0 | |
4 | numma.3 | . . . . . . 7 ⊢ 𝐵 ∈ ℕ0 | |
5 | 2, 3, 4 | numcl 9398 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
6 | 1, 5 | eqeltri 2250 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
7 | 6 | nn0cni 9190 | . . . 4 ⊢ 𝑀 ∈ ℂ |
8 | 7 | mulid1i 7961 | . . 3 ⊢ (𝑀 · 1) = 𝑀 |
9 | 8 | oveq1i 5887 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = (𝑀 + 𝑁) |
10 | numma.4 | . . 3 ⊢ 𝐶 ∈ ℕ0 | |
11 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
12 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
13 | 1nn0 9194 | . . 3 ⊢ 1 ∈ ℕ0 | |
14 | numaddc.8 | . . 3 ⊢ 𝐹 ∈ ℕ0 | |
15 | 3 | nn0cni 9190 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
16 | 15 | mulid1i 7961 | . . . . 5 ⊢ (𝐴 · 1) = 𝐴 |
17 | 16 | oveq1i 5887 | . . . 4 ⊢ ((𝐴 · 1) + (𝐶 + 1)) = (𝐴 + (𝐶 + 1)) |
18 | 10 | nn0cni 9190 | . . . . 5 ⊢ 𝐶 ∈ ℂ |
19 | ax-1cn 7906 | . . . . 5 ⊢ 1 ∈ ℂ | |
20 | 15, 18, 19 | addassi 7967 | . . . 4 ⊢ ((𝐴 + 𝐶) + 1) = (𝐴 + (𝐶 + 1)) |
21 | numaddc.9 | . . . 4 ⊢ ((𝐴 + 𝐶) + 1) = 𝐸 | |
22 | 17, 20, 21 | 3eqtr2i 2204 | . . 3 ⊢ ((𝐴 · 1) + (𝐶 + 1)) = 𝐸 |
23 | 4 | nn0cni 9190 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
24 | 23 | mulid1i 7961 | . . . . 5 ⊢ (𝐵 · 1) = 𝐵 |
25 | 24 | oveq1i 5887 | . . . 4 ⊢ ((𝐵 · 1) + 𝐷) = (𝐵 + 𝐷) |
26 | numaddc.10 | . . . 4 ⊢ (𝐵 + 𝐷) = ((𝑇 · 1) + 𝐹) | |
27 | 25, 26 | eqtri 2198 | . . 3 ⊢ ((𝐵 · 1) + 𝐷) = ((𝑇 · 1) + 𝐹) |
28 | 2, 3, 4, 10, 11, 1, 12, 13, 14, 13, 22, 27 | nummac 9430 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
29 | 9, 28 | eqtr3i 2200 | 1 ⊢ (𝑀 + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Colors of variables: wff set class |
Syntax hints: = wceq 1353 ∈ wcel 2148 (class class class)co 5877 1c1 7814 + caddc 7816 · cmul 7818 ℕ0cn0 9178 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-cnre 7924 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-br 4006 df-opab 4067 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-sub 8132 df-inn 8922 df-n0 9179 |
This theorem is referenced by: decaddc 9440 |
Copyright terms: Public domain | W3C validator |