Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > numma2c | GIF version |
Description: Perform a multiply-add of two decimal integers 𝑀 and 𝑁 against a fixed multiplicand 𝑃 (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 | ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) |
numma2c.8 | ⊢ 𝑃 ∈ ℕ0 |
numma2c.9 | ⊢ 𝐹 ∈ ℕ0 |
numma2c.10 | ⊢ 𝐺 ∈ ℕ0 |
numma2c.11 | ⊢ ((𝑃 · 𝐴) + (𝐶 + 𝐺)) = 𝐸 |
numma2c.12 | ⊢ ((𝑃 · 𝐵) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) |
Ref | Expression |
---|---|
numma2c | ⊢ ((𝑃 · 𝑀) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | numma2c.8 | . . . . 5 ⊢ 𝑃 ∈ ℕ0 | |
2 | 1 | nn0cni 8193 | . . . 4 ⊢ 𝑃 ∈ ℂ |
3 | numma.6 | . . . . . 6 ⊢ 𝑀 = ((𝑇 · 𝐴) + 𝐵) | |
4 | numma.1 | . . . . . . 7 ⊢ 𝑇 ∈ ℕ0 | |
5 | numma.2 | . . . . . . 7 ⊢ 𝐴 ∈ ℕ0 | |
6 | numma.3 | . . . . . . 7 ⊢ 𝐵 ∈ ℕ0 | |
7 | 4, 5, 6 | numcl 8378 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
8 | 3, 7 | eqeltri 2110 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
9 | 8 | nn0cni 8193 | . . . 4 ⊢ 𝑀 ∈ ℂ |
10 | 2, 9 | mulcomi 7033 | . . 3 ⊢ (𝑃 · 𝑀) = (𝑀 · 𝑃) |
11 | 10 | oveq1i 5522 | . 2 ⊢ ((𝑃 · 𝑀) + 𝑁) = ((𝑀 · 𝑃) + 𝑁) |
12 | numma.4 | . . 3 ⊢ 𝐶 ∈ ℕ0 | |
13 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
14 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
15 | numma2c.9 | . . 3 ⊢ 𝐹 ∈ ℕ0 | |
16 | numma2c.10 | . . 3 ⊢ 𝐺 ∈ ℕ0 | |
17 | 5 | nn0cni 8193 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
18 | 17, 2 | mulcomi 7033 | . . . . 5 ⊢ (𝐴 · 𝑃) = (𝑃 · 𝐴) |
19 | 18 | oveq1i 5522 | . . . 4 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = ((𝑃 · 𝐴) + (𝐶 + 𝐺)) |
20 | numma2c.11 | . . . 4 ⊢ ((𝑃 · 𝐴) + (𝐶 + 𝐺)) = 𝐸 | |
21 | 19, 20 | eqtri 2060 | . . 3 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 |
22 | 6 | nn0cni 8193 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
23 | 22, 2 | mulcomi 7033 | . . . . 5 ⊢ (𝐵 · 𝑃) = (𝑃 · 𝐵) |
24 | 23 | oveq1i 5522 | . . . 4 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑃 · 𝐵) + 𝐷) |
25 | numma2c.12 | . . . 4 ⊢ ((𝑃 · 𝐵) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) | |
26 | 24, 25 | eqtri 2060 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) |
27 | 4, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26 | nummac 8399 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
28 | 11, 27 | eqtri 2060 | 1 ⊢ ((𝑃 · 𝑀) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Colors of variables: wff set class |
Syntax hints: = wceq 1243 ∈ wcel 1393 (class class class)co 5512 + 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: decma2c 8407 |
Copyright terms: Public domain | W3C validator |