lcp [Fri, 31 Mar 1995 11:08:35 +0200] rev 990
Tried the new addss in many proofs, and tidied others involving simplification.
lcp [Fri, 31 Mar 1995 10:58:14 +0200] rev 989
Tried the new addss in a proof.
lcp [Fri, 31 Mar 1995 02:00:29 +0200] rev 988
Defined addss to perform simplification in a claset.
Precedence of addcongs is now 4 (to match that of other simplifier infixes)
clasohm [Thu, 30 Mar 1995 14:07:52 +0200] rev 987
changed translation of _applC
clasohm [Thu, 30 Mar 1995 14:07:30 +0200] rev 986
changed pretty printing of applC
lcp [Thu, 30 Mar 1995 14:01:35 +0200] rev 985
Added comment about why mem_irrefl should not be a safeE.
lcp [Thu, 30 Mar 1995 13:54:41 +0200] rev 984
Tried the new addss in many proofs, and tidied others
involving simplification.
lcp [Thu, 30 Mar 1995 13:48:30 +0200] rev 983
Precedence of infixes is now 4 (just above that of :=)
lcp [Thu, 30 Mar 1995 13:44:34 +0200] rev 982
Addition of wrappers for integration with the simplifier.
New infixes setwrapper compwrapper addbefore addafter. New function
getwrapper. The wrapper is a tactical that is applied to the step tactic. By
default it is the identity. Using THEN one can cause other tactics to be
tried before or after the step tactic. Other effects are possible using
ORELSE, etc.
lcp [Thu, 30 Mar 1995 13:36:00 +0200] rev 981
Defined addss to perform simplification in a claset.
Precedence of addcongs is now 4 (to match that of other simplifier infixes)