| 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 12533 | . . . 4 ⊢ 𝑇 ∈ ℂ |
| 3 | numma.2 | . . . . . . . . 9 ⊢ 𝐴 ∈ ℕ0 | |
| 4 | 3 | nn0cni 12533 | . . . . . . . 8 ⊢ 𝐴 ∈ ℂ |
| 5 | nummac.8 | . . . . . . . . 9 ⊢ 𝑃 ∈ ℕ0 | |
| 6 | 5 | nn0cni 12533 | . . . . . . . 8 ⊢ 𝑃 ∈ ℂ |
| 7 | 4, 6 | mulcli 11233 | . . . . . . 7 ⊢ (𝐴 · 𝑃) ∈ ℂ |
| 8 | numma.4 | . . . . . . . 8 ⊢ 𝐶 ∈ ℕ0 | |
| 9 | 8 | nn0cni 12533 | . . . . . . 7 ⊢ 𝐶 ∈ ℂ |
| 10 | nummac.10 | . . . . . . . 8 ⊢ 𝐺 ∈ ℕ0 | |
| 11 | 10 | nn0cni 12533 | . . . . . . 7 ⊢ 𝐺 ∈ ℂ |
| 12 | 7, 9, 11 | addassi 11236 | . . . . . 6 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = ((𝐴 · 𝑃) + (𝐶 + 𝐺)) |
| 13 | nummac.11 | . . . . . 6 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 | |
| 14 | 12, 13 | eqtri 2788 | . . . . 5 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = 𝐸 |
| 15 | 7, 9 | addcli 11232 | . . . . . 6 ⊢ ((𝐴 · 𝑃) + 𝐶) ∈ ℂ |
| 16 | 15, 11 | addcli 11232 | . . . . 5 ⊢ (((𝐴 · 𝑃) + 𝐶) + 𝐺) ∈ ℂ |
| 17 | 14, 16 | eqeltrri 2862 | . . . 4 ⊢ 𝐸 ∈ ℂ |
| 18 | 2, 17, 11 | subdii 11680 | . . 3 ⊢ (𝑇 · (𝐸 − 𝐺)) = ((𝑇 · 𝐸) − (𝑇 · 𝐺)) |
| 19 | 18 | oveq1i 7429 | . 2 ⊢ ((𝑇 · (𝐸 − 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 20 | numma.3 | . . 3 ⊢ 𝐵 ∈ ℕ0 | |
| 21 | numma.5 | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
| 22 | numma.6 | . . 3 ⊢ 𝑀 = ((𝑇 · 𝐴) + 𝐵) | |
| 23 | numma.7 | . . 3 ⊢ 𝑁 = ((𝑇 · 𝐶) + 𝐷) | |
| 24 | 17, 11, 15 | subadd2i 11563 | . . . . 5 ⊢ ((𝐸 − 𝐺) = ((𝐴 · 𝑃) + 𝐶) ↔ (((𝐴 · 𝑃) + 𝐶) + 𝐺) = 𝐸) |
| 25 | 14, 24 | mpbir 234 | . . . 4 ⊢ (𝐸 − 𝐺) = ((𝐴 · 𝑃) + 𝐶) |
| 26 | 25 | eqcomi 2774 | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐶) = (𝐸 − 𝐺) |
| 27 | nummac.12 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((𝑇 · 𝐺) + 𝐹) | |
| 28 | 1, 3, 20, 8, 21, 22, 23, 5, 26, 27 | numma 12778 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · (𝐸 − 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 29 | 2, 17 | mulcli 11233 | . . . . 5 ⊢ (𝑇 · 𝐸) ∈ ℂ |
| 30 | 2, 11 | mulcli 11233 | . . . . 5 ⊢ (𝑇 · 𝐺) ∈ ℂ |
| 31 | npcan 11483 | . . . . 5 ⊢ (((𝑇 · 𝐸) ∈ ℂ ∧ (𝑇 · 𝐺) ∈ ℂ) → (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) = (𝑇 · 𝐸)) | |
| 32 | 29, 30, 31 | mp2an 705 | . . . 4 ⊢ (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) = (𝑇 · 𝐸) |
| 33 | 32 | oveq1i 7429 | . . 3 ⊢ ((((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) + 𝐹) = ((𝑇 · 𝐸) + 𝐹) |
| 34 | 29, 30 | subcli 11551 | . . . 4 ⊢ ((𝑇 · 𝐸) − (𝑇 · 𝐺)) ∈ ℂ |
| 35 | nummac.9 | . . . . 5 ⊢ 𝐹 ∈ ℕ0 | |
| 36 | 35 | nn0cni 12533 | . . . 4 ⊢ 𝐹 ∈ ℂ |
| 37 | 34, 30, 36 | addassi 11236 | . . 3 ⊢ ((((𝑇 · 𝐸) − (𝑇 · 𝐺)) + (𝑇 · 𝐺)) + 𝐹) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 38 | 33, 37 | eqtr3i 2790 | . 2 ⊢ ((𝑇 · 𝐸) + 𝐹) = (((𝑇 · 𝐸) − (𝑇 · 𝐺)) + ((𝑇 · 𝐺) + 𝐹)) |
| 39 | 19, 28, 38 | 3eqtr4i 2798 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((𝑇 · 𝐸) + 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 (class class class)co 7419 ℂcc 11115 + caddc 11120 · cmul 11122 − cmin 11458 ℕ0cn0 12521 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11262 df-mnf 11263 df-ltxr 11265 df-sub 11460 df-nn 12251 df-n0 12522 |
| This theorem is used by: numma2c 12780 numaddc 12782 nummul1c 12783 decmac 12786 |
| Copyright terms: Public domain | W3C validator |