| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dig1 | Structured version Visualization version GIF version | ||
| Description: All but one digits of 1 are 0. (Contributed by AV, 24-May-2020.) |
| Ref | Expression |
|---|---|
| dig1 | ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzelcn 12841 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
| 2 | 1 | exp0d 14143 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
| 3 | 2 | eqcomd 2762 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
| 4 | 3 | ad2antrl 736 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 = (𝐵↑0)) |
| 5 | 4 | oveq2d 7401 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = (𝐾(digit‘𝐵)(𝐵↑0))) |
| 6 | simprl 778 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ (ℤ≥‘2)) | |
| 7 | simpr 487 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → 𝐾 ∈ ℤ) | |
| 8 | 7 | anim2i 625 | . . . . . 6 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (0 ≤ 𝐾 ∧ 𝐾 ∈ ℤ)) |
| 9 | 8 | ancomd 464 | . . . . 5 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) |
| 10 | elnn0z 12571 | . . . . 5 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) | |
| 11 | 9, 10 | sylibr 236 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℕ0) |
| 12 | 0nn0 12486 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 13 | 12 | a1i 11 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 0 ∈ ℕ0) |
| 14 | digexp 49177 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) | |
| 15 | 6, 11, 13, 14 | syl3anc 1386 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) |
| 16 | 5, 15 | eqtrd 2791 | . 2 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 17 | eluz2nn 12879 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
| 18 | 17 | ad2antrl 736 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ ℕ) |
| 19 | simprr 780 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℤ) | |
| 20 | nn0ge0 12496 | . . . . . . . 8 ⊢ (𝐾 ∈ ℕ0 → 0 ≤ 𝐾) | |
| 21 | 20 | a1i 11 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ ℕ0 → 0 ≤ 𝐾)) |
| 22 | 21 | con3d 152 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (¬ 0 ≤ 𝐾 → ¬ 𝐾 ∈ ℕ0)) |
| 23 | 22 | impcom 410 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → ¬ 𝐾 ∈ ℕ0) |
| 24 | 19, 23 | eldifd 3910 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ (ℤ ∖ ℕ0)) |
| 25 | 1nn0 12487 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 26 | 25 | a1i 11 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 ∈ ℕ0) |
| 27 | dignn0fr 49171 | . . . 4 ⊢ ((𝐵 ∈ ℕ ∧ 𝐾 ∈ (ℤ ∖ ℕ0) ∧ 1 ∈ ℕ0) → (𝐾(digit‘𝐵)1) = 0) | |
| 28 | 18, 24, 26, 27 | syl3anc 1386 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = 0) |
| 29 | 0le0 12309 | . . . . . . . 8 ⊢ 0 ≤ 0 | |
| 30 | breq2 5098 | . . . . . . . 8 ⊢ (𝐾 = 0 → (0 ≤ 𝐾 ↔ 0 ≤ 0)) | |
| 31 | 29, 30 | mpbiri 260 | . . . . . . 7 ⊢ (𝐾 = 0 → 0 ≤ 𝐾) |
| 32 | 31 | a1i 11 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾 = 0 → 0 ≤ 𝐾)) |
| 33 | 32 | con3d 152 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (¬ 0 ≤ 𝐾 → ¬ 𝐾 = 0)) |
| 34 | 33 | impcom 410 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → ¬ 𝐾 = 0) |
| 35 | 34 | iffalsed 4485 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → if(𝐾 = 0, 1, 0) = 0) |
| 36 | 28, 35 | eqtr4d 2794 | . 2 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 37 | 16, 36 | pm2.61ian 819 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ∖ cdif 3896 ifcif 4474 class class class wbr 5094 ‘cfv 6510 (class class class)co 7385 0cc0 11063 1c1 11064 ≤ cle 11207 ℕcn 12200 2c2 12262 ℕ0cn0 12471 ℤcz 12558 ℤ≥cuz 12829 ↑cexp 14064 digitcdig 49165 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-pre-sup 11141 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-sup 9378 df-inf 9379 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-div 11835 df-nn 12201 df-2 12270 df-n0 12472 df-z 12559 df-uz 12830 df-rp 12984 df-ico 13345 df-fl 13792 df-mod 13870 df-seq 14005 df-exp 14065 df-dig 49166 |
| This theorem is referenced by: 0dig1 49179 |
| Copyright terms: Public domain | W3C validator |