| 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 9504 | . . . 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 9717 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
| 8 | 3, 7 | eqeltri 2305 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
| 9 | 8 | nn0cni 9504 | . . . 4 ⊢ 𝑀 ∈ ℂ |
| 10 | 2, 9 | mulcomi 8276 | . . 3 ⊢ (𝑃 · 𝑀) = (𝑀 · 𝑃) |
| 11 | 10 | oveq1i 6059 | . 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 9504 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
| 18 | 17, 2 | mulcomi 8276 | . . . . 5 ⊢ (𝐴 · 𝑃) = (𝑃 · 𝐴) |
| 19 | 18 | oveq1i 6059 | . . . 4 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = ((𝑃 · 𝐴) + (𝐶 + 𝐺)) |
| 20 | numma2c.11 | . . . 4 ⊢ ((𝑃 · 𝐴) + (𝐶 + 𝐺)) = 𝐸 | |
| 21 | 19, 20 | eqtri 2253 | . . 3 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 |
| 22 | 6 | nn0cni 9504 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
| 23 | 22, 2 | mulcomi 8276 | . . . . 5 ⊢ (𝐵 · 𝑃) = (𝑃 · 𝐵) |
| 24 | 23 | oveq1i 6059 | . . . 4 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑃 · 𝐵) + 𝐷) |
| 25 | numma2c.12 | . . . 4 ⊢ ((𝑃 · 𝐵) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) | |
| 26 | 24, 25 | eqtri 2253 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) |
| 27 | 4, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26 | nummac 9749 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
| 28 | 11, 27 | eqtri 2253 | 1 ⊢ ((𝑃 · 𝑀) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∈ wcel 2203 (class class class)co 6049 + caddc 8126 · cmul 8128 ℕ0cn0 9492 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-setind 4658 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-br 4109 df-opab 4171 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-iota 5311 df-fun 5353 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-sub 8442 df-inn 9234 df-n0 9493 |
| This theorem is referenced by: decma2c 9757 |
| Copyright terms: Public domain | W3C validator |