Package list-dest-def: Definition of list type destructors
Information
| name | list-dest-def |
| version | 1.24 |
| description | Definition of list type destructors |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2011-11-27 |
| requires | bool list-def |
| show | Data.Bool Data.List |
Files
- Package tarball list-dest-def-1.24.tgz
- Theory file list-dest-def.thy (included in the package tarball)
Defined Constants
- Data
- List
- case
- head
- null
- tail
- List
Theorems
⊦ null []
⊦ ∀h t. ¬null (h :: t)
⊦ ∀h t. head (h :: t) = h
⊦ ∀h t. tail (h :: t) = t
⊦ ∀b f. case b f [] = b
⊦ ∀b f h t. case b f (h :: t) = f h t
Input Type Operators
- →
- bool
- Data
- List
- list
- List
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ¬
- F
- T
- List
- ::
- []
- Bool
Assumptions
⊦ T
⊦ (∃) = λP. P ((select) P)
⊦ (∀) = λp. p = λx. T
⊦ ∀t. (t ⇔ T) ⇔ t
⊦ ∀t. (t ⇔ F) ⇔ ¬t
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ (∃) = λP. ∀q. (∀x. P x ⇒ q) ⇒ q
⊦ ∀NIL' CONS'.
∃fn. fn [] = NIL' ∧ ∀a0 a1. fn (a0 :: a1) = CONS' a0 a1 (fn a1)