Package relation-well-founded-def: Definition of well-founded relations
Information
name | relation-well-founded-def |
version | 1.20 |
description | Definition of well-founded relations |
author | Joe Hurd <joe@gilith.com> |
license | HOLLight |
provenance | HOL Light theory extracted on 2012-02-07 |
requires | bool |
show | Data.Bool Relation |
Files
- Package tarball relation-well-founded-def-1.20.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
- ∀
- ∧
- ⇒
- ∃
- ¬
- ⊤
- Bool
Assumptions
⊦ ⊤
⊦ (∀) = λp. p = λx. ⊤