Thu, 13 Jun 1996 14:25:45 +0200 The "divides" relation, the greatest common divisor and Euclid's algorithm
paulson [Thu, 13 Jun 1996 14:25:45 +0200] rev 1792
The "divides" relation, the greatest common divisor and Euclid's algorithm
Fri, 07 Jun 1996 10:56:37 +0200 Addition of converse_iff, domain_converse, range_converse as rewrites
paulson [Fri, 07 Jun 1996 10:56:37 +0200] rev 1791
Addition of converse_iff, domain_converse, range_converse as rewrites
Thu, 06 Jun 1996 16:20:27 +0200 Quotes now optional around inductive set
paulson [Thu, 06 Jun 1996 16:20:27 +0200] rev 1790
Quotes now optional around inductive set
Thu, 06 Jun 1996 14:39:44 +0200 Quotes now optional around inductive set
paulson [Thu, 06 Jun 1996 14:39:44 +0200] rev 1789
Quotes now optional around inductive set
Thu, 06 Jun 1996 13:13:18 +0200 Quotes now optional around inductive set
paulson [Thu, 06 Jun 1996 13:13:18 +0200] rev 1788
Quotes now optional around inductive set
Tue, 04 Jun 1996 12:49:04 +0200 Tidied some proofs
paulson [Tue, 04 Jun 1996 12:49:04 +0200] rev 1787
Tidied some proofs
Mon, 03 Jun 1996 17:10:56 +0200 best_tac, deepen_tac and safe_tac now also use default claset.
berghofe [Mon, 03 Jun 1996 17:10:56 +0200] rev 1786
best_tac, deepen_tac and safe_tac now also use default claset.
Mon, 03 Jun 1996 11:44:44 +0200 Shortened some proofs
paulson [Mon, 03 Jun 1996 11:44:44 +0200] rev 1785
Shortened some proofs
Mon, 03 Jun 1996 11:43:55 +0200 Added a new theorem, UN_Int_subset
paulson [Mon, 03 Jun 1996 11:43:55 +0200] rev 1784
Added a new theorem, UN_Int_subset
Mon, 03 Jun 1996 11:41:26 +0200 Used 2 instead of Suc(Suc 0)
paulson [Mon, 03 Jun 1996 11:41:26 +0200] rev 1783
Used 2 instead of Suc(Suc 0)
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip