| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > decrmanc | GIF version | ||
| Description: Perform a multiply-add of two numerals 𝑀 and 𝑁 against a fixed multiplicand 𝑃 (no carry). (Contributed by AV, 16-Sep-2021.) |
| Ref | Expression |
|---|---|
| decrmanc.a | ⊢ 𝐴 ∈ ℕ0 |
| decrmanc.b | ⊢ 𝐵 ∈ ℕ0 |
| decrmanc.n | ⊢ 𝑁 ∈ ℕ0 |
| decrmanc.m | ⊢ 𝑀 = ;𝐴𝐵 |
| decrmanc.p | ⊢ 𝑃 ∈ ℕ0 |
| decrmanc.e | ⊢ (𝐴 · 𝑃) = 𝐸 |
| decrmanc.f | ⊢ ((𝐵 · 𝑃) + 𝑁) = 𝐹 |
| Ref | Expression |
|---|---|
| decrmanc | ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | decrmanc.a | . 2 ⊢ 𝐴 ∈ ℕ0 | |
| 2 | decrmanc.b | . 2 ⊢ 𝐵 ∈ ℕ0 | |
| 3 | 0nn0 9460 | . 2 ⊢ 0 ∈ ℕ0 | |
| 4 | decrmanc.n | . 2 ⊢ 𝑁 ∈ ℕ0 | |
| 5 | decrmanc.m | . 2 ⊢ 𝑀 = ;𝐴𝐵 | |
| 6 | 4 | dec0h 9675 | . 2 ⊢ 𝑁 = ;0𝑁 |
| 7 | decrmanc.p | . 2 ⊢ 𝑃 ∈ ℕ0 | |
| 8 | 1, 7 | nn0mulcli 9483 | . . . . 5 ⊢ (𝐴 · 𝑃) ∈ ℕ0 |
| 9 | 8 | nn0cni 9457 | . . . 4 ⊢ (𝐴 · 𝑃) ∈ ℂ |
| 10 | 9 | addridi 8364 | . . 3 ⊢ ((𝐴 · 𝑃) + 0) = (𝐴 · 𝑃) |
| 11 | decrmanc.e | . . 3 ⊢ (𝐴 · 𝑃) = 𝐸 | |
| 12 | 10, 11 | eqtri 2252 | . 2 ⊢ ((𝐴 · 𝑃) + 0) = 𝐸 |
| 13 | decrmanc.f | . 2 ⊢ ((𝐵 · 𝑃) + 𝑁) = 𝐹 | |
| 14 | 1, 2, 3, 4, 5, 6, 7, 12, 13 | decma 9704 | 1 ⊢ ((𝑀 · 𝑃) + 𝑁) = ;𝐸𝐹 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∈ wcel 2202 (class class class)co 6028 0cc0 8075 + caddc 8078 · cmul 8080 ℕ0cn0 9445 ;cdc 9654 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-sub 8395 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-5 9248 df-6 9249 df-7 9250 df-8 9251 df-9 9252 df-n0 9446 df-dec 9655 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |