Package natural-factorial-def: natural-factorial-def

Information

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

Files

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

Defined Constant

Number
- Natural
  - Number.Natural.factorial

Theorem

⊦ Number.Natural.factorial Number.Numeral.zero =
  Number.Numeral.bit1 Number.Numeral.zero ∧
  ∀n.
    Number.Natural.factorial (Number.Natural.suc n) =
    Number.Natural.* (Number.Natural.suc n) (Number.Natural.factorial n)

Input Type Operators

→
bool
Number
- Natural
  - Number.Natural.natural

Input Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - select
  - T
Number
- Natural
  - Number.Natural.*
  - Number.Natural.suc
- Numeral
  - Number.Numeral.bit1
  - Number.Numeral.zero

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

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