Package natural-bits: Natural number to bit-list conversions

Information

name	natural-bits
version	1.39
description	Natural number to bit-list conversions
author	Joe Leslie-Hurd <joe@gilith.com>
license	MIT
requires	bool function list natural pair probability relation
show	Data.Bool Data.List Data.Pair Function Number.Natural Probability.Random

Files

Package tarball natural-bits-1.39.tgz
Theory source file natural-bits.thy (included in the package tarball)

Defined Constants

Number
- Natural
  - fromBool
  - Bits
    - Bits.append
    - Bits.bit
    - Bits.bound
    - Bits.cons
    - Bits.fromNatural
    - Bits.head
    - Bits.normal
    - Bits.shiftLeft
    - Bits.shiftRight
    - Bits.tail
    - Bits.toNatural
    - Bits.width
  - Uniform
    - Uniform.fromRandom
      - Uniform.fromRandom.loop

Theorems

⊦ Bits.normal []

⊦ ¬Bits.head 0

⊦ Bits.head 1

⊦ fromBool ⊥ = 0

⊦ Bits.toNatural [] = 0

⊦ Bits.width 0 = 0

⊦ 0 = []

⊦ ∀n. Bits.normal (Bits.fromNatural n)

⊦ ¬Bits.head 2

⊦ fromBool ⊤ = 1

⊦ Bits.tail 1 = 0

⊦ ∀i. ¬Bits.bit 0 i

⊦ Bits.width 1 = 1

⊦ ∀b. Bits.head (fromBool b) ⇔ b

⊦ ∀b. Bits.tail (fromBool b) = 0

⊦ ∀n. Bits.head n ⇔ odd n

⊦ ∀n. Bits.toNatural (Bits.fromNatural n) = n

⊦ ∀n. Bits.append [] n = n

⊦ ∀k. Bits.bound 0 k = 0

⊦ ∀n. Bits.bound n 0 = 0

⊦ ∀k. Bits.shiftLeft 0 k = 0

⊦ ∀n. Bits.shiftLeft n 0 = n

⊦ ∀k. Bits.shiftRight 0 k = 0

⊦ ∀n. Bits.shiftRight n 0 = n

⊦ 1 = ⊤ :: []

⊦ ∀b. fromBool b < 2

⊦ ∀b. Bits.width (fromBool b) = fromBool b

⊦ ∀b. Bits.cons b 0 = fromBool b

⊦ ∀n. Bits.bit n 0 ⇔ Bits.head n

⊦ ∀n. length (Bits.fromNatural n) = Bits.width n

⊦ ∀k. Bits.toNatural (replicate ⊥ k) = 0

⊦ ∀n. Bits.shiftRight n (Bits.width n) = 0

⊦ ∀l. Bits.toNatural l = Bits.append l 0

⊦ ∀l. Bits.width (Bits.toNatural l) ≤ length l

⊦ ∀n k. Bits.bound n k ≤ n

⊦ ∀b. fromBool b = 0 ⇔ ¬b

⊦ ∀b. Bits.toNatural (b :: []) = fromBool b

⊦ ∀b. fromBool b = 1 ⇔ b

⊦ ∀n. ¬Bits.head (2 * n)

⊦ ∀n. Bits.head (suc n) ⇔ ¬Bits.head n

⊦ ∀n. Bits.cons (Bits.head n) (Bits.tail n) = n

⊦ ∀h t. Bits.head (Bits.cons h t) ⇔ h

⊦ ∀h t. Bits.tail (Bits.cons h t) = t

⊦ ∀n k. Bits.width (Bits.bound n k) ≤ k

⊦ ∀b. fromBool b = if b then 1 else 0

⊦ ∀n. ∃h t. n = Bits.cons h t

⊦ ∀n. n < 2 ↑ Bits.width n

⊦ ∀n. Bits.tail n = n div 2

⊦ ∀n. Bits.bit (Bits.tail n) = Bits.bit n ∘ suc

⊦ ∀n. Bits.fromNatural n = [] ⇔ n = 0

