![]() |
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 11800 | . . 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 11785 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
8 | 6, 7 | eqtri 2822 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
10 | dfdec10 11785 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
11 | 9, 10 | eqtri 2822 | . . 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 11827 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
16 | dfdec10 11785 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
17 | 15, 16 | eqtr4i 2825 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1653 ∈ wcel 2157 (class class class)co 6879 0cc0 10225 1c1 10226 + caddc 10228 · cmul 10230 ℕ0cn0 11579 ;cdc 11782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2378 ax-ext 2778 ax-sep 4976 ax-nul 4984 ax-pow 5036 ax-pr 5098 ax-un 7184 ax-resscn 10282 ax-1cn 10283 ax-icn 10284 ax-addcl 10285 ax-addrcl 10286 ax-mulcl 10287 ax-mulrcl 10288 ax-mulcom 10289 ax-addass 10290 ax-mulass 10291 ax-distr 10292 ax-i2m1 10293 ax-1ne0 10294 ax-1rid 10295 ax-rnegex 10296 ax-rrecex 10297 ax-cnre 10298 ax-pre-lttri 10299 ax-pre-lttrn 10300 ax-pre-ltadd 10301 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2592 df-eu 2610 df-clab 2787 df-cleq 2793 df-clel 2796 df-nfc 2931 df-ne 2973 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3388 df-sbc 3635 df-csb 3730 df-dif 3773 df-un 3775 df-in 3777 df-ss 3784 df-pss 3786 df-nul 4117 df-if 4279 df-pw 4352 df-sn 4370 df-pr 4372 df-tp 4374 df-op 4376 df-uni 4630 df-iun 4713 df-br 4845 df-opab 4907 df-mpt 4924 df-tr 4947 df-id 5221 df-eprel 5226 df-po 5234 df-so 5235 df-fr 5272 df-we 5274 df-xp 5319 df-rel 5320 df-cnv 5321 df-co 5322 df-dm 5323 df-rn 5324 df-res 5325 df-ima 5326 df-pred 5899 df-ord 5945 df-on 5946 df-lim 5947 df-suc 5948 df-iota 6065 df-fun 6104 df-fn 6105 df-f 6106 df-f1 6107 df-fo 6108 df-f1o 6109 df-fv 6110 df-ov 6882 df-om 7301 df-wrecs 7646 df-recs 7708 df-rdg 7746 df-er 7983 df-en 8197 df-dom 8198 df-sdom 8199 df-pnf 10366 df-mnf 10367 df-ltxr 10369 df-nn 11314 df-2 11375 df-3 11376 df-4 11377 df-5 11378 df-6 11379 df-7 11380 df-8 11381 df-9 11382 df-n0 11580 df-dec 11783 |
This theorem is referenced by: decrmanc 11840 2503lem2 16171 4001lem1 16174 log2ub 25027 sqn5i 37993 |
Copyright terms: Public domain | W3C validator |