Package natural-add-suc: natural-add-suc

Information

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

Files

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

Theorem

⊦ ∀m.
Number.Natural.suc m =
Number.Natural.+ m (Number.Numeral.bit1 Number.Numeral.zero)

Input Type Operators

→
bool
Number
- Natural
  - Number.Natural.natural

Input Constants

=
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - T
Number
- Natural
  - Number.Natural.+
  - Number.Natural.suc
- Numeral
  - Number.Numeral.bit1
  - Number.Numeral.zero

Assumptions

⊦ T

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

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

⊦ ∀x. x = x ⇔ T

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

⊦ ∀n. Number.Numeral.bit1 n = Number.Natural.suc (Number.Natural.+ n n)

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

⊦ (∀n. Number.Natural.+ Number.Numeral.zero n = n) ∧
  (∀m. Number.Natural.+ m Number.Numeral.zero = m) ∧
  (∀m n.
     Number.Natural.+ (Number.Natural.suc m) n =
     Number.Natural.suc (Number.Natural.+ m n)) ∧
  ∀m n.
    Number.Natural.+ m (Number.Natural.suc n) =
    Number.Natural.suc (Number.Natural.+ m n)