| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > decma | Structured version Visualization version GIF version | ||
| Description: Perform a multiply-add of two numerals 𝑀 and 𝑁 against a fixed multiplicand 𝑃 (no carry). (Contributed by Mario Carneiro, 18-Feb-2014.) (Revised by AV, 6-Sep-2021.) |
| Ref | Expression |
|---|---|
| decma.a | ⊢ 𝐴 ∈ ℕ0 |
| decma.b | ⊢ 𝐵 ∈ ℕ0 |
| decma.c | ⊢ 𝐶 ∈ ℕ0 |
| decma.d | ⊢ 𝐷 ∈ ℕ0 |
| decma.m | ⊢ 𝑀 = ;𝐴𝐵 |
| decma.n | ⊢ 𝑁 = ;𝐶𝐷 |
| decma.p | ⊢ 𝑃 ∈ ℕ0 |
| decma.e | ⊢ ((𝐴 · 𝑃) + 𝐶) = 𝐸 |
| decma.f | ⊢ ((𝐵 · 𝑃) + 𝐷) = 𝐹 |
| Ref | Expression |
|---|---|
| decma | ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 10nn0 12625 | . . 3 ⊢ ;10 ∈ ℕ0 | |
| 2 | decma.a | . . 3 ⊢ 𝐴 ∈ ℕ0 | |
| 3 | decma.b | . . 3 ⊢ 𝐵 ∈ ℕ0 | |
| 4 | decma.c | . . 3 ⊢ 𝐶 ∈ ℕ0 | |
| 5 | decma.d | . . 3 ⊢ 𝐷 ∈ ℕ0 | |
| 6 | decma.m | . . . 4 ⊢ 𝑀 = ;𝐴𝐵 | |
| 7 | dfdec10 12610 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 8 | 6, 7 | eqtri 2759 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
| 9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
| 10 | dfdec10 12610 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
| 11 | 9, 10 | eqtri 2759 | . . 3 ⊢ 𝑁 = ((;10 · 𝐶) + 𝐷) |
| 12 | decma.p | . . 3 ⊢ 𝑃 ∈ ℕ0 | |
| 13 | decma.e | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐶) = 𝐸 | |
| 14 | decma.f | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = 𝐹 | |
| 15 | 1, 2, 3, 4, 5, 8, 11, 12, 13, 14 | numma 12651 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
| 16 | dfdec10 12610 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
| 17 | 15, 16 | eqtr4i 2762 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∈ wcel 2113 (class class class)co 7358 0cc0 11026 1c1 11027 + caddc 11029 · cmul 11031 ℕ0cn0 12401 ;cdc 12607 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-ltxr 11171 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-dec 12608 |
| This theorem is referenced by: decrmanc 12664 2503lem2 17065 4001lem1 17068 log2ub 26915 3exp7 42303 3lexlogpow5ineq1 42304 sqn5i 42536 |
| Copyright terms: Public domain | W3C validator |