Package list-set-def: Definition of list to set conversions
Information
| name | list-set-def |
| version | 1.27 |
| description | Definition of list to set conversions |
| author | Joe Hurd <joe@gilith.com> |
| license | HOLLight |
| provenance | HOL Light theory extracted on 2011-12-18 |
| requires | bool set list-def list-length |
| show | Data.Bool Data.List Number.Natural Set |
Files
- Package tarball list-set-def-1.27.tgz
- Theory file list-set-def.thy (included in the package tarball)
Defined Constants
- Data
- List
- fromSet
- toSet
- List
Theorems
⊦ toSet [] = ∅
⊦ ∀h t. toSet (h :: t) = insert h (toSet t)
⊦ ∀s. finite s ⇒ toSet (fromSet s) = s ∧ length (fromSet s) = size s
Input Type Operators
- →
- bool
- Data
- List
- list
- List
- Number
- Natural
- natural
- Natural
- Set
- set
Input Constants
- =
- select
- Data
- Bool
- ∀
- ∧
- ⇒
- ∃
- ¬
- cond
- F
- T
- List
- ::
- []
- length
- Bool
- Number
- Natural
- suc
- zero
- Natural
- Set
- ∅
- finite
- insert
- ∈
- size
Assumptions
⊦ T
⊦ length [] = 0
⊦ size ∅ = 0
⊦ F ⇔ ∀p. p
⊦ (¬) = λp. p ⇒ F
⊦ (∃) = λp. p ((select) p)
⊦ (∀) = λp. p = λx. T
⊦ ∀t. T ∧ t ⇔ t
⊦ ∀t. T ⇒ t ⇔ t
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ ∀t1 t2. (if F then t1 else t2) = t2
⊦ ∀h t. length (h :: t) = suc (length t)
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ (∃) = λp. ∀q. (∀x. p x ⇒ q) ⇒ q
⊦ ∀p. (∀x. ∃y. p x y) ⇔ ∃y. ∀x. p x (y x)
⊦ ∀x s.
finite s ⇒ size (insert x s) = if x ∈ s then size s else suc (size s)
⊦ ∀NIL' CONS'.
∃fn. fn [] = NIL' ∧ ∀a0 a1. fn (a0 :: a1) = CONS' a0 a1 (fn a1)
⊦ ∀p.
p ∅ ∧ (∀x s. p s ∧ ¬(x ∈ s) ∧ finite s ⇒ p (insert x s)) ⇒
∀s. finite s ⇒ p s