Package word12-bits: 12-bit word to bit-list conversions

Information

name	word12-bits
version	1.77
description	12-bit word to bit-list conversions
author	Joe Leslie-Hurd <joe@gilith.com>
license	MIT
provenance	HOL Light theory extracted on 2014-11-01
checksum	86cd8527a487541b429e02e9f53d9abf50332cce
requires	base word12-def
show	Data.Bool Data.List Data.Word12 Data.Word12.Bits Number.Natural

Files

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

Theorem

⊦ ∀w.
    ∃x₀ x₁ x₂ x₃ x₄ x₅ x₆ x₇ x₈ x₉ x₁₀ x₁₁.
      w =
      toWord
        (x₀ :: x₁ :: x₂ :: x₃ :: x₄ :: x₅ :: x₆ :: x₇ :: x₈ :: x₉ :: x₁₀ ::
         x₁₁ :: [])

External Type Operators

→
bool
Data
- List
  - list
- Word12
  - word12
Number
- Natural
  - natural

External Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - ∨
  - ¬
  - ⊥
  - ⊤
- List
  - ::
  - []
  - head
  - length
  - tail
- Word12
  - width
  - Bits
    - fromWord
    - toWord
Number
- Natural
  - +
  - bit0
  - bit1
  - suc
  - zero

Assumptions

⊦ ⊤

⊦ length [] = 0

⊦ bit0 0 = 0

⊦ ∀t. t ⇒ t

⊦ ⊥ ⇔ ∀p. p

⊦ (¬) = λp. p ⇒ ⊥

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

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

⊦ ∀t. ⊤ ∧ t ⇔ t

⊦ ∀t. ⊥ ⇒ t ⇔ ⊤

⊦ ∀w. toWord (fromWord w) = w

⊦ ∀w. length (fromWord w) = width

⊦ ∀n. ¬(suc n = 0)

⊦ ∀n. 0 + n = n

⊦ width = 12

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

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

⊦ ∀h t. head (h :: t) = h

⊦ ∀h t. tail (h :: t) = t

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

⊦ ∀l. length l = 0 ⇔ l = []

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

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

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

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

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

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

⊦ ∀l. l = [] ∨ ∃h t. l = h :: t

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

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

⊦ ∀h₁ h₂ t₁ t₂. h₁ :: t₁ = h₂ :: t₂ ⇔ h₁ = h₂ ∧ t₁ = t₂