Package natural-numeral: Definitions and theorems about natural number numerals
Information
| name | natural-numeral |
| version | 1.5 |
| description | Definitions and theorems about natural number numerals |
| author | Joe Hurd <joe@gilith.com> |
| license | MIT |
| show | Data.Bool Number.Natural |
Files
- Package tarball natural-numeral-1.5.tgz
- Theory file natural-numeral.thy (included in the package tarball)
Defined Constants
- Number
- Natural
- bit0
- bit1
- Natural
Theorems
⊦ 1 = suc 0
⊦ 2 = suc 1
⊦ ∀n. bit1 n = suc (bit0 n)
⊦ bit0 0 = 0 ∧ ∀n. bit0 (suc n) = suc (suc (bit0 n))
Input Type Operators
- →
- bool
- Number
- Natural
- natural
- Natural
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- T
- Bool
- Number
- Natural
- suc
- zero
- Natural
Assumptions
⊦ T
⊦ (∃) = λP. P ((select) P)
⊦ (∀) = λp. p = λx. T
⊦ ∀x. x = x ⇔ T
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ ∀e f. ∃fn. fn 0 = e ∧ ∀n. fn (suc n) = f (fn n) n