![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > numadd | GIF version |
Description: Add two decimal integers 𝑀 and 𝑁 (no 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 | ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) |
numadd.8 | ⊢ (𝐴 + 𝐶) = 𝐸 |
numadd.9 | ⊢ (𝐵 + 𝐷) = 𝐹 |
Ref | Expression |
---|---|
numadd | ⊢ (𝑀 + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
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 8640 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
6 | 1, 5 | eqeltri 2155 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
7 | 6 | nn0cni 8437 | . . . 4 ⊢ 𝑀 ∈ ℂ |
8 | 7 | mulid1i 7253 | . . 3 ⊢ (𝑀 · 1) = 𝑀 |
9 | 8 | oveq1i 5574 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = (𝑀 + 𝑁) |
10 | numma.4 | . . 3 ⊢ 𝐶 ∈ ℕ0 | |
11 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
12 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
13 | 1nn0 8441 | . . 3 ⊢ 1 ∈ ℕ0 | |
14 | 3 | nn0cni 8437 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
15 | 14 | mulid1i 7253 | . . . . 5 ⊢ (𝐴 · 1) = 𝐴 |
16 | 15 | oveq1i 5574 | . . . 4 ⊢ ((𝐴 · 1) + 𝐶) = (𝐴 + 𝐶) |
17 | numadd.8 | . . . 4 ⊢ (𝐴 + 𝐶) = 𝐸 | |
18 | 16, 17 | eqtri 2103 | . . 3 ⊢ ((𝐴 · 1) + 𝐶) = 𝐸 |
19 | 4 | nn0cni 8437 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
20 | 19 | mulid1i 7253 | . . . . 5 ⊢ (𝐵 · 1) = 𝐵 |
21 | 20 | oveq1i 5574 | . . . 4 ⊢ ((𝐵 · 1) + 𝐷) = (𝐵 + 𝐷) |
22 | numadd.9 | . . . 4 ⊢ (𝐵 + 𝐷) = 𝐹 | |
23 | 21, 22 | eqtri 2103 | . . 3 ⊢ ((𝐵 · 1) + 𝐷) = 𝐹 |
24 | 2, 3, 4, 10, 11, 1, 12, 13, 18, 23 | numma 8671 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
25 | 9, 24 | eqtr3i 2105 | 1 ⊢ (𝑀 + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Colors of variables: wff set class |
Syntax hints: = wceq 1285 ∈ wcel 1434 (class class class)co 5564 1c1 7114 + caddc 7116 · cmul 7118 ℕ0cn0 8425 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-sep 3916 ax-pow 3968 ax-pr 3992 ax-setind 4308 ax-cnex 7199 ax-resscn 7200 ax-1cn 7201 ax-1re 7202 ax-icn 7203 ax-addcl 7204 ax-addrcl 7205 ax-mulcl 7206 ax-addcom 7208 ax-mulcom 7209 ax-addass 7210 ax-mulass 7211 ax-distr 7212 ax-i2m1 7213 ax-1rid 7215 ax-0id 7216 ax-rnegex 7217 ax-cnre 7219 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ne 2250 df-ral 2358 df-rex 2359 df-reu 2360 df-rab 2362 df-v 2612 df-sbc 2825 df-dif 2984 df-un 2986 df-in 2988 df-ss 2995 df-pw 3402 df-sn 3422 df-pr 3423 df-op 3425 df-uni 3622 df-int 3657 df-br 3806 df-opab 3860 df-id 4076 df-xp 4397 df-rel 4398 df-cnv 4399 df-co 4400 df-dm 4401 df-iota 4917 df-fun 4954 df-fv 4960 df-riota 5520 df-ov 5567 df-oprab 5568 df-mpt2 5569 df-sub 7418 df-inn 8177 df-n0 8426 |
This theorem is referenced by: decadd 8681 |
Copyright terms: Public domain | W3C validator |