File: NUM_PRE_CONV.doc

package info (click to toggle)
hol-light 20120602-1
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 23,452 kB
  • sloc: ml: 348,797; cpp: 438; java: 279; makefile: 252; sh: 183; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (40 lines) | stat: -rw-r--r-- 1,035 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
\DOC NUM_PRE_CONV

\TYPE {NUM_PRE_CONV : term -> thm}

\SYNOPSIS
Proves what the cutoff predecessor of a natural number numeral is.

\KEYWORDS
conversion, number, arithmetic.

\DESCRIBE
If {n} is a numeral (e.g. {0}, {1}, {2}, {3},...), then
{NUM_PRE_CONV `PRE n`} returns the theorem:
{
   |- PRE n = s
}
\noindent where {s} is the numeral that denotes the cutoff predecessor of the
natural number denoted by {n} (that is, the result of subtracting 1 from it, or 
zero if it is already zero).

\FAILURE
{NUM_PRE_CONV tm} fails if {tm} is not of the form  {`PRE n`}, where {n} is a 
numeral.

\EXAMPLE
{
  # NUM_PRE_CONV `PRE 0`;;
  val it : thm = |- PRE 0 = 0
  
  # NUM_PRE_CONV `PRE 12345`;;
  val it : thm = |- PRE 12345 = 12344
}

\SEEALSO
NUM_ADD_CONV, NUM_DIV_CONV, NUM_EQ_CONV, NUM_EVEN_CONV, NUM_EXP_CONV,
NUM_FACT_CONV, NUM_GE_CONV, NUM_GT_CONV, NUM_LE_CONV, NUM_LT_CONV,
NUM_MAX_CONV, NUM_MIN_CONV, NUM_MOD_CONV, NUM_MULT_CONV, NUM_ODD_CONV,
NUM_REDUCE_CONV, NUM_RED_CONV, NUM_REL_CONV, NUM_SUB_CONV, NUM_SUC_CONV.

\ENDDOC