paulson [Fri, 14 Jun 1996 12:23:31 +0200] rev 1797
Updated list of theories for target ex
paulson [Fri, 14 Jun 1996 12:22:59 +0200] rev 1796
Tidied spacing
paulson [Fri, 14 Jun 1996 12:22:42 +0200] rev 1795
New lemmas for gcd example
paulson [Fri, 14 Jun 1996 12:21:02 +0200] rev 1794
Obsolete relics concerned with recursion
paulson [Thu, 13 Jun 1996 16:22:37 +0200] rev 1793
New example of GCDs and divides relation
paulson [Thu, 13 Jun 1996 14:25:45 +0200] rev 1792
The "divides" relation, the greatest common divisor and Euclid's algorithm
paulson [Fri, 07 Jun 1996 10:56:37 +0200] rev 1791
Addition of converse_iff, domain_converse, range_converse as rewrites
paulson [Thu, 06 Jun 1996 16:20:27 +0200] rev 1790
Quotes now optional around inductive set
paulson [Thu, 06 Jun 1996 14:39:44 +0200] rev 1789
Quotes now optional around inductive set
paulson [Thu, 06 Jun 1996 13:13:18 +0200] rev 1788
Quotes now optional around inductive set
paulson [Tue, 04 Jun 1996 12:49:04 +0200] rev 1787
Tidied some proofs
berghofe [Mon, 03 Jun 1996 17:10:56 +0200] rev 1786
best_tac, deepen_tac and safe_tac now also use default claset.
paulson [Mon, 03 Jun 1996 11:44:44 +0200] rev 1785
Shortened some proofs
paulson [Mon, 03 Jun 1996 11:43:55 +0200] rev 1784
Added a new theorem, UN_Int_subset
paulson [Mon, 03 Jun 1996 11:41:26 +0200] rev 1783
Used 2 instead of Suc(Suc 0)
paulson [Mon, 03 Jun 1996 11:41:00 +0200] rev 1782
Shortened a proof
oheimb [Fri, 31 May 1996 20:25:59 +0200] rev 1781
adapted use of monofun_cfun_arg
oheimb [Fri, 31 May 1996 20:14:42 +0200] rev 1780
adapted proof of flat_codom
oheimb [Fri, 31 May 1996 19:55:19 +0200] rev 1779
introduced forgotten bind_thm calls
oheimb [Fri, 31 May 1996 19:47:23 +0200] rev 1778
adapted some proofs for new simplifier
oheimb [Fri, 31 May 1996 19:34:40 +0200] rev 1777
renamed le_0 to le_0_eq, to avoid confusion with le0,
supplied an experimental thm Suc_le_eq, but commented it out
oheimb [Fri, 31 May 1996 19:12:00 +0200] rev 1776
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
as there have been unnecessary proofs of anonymous thms, which could not be
removed (by name) from the !simpset where necessary. All these thms except
singleton_iff were already proved in Set.ML.
therefore in Set.ML: New version of singletonE, proof of new thm singleton_iff
nipkow [Thu, 30 May 1996 13:31:29 +0200] rev 1775
Smaller logo
nipkow [Thu, 30 May 1996 13:29:52 +0200] rev 1774
Regrouped logo
nipkow [Wed, 29 May 1996 13:53:39 +0200] rev 1773
Added logo
nipkow [Wed, 29 May 1996 13:47:43 +0200] rev 1772
An Isabelle logo
nipkow [Wed, 29 May 1996 13:34:17 +0200] rev 1771
Replaced setsolver by addsolver
nipkow [Wed, 29 May 1996 12:03:32 +0200] rev 1770
Added addsolver
paulson [Tue, 28 May 1996 11:19:16 +0200] rev 1769
Simplified proof of deduction theorem
paulson [Tue, 28 May 1996 11:16:38 +0200] rev 1768
Corrected a comment in #34