Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > numadd | Structured version Visualization version 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 12099 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
6 | 1, 5 | eqeltri 2906 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
7 | 6 | nn0cni 11897 | . . . 4 ⊢ 𝑀 ∈ ℂ |
8 | 7 | mulid1i 10633 | . . 3 ⊢ (𝑀 · 1) = 𝑀 |
9 | 8 | oveq1i 7155 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = (𝑀 + 𝑁) |
10 | numma.4 | . . 3 ⊢ 𝐶 ∈ ℕ0 | |
11 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
12 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
13 | 1nn0 11901 | . . 3 ⊢ 1 ∈ ℕ0 | |
14 | 3 | nn0cni 11897 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
15 | 14 | mulid1i 10633 | . . . . 5 ⊢ (𝐴 · 1) = 𝐴 |
16 | 15 | oveq1i 7155 | . . . 4 ⊢ ((𝐴 · 1) + 𝐶) = (𝐴 + 𝐶) |
17 | numadd.8 | . . . 4 ⊢ (𝐴 + 𝐶) = 𝐸 | |
18 | 16, 17 | eqtri 2841 | . . 3 ⊢ ((𝐴 · 1) + 𝐶) = 𝐸 |
19 | 4 | nn0cni 11897 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
20 | 19 | mulid1i 10633 | . . . . 5 ⊢ (𝐵 · 1) = 𝐵 |
21 | 20 | oveq1i 7155 | . . . 4 ⊢ ((𝐵 · 1) + 𝐷) = (𝐵 + 𝐷) |
22 | numadd.9 | . . . 4 ⊢ (𝐵 + 𝐷) = 𝐹 | |
23 | 21, 22 | eqtri 2841 | . . 3 ⊢ ((𝐵 · 1) + 𝐷) = 𝐹 |
24 | 2, 3, 4, 10, 11, 1, 12, 13, 18, 23 | numma 12130 | . 2 ⊢ ((𝑀 · 1) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
25 | 9, 24 | eqtr3i 2843 | 1 ⊢ (𝑀 + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1528 ∈ wcel 2105 (class class class)co 7145 1c1 10526 + caddc 10528 · cmul 10530 ℕ0cn0 11885 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-om 7570 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-ltxr 10668 df-nn 11627 df-n0 11886 |
This theorem is referenced by: decadd 12140 |
Copyright terms: Public domain | W3C validator |