| 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 12762 | . . 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 12743 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 8 | 6, 7 | eqtri 2785 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
| 9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
| 10 | dfdec10 12743 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
| 11 | 9, 10 | eqtri 2785 | . . 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 12789 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
| 16 | dfdec10 12743 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
| 17 | 15, 16 | eqtr4i 2788 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 (class class class)co 7417 0cc0 11128 1c1 11129 + caddc 11131 · cmul 11133 ℕ0cn0 12532 ;cdc 12740 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-ltxr 11276 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-dec 12741 |
| This theorem is used by: decrmanc 12802 2503lem2 17236 4001lem1 17239 log2ub 27194 3exp7 42927 3lexlogpow5ineq1 42928 sqn5i 43168 |
| Copyright terms: Public domain | W3C validator |