Package list-dest-def: Definition of the list destructors

Information

namelist-dest-def
version1.15
descriptionDefinition of the list destructors
authorJoe Hurd <joe@gilith.com>
licenseHOLLight
provenanceHOL Light theory extracted on 2011-09-21
showData.Bool

Files

Defined Constants

Theorems

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

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

(Data.List.null Data.List.[] T)
  h t. Data.List.null (Data.List.:: h t) F

(b f. Data.List.case b f Data.List.[] = b)
  b f h t. Data.List.case b f (Data.List.:: h t) = f h t

Input Type Operators

Input Constants

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

NIL' CONS'.
    fn.
      fn Data.List.[] = NIL'
      a0 a1. fn (Data.List.:: a0 a1) = CONS' a0 a1 (fn a1)