src/HOL/Nat.ML
author nipkow
Mon Apr 10 08:40:58 1995 +0200 (1995-04-10)
changeset 1024 b86042000035
parent 972 e61b058d58d2
child 1264 3eb91524b938
permissions -rw-r--r--
ROOT.ML: installed new hyp_subst_tac

Nat.ML: Changed proof of lessE for new hyp_subst_tac
clasohm@923
     1
(*  Title: 	HOL/nat
clasohm@923
     2
    ID:         $Id$
clasohm@923
     3
    Author: 	Tobias Nipkow, Cambridge University Computer Laboratory
clasohm@923
     4
    Copyright   1991  University of Cambridge
clasohm@923
     5
clasohm@923
     6
For nat.thy.  Type nat is defined as a set (Nat) over the type ind.
clasohm@923
     7
*)
clasohm@923
     8
clasohm@923
     9
open Nat;
clasohm@923
    10
clasohm@923
    11
goal Nat.thy "mono(%X. {Zero_Rep} Un (Suc_Rep``X))";
clasohm@923
    12
by (REPEAT (ares_tac [monoI, subset_refl, image_mono, Un_mono] 1));
clasohm@923
    13
qed "Nat_fun_mono";
clasohm@923
    14
clasohm@923
    15
val Nat_unfold = Nat_fun_mono RS (Nat_def RS def_lfp_Tarski);
clasohm@923
    16
clasohm@923
    17
(* Zero is a natural number -- this also justifies the type definition*)
clasohm@923
    18
goal Nat.thy "Zero_Rep: Nat";
clasohm@923
    19
by (rtac (Nat_unfold RS ssubst) 1);
clasohm@923
    20
by (rtac (singletonI RS UnI1) 1);
clasohm@923
    21
qed "Zero_RepI";
clasohm@923
    22
clasohm@923
    23
val prems = goal Nat.thy "i: Nat ==> Suc_Rep(i) : Nat";
clasohm@923
    24
by (rtac (Nat_unfold RS ssubst) 1);
clasohm@923
    25
by (rtac (imageI RS UnI2) 1);
clasohm@923
    26
by (resolve_tac prems 1);
clasohm@923
    27
qed "Suc_RepI";
clasohm@923
    28
clasohm@923
    29
(*** Induction ***)
clasohm@923
    30
clasohm@923
    31
val major::prems = goal Nat.thy
clasohm@923
    32
    "[| i: Nat;  P(Zero_Rep);   \
clasohm@923
    33
\       !!j. [| j: Nat; P(j) |] ==> P(Suc_Rep(j)) |]  ==> P(i)";
clasohm@923
    34
by (rtac ([Nat_def, Nat_fun_mono, major] MRS def_induct) 1);
clasohm@923
    35
by (fast_tac (set_cs addIs prems) 1);
clasohm@923
    36
qed "Nat_induct";
clasohm@923
    37
clasohm@923
    38
val prems = goalw Nat.thy [Zero_def,Suc_def]
clasohm@923
    39
    "[| P(0);   \
clasohm@923
    40
\       !!k. P(k) ==> P(Suc(k)) |]  ==> P(n)";
clasohm@923
    41
by (rtac (Rep_Nat_inverse RS subst) 1);   (*types force good instantiation*)
clasohm@923
    42
by (rtac (Rep_Nat RS Nat_induct) 1);
clasohm@923
    43
by (REPEAT (ares_tac prems 1
clasohm@923
    44
     ORELSE eresolve_tac [Abs_Nat_inverse RS subst] 1));
clasohm@923
    45
qed "nat_induct";
clasohm@923
    46
clasohm@923
    47
(*Perform induction on n. *)
clasohm@923
    48
fun nat_ind_tac a i = 
clasohm@923
    49
    EVERY [res_inst_tac [("n",a)] nat_induct i,
clasohm@923
    50
	   rename_last_tac a ["1"] (i+1)];
clasohm@923
    51
clasohm@923
    52
(*A special form of induction for reasoning about m<n and m-n*)
clasohm@923
    53
val prems = goal Nat.thy
clasohm@923
    54
    "[| !!x. P x 0;  \
clasohm@923
    55
\       !!y. P 0 (Suc y);  \
clasohm@923
    56
\       !!x y. [| P x y |] ==> P (Suc x) (Suc y)  \
clasohm@923
    57
\    |] ==> P m n";
clasohm@923
    58
