# HG changeset patch
# User wenzelm
# Date 889457455 -3600
# Node ID 75a9ef36b1fe0e87cf5d6574de2a4cd96e361f99
# Parent  05e57f1879ee432b2b487a9245cb57a93dbac104
removed pred;

diff -r 05e57f1879ee -r 75a9ef36b1fe NEWS
--- a/NEWS	Mon Mar 09 16:17:28 1998 +0100
+++ b/NEWS	Mon Mar 09 16:30:55 1998 +0100
@@ -9,7 +9,7 @@
   default simpset using Addsplits just like Addsimps. They can be removed via
   Delsplits just like Delsimps. For applications see HOL below.
 
-* changed wrapper mechanism for the classical reasoner now allows for selected
+* Changed wrapper mechanism for the classical reasoner now allows for selected
   deletion of wrappers, by introduction of names for wrapper functionals.
   This implies that addbefore, addSbefore, addaltern, and addSaltern now take
   a pair (name, tactic) as argument, and that adding two tactics with the same
@@ -19,8 +19,11 @@
   delWrapper, delSWrapper: claset *  string -> claset
   getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
 
+
 *** HOL ***
 
+* HOL/Arithmetic: removed 'pred' (predecessor) function;
+
 * The rule expand_if is now part of the default simpset. This means that
   the simplifier will eliminate all ocurrences of if-then-else in the
   conclusion of a goal. To prevent this, you can either remove expand_if
@@ -31,9 +34,10 @@
   simpset: every datatype generates a suitable rule `split_t_case' (where t
   is the name of the datatype).
 
-* New theory Vimage (inverse image of a function, syntax f-``B)
+* new theory Vimage (inverse image of a function, syntax f-``B);
 
-* Many new identities for unions, intersections, etc.
+* many new identities for unions, intersections, etc.;
+
 
 
 New in Isabelle98 (January 1998)
diff -r 05e57f1879ee -r 75a9ef36b1fe src/HOL/Arith.thy
--- a/src/HOL/Arith.thy	Mon Mar 09 16:17:28 1998 +0100
+++ b/src/HOL/Arith.thy	Mon Mar 09 16:30:55 1998 +0100
@@ -22,9 +22,6 @@
   diff_0   "m - 0 = m"
   diff_Suc "m - Suc n = (case m - n of 0 => 0 | Suc k => k)"
 
-syntax pred :: nat => nat
-translations "pred m" => "m - 1"
-
 primrec "op *"  nat 
   mult_0   "0 * n = 0"
   mult_Suc "Suc m * n = n + (m * n)"