Package natural-order-def: Definition of natural number orderings
Information
| name | natural-order-def |
| version | 1.14 |
| description | Definition of natural number orderings |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2011-11-27 |
| requires | bool natural-thm |
| show | Data.Bool Number.Natural |
Files
- Package tarball natural-order-def-1.14.tgz
- Theory file natural-order-def.thy (included in the package tarball)
Defined Constants
- Number
- Natural
- <
- ≤
- >
- ≥
- Natural
Theorems
⊦ ∀m. m < 0 ⇔ F
⊦ ∀m. m ≤ 0 ⇔ m = 0
⊦ ∀m n. m > n ⇔ n < m
⊦ ∀m n. m ≥ n ⇔ n ≤ m
⊦ ∀m n. m < suc n ⇔ m = n ∨ m < n
⊦ ∀m n. m ≤ suc n ⇔ m = suc n ∨ m ≤ n
Input Type Operators
- →
- bool
- Number
- Natural
- natural
- Natural
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ∃!
- ∨
- F
- T
- Bool
- Number
- Natural
- suc
- zero
- Natural
Assumptions
⊦ T
⊦ (∃) = λP. P ((select) P)
⊦ (∀) = λp. p = λx. T
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ (∃) = λP. ∀q. (∀x. P x ⇒ q) ⇒ q
⊦ (∃!) = λP. (∃) P ∧ ∀x y. P x ∧ P y ⇒ x = y
⊦ ∀e f. ∃!fn. fn 0 = e ∧ ∀n. fn (suc n) = f (fn n) n