Package list-append-def: Definition of appending lists
Information
| name | list-append-def |
| version | 1.39 |
| description | Definition of appending lists |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2012-08-06 |
| requires | bool list-def |
| show | Data.Bool Data.List |
Files
- Package tarball list-append-def-1.39.tgz
- Theory file list-append-def.thy (included in the package tarball)
Defined Constants
- Data
- List
- @
- concat
- List
Theorems
⊦ concat [] = []
⊦ ∀l. [] @ l = l
⊦ ∀h t. concat (h :: t) = h @ concat t
⊦ ∀l h t. (h :: t) @ l = h :: t @ l
Input Type Operators
- →
- bool
- Data
- List
- list
- List
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ⊤
- List
- ::
- []
- Bool
Assumptions
⊦ ⊤
⊦ (∃) = λp. p ((select) p)
⊦ (∀) = λp. p = λx. ⊤
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ (∧) = λp q. (λf. f p q) = λf. f ⊤ ⊤
⊦ (∃) = λp. ∀q. (∀x. p x ⇒ q) ⇒ q
⊦ ∀p. (∀x. ∃y. p x y) ⇔ ∃y. ∀x. p x (y x)
⊦ ∀b f. ∃fn. fn [] = b ∧ ∀h t. fn (h :: t) = f h t (fn t)