| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3dvdsdec | Structured version Visualization version 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 12720 | . . . 4 ⊢ ;𝐴𝐵 = ((;10 · 𝐴) + 𝐵) | |
| 2 | 9p1e10 12719 | . . . . . . . 8 ⊢ (9 + 1) = ;10 | |
| 3 | 2 | eqcomi 2771 | . . . . . . 7 ⊢ ;10 = (9 + 1) |
| 4 | 3 | oveq1i 7422 | . . . . . 6 ⊢ (;10 · 𝐴) = ((9 + 1) · 𝐴) |
| 5 | 9cn 12347 | . . . . . . 7 ⊢ 9 ∈ ℂ | |
| 6 | ax-1cn 11164 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 7 | 3dvdsdec.a | . . . . . . . 8 ⊢ 𝐴 ∈ ℕ0 | |
| 8 | 7 | nn0cni 12522 | . . . . . . 7 ⊢ 𝐴 ∈ ℂ |
| 9 | 5, 6, 8 | adddiri 11228 | . . . . . 6 ⊢ ((9 + 1) · 𝐴) = ((9 · 𝐴) + (1 · 𝐴)) |
| 10 | 8 | mullidi 11220 | . . . . . . 7 ⊢ (1 · 𝐴) = 𝐴 |
| 11 | 10 | oveq2i 7423 | . . . . . 6 ⊢ ((9 · 𝐴) + (1 · 𝐴)) = ((9 · 𝐴) + 𝐴) |
| 12 | 4, 9, 11 | 3eqtri 2789 | . . . . 5 ⊢ (;10 · 𝐴) = ((9 · 𝐴) + 𝐴) |
| 13 | 12 | oveq1i 7422 | . . . 4 ⊢ ((;10 · 𝐴) + 𝐵) = (((9 · 𝐴) + 𝐴) + 𝐵) |
| 14 | 5, 8 | mulcli 11222 | . . . . 5 ⊢ (9 · 𝐴) ∈ ℂ |
| 15 | 3dvdsdec.b | . . . . . 6 ⊢ 𝐵 ∈ ℕ0 | |
| 16 | 15 | nn0cni 12522 | . . . . 5 ⊢ 𝐵 ∈ ℂ |
| 17 | 14, 8, 16 | addassi 11225 | . . . 4 ⊢ (((9 · 𝐴) + 𝐴) + 𝐵) = ((9 · 𝐴) + (𝐴 + 𝐵)) |
| 18 | 1, 13, 17 | 3eqtri 2789 | . . 3 ⊢ ;𝐴𝐵 = ((9 · 𝐴) + (𝐴 + 𝐵)) |
| 19 | 18 | breq2i 5116 | . 2 ⊢ (3 ∥ ;𝐴𝐵 ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵))) |
| 20 | 3z 12633 | . . 3 ⊢ 3 ∈ ℤ | |
| 21 | 7 | nn0zi 12625 | . . . 4 ⊢ 𝐴 ∈ ℤ |
| 22 | 15 | nn0zi 12625 | . . . 4 ⊢ 𝐵 ∈ ℤ |
| 23 | zaddcl 12640 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 + 𝐵) ∈ ℤ) | |
| 24 | 21, 22, 23 | mp2an 704 | . . 3 ⊢ (𝐴 + 𝐵) ∈ ℤ |
| 25 | 9nn 12345 | . . . . . 6 ⊢ 9 ∈ ℕ | |
| 26 | 25 | nnzi 12624 | . . . . 5 ⊢ 9 ∈ ℤ |
| 27 | zmulcl 12649 | . . . . 5 ⊢ ((9 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (9 · 𝐴) ∈ ℤ) | |
| 28 | 26, 21, 27 | mp2an 704 | . . . 4 ⊢ (9 · 𝐴) ∈ ℤ |
| 29 | zmulcl 12649 | . . . . . . 7 ⊢ ((3 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (3 · 𝐴) ∈ ℤ) | |
| 30 | 20, 21, 29 | mp2an 704 | . . . . . 6 ⊢ (3 · 𝐴) ∈ ℤ |
| 31 | dvdsmul1 16341 | . . . . . 6 ⊢ ((3 ∈ ℤ ∧ (3 · 𝐴) ∈ ℤ) → 3 ∥ (3 · (3 · 𝐴))) | |
| 32 | 20, 30, 31 | mp2an 704 | . . . . 5 ⊢ 3 ∥ (3 · (3 · 𝐴)) |
| 33 | 3t3e9 12414 | . . . . . . . 8 ⊢ (3 · 3) = 9 | |
| 34 | 33 | eqcomi 2771 | . . . . . . 7 ⊢ 9 = (3 · 3) |
| 35 | 34 | oveq1i 7422 | . . . . . 6 ⊢ (9 · 𝐴) = ((3 · 3) · 𝐴) |
| 36 | 3cn 12328 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
| 37 | 36, 36, 8 | mulassi 11226 | . . . . . 6 ⊢ ((3 · 3) · 𝐴) = (3 · (3 · 𝐴)) |
| 38 | 35, 37 | eqtri 2785 | . . . . 5 ⊢ (9 · 𝐴) = (3 · (3 · 𝐴)) |
| 39 | 32, 38 | breqtrri 5137 | . . . 4 ⊢ 3 ∥ (9 · 𝐴) |
| 40 | 28, 39 | pm3.2i 475 | . . 3 ⊢ ((9 · 𝐴) ∈ ℤ ∧ 3 ∥ (9 · 𝐴)) |
| 41 | dvdsadd2b 16370 | . . 3 ⊢ ((3 ∈ ℤ ∧ (𝐴 + 𝐵) ∈ ℤ ∧ ((9 · 𝐴) ∈ ℤ ∧ 3 ∥ (9 · 𝐴))) → (3 ∥ (𝐴 + 𝐵) ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵)))) | |
| 42 | 20, 24, 40, 41 | mp3an 1489 | . 2 ⊢ (3 ∥ (𝐴 + 𝐵) ↔ 3 ∥ ((9 · 𝐴) + (𝐴 + 𝐵))) |
| 43 | 19, 42 | bitr4i 281 | 1 ⊢ (3 ∥ ;𝐴𝐵 ↔ 3 ∥ (𝐴 + 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 ∈ wcel 2142 class class class wbr 5108 (class class class)co 7412 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 3c3 12302 9c9 12308 ℕ0cn0 12510 ℤcz 12597 ;cdc 12717 ∥ cdvds 16316 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-z 12598 df-dec 12718 df-dvds 16317 |
| This theorem is used by: 257prm 48341 139prmALT 48376 31prm 48377 |
| Copyright terms: Public domain | W3C validator |