Package relation-well-founded-def: Definition of well-founded relations
Information
| name | relation-well-founded-def |
| version | 1.18 |
| description | Definition of well-founded relations |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2011-12-02 |
| requires | bool |
| show | Data.Bool Relation |
Files
- Package tarball relation-well-founded-def-1.18.tgz
- Theory file relation-well-founded-def.thy (included in the package tarball)
Defined Constant
- Relation
- wellFounded
Theorem
⊦ ∀r. wellFounded r ⇔ ∀p. (∃x. p x) ⇒ ∃x. p x ∧ ∀y. r y x ⇒ ¬p y
Input Type Operators
- →
- bool
Input Constants
- =
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ¬
- T
- Bool
Assumptions
⊦ T
⊦ (∀) = λp. p = λx. T