File: pre.tex

package info (click to toggle)
hol88 2.02.19940316-8
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 63,120 kB
  • ctags: 19,367
  • sloc: ml: 199,939; ansic: 9,300; sh: 7,118; makefile: 6,074; lisp: 2,747; yacc: 894; sed: 201; cpp: 87; awk: 5
file content (24 lines) | stat: -rw-r--r-- 762 bytes parent folder | download | duplicates (11) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
\section{The Theory {\tt pre}}

The theory \ml{pre}\index{pre, theory@{\ptt pre}, theory} contains an
\adhoc\ collection of 
theorems about \ml{PRE}. It contains no new definitions.
The theorems that have been pre-proved in this theory include but are not
restricted to the following:
\begin{hol}
\index{SUC\_PRE@{\ptt SUC\_PRE}}
\index{PRE\_MONO@{\ptt PRE\_MONO}}
\index{PRE\_LESS\_EQ@{\ptt PRE\_LESS\_EQ}}
\index{PRE\_ADD@{\ptt PRE\_ADD}}
\index{PRE\_K\_K@{\ptt PRE\_K\_K}}
\begin{verbatim}
  SUC_PRE      |- !n. 0 < n ==> (SUC(PRE n) = n)

  PRE_MONO     |- !m n. (PRE m) < (PRE n) ==> m < n

  PRE_LESS_EQ  |- !n. (PRE n) <= n

  PRE_ADD      |- !n m. 0 < n ==> (PRE(n + m) = (PRE n) + m)

  PRE_K_K      |- !k. 0 < k ==> (PRE k) < k
\end{verbatim}\end{hol}