by (res_inst_tac [("x","m")] spec 1);
clasohm@923
    59
by (nat_ind_tac "n" 1);
clasohm@923
    60
by (rtac allI 2);
clasohm@923
    61
by (nat_ind_tac "x" 2);
clasohm@923
    62
by (REPEAT (ares_tac (prems@[allI]) 1 ORELSE etac spec 1));
clasohm@923
    63
qed "diff_induct";
clasohm@923
    64
clasohm@923
    65
(*Case analysis on the natural numbers*)
clasohm@923
    66
val prems = goal Nat.thy 
clasohm@923
    67
    "[| n=0 ==> P;  !!x. n = Suc(x) ==> P |] ==> P";
clasohm@923
    68
by (subgoal_tac "n=0 | (EX x. n = Suc(x))" 1);
clasohm@923
    69
by (fast_tac (HOL_cs addSEs prems) 1);
clasohm@923
    70
by (nat_ind_tac "n" 1);
clasohm@923
    71
by (rtac (refl RS disjI1) 1);
clasohm@923
    72
by (fast_tac HOL_cs 1);
clasohm@923
    73
qed "natE";
clasohm@923
    74
clasohm@923
    75
(*** Isomorphisms: Abs_Nat and Rep_Nat ***)
clasohm@923
    76
clasohm@923
    77
(*We can't take these properties as axioms, or take Abs_Nat==Inv(Rep_Nat),
clasohm@923
    78
  since we assume the isomorphism equations will one day be given by Isabelle*)
clasohm@923
    79
clasohm@923
    80
goal Nat.thy "inj(Rep_Nat)";
clasohm@923
    81
by (rtac inj_inverseI 1);
clasohm@923
    82
by (rtac Rep_Nat_inverse 1);
clasohm@923
    83
qed "inj_Rep_Nat";
clasohm@923
    84
clasohm@923
    85
goal Nat.thy "inj_onto Abs_Nat Nat";
clasohm@923
    86
by (rtac inj_onto_inverseI 1);
clasohm@923
    87
by (etac Abs_Nat_inverse 1);
clasohm@923
    88
qed "inj_onto_Abs_Nat";
clasohm@923
    89
clasohm@923
    90
(*** Distinctness of constructors ***)
clasohm@923
    91
clasohm@923
    92
goalw Nat.thy [Zero_def,Suc_def] "Suc(m) ~= 0";
clasohm@923
    93
by (rtac (inj_onto_Abs_Nat RS inj_onto_contraD) 1);
clasohm@923
    94
by (rtac Suc_Rep_not_Zero_Rep 1);
clasohm@923
    95
by (REPEAT (resolve_tac [Rep_Nat, Suc_RepI, Zero_RepI] 1));
clasohm@923
    96
qed "Suc_not_Zero";
clasohm@923
    97
clasohm@923
    98
bind_thm ("Zero_not_Suc", (Suc_not_Zero RS not_sym));
clasohm@923
    99
clasohm@923
   100
bind_thm ("Suc_neq_Zero", (Suc_not_Zero RS notE));
clasohm@923
   101
val Zero_neq_Suc = sym RS Suc_neq_Zero;
clasohm@923
   102
clasohm@923
   103
(** Injectiveness of Suc **)
clasohm@923
   104
clasohm@923
   105
goalw Nat.thy [Suc_def] "inj(Suc)";
clasohm@923
   106
by (rtac injI 1);
clasohm@923
   107
by (dtac (inj_onto_Abs_Nat RS inj_ontoD) 1);
clasohm@923
   108
by (REPEAT (resolve_tac [Rep_Nat, Suc_RepI] 1));
clasohm@923
   109
by (dtac (inj_Suc_Rep RS injD) 1);
clasohm@923
   110
by (etac (inj_Rep_Nat RS injD) 1);
clasohm@923
   111
qed "inj_Suc";
clasohm@923
   112
clasohm@923
   113
val Suc_inject = inj_Suc RS injD;;
clasohm@923
   114
clasohm@923
   115
goal Nat.thy "(Suc(m)=Suc(n)) = (m=n)";
clasohm@923
   116
by (EVERY1 [rtac iffI, etac Suc_inject, etac arg_cong]); 
clasohm@923
   117
qed "Suc_Suc_eq";
clasohm@923
   118
clasohm@923
   119
goal Nat.thy "n ~= Suc(n)";
clasohm@923
   120
by (nat_ind_tac "n" 1);
clasohm@923
   121