⊦ ∀n. suc (Bits.cons ⊥ n) = Bits.cons ⊤ n

⊦ ∀n. Bits.bound n 1 = fromBool (Bits.head n)

⊦ ∀l. Bits.normal l ⇔ null l ∨ last l

⊦ ∀l. Bits.normal l ⇔ Bits.fromNatural (Bits.toNatural l) = l

⊦ ∀n k. Bits.bound (Bits.shiftLeft n k) k = 0

⊦ ∀n k. Bits.shiftRight (Bits.bound n k) k = 0

⊦ ∀b. fromBool b mod 2 = fromBool b

⊦ ∀n. fromBool (Bits.head n) = n mod 2

⊦ ∀n. Bits.cons ⊥ n = 2 * n

⊦ ∀n. suc (Bits.cons ⊤ n) = Bits.cons ⊥ (suc n)

⊦ ∀l. Bits.normal l ⇔ Bits.width (Bits.toNatural l) = length l

⊦ ∀l. Bits.toNatural l < 2 ↑ length l

⊦ ∀h t. Bits.width (Bits.cons h t) ≤ suc (Bits.width t)

⊦ ∀n i. Bits.bit n i ⇔ Bits.head (Bits.shiftRight n i)

⊦ ∀n k. Bits.shiftRight n k = (Bits.tail ↑ k) n

⊦ ∀n i. Bits.bit n i ⇒ i < Bits.width n

⊦ ∀n. (∀i. ¬Bits.bit n i) ⇔ n = 0

⊦ ∀n. (∀i. ¬Bits.bit n i) ⇒ n = 0

⊦ ∀l n. Bits.append l n = foldr Bits.cons n l

⊦ ∀n. Bits.fromNatural n = map (Bits.bit n) (interval 0 (Bits.width n))

⊦ ∀n. Bits.shiftLeft n 1 = 2 * n

⊦ ∀k. Bits.shiftLeft 1 k = 2 ↑ k

⊦ ∀h t. Bits.toNatural (h :: t) = Bits.cons h (Bits.toNatural t)

⊦ ∀n k. Bits.shiftLeft n k = (Bits.cons ⊥ ↑ k) n

⊦ ∀n₁ n₂. n₁ ≤ n₂ ⇒ Bits.width n₁ ≤ Bits.width n₂

⊦ ∀n i. Bits.bit n (suc i) ⇔ Bits.bit (Bits.tail n) i

⊦ ∀n k. Bits.shiftRight n (suc k) = Bits.tail (Bits.shiftRight n k)

⊦ ∀n k. Bits.shiftRight n (suc k) = Bits.shiftRight (Bits.tail n) k

⊦ ∀n k. Bits.width (Bits.shiftLeft n k) ≤ Bits.width n + k

⊦ ∀k n. Bits.shiftLeft n k = 0 ⇔ n = 0

⊦ ∀n k. Bits.bound (Bits.bound n k) k = Bits.bound n k

⊦ ∀k. Bits.width (2 ↑ k - 1) = k

⊦ ∀b k. Bits.normal (replicate b k) ⇔ k = 0 ∨ b

⊦ ∀n₁ n₂. Bits.head (n₁ * n₂) ⇔ Bits.head n₁ ∧ Bits.head n₂

⊦ ∀m n. Bits.width (max m n) = max (Bits.width m) (Bits.width n)

⊦ ∀n k. Bits.shiftLeft n (suc k) = Bits.cons ⊥ (Bits.shiftLeft n k)

⊦ ∀n k. Bits.shiftLeft n (suc k) = Bits.shiftLeft (Bits.cons ⊥ n) k

⊦ ∀m n. Bits.width (m * n) ≤ Bits.width m + Bits.width n

⊦ ∀n k. Bits.bound n k = n ⇔ Bits.width n ≤ k

⊦ ∀n k. Bits.shiftRight n k = 0 ⇔ Bits.width n ≤ k

