Package list-quant-def: Definition of list quantifiers
Information
| name | list-quant-def |
| version | 1.25 |
| description | Definition of list quantifiers |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2011-12-18 |
| requires | bool list-def |
| show | Data.Bool Data.List |
Files
- Package tarball list-quant-def-1.25.tgz
- Theory file list-quant-def.thy (included in the package tarball)
Defined Constants
- Data
- List
- all
- exists
- List
Theorems
⊦ ∀p. all p []
⊦ ∀p. ¬exists p []
⊦ ∀p h t. all p (h :: t) ⇔ p h ∧ all p t
⊦ ∀p h t. exists p (h :: t) ⇔ p h ∨ exists p 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
⊦ ∀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)