Package list-zipwith-def: Definition of the list zipWith function
Information
| name | list-zipwith-def |
| version | 1.30 |
| description | Definition of the list zipWith function |
| author | Joe Hurd <joe@gilith.com> |
| license | MIT |
| provenance | HOL Light theory extracted on 2012-01-28 |
| requires | bool list-def list-dest |
| show | Data.Bool Data.List Number.Natural |
Files
- Package tarball list-zipwith-def-1.30.tgz
- Theory file list-zipwith-def.thy (included in the package tarball)
Defined Constant
- Data
- List
- zipWith
- List
Theorems
⊦ ∀f. zipWith f [] [] = []
⊦ ∀f h1 h2 t1 t2.
length t1 = length t2 ⇒
zipWith f (h1 :: t1) (h2 :: t2) = f h1 h2 :: zipWith f t1 t2
Input Type Operators
- →
- bool
- Data
- List
- list
- List
- Number
- Natural
- natural
- Natural
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- T
- List
- ::
- []
- head
- length
- tail
- Bool
Assumptions
⊦ T
⊦ (∃) = λp. p ((select) p)
⊦ ∀t. (∀x. t) ⇔ t
⊦ (∀) = λp. p = λx. T
⊦ ∀t. t ⇒ T ⇔ T
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ ∀h t. head (h :: t) = h
⊦ ∀h t. tail (h :: t) = t
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ (∃) = λ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)