Package list-last-def: Definition of the last list function
Information
| name | list-last-def |
| version | 1.25 |
| description | Definition of the last list function |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2012-02-07 |
| requires | bool list-def |
| show | Data.Bool Data.List |
Files
- Package tarball list-last-def-1.25.tgz
- Theory file list-last-def.thy (included in the package tarball)
Defined Constant
- Data
- List
- last
- List
Theorem
⊦ ∀h t. last (h :: t) = if t = [] then h else last t
Input Type Operators
- →
- bool
- Data
- List
- list
- List
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- cond
- ⊤
- 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)
⊦ ∀NIL' CONS'.
∃fn. fn [] = NIL' ∧ ∀a0 a1. fn (a0 :: a1) = CONS' a0 a1 (fn a1)