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 11913 | . 2 ⊢ 0 ∈ ℕ0 | |
4 | decrmanc.n | . 2 ⊢ 𝑁 ∈ ℕ0 | |
5 | decrmanc.m | . 2 ⊢ 𝑀 = ;𝐴𝐵 | |
6 | 4 | dec0h 12121 | . 2 ⊢ 𝑁 = ;0𝑁 |
7 | decrmanc.p | . 2 ⊢ 𝑃 ∈ ℕ0 | |
8 | decrmac.f | . 2 ⊢ 𝐹 ∈ ℕ0 | |
9 | decrmac.g | . 2 ⊢ 𝐺 ∈ ℕ0 | |
10 | 9 | nn0cni 11910 | . . . . 5 ⊢ 𝐺 ∈ ℂ |
11 | 10 | addid2i 10828 | . . . 4 ⊢ (0 + 𝐺) = 𝐺 |
12 | 11 | oveq2i 7167 | . . 3 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = ((𝐴 · 𝑃) + 𝐺) |
13 | decrmac.e | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐺) = 𝐸 | |
14 | 12, 13 | eqtri 2844 | . 2 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = 𝐸 |
15 | decrmac.2 | . 2 ⊢ ((𝐵 · 𝑃) + 𝑁) = ;𝐺𝐹 | |
16 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | decmac 12151 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 (class class class)co 7156 0cc0 10537 + caddc 10540 · cmul 10542 ℕ0cn0 11898 ;cdc 12099 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-ltxr 10680 df-sub 10872 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-dec 12100 |
This theorem is referenced by: 2exp16 16424 139prm 16457 163prm 16458 1259lem1 16464 1259lem3 16466 1259lem4 16467 2503lem1 16470 2503lem2 16471 4001lem1 16474 4001lem3 16476 4001prm 16478 log2ub 25527 139prmALT 43779 127prm 43783 |
Copyright terms: Public domain | W3C validator |