Wed, 07 Feb 2007 18:01:40 +0100 Added split_rule attribute.
berghofe [Wed, 07 Feb 2007 18:01:40 +0100] rev 22278
Added split_rule attribute.
Wed, 07 Feb 2007 18:00:38 +0100 Fixed bug in mk_AbsP.
berghofe [Wed, 07 Feb 2007 18:00:38 +0100] rev 22277
Fixed bug in mk_AbsP.
Wed, 07 Feb 2007 17:59:40 +0100 Introduction and elimination rules for <= on predicates
berghofe [Wed, 07 Feb 2007 17:59:40 +0100] rev 22276
Introduction and elimination rules for <= on predicates are now declared properly.
Wed, 07 Feb 2007 17:58:50 +0100 - Improved handling of monotonicity rules involving <=
berghofe [Wed, 07 Feb 2007 17:58:50 +0100] rev 22275
- Improved handling of monotonicity rules involving <= - ind_cases: variables to be generalized can now be specified using "for" keyword
Wed, 07 Feb 2007 17:51:38 +0100 Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:51:38 +0100] rev 22274
Adapted to changes in Finite_Set theory.
Wed, 07 Feb 2007 17:46:03 +0100 Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:46:03 +0100] rev 22273
Adapted to changes in Finite_Set theory.
Wed, 07 Feb 2007 17:45:03 +0100 - Adapted to new inductive definition package
berghofe [Wed, 07 Feb 2007 17:45:03 +0100] rev 22272
- Adapted to new inductive definition package - More elegant proof of eta postponement theorem inspired by Andreas Abel
Wed, 07 Feb 2007 17:44:07 +0100 Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:44:07 +0100] rev 22271
Adapted to new inductive definition package.
Wed, 07 Feb 2007 17:41:11 +0100 Converted to predicate notation.
berghofe [Wed, 07 Feb 2007 17:41:11 +0100] rev 22270
Converted to predicate notation.
Wed, 07 Feb 2007 17:39:49 +0100 Adapted to changes in List theory.
berghofe [Wed, 07 Feb 2007 17:39:49 +0100] rev 22269
Adapted to changes in List theory.
Wed, 07 Feb 2007 17:37:59 +0100 - wfP has been moved to theory Wellfounded_Recursion
berghofe [Wed, 07 Feb 2007 17:37:59 +0100] rev 22268
- wfP has been moved to theory Wellfounded_Recursion - Accessible part now works on predicates, hence accP is no longer needed
Wed, 07 Feb 2007 17:35:28 +0100 Adapted to changes in Transitive_Closure theory.
berghofe [Wed, 07 Feb 2007 17:35:28 +0100] rev 22267
Adapted to changes in Transitive_Closure theory.
Wed, 07 Feb 2007 17:34:43 +0100 Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:34:43 +0100] rev 22266
Adapted to new inductive definition package.
Wed, 07 Feb 2007 17:32:52 +0100 Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:32:52 +0100] rev 22265
Adapted to changes in Finite_Set theory.
Wed, 07 Feb 2007 17:30:53 +0100 Theorems for converting between wf and wfP are now declared
berghofe [Wed, 07 Feb 2007 17:30:53 +0100] rev 22264
Theorems for converting between wf and wfP are now declared as hints.
(0) -10000 -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 +3000 +10000 +30000 tip