| 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 12817 | . . 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 12798 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 8 | 6, 7 | eqtri 2784 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
| 9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
| 10 | dfdec10 12798 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
| 11 | 9, 10 | eqtri 2784 | . . 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 12844 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
| 16 | dfdec10 12798 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
| 17 | 15, 16 | eqtr4i 2787 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 (class class class)co 7412 0cc0 11181 1c1 11182 + caddc 11184 · cmul 11186 ℕ0cn0 12587 ;cdc 12795 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-ltxr 11329 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-5 12389 df-6 12390 df-7 12391 df-8 12392 df-9 12393 df-n0 12588 df-dec 12796 |
| This theorem is used by: decrmanc 12857 2503lem2 17296 4001lem1 17299 log2ub 27259 3exp7 43071 3lexlogpow5ineq1 43072 sqn5i 43310 |
| Copyright terms: Public domain | W3C validator |