by (ALLGOALS(asm_simp_tac (HOL_ss addsimps [Zero_not_Suc,Suc_Suc_eq])));
clasohm@923
   122
qed "n_not_Suc_n";
clasohm@923
   123
clasohm@923
   124
val Suc_n_not_n = n_not_Suc_n RS not_sym;
clasohm@923
   125
clasohm@923
   126
(*** nat_case -- the selection operator for nat ***)
clasohm@923
   127
clasohm@923
   128
goalw Nat.thy [nat_case_def] "nat_case a f 0 = a";
clasohm@923
   129
by (fast_tac (set_cs addIs [select_equality] addEs [Zero_neq_Suc]) 1);
clasohm@923
   130
qed "nat_case_0";
clasohm@923
   131
clasohm@923
   132
goalw Nat.thy [nat_case_def] "nat_case a f (Suc k) = f(k)";
clasohm@923
   133
by (fast_tac (set_cs addIs [select_equality] 
clasohm@923
   134
	               addEs [make_elim Suc_inject, Suc_neq_Zero]) 1);
clasohm@923
   135
qed "nat_case_Suc";
clasohm@923
   136
clasohm@923
   137
(** Introduction rules for 'pred_nat' **)
clasohm@923
   138
clasohm@972
   139
goalw Nat.thy [pred_nat_def] "(n, Suc(n)) : pred_nat";
clasohm@923
   140
by (fast_tac set_cs 1);
clasohm@923
   141
qed "pred_natI";
clasohm@923
   142
clasohm@923
   143
val major::prems = goalw Nat.thy [pred_nat_def]
clasohm@972
   144
    "[| p : pred_nat;  !!x n. [| p = (n, Suc(n)) |] ==> R \
clasohm@923
   145
\    |] ==> R";
clasohm@923
   146
by (rtac (major RS CollectE) 1);
clasohm@923
   147
by (REPEAT (eresolve_tac ([asm_rl,exE]@prems) 1));
clasohm@923
   148
qed "pred_natE";
clasohm@923
   149
clasohm@923
   150
goalw Nat.thy [wf_def] "wf(pred_nat)";
clasohm@923
   151
by (strip_tac 1);
clasohm@923
   152
by (nat_ind_tac "x" 1);
clasohm@923
   153
by (fast_tac (HOL_cs addSEs [mp, pred_natE, Pair_inject, 
clasohm@923
   154
			     make_elim Suc_inject]) 2);
clasohm@923
   155
by (fast_tac (HOL_cs addSEs [mp, pred_natE, Pair_inject, Zero_neq_Suc]) 1);
clasohm@923
   156
qed "wf_pred_nat";
clasohm@923
   157
clasohm@923
   158
clasohm@923
   159
(*** nat_rec -- by wf recursion on pred_nat ***)
clasohm@923
   160
clasohm@923
   161
bind_thm ("nat_rec_unfold", (wf_pred_nat RS (nat_rec_def RS def_wfrec)));
clasohm@923
   162
clasohm@923
   163
(** conversion rules **)
clasohm@923
   164
clasohm@923
   165
goal Nat.thy "nat_rec 0 c h = c";
clasohm@923
   166
by (rtac (nat_rec_unfold RS trans) 1);
clasohm@923
   167
by (simp_tac (HOL_ss addsimps [nat_case_0]) 1);
clasohm@923
   168
qed "nat_rec_0";
clasohm@923
   169
clasohm@923
   170
goal Nat.thy "nat_rec (Suc n) c h = h n (nat_rec n c h)";
clasohm@923
   171
by (rtac (nat_rec_unfold RS trans) 1);
clasohm@923
   172
by (simp_tac (HOL_ss addsimps [nat_case_Suc, pred_natI, cut_apply]) 1);
clasohm@923
   173
qed "nat_rec_Suc";
clasohm@923
   174
clasohm@923
   175
(*These 2 rules ease the use of primitive recursion.  NOTE USE OF == *)
clasohm@923
   176
val [rew] = goal Nat.thy
clasohm@923
   177
    "[| !!n. f(n) == nat_rec n c h |] ==> f(0) = c";
clasohm@923
   178
by (rewtac rew);
clasohm@923
   179
by (rtac nat_rec_0 1);
clasohm@923
   180
qed "def_nat_rec_0";
clasohm@923
   181
clasohm@923
   182
