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 12119 | . . 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 12104 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
8 | 6, 7 | eqtri 2847 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
10 | dfdec10 12104 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
11 | 9, 10 | eqtri 2847 | . . 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 12145 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
16 | dfdec10 12104 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
17 | 15, 16 | eqtr4i 2850 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1536 ∈ wcel 2113 (class class class)co 7159 0cc0 10540 1c1 10541 + caddc 10543 · cmul 10545 ℕ0cn0 11900 ;cdc 12101 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-om 7584 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-ltxr 10683 df-nn 11642 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-dec 12102 |
This theorem is referenced by: decrmanc 12158 2503lem2 16474 4001lem1 16477 log2ub 25530 sqn5i 39177 |
Copyright terms: Public domain | W3C validator |