Metamath Proof Explorer


Theorem blennn0e2

Description: The binary length of an even positive integer is the binary length of the half of the integer, increased by 1. (Contributed by AV, 29-May-2020)

Ref Expression
Assertion blennn0e2 ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → # b ⁡ N = # b ⁡ N 2 + 1

Proof

Step Hyp Ref Expression
1 2rp ⊢ 2 ∈ ℝ +
2 1ne2 ⊢ 1 ≠ 2
3 2 necomi ⊢ 2 ≠ 1
4 eldifsn ⊢ 2 ∈ ℝ + ∖ 1 ↔ 2 ∈ ℝ + ∧ 2 ≠ 1
5 1 3 4 mpbir2an ⊢ 2 ∈ ℝ + ∖ 1
6 nnrp ⊢ N ∈ ℕ → N ∈ ℝ +
7 6 adantr ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → N ∈ ℝ +
8 relogbdivb ⊢ 2 ∈ ℝ + ∖ 1 ∧ N ∈ ℝ + → log 2 N 2 = log 2 N − 1
9 5 7 8 sylancr ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N 2 = log 2 N − 1
10 9 fveq2d ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N 2 = log 2 N − 1
11 10 oveq1d ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N 2 + 1 = log 2 N − 1 + 1
12 1 a1i ⊢ N ∈ ℕ → 2 ∈ ℝ +
13 3 a1i ⊢ N ∈ ℕ → 2 ≠ 1
14 relogbcl ⊢ 2 ∈ ℝ + ∧ N ∈ ℝ + ∧ 2 ≠ 1 → log 2 N ∈ ℝ
15 12 6 13 14 syl3anc ⊢ N ∈ ℕ → log 2 N ∈ ℝ
16 1zzd ⊢ N ∈ ℕ → 1 ∈ ℤ
17 15 16 jca ⊢ N ∈ ℕ → log 2 N ∈ ℝ ∧ 1 ∈ ℤ
18 17 adantr ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N ∈ ℝ ∧ 1 ∈ ℤ
19 flsubz ⊢ log 2 N ∈ ℝ ∧ 1 ∈ ℤ → log 2 N − 1 = log 2 N − 1
20 18 19 syl ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N − 1 = log 2 N − 1
21 20 oveq1d ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N − 1 + 1 = log 2 N - 1 + 1
22 15 flcld ⊢ N ∈ ℕ → log 2 N ∈ ℤ
23 22 zcnd ⊢ N ∈ ℕ → log 2 N ∈ ℂ
24 npcan1 ⊢ 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 25 adantr ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N - 1 + 1 = log 2 N
27 11 21 26 3eqtrd ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N 2 + 1 = log 2 N
28 27 oveq1d ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → log 2 N 2 + 1 + 1 = log 2 N + 1
29 nn0enne ⊢ N ∈ ℕ → N 2 ∈ ℕ 0 ↔ N 2 ∈ ℕ
30 29 biimpa ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → N 2 ∈ ℕ
31 blennn ⊢ N 2 ∈ ℕ → # b ⁡ N 2 = log 2 N 2 + 1
32 31 oveq1d ⊢ N 2 ∈ ℕ → # b ⁡ N 2 + 1 = log 2 N 2 + 1 + 1
33 30 32 syl ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → # b ⁡ N 2 + 1 = log 2 N 2 + 1 + 1
34 blennn ⊢ N ∈ ℕ → # b ⁡ N = log 2 N + 1
35 34 adantr ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → # b ⁡ N = log 2 N + 1
36 28 33 35 3eqtr4rd ⊢ N ∈ ℕ ∧ N 2 ∈ ℕ 0 → # b ⁡ N = # b ⁡ N 2 + 1