src/HOL/NatDef.ML
1998-04-27 nipkow 1998-04-27 Added a few lemmas. Renamed expand_const -> split_const.
1998-04-22 nipkow 1998-04-22 Modifications due to improved simplifier.
1998-03-16 paulson 1998-03-16 re-ordered proofs
1998-03-12 paulson 1998-03-12 The theorem nat_neqE, and some tidying
1998-03-07 nipkow 1998-03-07 Removed `addsplits [expand_if]'
1998-02-20 nipkow 1998-02-20 Congruence rules use == in premises now. New class linord.
1998-02-20 paulson 1998-02-20 New theorem eq_imp_le
1998-02-10 paulson 1998-02-10 New AddIffs le_0_eq and neq0_conv
1998-02-05 paulson 1998-02-05 New max, min theorems
1998-01-08 oheimb 1998-01-08 added select_equality to the implicit claset
1997-12-23 paulson 1997-12-23 tidied
1997-12-16 wenzelm 1997-12-16 expandshort;
1997-12-03 nipkow 1997-12-03 Replaced n ~= 0 by 0 < n
1997-11-05 paulson 1997-11-05 Ran expandshort, especially to introduce Safe_tac
1997-11-03 wenzelm 1997-11-03 nat datatype_info moved to Nat.thy;
1997-11-03 wenzelm 1997-11-03 isatool fixclasimp;
1997-10-30 nipkow 1997-10-30 For each datatype `t' there is now a theorem `split_t_case' of the form P(t_case f1 ... fn x) = ((!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1))& ... (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))) The simplifier now reduces !x. (..x.. & x = t & ..x..) --> P x to (..t.. & ..t..) --> P t (and similarly for t=x).
1997-10-24 wenzelm 1997-10-24 ProtoPure.flexpair_def;
1997-10-10 wenzelm 1997-10-10 fixed dots;
1997-10-01 wenzelm 1997-10-01 fully qualified names: Theory.add_XXX;
1997-09-26 paulson 1997-09-26 Minor tidying to use Clarify_tac, etc.
1997-07-23 paulson 1997-07-23 Uses new version of Datatype.occs_in_prems
1997-07-02 nipkow 1997-07-02 Added the following lemmas tp Divides and a few others to Arith and NatDef: div_le_mono, div_le_mono2, div_le_dividend, div_less_dividend Fixed a broken proof in WF_Rel.ML. No idea what caused this.
1997-06-23 paulson 1997-06-23 Ran expandshort
1997-05-30 paulson 1997-05-30 Moved "less_eq" to NatDef from Arith
1997-05-27 paulson 1997-05-27 New theorem le_Suc_eq
1997-05-26 paulson 1997-05-26 Renamed lessD to Suc_leI
1997-05-23 nipkow 1997-05-23 Added overloaded function `size' for all datatypes.
1997-05-22 nipkow 1997-05-22 Added rotation to exhaust_tac.
1997-05-22 nipkow 1997-05-22 Added exhaustion thm and exhaust_tac for each datatype.
1997-05-20 paulson 1997-05-20 New pattern-matching definition of pred_nat
1997-05-08 nipkow 1997-05-08 Modified def of Least, which, as Markus correctly complained, looked like Minimal. Derived the old def for nat in NatDef as Least_nat_def.
1997-04-30 paulson 1997-04-30 Fixed clasets so that blast_tac would work
1997-04-24 nipkow 1997-04-24 Introduced a generic "induct_tac" which picks up the right induction scheme automatically. Also changed nat_ind_tac, which does no longer append a "1" to the name of the induction variable. This caused some changes...
1997-04-23 paulson 1997-04-23 Ran expandshort
1997-04-11 paulson 1997-04-11 Yet more fast_tac->blast_tac, and other tidying
1997-04-09 paulson 1997-04-09 Using Blast_tac
1997-04-04 paulson 1997-04-04 Calls Blast_tac
1997-03-04 paulson 1997-03-04 Renamed constant "not" to "Not"
1997-02-25 pusch 1997-02-25 function nat_add_primrec added to allow primrec definitions over nat
1997-02-12 nipkow 1997-02-12 New class "order" and accompanying changes. In particular reflexivity of <= is now one rewrite rule.