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 8989 | . . . 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 9194 | . . . . . 6 ⊢ ((𝑇 · 𝐴) + 𝐵) ∈ ℕ0 |
8 | 3, 7 | eqeltri 2212 | . . . . 5 ⊢ 𝑀 ∈ ℕ0 |
9 | 8 | nn0cni 8989 | . . . 4 ⊢ 𝑀 ∈ ℂ |
10 | 2, 9 | mulcomi 7772 | . . 3 ⊢ (𝑃 · 𝑀) = (𝑀 · 𝑃) |
11 | 10 | oveq1i 5784 | . 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 8989 | . . . . . 6 ⊢ 𝐴 ∈ ℂ |
18 | 17, 2 | mulcomi 7772 | . . . . 5 ⊢ (𝐴 · 𝑃) = (𝑃 · 𝐴) |
19 | 18 | oveq1i 5784 | . . . 4 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = ((𝑃 · 𝐴) + (𝐶 + 𝐺)) |
20 | numma2c.11 | . . . 4 ⊢ ((𝑃 · 𝐴) + (𝐶 + 𝐺)) = 𝐸 | |
21 | 19, 20 | eqtri 2160 | . . 3 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 |
22 | 6 | nn0cni 8989 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
23 | 22, 2 | mulcomi 7772 | . . . . 5 ⊢ (𝐵 · 𝑃) = (𝑃 · 𝐵) |
24 | 23 | oveq1i 5784 | . . . 4 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑃 · 𝐵) + 𝐷) |
25 | numma2c.12 | . . . 4 ⊢ ((𝑃 · 𝐵) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) | |
26 | 24, 25 | eqtri 2160 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) |
27 | 4, 5, 6, 12, 13, 3, 14, 1, 15, 16, 21, 26 | nummac 9226 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
28 | 11, 27 | eqtri 2160 | 1 ⊢ ((𝑃 · 𝑀) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
Colors of variables: wff set class |
Syntax hints: = wceq 1331 ∈ wcel 1480 (class class class)co 5774 + caddc 7623 · cmul 7625 ℕ0cn0 8977 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-sub 7935 df-inn 8721 df-n0 8978 |
This theorem is referenced by: decma2c 9234 |
Copyright terms: Public domain | W3C validator |