⊦ ∀n. Bits.cons ⊤ n = 1 + 2 * n

⊦ ∀h t. Bits.normal (h :: t) ⇔ if null t then h else Bits.normal t

⊦ ∀n k. Bits.bound n k = n mod 2 ↑ k

⊦ ∀n k. Bits.shiftLeft n k = 2 ↑ k * n

⊦ ∀n k. Bits.shiftRight n k = n div 2 ↑ k

⊦ ∀n₁ n₂. Bits.head (n₁ + n₂) ⇔ ¬(Bits.head n₁ ⇔ Bits.head n₂)

⊦ ∀n₁ n₂. Bits.tail (n₁ + Bits.cons ⊥ n₂) = Bits.tail n₁ + n₂

⊦ ∀n k. Bits.bound n k + Bits.shiftLeft (Bits.shiftRight n k) k = n

⊦ ∀k. Bits.toNatural (replicate ⊤ k) = 2 ↑ k - 1

⊦ ∀h t. Bits.cons h t = fromBool h + 2 * t

⊦ ∀h t. Bits.cons h t = 0 ⇔ ¬h ∧ t = 0

⊦ ∀h t. Bits.cons h t = 1 ⇔ h ∧ t = 0

⊦ ∀n k. Bits.width n ≤ k ⇔ n < 2 ↑ k

⊦ ∀n k.
Bits.bound n (suc k) =
Bits.cons (Bits.head n) (Bits.bound (Bits.tail n) k)

⊦ ∀h t₁ t₂. Bits.cons h t₁ ≤ Bits.cons h t₂ ⇔ t₁ ≤ t₂

⊦ ∀h t n. Bits.append (h :: t) n = Bits.cons h (Bits.append t n)

⊦ ∀n k i. Bits.bit n (k + i) ⇔ Bits.bit (Bits.shiftRight n k) i

⊦ ∀n k₁ k₂.
Bits.shiftLeft n (k₁ + k₂) = Bits.shiftLeft (Bits.shiftLeft n k₁) k₂

⊦ ∀n k₁ k₂.
Bits.shiftRight n (k₁ + k₂) = Bits.shiftRight (Bits.shiftRight n k₁) k₂

⊦ ∀n j k. Bits.bound (Bits.bound n j) k = Bits.bound n (min j k)

⊦ ∀k n₁ n₂. Bits.shiftLeft (n₁ * n₂) k = n₁ * Bits.shiftLeft n₂ k

⊦ ∀k n₁ n₂. Bits.shiftLeft n₁ k = Bits.shiftLeft n₂ k ⇔ n₁ = n₂

⊦ ∀k n₁ n₂. Bits.shiftLeft n₁ k ≤ Bits.shiftLeft n₂ k ⇔ n₁ ≤ n₂

⊦ ∀m n. (∀i. Bits.bit m i ⇔ Bits.bit n i) ⇒ m = n

⊦ ∀n. Bits.width n = if n = 0 then 0 else Bits.width (Bits.tail n) + 1

⊦ ∀n.
Bits.fromNatural n =
if n = 0 then [] else Bits.head n :: Bits.fromNatural (Bits.tail n)

⊦ ∀h t. ¬(t = 0) ⇒ Bits.width (Bits.cons h t) = suc (Bits.width t)

⊦ ∀m n. Bits.width (m + n) ≤ max (Bits.width m) (Bits.width n) + 1

⊦ ∀l i. Bits.bit (Bits.toNatural l) i ⇔ i < length l ∧ nth l i

⊦ ∀l₁ l₂.
Bits.toNatural (l₁ @ l₂) =
Bits.toNatural l₁ + Bits.shiftLeft (Bits.toNatural l₂) (length l₁)

⊦ ∀h t. Bits.toNatural (h :: t) = 0 ⇔ ¬h ∧ Bits.toNatural t = 0

⊦ ∀n k. ¬(n = 0) ⇒ Bits.width (Bits.shiftLeft n k) = Bits.width n + k

