| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > decsplit | Structured version Visualization version GIF version | ||
| Description: Split a decimal number into two parts. Inductive step. (Contributed by Mario Carneiro, 16-Jul-2015.) (Revised by AV, 8-Sep-2021.) |
| Ref | Expression |
|---|---|
| decsplit0.1 | ⊢ 𝐴 ∈ ℕ0 |
| decsplit.2 | ⊢ 𝐵 ∈ ℕ0 |
| decsplit.3 | ⊢ 𝐷 ∈ ℕ0 |
| decsplit.4 | ⊢ 𝑀 ∈ ℕ0 |
| decsplit.5 | ⊢ (𝑀 + 1) = 𝑁 |
| decsplit.6 | ⊢ ((𝐴 · (;10↑𝑀)) + 𝐵) = 𝐶 |
| Ref | Expression |
|---|---|
| decsplit | ⊢ ((𝐴 · (;10↑𝑁)) + ;𝐵𝐷) = ;𝐶𝐷 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 10nn0 12629 | . . . . . 6 ⊢ ;10 ∈ ℕ0 | |
| 2 | decsplit0.1 | . . . . . . 7 ⊢ 𝐴 ∈ ℕ0 | |
| 3 | decsplit.4 | . . . . . . . 8 ⊢ 𝑀 ∈ ℕ0 | |
| 4 | 1, 3 | nn0expcli 14015 | . . . . . . 7 ⊢ (;10↑𝑀) ∈ ℕ0 |
| 5 | 2, 4 | nn0mulcli 12443 | . . . . . 6 ⊢ (𝐴 · (;10↑𝑀)) ∈ ℕ0 |
| 6 | 1, 5 | nn0mulcli 12443 | . . . . 5 ⊢ (;10 · (𝐴 · (;10↑𝑀))) ∈ ℕ0 |
| 7 | 6 | nn0cni 12417 | . . . 4 ⊢ (;10 · (𝐴 · (;10↑𝑀))) ∈ ℂ |
| 8 | decsplit.2 | . . . . . 6 ⊢ 𝐵 ∈ ℕ0 | |
| 9 | 1, 8 | nn0mulcli 12443 | . . . . 5 ⊢ (;10 · 𝐵) ∈ ℕ0 |
| 10 | 9 | nn0cni 12417 | . . . 4 ⊢ (;10 · 𝐵) ∈ ℂ |
| 11 | decsplit.3 | . . . . 5 ⊢ 𝐷 ∈ ℕ0 | |
| 12 | 11 | nn0cni 12417 | . . . 4 ⊢ 𝐷 ∈ ℂ |
| 13 | 7, 10, 12 | addassi 11146 | . . 3 ⊢ (((;10 · (𝐴 · (;10↑𝑀))) + (;10 · 𝐵)) + 𝐷) = ((;10 · (𝐴 · (;10↑𝑀))) + ((;10 · 𝐵) + 𝐷)) |
| 14 | 1 | nn0cni 12417 | . . . . . 6 ⊢ ;10 ∈ ℂ |
| 15 | 5 | nn0cni 12417 | . . . . . 6 ⊢ (𝐴 · (;10↑𝑀)) ∈ ℂ |
| 16 | 8 | nn0cni 12417 | . . . . . 6 ⊢ 𝐵 ∈ ℂ |
| 17 | 14, 15, 16 | adddii 11148 | . . . . 5 ⊢ (;10 · ((𝐴 · (;10↑𝑀)) + 𝐵)) = ((;10 · (𝐴 · (;10↑𝑀))) + (;10 · 𝐵)) |
| 18 | decsplit.6 | . . . . . 6 ⊢ ((𝐴 · (;10↑𝑀)) + 𝐵) = 𝐶 | |
| 19 | 18 | oveq2i 7371 | . . . . 5 ⊢ (;10 · ((𝐴 · (;10↑𝑀)) + 𝐵)) = (;10 · 𝐶) |
| 20 | 17, 19 | eqtr3i 2762 | . . . 4 ⊢ ((;10 · (𝐴 · (;10↑𝑀))) + (;10 · 𝐵)) = (;10 · 𝐶) |
| 21 | 20 | oveq1i 7370 | . . 3 ⊢ (((;10 · (𝐴 · (;10↑𝑀))) + (;10 · 𝐵)) + 𝐷) = ((;10 · 𝐶) + 𝐷) |
| 22 | 13, 21 | eqtr3i 2762 | . 2 ⊢ ((;10 · (𝐴 · (;10↑𝑀))) + ((;10 · 𝐵) + 𝐷)) = ((;10 · 𝐶) + 𝐷) |
| 23 | decsplit.5 | . . . . . 6 ⊢ (𝑀 + 1) = 𝑁 | |
| 24 | 4 | nn0cni 12417 | . . . . . . 7 ⊢ (;10↑𝑀) ∈ ℂ |
| 25 | 24, 14 | mulcomi 11144 | . . . . . 6 ⊢ ((;10↑𝑀) · ;10) = (;10 · (;10↑𝑀)) |
| 26 | 1, 3, 23, 25 | numexpp1 17009 | . . . . 5 ⊢ (;10↑𝑁) = (;10 · (;10↑𝑀)) |
| 27 | 26 | oveq2i 7371 | . . . 4 ⊢ (𝐴 · (;10↑𝑁)) = (𝐴 · (;10 · (;10↑𝑀))) |
| 28 | 2 | nn0cni 12417 | . . . . 5 ⊢ 𝐴 ∈ ℂ |
| 29 | 28, 14, 24 | mul12i 11332 | . . . 4 ⊢ (𝐴 · (;10 · (;10↑𝑀))) = (;10 · (𝐴 · (;10↑𝑀))) |
| 30 | 27, 29 | eqtri 2760 | . . 3 ⊢ (𝐴 · (;10↑𝑁)) = (;10 · (𝐴 · (;10↑𝑀))) |
| 31 | dfdec10 12614 | . . 3 ⊢ ;𝐵𝐷 = ((;10 · 𝐵) + 𝐷) | |
| 32 | 30, 31 | oveq12i 7372 | . 2 ⊢ ((𝐴 · (;10↑𝑁)) + ;𝐵𝐷) = ((;10 · (𝐴 · (;10↑𝑀))) + ((;10 · 𝐵) + 𝐷)) |
| 33 | dfdec10 12614 | . 2 ⊢ ;𝐶𝐷 = ((;10 · 𝐶) + 𝐷) | |
| 34 | 22, 32, 33 | 3eqtr4i 2770 | 1 ⊢ ((𝐴 · (;10↑𝑁)) + ;𝐵𝐷) = ;𝐶𝐷 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 (class class class)co 7360 0cc0 11030 1c1 11031 + caddc 11033 · cmul 11035 ℕ0cn0 12405 ;cdc 12611 ↑cexp 13988 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-dec 12612 df-uz 12756 df-seq 13929 df-exp 13989 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |