| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nummac | Structured version Visualization version 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 | ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) |
| nummac.8 | ⊢ 𝑃 ∈ ℕ0 |
| nummac.9 | ⊢ 𝐹 ∈ ℕ0 |
| nummac.10 | ⊢ 𝐺 ∈ ℕ0 |
| nummac.11 | ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 |
| nummac.12 | ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) |
| Ref | Expression |
|---|---|
| nummac | ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | numma.1 | . . . . 5 ⊢ 𝑇 ∈ ℕ0 | |
| 2 | 1 | nn0cni 12443 | . . . 4 ⊢ 𝑇 ∈ ℂ |
| 3 | numma.2 | . . . . . . . . 9 ⊢ 𝐴 ∈ ℕ0 | |
| 4 | 3 | nn0cni 12443 | . . . . . . . 8 ⊢ 𝐴 ∈ ℂ |
| 5 | nummac.8 | . . . . . . . . 9 ⊢ 𝑃 ∈ ℕ0 | |
| 6 | 5 | nn0cni 12443 | . . . . . . . 8 ⊢ 𝑃 ∈ ℂ |
| 7 | 4, 6 | mulcli 11146 | . . . . . . 7 ⊢ (𝐴 · 𝑃) ∈ ℂ |
| 8 | numma.4 | . . . . . . . 8 ⊢ 𝐶 ∈ ℕ0 | |
| 9 | 8 | nn0cni 12443 | . . . . . . 7 ⊢ 𝐶 ∈ ℂ |
| 10 | nummac.10 | . . . . . . . 8 ⊢ 𝐺 ∈ ℕ0 | |
| 11 | 10 | nn0cni 12443 | . . . . . . 7 ⊢ 𝐺 ∈ ℂ |
| 12 | 7, 9, 11 | addassi 11149 | . . . . . 6 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = ((𝐴 · 𝑃) + (𝐶 + 𝐺)) |
| 13 | nummac.11 | . . . . . 6 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 | |
| 14 | 12, 13 | eqtri 2760 | . . . . 5 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = 𝐸 |
| 15 | 7, 9 | addcli 11145 | . . . . . 6 ⊢ ((𝐴 · 𝑃) + 𝐶) ∈ ℂ |
| 16 | 15, 11 | addcli 11145 | . . . . 5 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) ∈ ℂ |
| 17 | 14, 16 | eqeltrri 2834 | . . . 4 ⊢ 𝐸 ∈ ℂ |
| 18 | 2, 17, 11 | subdii 11593 | . . 3 ⊢ (𝑇 · (𝐸 − 𝐺)) = ((𝑇 · 𝐸) − (𝑇 · 𝐺)) |
| 19 | 18 | oveq1i 7371 | . 2 ⊢ ((𝑇 · (𝐸 − 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 20 | numma.3 | . . 3 ⊢ 𝐵 ∈ ℕ0 | |
| 21 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
| 22 | numma.6 | . . 3 ⊢ 𝑀 = ((𝑇 · 𝐴) + 𝐵) | |
| 23 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
| 24 | 17, 11, 15 | subadd2i 11476 | . . . . 5 ⊢ ((𝐸 − 𝐺) = ((𝐴 · 𝑃) + 𝐶) ↔ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = 𝐸) |
| 25 | 14, 24 | mpbir 231 | . . . 4 ⊢ (𝐸 − 𝐺) = ((𝐴 · 𝑃) + 𝐶) |
| 26 | 25 | eqcomi 2746 | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐶) = (𝐸 − 𝐺) |
| 27 | nummac.12 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) | |
| 28 | 1, 3, 20, 8, 21, 22, 23, 5, 26, 27 | numma 12682 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · (𝐸 − 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 29 | 2, 17 | mulcli 11146 | . . . . 5 ⊢ (𝑇 · 𝐸) ∈ ℂ |
| 30 | 2, 11 | mulcli 11146 | . . . . 5 ⊢ (𝑇 · 𝐺) ∈ ℂ |
| 31 | npcan 11396 | . . . . 5 ⊢ (((𝑇 · 𝐸) ∈ ℂ ∧ (𝑇 · 𝐺) ∈ ℂ) → (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) = (𝑇 · 𝐸)) | |
| 32 | 29, 30, 31 | mp2an 693 | . . . 4 ⊢ (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) = (𝑇 · 𝐸) |
| 33 | 32 | oveq1i 7371 | . . 3 ⊢ ((((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) + 𝐹) = ((𝑇 · 𝐸) + 𝐹) |
| 34 | 29, 30 | subcli 11464 | . . . 4 ⊢ ((𝑇 · 𝐸) − (𝑇 · 𝐺)) ∈ ℂ |
| 35 | nummac.9 | . . . . 5 ⊢ 𝐹 ∈ ℕ0 | |
| 36 | 35 | nn0cni 12443 | . . . 4 ⊢ 𝐹 ∈ ℂ |
| 37 | 34, 30, 36 | addassi 11149 | . . 3 ⊢ ((((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) + 𝐹) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 38 | 33, 37 | eqtr3i 2762 | . 2 ⊢ ((𝑇 · 𝐸) + 𝐹) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 39 | 19, 28, 38 | 3eqtr4i 2770 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 (class class class)co 7361 ℂcc 11030 + caddc 11035 · cmul 11037 − cmin 11371 ℕ0cn0 12431 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-ltxr 11178 df-sub 11373 df-nn 12169 df-n0 12432 |
| This theorem is referenced by: numma2c 12684 numaddc 12686 nummul1c 12687 decmac 12690 |
| Copyright terms: Public domain | W3C validator |