val [rew] = goal Nat.thy
clasohm@923
   183
    "[| !!n. f(n) == nat_rec n c h |] ==> f(Suc(n)) = h n (f n)";
clasohm@923
   184
by (rewtac rew);
clasohm@923
   185
by (rtac nat_rec_Suc 1);
clasohm@923
   186
qed "def_nat_rec_Suc";
clasohm@923
   187
clasohm@923
   188
fun nat_recs def =
clasohm@923
   189
      [standard (def RS def_nat_rec_0),
clasohm@923
   190
       standard (def RS def_nat_rec_Suc)];
clasohm@923
   191
clasohm@923
   192
clasohm@923
   193
(*** Basic properties of "less than" ***)
clasohm@923
   194
clasohm@923
   195
(** Introduction properties **)
clasohm@923
   196
clasohm@923
   197
val prems = goalw Nat.thy [less_def] "[| i<j;  j<k |] ==> i<(k::nat)";
clasohm@923
   198
by (rtac (trans_trancl RS transD) 1);
clasohm@923
   199
by (resolve_tac prems 1);
clasohm@923
   200
by (resolve_tac prems 1);
clasohm@923
   201
qed "less_trans";
clasohm@923
   202
clasohm@923
   203
goalw Nat.thy [less_def] "n < Suc(n)";
clasohm@923
   204
by (rtac (pred_natI RS r_into_trancl) 1);
clasohm@923
   205
qed "lessI";
clasohm@923
   206
clasohm@972
   207
