| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > decmac | GIF version | ||
| Description: Perform a multiply-add of two numerals 𝑀 and 𝑁 against a fixed multiplicand 𝑃 (with 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 | ⊢ 𝑁 = ;𝐶𝐷 |
| decmac.p | ⊢ 𝑃 ∈ ℕ0 |
| decmac.f | ⊢ 𝐹 ∈ ℕ0 |
| decmac.g | ⊢ 𝐺 ∈ ℕ0 |
| decmac.e | ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 |
| decmac.2 | ⊢ ((𝐵 · 𝑃) + 𝐷) = ;𝐺𝐹 |
| Ref | Expression |
|---|---|
| decmac | ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 10nn0 9812 | . . 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 9794 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 8 | 6, 7 | eqtri 2259 | . . 3 ⊢ 𝑀 = ((;10 · 𝐴) + 𝐵) |
| 9 | decma.n | . . . 4 ⊢ 𝑁 = ;𝐶𝐷 | |
| 10 | dfdec10 9794 | . . . 4 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
| 11 | 9, 10 | eqtri 2259 | . . 3 ⊢ 𝑁 = ((;10 · 𝐶) + 𝐷) |
| 12 | decmac.p | . . 3 ⊢ 𝑃 ∈ ℕ0 | |
| 13 | decmac.f | . . 3 ⊢ 𝐹 ∈ ℕ0 | |
| 14 | decmac.g | . . 3 ⊢ 𝐺 ∈ ℕ0 | |
| 15 | decmac.e | . . 3 ⊢ ((𝐴 · 𝑃) + (𝐶 + 𝐺)) = 𝐸 | |
| 16 | decmac.2 | . . . 4 ⊢ ((𝐵 · 𝑃) + 𝐷) = ;𝐺𝐹 | |
| 17 | dfdec10 9794 | . . . 4 ⊢ ;𝐺𝐹 = ((;10 · 𝐺) + 𝐹) | |
| 18 | 16, 17 | eqtri 2259 | . . 3 ⊢ ((𝐵 · 𝑃) + 𝐷) = ((;10 · 𝐺) + 𝐹) |
| 19 | 1, 2, 3, 4, 5, 8, 11, 12, 13, 14, 15, 18 | nummac 9840 | . 2 ⊢ ((𝑀 · 𝑃) + 𝑁) = ((;10 · 𝐸) + 𝐹) |
| 20 | dfdec10 9794 | . 2 ⊢ ;𝐸𝐹 = ((;10 · 𝐸) + 𝐹) | |
| 21 | 19, 20 | eqtr4i 2262 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: = wceq 1402 ∈ wcel 2209 (class class class)co 6091 0cc0 8189 1c1 8190 + caddc 8192 · cmul 8194 ℕ0cn0 9578 ;cdc 9791 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-setind 4686 ax-cnex 8280 ax-resscn 8281 ax-1cn 8282 ax-1re 8283 ax-icn 8284 ax-addcl 8285 ax-addrcl 8286 ax-mulcl 8287 ax-addcom 8289 ax-mulcom 8290 ax-addass 8291 ax-mulass 8292 ax-distr 8293 ax-i2m1 8294 ax-1rid 8296 ax-0id 8297 ax-rnegex 8298 ax-cnre 8300 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5343 df-fun 5385 df-fv 5391 df-riota 6044 df-ov 6094 df-oprab 6095 df-mpo 6096 df-sub 8510 df-inn 9318 df-2 9376 df-3 9377 df-4 9378 df-5 9379 df-6 9380 df-7 9381 df-8 9382 df-9 9383 df-n0 9579 df-dec 9792 |
| This theorem is used by: decrmac 9853 2exp16 13249 37prm 13267 43prm 13268 83prm 13269 139prm 13270 163prm 13271 317prm 13272 631prm 13273 1259lem1 13274 1259lem2 13275 1259lem3 13276 1259lem4 13277 1259lem5 13278 1259prm 13279 log2ublem3 16274 log2ublog2 16275 |
| Copyright terms: Public domain | W3C validator |