Package list-take-drop-def: list-take-drop-def

Information

name	list-take-drop-def
version	1.0
description	list-take-drop-def
author	Joe Hurd <joe@gilith.com>
license	HOLLight
provenance	HOL Light theory extracted on 2011-03-16
show	Data.Bool

Files

Package tarball list-take-drop-def-1.0.tgz
Theory file list-take-drop-def.thy (included in the package tarball)

Defined Constants

Data
- List
  - Data.List.drop
  - Data.List.take

Theorems

⊦ (∀l. Data.List.drop Number.Numeral.zero l = l) ∧
  ∀n h t.
    Data.List.drop (Number.Natural.suc n) (Data.List.:: h t) =
    Data.List.drop n t

⊦ (∀l. Data.List.take Number.Numeral.zero l = Data.List.[]) ∧
  ∀n h t.
    Data.List.take (Number.Natural.suc n) (Data.List.:: h t) =
    Data.List.:: h (Data.List.take n t)

Input Type Operators

→
bool
Data
- List
  - Data.List.list
Number
- Natural
  - Number.Natural.natural

Input Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - select
  - F
  - T
- List
  - Data.List.::
  - Data.List.[]
  - Data.List.head
  - Data.List.tail
Number
- Natural
  - Number.Natural.suc
- Numeral
  - Number.Numeral.zero

Assumptions

⊦ T

⊦ (∃) = λP. P ((select) P)

⊦ ∀t. (∀x. t) ⇔ t

⊦ (∀) = λP. P = λx. T

⊦ ∀x. x = x ⇔ T

⊦ (⇒) = λp q. p ∧ q ⇔ p

⊦ ∀h t. Data.List.tail (Data.List.:: h t) = t

⊦ ∀t h. Data.List.head (Data.List.:: h t) = h

⊦ (∧) = λp q. (λf. f p q) = λf. f T T

⊦ (∃) = λP. ∀q. (∀x. P x ⇒ q) ⇒ q

⊦ ∀e f.
    ∃fn.
      fn Number.Numeral.zero = e ∧
      ∀n. fn (Number.Natural.suc n) = f (fn n) n

⊦ ∀t. (T ∧ t ⇔ t) ∧ (t ∧ T ⇔ t) ∧ (F ∧ t ⇔ F) ∧ (t ∧ F ⇔ F) ∧ (t ∧ t ⇔ t)