⊦ ∀h₁ h₂ t. Bits.cons h₁ t ≤ Bits.cons h₂ t ⇔ fromBool h₁ ≤ fromBool h₂

⊦ ∀n i k. Bits.bit (Bits.bound n k) i ⇔ i < k ∧ Bits.bit n i

⊦ ∀k n₁ n₂.
Bits.shiftLeft (n₁ + n₂) k = Bits.shiftLeft n₁ k + Bits.shiftLeft n₂ k

⊦ ∀n j k.
Bits.bound (Bits.shiftLeft n k) (j + k) =
Bits.shiftLeft (Bits.bound n j) k

⊦ ∀n₁ n₂ k.
Bits.shiftRight (n₁ + Bits.shiftLeft n₂ k) k =
Bits.shiftRight n₁ k + n₂

⊦ ∀n j k.
Bits.shiftRight (Bits.bound n (j + k)) k =
Bits.bound (Bits.shiftRight n k) j

⊦ ∀n. Bits.width n = if n = 0 then 0 else log 2 n + 1

⊦ ∀n k.
Bits.bound n (suc k) =
Bits.bound n k + Bits.shiftLeft (fromBool (Bits.bit n k)) k

⊦ ∀p. p 0 ∧ (∀h t. p t ⇒ p (Bits.cons h t)) ⇒ ∀n. p n

⊦ ∀m n k.
Bits.bound (Bits.bound m k * Bits.bound n k) k = Bits.bound (m * n) k

⊦ ∀m n k.
Bits.bound (Bits.bound m k + Bits.bound n k) k = Bits.bound (m + n) k

⊦ ∀h₁ h₂ t₁ t₂. Bits.cons h₁ t₁ = Bits.cons h₂ t₂ ⇔ (h₁ ⇔ h₂) ∧ t₁ = t₂

⊦ ∀m n p k. m = n + Bits.shiftLeft p k ⇒ Bits.bound m k = Bits.bound n k

⊦ ∀p. p 0 ∧ (∀n. ¬(n = 0) ∧ p (Bits.tail n) ⇒ p n) ⇒ ∀n. p n

⊦ ∀n r.
    Uniform.fromRandom n r =
    let w ← Bits.width (n - 1) in
    let (r₁, r₂) ← split r in
    (Uniform.fromRandom.loop n w r₁ mod n, r₂)

