| 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 12736 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
| 2 | 1 | exp0d 14039 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
| 3 | 2 | eqcomd 2736 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
| 4 | 3 | ad2antrl 728 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 = (𝐵↑0)) |
| 5 | 4 | oveq2d 7357 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = (𝐾(digit‘𝐵)(𝐵↑0))) |
| 6 | simprl 770 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ (ℤ≥‘2)) | |
| 7 | simpr 484 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → 𝐾 ∈ ℤ) | |
| 8 | 7 | anim2i 617 | . . . . . 6 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (0 ≤ 𝐾 ∧ 𝐾 ∈ ℤ)) |
| 9 | 8 | ancomd 461 | . . . . 5 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) |
| 10 | elnn0z 12473 | . . . . 5 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) | |
| 11 | 9, 10 | sylibr 234 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℕ0) |
| 12 | 0nn0 12388 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 13 | 12 | a1i 11 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 0 ∈ ℕ0) |
| 14 | digexp 48618 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) | |
| 15 | 6, 11, 13, 14 | syl3anc 1373 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) |
| 16 | 5, 15 | eqtrd 2765 | . 2 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 17 | eluz2nn 12778 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
| 18 | 17 | ad2antrl 728 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ ℕ) |
| 19 | simprr 772 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℤ) | |
| 20 | nn0ge0 12398 | . . . . . . . 8 ⊢ (𝐾 ∈ ℕ0 → 0 ≤ 𝐾) | |
| 21 | 20 | a1i 11 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ ℕ0 → 0 ≤ 𝐾)) |
| 22 | 21 | con3d 152 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (¬ 0 ≤ 𝐾 → ¬ 𝐾 ∈ ℕ0)) |
| 23 | 22 | impcom 407 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → ¬ 𝐾 ∈ ℕ0) |
| 24 | 19, 23 | eldifd 3911 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ (ℤ ∖ ℕ0)) |
| 25 | 1nn0 12389 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 26 | 25 | a1i 11 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 ∈ ℕ0) |
| 27 | dignn0fr 48612 | . . . 4 ⊢ ((𝐵 ∈ ℕ ∧ 𝐾 ∈ (ℤ ∖ ℕ0) ∧ 1 ∈ ℕ0) → (𝐾(digit‘𝐵)1) = 0) | |
| 28 | 18, 24, 26, 27 | syl3anc 1373 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = 0) |
| 29 | 0le0 12218 | . . . . . . . 8 ⊢ 0 ≤ 0 | |
| 30 | breq2 5093 | . . . . . . . 8 ⊢ (𝐾 = 0 → (0 ≤ 𝐾 ↔ 0 ≤ 0)) | |
| 31 | 29, 30 | mpbiri 258 | . . . . . . 7 ⊢ (𝐾 = 0 → 0 ≤ 𝐾) |
| 32 | 31 | a1i 11 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾 = 0 → 0 ≤ 𝐾)) |
| 33 | 32 | con3d 152 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (¬ 0 ≤ 𝐾 → ¬ 𝐾 = 0)) |
| 34 | 33 | impcom 407 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → ¬ 𝐾 = 0) |
| 35 | 34 | iffalsed 4484 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → if(𝐾 = 0, 1, 0) = 0) |
| 36 | 28, 35 | eqtr4d 2768 | . 2 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 37 | 16, 36 | pm2.61ian 811 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2110 ∖ cdif 3897 ifcif 4473 class class class wbr 5089 ‘cfv 6477 (class class class)co 7341 0cc0 10998 1c1 10999 ≤ cle 11139 ℕcn 12117 2c2 12172 ℕ0cn0 12373 ℤcz 12460 ℤ≥cuz 12724 ↑cexp 13960 digitcdig 48606 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 ax-pre-sup 11076 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-sup 9321 df-inf 9322 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-div 11767 df-nn 12118 df-2 12180 df-n0 12374 df-z 12461 df-uz 12725 df-rp 12883 df-ico 13243 df-fl 13688 df-mod 13766 df-seq 13901 df-exp 13961 df-dig 48607 |
| This theorem is referenced by: 0dig1 48620 |
| Copyright terms: Public domain | W3C validator |