Package option-dest-def: Definition of option type destructors
Information
| name | option-dest-def |
| version | 1.27 |
| description | Definition of option type destructors |
| author | Joe Hurd <joe@gilith.com> |
| license | MIT |
| provenance | HOL Light theory extracted on 2011-11-27 |
| requires | bool option-def |
| show | Data.Bool Data.Option |
Files
- Package tarball option-dest-def-1.27.tgz
- Theory file option-dest-def.thy (included in the package tarball)
Defined Constants
- Data
- Option
- case
- isNone
- isSome
- Option
Theorems
⊦ isNone none
⊦ ¬isSome none
⊦ ∀a. isSome (some a)
⊦ ∀a. ¬isNone (some a)
⊦ ∀b f. case b f none = b
⊦ ∀b f a. case b f (some a) = f a
Input Type Operators
- →
- bool
- Data
- Option
- option
- Option
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ¬
- F
- T
- Option
- none
- some
- 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
⊦ ∀NONE' SOME'. ∃fn. fn none = NONE' ∧ ∀a. fn (some a) = SOME' a