⊦ ∀n w r.
    Uniform.fromRandom.loop n w r =
    let (l, r') ← bits w r in
    let m ← Bits.toNatural l in
    if m < n then m else Uniform.fromRandom.loop n w r'

External Type Operators

→
bool
Data
- List
  - list
- Pair
  - ×
Number
- Natural
  - natural
Probability
- Random
  - random

External Constants

=
select
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - ∨
  - ¬
  - cond
  - ⊥
  - ⊤
- List
  - ::
  - @
  - []
  - foldr
  - interval
  - last
  - length
  - map
  - nth
  - null
  - replicate
- Pair
  - ,
Function
- ↑
- id
- ∘
Number
- Natural
  - *
  - +
  - -
  - <
  - ≤
  - ↑
  - bit0
  - bit1
  - div
  - even
  - log
  - max
  - min
  - mod
  - odd
  - suc
  - zero
Probability
- Random
  - bits
  - split

Assumptions

⊦ ⊤

⊦ null []

⊦ ¬odd 0

⊦ ¬⊥ ⇔ ⊤

⊦ ¬⊤ ⇔ ⊥

⊦ length [] = 0

⊦ bit0 0 = 0

⊦ ∀t. t ⇒ t

⊦ ∀n. 0 ≤ n

⊦ ∀n. n ≤ n

⊦ ⊥ ⇔ ∀p. p

⊦ ∀x. id x = x

⊦ ∀t. t ∨ ¬t

⊦ ∀m. ¬(m < 0)

⊦ ∀n. 0 < suc n

⊦ ∀n. n < suc n

⊦ ∀n. n ≤ suc n

⊦ (¬) = λp. p ⇒ ⊥

⊦ (∃) = λp. p ((select) p)

⊦ ∀t. (∀x. t) ⇔ t

⊦ ∀t. (λx. t x) = t

⊦ (∀) = λp. p = λx. ⊤

⊦ ∀x. replicate x 0 = []

⊦ ∀t. ¬¬t ⇔ t

⊦ ∀t. (⊤ ⇔ t) ⇔ t

⊦ ∀t. (t ⇔ ⊤) ⇔ t

⊦ ∀t. ⊥ ∧ t ⇔ ⊥

⊦ ∀t. ⊤ ∧ t ⇔ t

⊦ ∀t. t ∧ ⊥ ⇔ ⊥

⊦ ∀t. ⊤ ⇒ t ⇔ t

⊦ ∀t. t ⇒ ⊤ ⇔ ⊤

⊦ ∀t. ⊥ ∨ t ⇔ t

⊦ ∀t. ⊤ ∨ t ⇔ ⊤

⊦ ∀t. t ∨ ⊤ ⇔ ⊤

⊦ ∀n. ¬(suc n = 0)

⊦ ∀m. m * 0 = 0

⊦ ∀n. 0 + n = n

⊦ ∀m. m + 0 = m

⊦ ∀n. min n n = n

⊦ ∀m. interval m 0 = []

⊦ ∀l. [] @ l = l

⊦ ∀f. f ↑ 0 = id

⊦ ∀f. map f [] = []

⊦ ∀x. last (x :: []) = x

⊦ ∀t. (⊥ ⇔ t) ⇔ ¬t

⊦ ∀t. (t ⇔ ⊥) ⇔ ¬t

⊦ ∀t. t ⇒ ⊥ ⇔ ¬t

⊦ ∀n. bit1 n = suc (bit0 n)

⊦ ∀n. ¬odd n ⇔ even n

⊦ ∀m. m ↑ 0 = 1

⊦ ∀m. m * 1 = m

⊦ ∀n. n ↑ 1 = n

⊦ ∀n. n div 1 = n

⊦ ∀m. 1 * m = m

⊦ ∀l. null l ⇔ l = []

⊦ ∀h t. ¬null (h :: t)

⊦ ∀m n. m ≤ m + n

⊦ ∀m n. m ≤ max m n

⊦ ∀m n. n ≤ max m n

⊦ (⇒) = λp q. p ∧ q ⇔ p

⊦ ∀t. (t ⇔ ⊤) ∨ (t ⇔ ⊥)

⊦ ∀m. suc m = m + 1

⊦ ∀n. odd (suc n) ⇔ ¬odd n

⊦ ∀m. m ≤ 0 ⇔ m = 0

⊦ ∀n. suc n - 1 = n

⊦ ∀t₁ t₂. (if ⊥ then t₁ else t₂) = t₂

⊦ ∀t₁ t₂. (if ⊤ then t₁ else t₂) = t₁

⊦ ∀x n. length (replicate x n) = n

⊦ ∀h t. ¬(h :: t = [])

⊦ ∀m n. length (interval m n) = n

⊦ ∀p x. p x ⇒ p ((select) p)

⊦ ∀f b. foldr f b [] = b

⊦ ∀n. 0 < n ⇔ ¬(n = 0)

⊦ ∀n. bit0 (suc n) = suc (suc (bit0 n))

⊦ ∀x. ∃a b. x = (a, b)

⊦ ∀x y. x = y ⇔ y = x

⊦ ∀x y. x = y ⇒ y = x

⊦ ∀h t. nth (h :: t) 0 = h

⊦ ∀m n. m * n = n * m

⊦ ∀m n. m + n = n + m

⊦ ∀m n. m < n ⇒ m ≤ n

⊦ ∀f l. length (map f l) = length l

⊦ ∀n. 2 * n = n + n

⊦ ∀x n. null (replicate x n) ⇔ n = 0

⊦ ∀h t. length (h :: t) = suc (length t)

⊦ ∀m n. ¬(m < n) ⇔ n ≤ m

⊦ ∀m n. ¬(m ≤ n) ⇔ n < m

⊦ ∀m n. m < suc n ⇔ m ≤ n

⊦ ∀m n. suc m ≤ n ⇔ m < n

⊦ (∧) = λp q. (λf. f p q) = λf. f ⊤ ⊤

⊦ ∀n. even n ⇔ n mod 2 = 0

⊦ ∀n. ¬(n = 0) ⇒ 0 div n = 0

⊦ ∀p. ¬(∃x. p x) ⇔ ∀x. ¬p x

⊦ (∃) = λp. ∀q. (∀x. p x ⇒ q) ⇒ q

⊦ ∀t₁ t₂. ¬t₁ ⇒ ¬t₂ ⇔ t₂ ⇒ t₁

⊦ ∀m n. m < n ⇒ m div n = 0

⊦ ∀m n. m + suc n = suc (m + n)

⊦ ∀m n. suc m + n = suc (m + n)

⊦ ∀m n. suc m = suc n ⇔ m = n

⊦ ∀m n. suc m < suc n ⇔ m < n

⊦ ∀m n. suc m ≤ suc n ⇔ m ≤ n

⊦ ∀m n. m + n = m ⇔ n = 0

⊦ ∀m n. m + n = n ⇔ m = 0

⊦ ∀n. odd n ⇔ n mod 2 = 1

⊦ ∀k. 1 < k ⇒ log k 1 = 0

⊦ ∀f g x. (f ∘ g) x = f (g x)

⊦ ∀x n. replicate x (suc n) = x :: replicate x n

⊦ ∀t₁ t₂. ¬(t₁ ∧ t₂) ⇔ ¬t₁ ∨ ¬t₂

⊦ ∀m n. max m n = if m ≤ n then n else m

⊦ ∀m n. min m n = if m ≤ n then m else n

⊦ ∀m n. odd (m * n) ⇔ odd m ∧ odd n

⊦ ∀m n. m * suc n = m + m * n

⊦ ∀m n. m ↑ suc n = m * m ↑ n

⊦ ∀m n. map suc (interval m n) = interval (suc m) n

⊦ ∀f n. f ↑ suc n = f ∘ f ↑ n

⊦ ∀f n. f ↑ suc n = f ↑ n ∘ f

⊦ ∀m n. m ≤ n ⇔ ∃d. n = m + d

⊦ ∀f g. (∀x. f x = g x) ⇔ f = g

⊦ (∨) = λp q. ∀r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r

⊦ ∀m n. odd (m + n) ⇔ ¬(odd m ⇔ odd n)

⊦ ∀m n. interval m (suc n) = m :: interval (suc m) n

⊦ ∀m n. m ≤ n ∧ n ≤ m ⇔ m = n

⊦ ∀f. ∃fn. ∀a b. fn (a, b) = f a b

⊦ ∀m n. m < n ⇔ ∃d. n = m + suc d

⊦ ∀p. (∀x y. p x y) ⇔ ∀y x. p x y

⊦ ∀m n. ¬(m = 0) ⇒ m * n div m = n

⊦ ∀m n. ¬(m = 0) ⇒ m * n mod m = 0

⊦ ∀x y z. x = y ∧ y = z ⇒ x = z

⊦ ∀x₁ x₂ l. last (x₁ :: x₂ :: l) = last (x₂ :: l)

⊦ ∀m n p. m * (n * p) = m * n * p

⊦ ∀m n p. m + (n + p) = m + n + p

⊦ ∀m n p. m + n = m + p ⇔ n = p

⊦ ∀p m n. m + p = n + p ⇔ m = n

⊦ ∀m n p. m + n ≤ m + p ⇔ n ≤ p

⊦ ∀m n p. n + m ≤ p + m ⇔ n ≤ p

⊦ ∀m n p. m < n ∧ n ≤ p ⇒ m < p

⊦ ∀m n p. m ≤ n ∧ n ≤ p ⇒ m ≤ p

⊦ ∀l h t. (h :: t) @ l = h :: t @ l

⊦ ∀f g l. map (f ∘ g) l = map f (map g l)

⊦ ∀r. (∀x. ∃y. r x y) ⇔ ∃f. ∀x. r x (f x)

⊦ ∀m n. m * n = 0 ⇔ m = 0 ∨ n = 0

⊦ ∀f h t. map f (h :: t) = f h :: map f t

⊦ ∀p. p 0 ∧ (∀n. p n ⇒ p (suc n)) ⇒ ∀n. p n

⊦ ∀n m. ¬(n = 0) ⇒ m mod n mod n = m mod n

⊦ ∀m n. ¬(n = 0) ⇒ (m div n = 0 ⇔ m < n)

⊦ ∀m n. m ↑ n = 0 ⇔ m = 0 ∧ ¬(n = 0)

⊦ ∀m n i. i < n ⇒ nth (interval m n) i = m + i

⊦ ∀m n p. m * (n + p) = m * n + m * p

⊦ ∀m n p. (m + n) * p = m * p + n * p

⊦ ∀f m n. f ↑ (m + n) = f ↑ m ∘ f ↑ n

⊦ ∀p g h. ∃f. ∀x. f x = if p x then f (g x) else h x

⊦ ∀m n. ¬(n = 0) ⇒ (m div n) * n + m mod n = m

⊦ ∀p. p [] ∧ (∀h t. p t ⇒ p (h :: t)) ⇒ ∀l. p l

⊦ ∀f b h t. foldr f b (h :: t) = f h (foldr f b t)

⊦ ∀h t n. n < length t ⇒ nth (h :: t) (suc n) = nth t n

⊦ ∀m n p. m * n ≤ m * p ⇔ m = 0 ∨ n ≤ p

⊦ ∀f l i. i < length l ⇒ nth (map f l) i = f (nth l i)

⊦ ∀k m n. 1 < k ∧ k ↑ m ≤ n ⇒ m ≤ log k n

⊦ ∀m n p q. m ≤ p ∧ n ≤ q ⇒ m + n ≤ p + q

⊦ ∀p c x y. p (if c then x else y) ⇔ (c ⇒ p x) ∧ (¬c ⇒ p y)

⊦ ∀m n p. ¬(n * p = 0) ⇒ m div n div p = m div n * p

⊦ ∀k n. 1 < k ∧ ¬(n = 0) ⇒ n < k ↑ (log k n + 1)

⊦ ∀n a b. ¬(n = 0) ⇒ (a mod n + b mod n) mod n = (a + b) mod n

⊦ ∀k n₁ n₂. 1 < k ∧ ¬(n₁ = 0) ∧ n₁ ≤ n₂ ⇒ log k n₁ ≤ log k n₂

⊦ ∀k m n. 1 < k ∧ ¬(n = 0) ∧ n < k ↑ m ⇒ log k n < m

⊦ ∀l₁ l₂.
length l₁ = length l₂ ∧ (∀i. i < length l₁ ⇒ nth l₁ i = nth l₂ i) ⇒
l₁ = l₂

⊦ ∀k p. 1 < k ∧ p 0 ∧ (∀n. ¬(n = 0) ∧ p (n div k) ⇒ p n) ⇒ ∀n. p n

⊦ ∀k n.
1 < k ∧ ¬(n = 0) ⇒ log k n = if n < k then 0 else log k (n div k) + 1

⊦ ∀x m n. x ↑ m ≤ x ↑ n ⇔ if x = 0 then m = 0 ⇒ n = 0 else x = 1 ∨ m ≤ n

⊦ ∀k n₁ n₂.
1 < k ∧ ¬(n₁ = 0) ∧ ¬(n₂ = 0) ⇒
log k (n₁ * n₂) ≤ log k n₁ + (log k n₂ + 1)

⊦ ∀a b n.
¬(n = 0) ⇒
((a + b) mod n = a mod n + b mod n ⇔ (a + b) div n = a div n + b div n)