(* i(j ==> i(Suc(j) *)
clasohm@923
   208
val less_SucI = lessI RSN (2, less_trans);
clasohm@923
   209
clasohm@923
   210
goal Nat.thy "0 < Suc(n)";
clasohm@923
   211
by (nat_ind_tac "n" 1);
clasohm@923
   212
by (rtac lessI 1);
clasohm@923
   213
by (etac less_trans 1);
clasohm@923
   214
by (rtac lessI 1);
clasohm@923
   215
qed "zero_less_Suc";
clasohm@923
   216
clasohm@923
   217
(** Elimination properties **)
clasohm@923
   218
clasohm@923
   219
val prems = goalw Nat.thy [less_def] "n<m ==> ~ m<(n::nat)";
clasohm@923
   220
by(fast_tac (HOL_cs addIs ([wf_pred_nat, wf_trancl RS wf_asym]@prems))1);
clasohm@923
   221
qed "less_not_sym";
clasohm@923
   222
clasohm@972
   223
(* [| n(m; m(n |] ==> R *)
clasohm@923
   224
bind_thm ("less_asym", (less_not_sym RS notE));
clasohm@923
   225
clasohm@923
   226
goalw Nat.thy [less_def] "~ n<(n::nat)";
clasohm@923
   227
by (rtac notI 1);
clasohm@923
   228
by (etac (wf_pred_nat RS wf_trancl RS wf_anti_refl) 1);
clasohm@923
   229
qed "less_not_refl";
clasohm@923
   230
clasohm@972
   231
(* n(n ==> R *)
clasohm@923
   232
bind_thm ("less_anti_refl", (less_not_refl RS notE));
clasohm@923
   233
clasohm@923
   234
goal Nat.thy "!!m. n<m ==> m ~= (n::nat)";
clasohm@923
   235
by(fast_tac (HOL_cs addEs [less_anti_refl]) 1);
clasohm@923
   236
qed "less_not_refl2";
clasohm@923
   237
clasohm@923
   238
clasohm@923
   239
val major::prems = goalw Nat.thy [less_def]
clasohm@923
   240
    "[| i<k;  k=Suc(i) ==> P;  !!j. [| i<j;  k=Suc(j) |] ==> P \
clasohm@923
   241
\    |] ==> P";
clasohm@923
   242
by (rtac (major RS tranclE) 1);
nipkow@1024
   243
by (REPEAT_FIRST (bound_hyp_subst_tac ORELSE'
nipkow@1024
   244
		  eresolve_tac (prems@[pred_natE, Pair_inject])));
nipkow@1024
   245
by (rtac refl 1);
clasohm@923
   246
qed "lessE";
clasohm@923
   247
clasohm@923
   248
goal Nat.thy "~ n<0";
clasohm@923
   249
by (rtac notI 1);
clasohm@923
   250
by (etac lessE 1);
clasohm@923
   251
by (etac Zero_neq_Suc 1);
clasohm@923
   252
by (etac Zero_neq_Suc 1);
clasohm@923
   253
qed "not_less0";
clasohm@923
   254
clasohm@923
   255
(* n<0 ==> R *)
clasohm@923
   256
bind_thm ("less_zeroE", (not_less0 RS notE));
clasohm@923
   257
clasohm@923
   258
val [major,less,eq] = goal Nat.thy
clasohm@923
   259
    "[| m < Suc(n);  m<n ==> P;  m=n ==> P |] ==> P";
clasohm@923
   260
by (rtac (major RS lessE) 1);
clasohm@923
   261
by (rtac eq 1);
clasohm@923
   262
by (fast_tac (HOL_cs addSDs [Suc_inject]) 1);
clasohm@923
   263
by (rtac less 1);
clasohm@923
   264
by (fast_tac (HOL_cs addSDs [Suc_inject]) 1);
clasohm@923
   265
qed "less_SucE";
clasohm@923
   266
clasohm@923
   267
goal Nat.thy "(m < Suc(n)) = (m < n | m = n)";
clasohm@923
   268
by (fast_tac (HOL_cs addSIs [lessI]
clasohm@923
   269
		     addEs  [less_trans, less_SucE]) 1);
clasohm@923
   270
qed "less_Suc_eq";
clasohm@923
   271
clasohm@923
   272
clasohm@923
   273
(** Inductive (?) properties **)
clasohm@923
   274
clasohm@923
   275
val [prem] = goal Nat.thy "Suc(m) < n ==> m<n";
clasohm@923
   276
by (rtac (prem RS rev_mp) 1);
clasohm@923
   277
by (nat_ind_tac "n" 1);
clasohm@923
   278
by (rtac impI 1);
clasohm@923
   279
by (etac less_zeroE 1);
clasohm@923
   280
by (fast_tac (HOL_cs addSIs [lessI RS less_SucI]
clasohm@923
   281
	 	     addSDs [Suc_inject]
clasohm@923
   282
		     addEs  [less_trans, lessE]) 1);
clasohm@923
   283
qed "Suc_lessD";
clasohm@923
   284
clasohm@923
   285
val [major,minor] = goal Nat.thy 
clasohm@923
   286
    "[| Suc(i)<k;  !!j. [| i<j;  k=Suc(j) |] ==> P \
clasohm@923
   287
\    |] ==> P";
clasohm@923
   288
by (rtac (major RS lessE) 1);
clasohm@923
   289
by (etac (lessI RS minor) 1);
clasohm@923
   290
by (etac (Suc_lessD RS minor) 1);
clasohm@923
   291
by (assume_tac 1);
clasohm@923
   292
qed "Suc_lessE";
clasohm@923
   293
clasohm@923
   294
val [major] = goal Nat.thy "Suc(m) < Suc(n) ==> m<n";
clasohm@923
   295
by (rtac (major RS lessE) 1);
clasohm@923
   296
by (REPEAT (rtac lessI 1
clasohm@923
   297
     ORELSE eresolve_tac [make_elim Suc_inject, ssubst, Suc_lessD] 1));
clasohm@923
   298
qed "Suc_less_SucD";
clasohm@923
   299
clasohm@923
   300
val prems = goal Nat.thy "m<n ==> Suc(m) < Suc(n)";
clasohm@923
   301
by (subgoal_tac "m<n --> Suc(m) < Suc(n)" 1);
clasohm@923
   302
by (fast_tac (HOL_cs addIs prems) 1);
clasohm@923
   303
by (nat_ind_tac "n" 1);
clasohm@923
   304
by (rtac impI 1);
clasohm@923
   305
by (etac less_zeroE 1);
clasohm@923
   306
by (fast_tac (HOL_cs addSIs [lessI]
clasohm@923
   307
	 	     addSDs [Suc_inject]
clasohm@923
   308
		     addEs  [less_trans, lessE]) 1);
clasohm@923
   309
qed "Suc_mono";
clasohm@923
   310
clasohm@923
   311
goal Nat.thy "(Suc(m) < Suc(n)) = (m<n)";
clasohm@923
   312
by (EVERY1 [rtac iffI, etac Suc_less_SucD, etac Suc_mono]);
clasohm@923
   313
qed "Suc_less_eq";
clasohm@923
   314
clasohm@923
   315
goal Nat.thy "~(Suc(n) < n)";
clasohm@923
   316
by(fast_tac (HOL_cs addEs [Suc_lessD RS less_anti_refl]) 1);
clasohm@923
   317
qed "not_Suc_n_less_n";
clasohm@923
   318
clasohm@923
   319
(*"Less than" is a linear ordering*)
clasohm@923
   320
goal Nat.thy "m<n | m=n | n<(m::nat)";
clasohm@923
   321
by (nat_ind_tac "m" 1);
clasohm@923
   322
by (nat_ind_tac "n" 1);
clasohm@923
   323
by (rtac (refl RS disjI1 RS disjI2) 1);
clasohm@923
   324
by (rtac (zero_less_Suc RS disjI1) 1);
clasohm@923
   325
by (fast_tac (HOL_cs addIs [lessI, Suc_mono, less_SucI] addEs [lessE]) 1);
clasohm@923
   326
qed "less_linear";
clasohm@923
   327
clasohm@923
   328
(*Can be used with less_Suc_eq to get n=m | n<m *)
clasohm@923
   329
goal Nat.thy "(~ m < n) = (n < Suc(m))";
clasohm@923
   330
by (res_inst_tac [("m","m"),("n","n")] diff_induct 1);
clasohm@923
   331
by(ALLGOALS(asm_simp_tac (HOL_ss addsimps
clasohm@923
   332
                          [not_less0,zero_less_Suc,Suc_less_eq])));
clasohm@923
   333
qed "not_less_eq";
clasohm@923
   334
clasohm@923
   335
(*Complete induction, aka course-of-values induction*)
clasohm@923
   336
val prems = goalw Nat.thy [less_def]
clasohm@923
   337
    "[| !!n. [| ! m::nat. m<n --> P(m) |] ==> P(n) |]  ==>  P(n)";
clasohm@923
   338
by (wf_ind_tac "n" [wf_pred_nat RS wf_trancl] 1);
clasohm@923
   339
by (eresolve_tac prems 1);
clasohm@923
   340
qed "less_induct";
clasohm@923
   341
clasohm@923
   342
clasohm@923
   343
(*** Properties of <= ***)
clasohm@923
   344
clasohm@923
   345
goalw Nat.thy [le_def] "0 <= n";
clasohm@923
   346
by (rtac not_less0 1);
clasohm@923
   347
qed "le0";
clasohm@923
   348
clasohm@923
   349
val nat_simps = [not_less0, less_not_refl, zero_less_Suc, lessI, 
clasohm@923
   350
		 Suc_less_eq, less_Suc_eq, le0, not_Suc_n_less_n,
clasohm@923
   351
		 Suc_not_Zero, Zero_not_Suc, Suc_Suc_eq,
clasohm@923
   352
		 n_not_Suc_n, Suc_n_not_n,
clasohm@923
   353
		 nat_case_0, nat_case_Suc, nat_rec_0, nat_rec_Suc];
clasohm@923
   354
clasohm@923
   355
val nat_ss0 = sum_ss  addsimps  nat_simps;
clasohm@923
   356
clasohm@923
   357
(*Prevents simplification of f and g: much faster*)
clasohm@923
   358
qed_goal "nat_case_weak_cong" Nat.thy
clasohm@923
   359
  "m=n ==> nat_case a f m = nat_case a f n"
clasohm@923
   360
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
clasohm@923
   361
clasohm@923
   362
qed_goal "nat_rec_weak_cong" Nat.thy
clasohm@923
   363
  "m=n ==> nat_rec m a f = nat_rec n a f"
clasohm@923
   364
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
clasohm@923
   365
clasohm@923
   366
val prems = goalw Nat.thy [le_def] "~(n<m) ==> m<=(n::nat)";
clasohm@923
   367
by (resolve_tac prems 1);
clasohm@923
   368
qed "leI";
clasohm@923
   369
clasohm@923
   370
val prems = goalw Nat.thy [le_def] "m<=n ==> ~(n<(m::nat))";
clasohm@923
   371
by (resolve_tac prems 1);
clasohm@923
   372
qed "leD";
clasohm@923
   373
clasohm@923
   374
val leE = make_elim leD;
clasohm@923
   375
clasohm@923
   376
goalw Nat.thy [le_def] "!!m. ~ m <= n ==> n<(m::nat)";
clasohm@923
   377
by (fast_tac HOL_cs 1);
clasohm@923
   378
qed "not_leE";
clasohm@923
   379
clasohm@923
   380
goalw Nat.thy [le_def] "!!m. m < n ==> Suc(m) <= n";
clasohm@923
   381
by(simp_tac nat_ss0 1);
clasohm@923
   382
by (fast_tac (HOL_cs addEs [less_anti_refl,less_asym]) 1);
clasohm@923
   383
qed "lessD";
clasohm@923
   384
clasohm@923
   385
goalw Nat.thy [le_def] "!!m. Suc(m) <= n ==> m <= n";
clasohm@923
   386
by(asm_full_simp_tac nat_ss0 1);
clasohm@923
   387
by(fast_tac HOL_cs 1);
clasohm@923
   388
qed "Suc_leD";
clasohm@923
   389
clasohm@923
   390
goalw Nat.thy [le_def] "!!m. m < n ==> m <= (n::nat)";
clasohm@923
   391
by (fast_tac (HOL_cs addEs [less_asym]) 1);
clasohm@923
   392
qed "less_imp_le";
clasohm@923
   393
clasohm@923
   394
goalw Nat.thy [le_def] "!!m. m <= n ==> m < n | m=(n::nat)";
clasohm@923
   395
by (cut_facts_tac [less_linear] 1);
clasohm@923
   396
by (fast_tac (HOL_cs addEs [less_anti_refl,less_asym]) 1);
clasohm@923
   397
qed "le_imp_less_or_eq";
clasohm@923
   398
clasohm@923
   399
goalw Nat.thy [le_def] "!!m. m<n | m=n ==> m <=(n::nat)";
clasohm@923
   400
by (cut_facts_tac [less_linear] 1);
clasohm@923
   401
by (fast_tac (HOL_cs addEs [less_anti_refl,less_asym]) 1);
clasohm@923
   402
by (flexflex_tac);
clasohm@923
   403
qed "less_or_eq_imp_le";
clasohm@923
   404
clasohm@923
   405
goal Nat.thy "(x <= (y::nat)) = (x < y | x=y)";
clasohm@923
   406
by (REPEAT(ares_tac [iffI,less_or_eq_imp_le,le_imp_less_or_eq] 1));
clasohm@923
   407
qed "le_eq_less_or_eq";
clasohm@923
   408
clasohm@923
   409
goal Nat.thy "n <= (n::nat)";
clasohm@923
   410
by(simp_tac (HOL_ss addsimps [le_eq_less_or_eq]) 1);
clasohm@923
   411
qed "le_refl";
clasohm@923
   412
clasohm@923
   413
val prems = goal Nat.thy "!!i. [| i <= j; j < k |] ==> i < (k::nat)";
clasohm@923
   414
by (dtac le_imp_less_or_eq 1);
clasohm@923
   415
by (fast_tac (HOL_cs addIs [less_trans]) 1);
clasohm@923
   416
qed "le_less_trans";
clasohm@923
   417
clasohm@923
   418
goal Nat.thy "!!i. [| i < j; j <= k |] ==> i < (k::nat)";
clasohm@923
   419
by (dtac le_imp_less_or_eq 1);
clasohm@923
   420
by (fast_tac (HOL_cs addIs [less_trans]) 1);
clasohm@923
   421
qed "less_le_trans";
clasohm@923
   422
clasohm@923
   423
goal Nat.thy "!!i. [| i <= j; j <= k |] ==> i <= (k::nat)";
clasohm@923
   424
by (EVERY1[dtac le_imp_less_or_eq, dtac le_imp_less_or_eq,
clasohm@923
   425
          rtac less_or_eq_imp_le, fast_tac (HOL_cs addIs [less_trans])]);
clasohm@923
   426
qed "le_trans";
clasohm@923
   427
clasohm@923
   428
val prems = goal Nat.thy "!!m. [| m <= n; n <= m |] ==> m = (n::nat)";
clasohm@923
   429
by (EVERY1[dtac le_imp_less_or_eq, dtac le_imp_less_or_eq,
clasohm@923
   430
          fast_tac (HOL_cs addEs [less_anti_refl,less_asym])]);
clasohm@923
   431
qed "le_anti_sym";
clasohm@923
   432
clasohm@923
   433
goal Nat.thy "(Suc(n) <= Suc(m)) = (n <= m)";
clasohm@923
   434
by (simp_tac (nat_ss0 addsimps [le_eq_less_or_eq]) 1);
clasohm@923
   435
qed "Suc_le_mono";
clasohm@923
   436
nipkow@962
   437
val nat_ss = nat_ss0 addsimps [le_refl,Suc_le_mono];