| 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 12872 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
| 2 | 1 | exp0d 14162 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
| 3 | 2 | eqcomd 2740 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
| 4 | 3 | ad2antrl 728 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 = (𝐵↑0)) |
| 5 | 4 | oveq2d 7429 | . . 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 12609 | . . . . 5 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) | |
| 11 | 9, 10 | sylibr 234 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℕ0) |
| 12 | 0nn0 12524 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 13 | 12 | a1i 11 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 0 ∈ ℕ0) |
| 14 | digexp 48486 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) | |
| 15 | 6, 11, 13, 14 | syl3anc 1372 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) |
| 16 | 5, 15 | eqtrd 2769 | . 2 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 17 | eluz2nn 12906 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
| 18 | 17 | ad2antrl 728 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ ℕ) |
| 19 | simprr 772 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℤ) | |
| 20 | nn0ge0 12534 | . . . . . . . 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 3942 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ (ℤ ∖ ℕ0)) |
| 25 | 1nn0 12525 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 26 | 25 | a1i 11 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 ∈ ℕ0) |
| 27 | dignn0fr 48480 | . . . 4 ⊢ ((𝐵 ∈ ℕ ∧ 𝐾 ∈ (ℤ ∖ ℕ0) ∧ 1 ∈ ℕ0) → (𝐾(digit‘𝐵)1) = 0) | |
| 28 | 18, 24, 26, 27 | syl3anc 1372 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = 0) |
| 29 | 0le0 12349 | . . . . . . . 8 ⊢ 0 ≤ 0 | |
| 30 | breq2 5127 | . . . . . . . 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 4516 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → if(𝐾 = 0, 1, 0) = 0) |
| 36 | 28, 35 | eqtr4d 2772 | . 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 1539 ∈ wcel 2107 ∖ cdif 3928 ifcif 4505 class class class wbr 5123 ‘cfv 6541 (class class class)co 7413 0cc0 11137 1c1 11138 ≤ cle 11278 ℕcn 12248 2c2 12303 ℕ0cn0 12509 ℤcz 12596 ℤ≥cuz 12860 ↑cexp 14084 digitcdig 48474 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214 ax-pre-sup 11215 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7870 df-1st 7996 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-er 8727 df-en 8968 df-dom 8969 df-sdom 8970 df-sup 9464 df-inf 9465 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-div 11903 df-nn 12249 df-2 12311 df-n0 12510 df-z 12597 df-uz 12861 df-rp 13017 df-ico 13375 df-fl 13814 df-mod 13892 df-seq 14025 df-exp 14085 df-dig 48475 |
| This theorem is referenced by: 0dig1 48488 |
| Copyright terms: Public domain | W3C validator |