Metamath Proof Explorer


Theorem dig2nn1st

Description: The first (relevant) digit of a positive integer in a binary system is 1. (Contributed by AV, 26-May-2020)

Ref Expression
Assertion dig2nn1st ⊢ N ∈ ℕ → # b ⁡ N − 1 digit ⁡ 2 N = 1

Proof

Step Hyp Ref Expression
1 2nn ⊢ 2 ∈ ℕ
2 1 a1i ⊢ N ∈ ℕ → 2 ∈ ℕ
3 blennnelnn ⊢ N ∈ ℕ → # b ⁡ N ∈ ℕ
4 nnm1nn0 ⊢ # b ⁡ N ∈ ℕ → # b ⁡ N − 1 ∈ ℕ 0
5 3 4 syl ⊢ N ∈ ℕ → # b ⁡ N − 1 ∈ ℕ 0
6 nnre ⊢ N ∈ ℕ → N ∈ ℝ
7 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
8 7 nn0ge0d ⊢ N ∈ ℕ → 0 ≤ N
9 elrege0 ⊢ N ∈ 0 +∞ ↔ N ∈ ℝ ∧ 0 ≤ N
10 6 8 9 sylanbrc ⊢ N ∈ ℕ → N ∈ 0 +∞
11 nn0digval ⊢ 2 ∈ ℕ ∧ # b ⁡ N − 1 ∈ ℕ 0 ∧ N ∈ 0 +∞ → # b ⁡ N − 1 digit ⁡ 2 N = N 2 # b ⁡ N − 1 mod 2
12 2 5 10 11 syl3anc ⊢ N ∈ ℕ → # b ⁡ N − 1 digit ⁡ 2 N = N 2 # b ⁡ N − 1 mod 2
13 n2dvds1 ⊢ ¬ 2 ∥ 1
14 blennn ⊢ N ∈ ℕ → # b ⁡ N = log 2 N + 1
15 14 oveq1d ⊢ N ∈ ℕ → # b ⁡ N − 1 = log 2 N + 1 - 1
16 2z ⊢ 2 ∈ ℤ
17 uzid ⊢ 2 ∈ ℤ → 2 ∈ ℤ ≥ 2
18 16 17 ax-mp ⊢ 2 ∈ ℤ ≥ 2
19 nnrp ⊢ N ∈ ℕ → N ∈ ℝ +
20 relogbzcl ⊢ 2 ∈ ℤ ≥ 2 ∧ N ∈ ℝ + → log 2 N ∈ ℝ
21 18 19 20 sylancr ⊢ N ∈ ℕ → log 2 N ∈ ℝ
22 21 flcld ⊢ N ∈ ℕ → log 2 N ∈ ℤ
23 22 zcnd ⊢ N ∈ ℕ → log 2 N ∈ ℂ
24 pncan1 ⊢ log 2 N ∈ ℂ → log 2 N + 1 - 1 = log 2 N
25 23 24 syl ⊢ N ∈ ℕ → log 2 N + 1 - 1 = log 2 N
26 15 25 eqtrd ⊢ N ∈ ℕ → # b ⁡ N − 1 = log 2 N
27 26 oveq2d ⊢ N ∈ ℕ → 2 # b ⁡ N − 1 = 2 log 2 N
28 27 oveq2d ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 = N 2 log 2 N
29 28 fveq2d ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 = N 2 log 2 N
30 fldivexpfllog2 ⊢ N ∈ ℝ + → N 2 log 2 N = 1
31 19 30 syl ⊢ N ∈ ℕ → N 2 log 2 N = 1
32 29 31 eqtrd ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 = 1
33 32 breq2d ⊢ N ∈ ℕ → 2 ∥ N 2 # b ⁡ N − 1 ↔ 2 ∥ 1
34 13 33 mtbiri ⊢ N ∈ ℕ → ¬ 2 ∥ N 2 # b ⁡ N − 1
35 2re ⊢ 2 ∈ ℝ
36 35 a1i ⊢ N ∈ ℕ → 2 ∈ ℝ
37 36 5 reexpcld ⊢ N ∈ ℕ → 2 # b ⁡ N − 1 ∈ ℝ
38 2cnd ⊢ N ∈ ℕ → 2 ∈ ℂ
39 2ne0 ⊢ 2 ≠ 0
40 39 a1i ⊢ N ∈ ℕ → 2 ≠ 0
41 5 nn0zd ⊢ N ∈ ℕ → # b ⁡ N − 1 ∈ ℤ
42 38 40 41 expne0d ⊢ N ∈ ℕ → 2 # b ⁡ N − 1 ≠ 0
43 6 37 42 redivcld ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 ∈ ℝ
44 43 flcld ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 ∈ ℤ
45 mod2eq1n2dvds ⊢ N 2 # b ⁡ N − 1 ∈ ℤ → N 2 # b ⁡ N − 1 mod 2 = 1 ↔ ¬ 2 ∥ N 2 # b ⁡ N − 1
46 44 45 syl ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 mod 2 = 1 ↔ ¬ 2 ∥ N 2 # b ⁡ N − 1
47 34 46 mpbird ⊢ N ∈ ℕ → N 2 # b ⁡ N − 1 mod 2 = 1
48 12 47 eqtrd ⊢ N ∈ ℕ → # b ⁡ N − 1 digit ⁡ 2 N = 1