Package list-reverse-def: list-reverse-def

Information

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

Files

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

Defined Constant

Data
- List
  - Data.List.reverse

Theorem

⊦ Data.List.reverse Data.List.[] = Data.List.[] ∧
  ∀l x.
    Data.List.reverse (Data.List.:: x l) =
    Data.List.@ (Data.List.reverse l) (Data.List.:: x Data.List.[])

Input Type Operators

→
bool
Data
- List
  - Data.List.list

Input Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - select
  - T
- List
  - Data.List.::
  - Data.List.@
  - Data.List.[]

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)