Documentation

Mathlib.Data.Nat.Size

Lemmas about size.

shiftLeft and shiftRight #

source
theorem Nat.shiftLeft_eq_mul_pow (m : ℕ) (n : ℕ) :
m <<< n = m * 2 ^ n
source
theorem Nat.shiftLeft'_tt_eq_mul_pow (m : ℕ) (n : ℕ) :
Nat.shiftLeft' true m n + 1 = (m + 1) * 2 ^ n
source
theorem Nat.shiftLeft'_ne_zero_left (b : Bool) {m : ℕ} (h : m ≠ 0) (n : ℕ) :
Nat.shiftLeft' b m n ≠ 0
source
theorem Nat.shiftLeft'_tt_ne_zero (m : ℕ) {n : ℕ} :
n ≠ 0 → Nat.shiftLeft' true m n ≠ 0

size #

source
@[simp]
theorem Nat.size_zero :
Nat.size 0 = 0
source
@[simp]
theorem Nat.size_bit {b : Bool} {n : ℕ} (h : Nat.bit b n ≠ 0) :
(Nat.bit b n).size = n.size.succ
source
@[simp]
theorem Nat.size_bit0 {n : ℕ} (h : n ≠ 0) :
(bit0 n).size = n.size.succ
source
@[simp]
theorem Nat.size_bit1 (n : ℕ) :
(bit1 n).size = n.size.succ
source
@[simp]
theorem Nat.size_one :
Nat.size 1 = 1
source
@[simp]
theorem Nat.size_shiftLeft' {b : Bool} {m : ℕ} {n : ℕ} (h : Nat.shiftLeft' b m n ≠ 0) :
(Nat.shiftLeft' b m n).size = m.size + n
source
@[simp]
theorem Nat.size_shiftLeft {m : ℕ} (h : m ≠ 0) (n : ℕ) :
(m <<< n).size = m.size + n
source
theorem Nat.lt_size_self (n : ℕ) :
n < 2 ^ n.size
source
theorem Nat.size_le {m : ℕ} {n : ℕ} :
m.size ≤ n ↔ m < 2 ^ n
source
theorem Nat.lt_size {m : ℕ} {n : ℕ} :
m < n.size ↔ 2 ^ m ≤ n
source
theorem Nat.size_pos {n : ℕ} :
0 < n.size ↔ 0 < n
source
theorem Nat.size_eq_zero {n : ℕ} :
n.size = 0 ↔ n = 0
source
theorem Nat.size_pow {n : ℕ} :
(2 ^ n).size = n + 1
source
theorem Nat.size_le_size {m : ℕ} {n : ℕ} (h : m ≤ n) :
m.size ≤ n.size
source
theorem Nat.size_eq_bits_len (n : ℕ) :
n.bits.length = n.size