| 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 12789 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
| 2 | 1 | exp0d 14091 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
| 3 | 2 | eqcomd 2743 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
| 4 | 3 | ad2antrl 729 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 = (𝐵↑0)) |
| 5 | 4 | oveq2d 7374 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = (𝐾(digit‘𝐵)(𝐵↑0))) |
| 6 | simprl 771 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ (ℤ≥‘2)) | |
| 7 | simpr 484 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → 𝐾 ∈ ℤ) | |
| 8 | 7 | anim2i 618 | . . . . . 6 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (0 ≤ 𝐾 ∧ 𝐾 ∈ ℤ)) |
| 9 | 8 | ancomd 461 | . . . . 5 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) |
| 10 | elnn0z 12526 | . . . . 5 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾)) | |
| 11 | 9, 10 | sylibr 234 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℕ0) |
| 12 | 0nn0 12441 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 13 | 12 | a1i 11 | . . . 4 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 0 ∈ ℕ0) |
| 14 | digexp 49080 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) | |
| 15 | 6, 11, 13, 14 | syl3anc 1374 | . . 3 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)(𝐵↑0)) = if(𝐾 = 0, 1, 0)) |
| 16 | 5, 15 | eqtrd 2772 | . 2 ⊢ ((0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 17 | eluz2nn 12827 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
| 18 | 17 | ad2antrl 729 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐵 ∈ ℕ) |
| 19 | simprr 773 | . . . . 5 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ ℤ) | |
| 20 | nn0ge0 12451 | . . . . . . . 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 3901 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 𝐾 ∈ (ℤ ∖ ℕ0)) |
| 25 | 1nn0 12442 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 26 | 25 | a1i 11 | . . . 4 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → 1 ∈ ℕ0) |
| 27 | dignn0fr 49074 | . . . 4 ⊢ ((𝐵 ∈ ℕ ∧ 𝐾 ∈ (ℤ ∖ ℕ0) ∧ 1 ∈ ℕ0) → (𝐾(digit‘𝐵)1) = 0) | |
| 28 | 18, 24, 26, 27 | syl3anc 1374 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = 0) |
| 29 | 0le0 12271 | . . . . . . . 8 ⊢ 0 ≤ 0 | |
| 30 | breq2 5090 | . . . . . . . 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 4478 | . . 3 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → if(𝐾 = 0, 1, 0) = 0) |
| 36 | 28, 35 | eqtr4d 2775 | . 2 ⊢ ((¬ 0 ≤ 𝐾 ∧ (𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ)) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| 37 | 16, 36 | pm2.61ian 812 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝐾 ∈ ℤ) → (𝐾(digit‘𝐵)1) = if(𝐾 = 0, 1, 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 ifcif 4467 class class class wbr 5086 ‘cfv 6490 (class class class)co 7358 0cc0 11027 1c1 11028 ≤ cle 11169 ℕcn 12163 2c2 12225 ℕ0cn0 12426 ℤcz 12513 ℤ≥cuz 12777 ↑cexp 14012 digitcdig 49068 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-sup 9346 df-inf 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12164 df-2 12233 df-n0 12427 df-z 12514 df-uz 12778 df-rp 12932 df-ico 13293 df-fl 13740 df-mod 13818 df-seq 13953 df-exp 14013 df-dig 49069 |
| This theorem is referenced by: 0dig1 49082 |
| Copyright terms: Public domain | W3C validator |