| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > decrmac | 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 9407 | . 2 ⊢ 0 ∈ ℕ0 | |
| 4 | decrmanc.n | . 2 ⊢ 𝑁 ∈ ℕ0 | |
| 5 | decrmanc.m | . 2 ⊢ 𝑀 = ;𝐴𝐵 | |
| 6 | 4 | dec0h 9622 | . 2 ⊢ 𝑁 = ;0𝑁 |
| 7 | decrmanc.p | . 2 ⊢ 𝑃 ∈ ℕ0 | |
| 8 | decrmac.f | . 2 ⊢ 𝐹 ∈ ℕ0 | |
| 9 | decrmac.g | . 2 ⊢ 𝐺 ∈ ℕ0 | |
| 10 | 9 | nn0cni 9404 | . . . . 5 ⊢ 𝐺 ∈ ℂ |
| 11 | 10 | addlidi 8312 | . . . 4 ⊢ (0 + 𝐺) = 𝐺 |
| 12 | 11 | oveq2i 6024 | . . 3 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = ((𝐴 · 𝑃) + 𝐺) |
| 13 | decrmac.e | . . 3 ⊢ ((𝐴 · 𝑃) + 𝐺) = 𝐸 | |
| 14 | 12, 13 | eqtri 2250 | . 2 ⊢ ((𝐴 · 𝑃) + (0 + 𝐺)) = 𝐸 |
| 15 | decrmac.2 | . 2 ⊢ ((𝐵 · 𝑃) + 𝑁) = ;𝐺𝐹 | |
| 16 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | decmac 9652 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ∈ wcel 2200 (class class class)co 6013 0cc0 8022 + caddc 8025 · cmul 8027 ℕ0cn0 9392 ;cdc 9601 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-iota 5284 df-fun 5326 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-sub 8342 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-5 9195 df-6 9196 df-7 9197 df-8 9198 df-9 9199 df-n0 9393 df-dec 9602 |
| This theorem is referenced by: 2exp16 13000 |
| Copyright terms: Public domain | W3C validator |