| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > decrmac | Structured version Visualization version GIF version | ||
| Description: Perform a multiply-add of two numerals 𝑀 and 𝑁 against a fixed multiplicand 𝑃 (with carry). (Contributed by AV, 16-Sep-2021.) |
| Ref | Expression |
|---|---|
| decrmanc.a | ⊢ 𝐴 ∈ ℕ0 |
| decrmanc.b | ⊢ 𝐵 ∈ ℕ0 |
| decrmanc.n | ⊢ 𝑁 ∈ ℕ0 |
| decrmanc.m | ⊢ 𝑀 = ;𝐴𝐵 |
| decrmanc.p | ⊢ 𝑃 ∈ ℕ0 |
| decrmac.f | ⊢ 𝐹 ∈ ℕ0 |
| decrmac.g | ⊢ 𝐺 ∈ ℕ0 |
| decrmac.e | ⊢ ((𝐴 · 𝑃) + 𝐺) = 𝐸 |
| decrmac.2 | ⊢ ((𝐵 · 𝑃) + 𝑁) = ;𝐺𝐹 |
| Ref | Expression |
|---|---|
| decrmac | ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | decrmanc.a | . 2 ⊢ 𝐴 ∈ ℕ0 | |
| 2 | decrmanc.b | . 2 ⊢ 𝐵 ∈ ℕ0 | |
| 3 | 0nn0 12443 | . 2 ⊢ 0 ∈ ℕ0 | |
| 4 | decrmanc.n | . 2 ⊢ 𝑁 ∈ ℕ0 | |
| 5 | decrmanc.m | . 2 ⊢ 𝑀 = ;𝐴𝐵 | |
| 6 | 4 | dec0h 12657 | . 2 ⊢ 𝑁 = ;0𝑁 |
| 7 | decrmanc.p | . 2 ⊢ 𝑃 ∈ ℕ0 | |
| 8 | decrmac.f | . 2 ⊢ 𝐹 ∈ ℕ0 | |
| 9 | decrmac.g | . 2 ⊢ 𝐺 ∈ ℕ0 | |
| 10 | 9 | nn0cni 12440 | . . . . 5 ⊢ 𝐺 ∈ ℂ |
| 11 | 10 | addlidi 11325 | . . . 4 ⊢ (0 + 𝐺) = 𝐺 |
| 12 | 11 | oveq2i 7367 | . . 3 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = ((𝐴 · 𝑃) + 𝐺) |
| 13 | decrmac.e | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐺) = 𝐸 | |
| 14 | 12, 13 | eqtri 2762 | . 2 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = 𝐸 |
| 15 | decrmac.2 | . 2 ⊢ ((𝐵 · 𝑃) + 𝑁) = ;𝐺𝐹 | |
| 16 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | decmac 12687 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∈ wcel 2119 (class class class)co 7356 0cc0 11029 + caddc 11032 · cmul 11034 ℕ0cn0 12428 ;cdc 12635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-ltxr 11175 df-sub 11370 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-dec 12636 |
| This theorem is referenced by: 2exp16 17052 139prm 17085 163prm 17086 1259lem1 17092 1259lem3 17094 1259lem4 17095 2503lem1 17098 2503lem2 17099 4001lem1 17102 4001lem3 17104 4001prm 17106 log2ub 26931 139prmALT 48074 127prm 48077 |
| Copyright terms: Public domain | W3C validator |