| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > decmul10add | GIF version | ||
| Description: A multiplication of a number and a numeral expressed as addition with first summand as multiple of 10. (Contributed by AV, 22-Jul-2021.) (Revised by AV, 6-Sep-2021.) |
| Ref | Expression |
|---|---|
| decmul10add.1 | ⊢ 𝐴 ∈ ℕ0 |
| decmul10add.2 | ⊢ 𝐵 ∈ ℕ0 |
| decmul10add.3 | ⊢ 𝑀 ∈ ℕ0 |
| decmul10add.4 | ⊢ 𝐸 = (𝑀 · 𝐴) |
| decmul10add.5 | ⊢ 𝐹 = (𝑀 · 𝐵) |
| Ref | Expression |
|---|---|
| decmul10add | ⊢ (𝑀 · ;𝐴𝐵) = (;𝐸0 + 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfdec10 9792 | . . 3 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 2 | 1 | oveq2i 6099 | . 2 ⊢ (𝑀 · ;𝐴𝐵) = (𝑀 · ((;10 · 𝐴) + 𝐵)) |
| 3 | decmul10add.3 | . . . 4 ⊢ 𝑀 ∈ ℕ0 | |
| 4 | 3 | nn0cni 9587 | . . 3 ⊢ 𝑀 ∈ ℂ |
| 5 | 10nn0 9810 | . . . . 5 ⊢ ;10 ∈ ℕ0 | |
| 6 | decmul10add.1 | . . . . 5 ⊢ 𝐴 ∈ ℕ0 | |
| 7 | 5, 6 | nn0mulcli 9613 | . . . 4 ⊢ (;10 · 𝐴) ∈ ℕ0 |
| 8 | 7 | nn0cni 9587 | . . 3 ⊢ (;10 · 𝐴) ∈ ℂ |
| 9 | decmul10add.2 | . . . 4 ⊢ 𝐵 ∈ ℕ0 | |
| 10 | 9 | nn0cni 9587 | . . 3 ⊢ 𝐵 ∈ ℂ |
| 11 | 4, 8, 10 | adddii 8343 | . 2 ⊢ (𝑀 · ((;10 · 𝐴) + 𝐵)) = ((𝑀 · (;10 · 𝐴)) + (𝑀 · 𝐵)) |
| 12 | 5 | nn0cni 9587 | . . . . 5 ⊢ ;10 ∈ ℂ |
| 13 | 6 | nn0cni 9587 | . . . . 5 ⊢ 𝐴 ∈ ℂ |
| 14 | 4, 12, 13 | mul12i 8480 | . . . 4 ⊢ (𝑀 · (;10 · 𝐴)) = (;10 · (𝑀 · 𝐴)) |
| 15 | 3, 6 | nn0mulcli 9613 | . . . . 5 ⊢ (𝑀 · 𝐴) ∈ ℕ0 |
| 16 | 15 | dec0u 9814 | . . . 4 ⊢ (;10 · (𝑀 · 𝐴)) = ;(𝑀 · 𝐴)0 |
| 17 | decmul10add.4 | . . . . . 6 ⊢ 𝐸 = (𝑀 · 𝐴) | |
| 18 | 17 | eqcomi 2242 | . . . . 5 ⊢ (𝑀 · 𝐴) = 𝐸 |
| 19 | 18 | deceq1i 9795 | . . . 4 ⊢ ;(𝑀 · 𝐴)0 = ;𝐸0 |
| 20 | 14, 16, 19 | 3eqtri 2263 | . . 3 ⊢ (𝑀 · (;10 · 𝐴)) = ;𝐸0 |
| 21 | decmul10add.5 | . . . 4 ⊢ 𝐹 = (𝑀 · 𝐵) | |
| 22 | 21 | eqcomi 2242 | . . 3 ⊢ (𝑀 · 𝐵) = 𝐹 |
| 23 | 20, 22 | oveq12i 6100 | . 2 ⊢ ((𝑀 · (;10 · 𝐴)) + (𝑀 · 𝐵)) = (;𝐸0 + 𝐹) |
| 24 | 2, 11, 23 | 3eqtri 2263 | 1 ⊢ (𝑀 · ;𝐴𝐵) = (;𝐸0 + 𝐹) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: = wceq 1402 ∈ wcel 2209 (class class class)co 6088 0cc0 8186 1c1 8187 + caddc 8189 · cmul 8191 ℕ0cn0 9575 ;cdc 9789 |
| 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 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-cnre 8297 |
| 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 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-sub 8507 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-5 9376 df-6 9377 df-7 9378 df-8 9379 df-9 9380 df-n0 9576 df-dec 9790 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |