| 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 12661 | . 2 ⊢ 0 ∈ ℕ0 | |
| 4 | decrmanc.n | . 2 ⊢ 𝑁 ∈ ℕ0 | |
| 5 | decrmanc.m | . 2 ⊢ 𝑀 = ;𝐴𝐵 | |
| 6 | 4 | dec0h 12881 | . 2 ⊢ 𝑁 = ;0𝑁 |
| 7 | decrmanc.p | . 2 ⊢ 𝑃 ∈ ℕ0 | |
| 8 | decrmac.f | . 2 ⊢ 𝐹 ∈ ℕ0 | |
| 9 | decrmac.g | . 2 ⊢ 𝐺 ∈ ℕ0 | |
| 10 | 9 | nn0cni 12658 | . . . . 5 ⊢ 𝐺 ∈ ℂ |
| 11 | 10 | addlidi 11537 | . . . 4 ⊢ (0 + 𝐺) = 𝐺 |
| 12 | 11 | oveq2i 7462 | . . 3 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = ((𝐴 · 𝑃) + 𝐺) |
| 13 | decrmac.e | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐺) = 𝐸 | |
| 14 | 12, 13 | eqtri 2786 | . 2 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = 𝐸 |
| 15 | decrmac.2 | . 2 ⊢ ((𝐵 · 𝑃) + 𝑁) = ;𝐺𝐹 | |
| 16 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | decmac 12911 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 (class class class)co 7451 0cc0 11239 + caddc 11242 · cmul 11244 ℕ0cn0 12646 ;cdc 12854 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-dec 12855 |
| This theorem is used by: 2exp16 17312 139prm 17346 163prm 17347 1259lem1 17353 1259lem3 17355 1259lem4 17356 2503lem1 17359 2503lem2 17360 4001lem1 17363 4001lem3 17365 4001prm 17367 log2ub 27334 139prmALT 48954 127prm 48957 |
| Copyright terms: Public domain | W3C validator |