Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 3dvdsdec | GIF version |
Description: A decimal number is divisible by three iff the sum of its two "digits" is divisible by three. The term "digits" in its narrow sense is only correct if 𝐴 and 𝐵 actually are digits (i.e. nonnegative integers less than 10). However, this theorem holds for arbitrary nonnegative integers 𝐴 and 𝐵, especially if 𝐴 is itself a decimal number, e.g., 𝐴 = ;𝐶𝐷. (Contributed by AV, 14-Jun-2021.) (Revised by AV, 8-Sep-2021.) |
Ref | Expression |
---|---|
3dvdsdec.a | ⊢ 𝐴 ∈ ℕ0 |
3dvdsdec.b | ⊢ 𝐵 ∈ ℕ0 |
Ref | Expression |
---|---|
3dvdsdec | ⊢ (3 ∥ ;𝐴𝐵 ↔ 3 ∥ (𝐴 + 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdec10 9325 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
2 | 9p1e10 9324 | . . . . . . . 8 ⊢ (9 + 1) = ;10 | |
3 | 2 | eqcomi 2169 | . . . . . . 7 ⊢ ;10 = (9 + 1) |
4 | 3 | oveq1i 5852 | . . . . . 6 ⊢ (;10 · 𝐴) = ((9 + 1) · 𝐴) |
5 | 9cn 8945 | . . . . . . 7 ⊢ 9 ∈ ℂ | |
6 | ax-1cn 7846 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
7 | 3dvdsdec.a | . . . . . . . 8 ⊢ 𝐴 ∈ ℕ0 | |
8 | 7 | nn0cni 9126 | . . . . . . 7 ⊢ 𝐴 ∈ ℂ |
9 | 5, 6, 8 | adddiri 7910 | . . . . . 6 ⊢ ((9 + 1) · 𝐴) = ((9 · 𝐴) + (1 · 𝐴)) |
10 | 8 | mulid2i 7902 | . . . . . . 7 ⊢ (1 · 𝐴) = 𝐴 |
11 | 10 | oveq2i 5853 | . . . . . 6 ⊢ ((9 · 𝐴) + (1 · 𝐴)) = ((9 · 𝐴) + 𝐴) |
12 | 4, 9, 11 | 3eqtri 2190 | . . . . 5 ⊢ (;10 · 𝐴) = ((9 · 𝐴) + 𝐴) |
13 | 12 | oveq1i 5852 | . . . 4 ⊢ ((;10 · 𝐴) + 𝐵) = (((9 · 𝐴) + 𝐴) + 𝐵) |
14 | 5, 8 | mulcli 7904 | . . . . 5 ⊢ (9 · 𝐴) ∈ ℂ |
15 | 3dvdsdec.b | . . . . . 6 ⊢ 𝐵 ∈ ℕ0 | |
16 | 15 | nn0cni 9126 | . . . . 5 ⊢ 𝐵 ∈ ℂ |
17 | 14, 8, 16 | addassi 7907 | . . . 4 ⊢ (((9 · 𝐴) + 𝐴) + 𝐵) = ((9 · 𝐴) + (𝐴 + 𝐵)) |
18 | 1, 13, 17 | 3eqtri 2190 | . . 3 ⊢ ;𝐴𝐵 = ((9 · 𝐴) + (𝐴 + 𝐵)) |
19 | 18 | breq2i 3990 | . 2 ⊢ (3 ∥ ;𝐴𝐵 ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵))) |
20 | 3z 9220 | . . 3 ⊢ 3 ∈ ℤ | |
21 | 7 | nn0zi 9213 | . . . 4 ⊢ 𝐴 ∈ ℤ |
22 | 15 | nn0zi 9213 | . . . 4 ⊢ 𝐵 ∈ ℤ |
23 | zaddcl 9231 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 + 𝐵) ∈ ℤ) | |
24 | 21, 22, 23 | mp2an 423 | . . 3 ⊢ (𝐴 + 𝐵) ∈ ℤ |
25 | 9nn 9025 | . . . . . 6 ⊢ 9 ∈ ℕ | |
26 | 25 | nnzi 9212 | . . . . 5 ⊢ 9 ∈ ℤ |
27 | zmulcl 9244 | . . . . 5 ⊢ ((9 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (9 · 𝐴) ∈ ℤ) | |
28 | 26, 21, 27 | mp2an 423 | . . . 4 ⊢ (9 · 𝐴) ∈ ℤ |
29 | zmulcl 9244 | . . . . . . 7 ⊢ ((3 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (3 · 𝐴) ∈ ℤ) | |
30 | 20, 21, 29 | mp2an 423 | . . . . . 6 ⊢ (3 · 𝐴) ∈ ℤ |
31 | dvdsmul1 11753 | . . . . . 6 ⊢ ((3 ∈ ℤ ∧ (3 · 𝐴) ∈ ℤ) → 3 ∥ (3 · (3 · 𝐴))) | |
32 | 20, 30, 31 | mp2an 423 | . . . . 5 ⊢ 3 ∥ (3 · (3 · 𝐴)) |
33 | 3t3e9 9014 | . . . . . . . 8 ⊢ (3 · 3) = 9 | |
34 | 33 | eqcomi 2169 | . . . . . . 7 ⊢ 9 = (3 · 3) |
35 | 34 | oveq1i 5852 | . . . . . 6 ⊢ (9 · 𝐴) = ((3 · 3) · 𝐴) |
36 | 3cn 8932 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
37 | 36, 36, 8 | mulassi 7908 | . . . . . 6 ⊢ ((3 · 3) · 𝐴) = (3 · (3 · 𝐴)) |
38 | 35, 37 | eqtri 2186 | . . . . 5 ⊢ (9 · 𝐴) = (3 · (3 · 𝐴)) |
39 | 32, 38 | breqtrri 4009 | . . . 4 ⊢ 3 ∥ (9 · 𝐴) |
40 | 28, 39 | pm3.2i 270 | . . 3 ⊢ ((9 · 𝐴) ∈ ℤ ∧ 3 ∥ (9 · 𝐴)) |
41 | dvdsadd2b 11780 | . . 3 ⊢ ((3 ∈ ℤ ∧ (𝐴 + 𝐵) ∈ ℤ ∧ ((9 · 𝐴) ∈ ℤ ∧ 3 ∥ (9 · 𝐴))) → (3 ∥ (𝐴 + 𝐵) ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵)))) | |
42 | 20, 24, 40, 41 | mp3an 1327 | . 2 ⊢ (3 ∥ (𝐴 + 𝐵) ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵))) |
43 | 19, 42 | bitr4i 186 | 1 ⊢ (3 ∥ ;𝐴𝐵 ↔ 3 ∥ (𝐴 + 𝐵)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 ∈ wcel 2136 class class class wbr 3982 (class class class)co 5842 0cc0 7753 1c1 7754 + caddc 7756 · cmul 7758 3c3 8909 9c9 8915 ℕ0cn0 9114 ℤcz 9191 ;cdc 9322 ∥ cdvds 11727 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-ltadd 7869 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-br 3983 df-opab 4044 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-inn 8858 df-2 8916 df-3 8917 df-4 8918 df-5 8919 df-6 8920 df-7 8921 df-8 8922 df-9 8923 df-n0 9115 df-z 9192 df-dec 9323 df-dvds 11728 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |