src/HOL/Nat.thy
author berghofe
Wed Feb 07 17:28:09 2007 +0100 (2007-02-07)
changeset 22262 96ba62dff413
parent 22191 9c07aab3a653
child 22318 6efe70ab7add
permissions -rw-r--r--
Adapted to new inductive definition package.
clasohm@923
     1
(*  Title:      HOL/Nat.thy
clasohm@923
     2
    ID:         $Id$
wenzelm@21243
     3
    Author:     Tobias Nipkow and Lawrence C Paulson and Markus Wenzel
clasohm@923
     4
wenzelm@9436
     5
Type "nat" is a linear order, and a datatype; arithmetic operators + -
wenzelm@9436
     6
and * (for div, mod and dvd, see theory Divides).
clasohm@923
     7
*)
clasohm@923
     8
berghofe@13449
     9
header {* Natural numbers *}
berghofe@13449
    10
nipkow@15131
    11
theory Nat
nipkow@15140
    12
imports Wellfounded_Recursion Ring_and_Field
wenzelm@21243
    13
uses ("arith_data.ML")
nipkow@15131
    14
begin
berghofe@13449
    15
berghofe@13449
    16
subsection {* Type @{text ind} *}
berghofe@13449
    17
berghofe@13449
    18
typedecl ind
berghofe@13449
    19
wenzelm@19573
    20
axiomatization
wenzelm@19573
    21
  Zero_Rep :: ind and
wenzelm@19573
    22
  Suc_Rep :: "ind => ind"
wenzelm@19573
    23
where
berghofe@13449
    24
  -- {* the axiom of infinity in 2 parts *}
wenzelm@19573
    25
  inj_Suc_Rep:          "inj Suc_Rep" and
paulson@14267
    26
  Suc_Rep_not_Zero_Rep: "Suc_Rep x \<noteq> Zero_Rep"
wenzelm@19573
    27
berghofe@13449
    28
berghofe@13449
    29
subsection {* Type nat *}
berghofe@13449
    30
berghofe@13449
    31
text {* Type definition *}
berghofe@13449
    32
berghofe@22262
    33
inductive2 Nat :: "ind \<Rightarrow> bool"
berghofe@22262
    34
where
berghofe@22262
    35
    Zero_RepI: "Nat Zero_Rep"
berghofe@22262
    36
  | Suc_RepI: "Nat i ==> Nat (Suc_Rep i)"
berghofe@13449
    37
berghofe@13449
    38
global
berghofe@13449
    39
berghofe@13449
    40
typedef (open Nat)
berghofe@22262
    41
  nat = "Collect Nat"
wenzelm@21243
    42
proof
berghofe@22262
    43
  from Nat.Zero_RepI
berghofe@22262
    44
  show "Zero_Rep : Collect Nat" ..
wenzelm@21243
    45
qed
berghofe@13449
    46
berghofe@13449
    47
text {* Abstract constants and syntax *}
berghofe@13449
    48
berghofe@13449
    49
consts
berghofe@13449
    50
  Suc :: "nat => nat"
berghofe@13449
    51
  pred_nat :: "(nat * nat) set"
berghofe@13449
    52
berghofe@13449
    53
local
berghofe@13449
    54
berghofe@13449
    55
defs
paulson@18648
    56
  Suc_def:      "Suc == (%n. Abs_Nat (Suc_Rep (Rep_Nat n)))"
berghofe@13449
    57
  pred_nat_def: "pred_nat == {(m, n). n = Suc m}"
berghofe@13449
    58
haftmann@21456
    59
instance nat :: "{ord, zero, one}"
haftmann@21456
    60
  Zero_nat_def: "0 == Abs_Nat Zero_Rep"
haftmann@21456
    61
  One_nat_def [simp]: "1 == Suc 0"
berghofe@22262
    62
  less_def: "m < n == (m, n) : pred_nat^+"
haftmann@21456
    63
  le_def: "m \<le> (n::nat) == ~ (n < m)" ..
berghofe@13449
    64
berghofe@13449
    65
text {* Induction *}
clasohm@923
    66
berghofe@22262
    67
lemmas Rep_Nat' = Rep_Nat [simplified mem_Collect_eq]
berghofe@22262
    68
lemmas Abs_Nat_inverse' = Abs_Nat_inverse [simplified mem_Collect_eq]
berghofe@22262
    69
berghofe@13449
    70
theorem nat_induct: "P 0 ==> (!!n. P n ==> P (Suc n)) ==> P n"
berghofe@13449
    71
  apply (unfold Zero_nat_def Suc_def)
berghofe@13449
    72
  apply (rule Rep_Nat_inverse [THEN subst]) -- {* types force good instantiation *}
berghofe@22262
    73
  apply (erule Rep_Nat' [THEN Nat.induct])
berghofe@22262
    74
  apply (iprover elim: Abs_Nat_inverse' [THEN subst])
berghofe@13449
    75
  done
berghofe@13449
    76
berghofe@13449
    77
text {* Distinctness of constructors *}
berghofe@13449
    78
paulson@14267
    79
lemma Suc_not_Zero [iff]: "Suc m \<noteq> 0"
berghofe@22262
    80
  by (simp add: Zero_nat_def Suc_def Abs_Nat_inject Rep_Nat' Suc_RepI Zero_RepI
paulson@15413
    81
                Suc_Rep_not_Zero_Rep) 
berghofe@13449
    82
paulson@14267
    83
lemma Zero_not_Suc [iff]: "0 \<noteq> Suc m"
berghofe@13449
    84
  by (rule not_sym, rule Suc_not_Zero not_sym)
berghofe@13449
    85
berghofe@13449
    86
lemma Suc_neq_Zero: "Suc m = 0 ==> R"
berghofe@13449
    87
  by (rule notE, rule Suc_not_Zero)
berghofe@13449
    88
berghofe@13449
    89
lemma Zero_neq_Suc: "0 = Suc m ==> R"
berghofe@13449
    90
  by (rule Suc_neq_Zero, erule sym)
berghofe@13449
    91
berghofe@13449
    92
text {* Injectiveness of @{term Suc} *}
berghofe@13449
    93
nipkow@16733
    94
lemma inj_Suc[simp]: "inj_on Suc N"
berghofe@22262
    95
  by (simp add: Suc_def inj_on_def Abs_Nat_inject Rep_Nat' Suc_RepI 
paulson@15413
    96
                inj_Suc_Rep [THEN inj_eq] Rep_Nat_inject) 
berghofe@13449
    97
berghofe@13449
    98
lemma Suc_inject: "Suc x = Suc y ==> x = y"
berghofe@13449
    99
  by (rule inj_Suc [THEN injD])
berghofe@13449
   100
berghofe@13449
   101
lemma Suc_Suc_eq [iff]: "(Suc m = Suc n) = (m = n)"
paulson@15413
   102
  by (rule inj_Suc [THEN inj_eq])
berghofe@13449
   103
paulson@14267
   104
lemma nat_not_singleton: "(\<forall>x. x = (0::nat)) = False"
berghofe@13449
   105
  by auto
berghofe@13449
   106
haftmann@21411
   107
text {* size of a datatype value *}
wenzelm@21243
   108
haftmann@21411
   109
class size =
haftmann@21411
   110
  fixes size :: "'a \<Rightarrow> nat"
wenzelm@21243
   111
berghofe@13449
   112
text {* @{typ nat} is a datatype *}
wenzelm@9436
   113
berghofe@5188
   114
rep_datatype nat
berghofe@13449
   115
  distinct  Suc_not_Zero Zero_not_Suc
berghofe@13449
   116
  inject    Suc_Suc_eq
haftmann@21411
   117
  induction nat_induct
haftmann@21411
   118
haftmann@21411
   119
declare nat.induct [case_names 0 Suc, induct type: nat]
haftmann@21411
   120
declare nat.exhaust [case_names 0 Suc, cases type: nat]
berghofe@13449
   121
wenzelm@21672
   122
lemmas nat_rec_0 = nat.recs(1)
wenzelm@21672
   123
  and nat_rec_Suc = nat.recs(2)
wenzelm@21672
   124
wenzelm@21672
   125
lemmas nat_case_0 = nat.cases(1)
wenzelm@21672
   126
  and nat_case_Suc = nat.cases(2)
wenzelm@21672
   127
wenzelm@21672
   128
paulson@14267
   129
lemma n_not_Suc_n: "n \<noteq> Suc n"
berghofe@13449
   130
  by (induct n) simp_all
berghofe@13449
   131
paulson@14267
   132
lemma Suc_n_not_n: "Suc t \<noteq> t"
berghofe@13449
   133
  by (rule not_sym, rule n_not_Suc_n)
berghofe@13449
   134
berghofe@13449
   135
text {* A special form of induction for reasoning
berghofe@13449
   136
  about @{term "m < n"} and @{term "m - n"} *}
berghofe@13449
   137
berghofe@13449
   138
theorem diff_induct: "(!!x. P x 0) ==> (!!y. P 0 (Suc y)) ==>
berghofe@13449
   139
    (!!x y. P x y ==> P (Suc x) (Suc y)) ==> P m n"
paulson@14208
   140
  apply (rule_tac x = m in spec)
paulson@15251
   141
  apply (induct n)
berghofe@13449
   142
  prefer 2
berghofe@13449
   143
  apply (rule allI)
nipkow@17589
   144
  apply (induct_tac x, iprover+)
berghofe@13449
   145
  done
berghofe@13449
   146
berghofe@13449
   147
subsection {* Basic properties of "less than" *}
berghofe@13449
   148
berghofe@13449
   149
lemma wf_pred_nat: "wf pred_nat"
paulson@14208
   150
  apply (unfold wf_def pred_nat_def, clarify)
paulson@14208
   151
  apply (induct_tac x, blast+)
berghofe@13449
   152
  done
berghofe@13449
   153
berghofe@13449
   154
lemma wf_less: "wf {(x, y::nat). x < y}"
berghofe@13449
   155
  apply (unfold less_def)
paulson@14208
   156
  apply (rule wf_pred_nat [THEN wf_trancl, THEN wf_subset], blast)
berghofe@13449
   157
  done
berghofe@13449
   158
berghofe@13449
   159
lemma less_eq: "((m, n) : pred_nat^+) = (m < n)"
berghofe@13449
   160
  apply (unfold less_def)
berghofe@13449
   161
  apply (rule refl)
berghofe@13449
   162
  done
berghofe@13449
   163
berghofe@13449
   164
subsubsection {* Introduction properties *}
berghofe@13449
   165
berghofe@13449
   166
lemma less_trans: "i < j ==> j < k ==> i < (k::nat)"
berghofe@13449
   167
  apply (unfold less_def)
paulson@14208
   168
  apply (rule trans_trancl [THEN transD], assumption+)
berghofe@13449
   169
  done
berghofe@13449
   170
berghofe@13449
   171
lemma lessI [iff]: "n < Suc n"
berghofe@13449
   172
  apply (unfold less_def pred_nat_def)
berghofe@13449
   173
  apply (simp add: r_into_trancl)
berghofe@13449
   174
  done
berghofe@13449
   175
berghofe@13449
   176
lemma less_SucI: "i < j ==> i < Suc j"
paulson@14208
   177
  apply (rule less_trans, assumption)
berghofe@13449
   178
  apply (rule lessI)
berghofe@13449
   179
  done
berghofe@13449
   180
berghofe@13449
   181
lemma zero_less_Suc [iff]: "0 < Suc n"
berghofe@13449
   182
  apply (induct n)
berghofe@13449
   183
  apply (rule lessI)
berghofe@13449
   184
  apply (erule less_trans)
berghofe@13449
   185
  apply (rule lessI)
berghofe@13449
   186
  done
berghofe@13449
   187
berghofe@13449
   188
subsubsection {* Elimination properties *}
berghofe@13449
   189
berghofe@13449
   190
lemma less_not_sym: "n < m ==> ~ m < (n::nat)"
berghofe@13449
   191
  apply (unfold less_def)
berghofe@13449
   192
  apply (blast intro: wf_pred_nat wf_trancl [THEN wf_asym])
berghofe@13449
   193
  done
berghofe@13449
   194
berghofe@13449
   195
lemma less_asym:
berghofe@13449
   196
  assumes h1: "(n::nat) < m" and h2: "~ P ==> m < n" shows P
berghofe@13449
   197
  apply (rule contrapos_np)
berghofe@13449
   198
  apply (rule less_not_sym)
berghofe@13449
   199
  apply (rule h1)
berghofe@13449
   200
  apply (erule h2)
berghofe@13449
   201
  done
berghofe@13449
   202
berghofe@13449
   203
lemma less_not_refl: "~ n < (n::nat)"
berghofe@13449
   204
  apply (unfold less_def)
berghofe@13449
   205
  apply (rule wf_pred_nat [THEN wf_trancl, THEN wf_not_refl])
berghofe@13449
   206
  done
berghofe@13449
   207
berghofe@13449
   208
lemma less_irrefl [elim!]: "(n::nat) < n ==> R"
berghofe@13449
   209
  by (rule notE, rule less_not_refl)
berghofe@13449
   210
paulson@14267
   211
lemma less_not_refl2: "n < m ==> m \<noteq> (n::nat)" by blast
berghofe@13449
   212
paulson@14267
   213
lemma less_not_refl3: "(s::nat) < t ==> s \<noteq> t"
berghofe@13449
   214
  by (rule not_sym, rule less_not_refl2)
berghofe@13449
   215
berghofe@13449
   216
lemma lessE:
berghofe@13449
   217
  assumes major: "i < k"
berghofe@13449
   218
  and p1: "k = Suc i ==> P" and p2: "!!j. i < j ==> k = Suc j ==> P"
berghofe@13449
   219
  shows P
paulson@14208
   220
  apply (rule major [unfolded less_def pred_nat_def, THEN tranclE], simp_all)
berghofe@13449
   221
  apply (erule p1)
berghofe@13449
   222
  apply (rule p2)
paulson@14208
   223
  apply (simp add: less_def pred_nat_def, assumption)
berghofe@13449
   224
  done
berghofe@13449
   225
berghofe@13449
   226
lemma not_less0 [iff]: "~ n < (0::nat)"
berghofe@13449
   227
  by (blast elim: lessE)
berghofe@13449
   228
berghofe@13449
   229
lemma less_zeroE: "(n::nat) < 0 ==> R"
berghofe@13449
   230
  by (rule notE, rule not_less0)
berghofe@13449
   231
berghofe@13449
   232
lemma less_SucE: assumes major: "m < Suc n"
berghofe@13449
   233
  and less: "m < n ==> P" and eq: "m = n ==> P" shows P
berghofe@13449
   234
  apply (rule major [THEN lessE])
paulson@14208
   235
  apply (rule eq, blast)
paulson@14208
   236
  apply (rule less, blast)
berghofe@13449
   237
  done
berghofe@13449
   238
berghofe@13449
   239
lemma less_Suc_eq: "(m < Suc n) = (m < n | m = n)"
berghofe@13449
   240
  by (blast elim!: less_SucE intro: less_trans)
berghofe@13449
   241
berghofe@13449
   242
lemma less_one [iff]: "(n < (1::nat)) = (n = 0)"
berghofe@13449
   243
  by (simp add: less_Suc_eq)
berghofe@13449
   244
berghofe@13449
   245
lemma less_Suc0 [iff]: "(n < Suc 0) = (n = 0)"
berghofe@13449
   246
  by (simp add: less_Suc_eq)
berghofe@13449
   247
berghofe@13449
   248
lemma Suc_mono: "m < n ==> Suc m < Suc n"
berghofe@13449
   249
  by (induct n) (fast elim: less_trans lessE)+
berghofe@13449
   250
berghofe@13449
   251
text {* "Less than" is a linear ordering *}
berghofe@13449
   252
lemma less_linear: "m < n | m = n | n < (m::nat)"
paulson@15251
   253
  apply (induct m)
paulson@15251
   254
  apply (induct n)
berghofe@13449
   255
  apply (rule refl [THEN disjI1, THEN disjI2])
berghofe@13449
   256
  apply (rule zero_less_Suc [THEN disjI1])
berghofe@13449
   257
  apply (blast intro: Suc_mono less_SucI elim: lessE)
berghofe@13449
   258
  done
berghofe@13449
   259
nipkow@14302
   260
text {* "Less than" is antisymmetric, sort of *}
nipkow@14302
   261
lemma less_antisym: "\<lbrakk> \<not> n < m; n < Suc m \<rbrakk> \<Longrightarrow> m = n"
nipkow@14302
   262
apply(simp only:less_Suc_eq)
nipkow@14302
   263
apply blast
nipkow@14302
   264
done
nipkow@14302
   265
paulson@14267
   266
lemma nat_neq_iff: "((m::nat) \<noteq> n) = (m < n | n < m)"
berghofe@13449
   267
  using less_linear by blast
berghofe@13449
   268
berghofe@13449
   269
lemma nat_less_cases: assumes major: "(m::nat) < n ==> P n m"
berghofe@13449
   270
  and eqCase: "m = n ==> P n m" and lessCase: "n<m ==> P n m"
berghofe@13449
   271
  shows "P n m"
berghofe@13449
   272
  apply (rule less_linear [THEN disjE])
berghofe@13449
   273
  apply (erule_tac [2] disjE)
berghofe@13449
   274
  apply (erule lessCase)
berghofe@13449
   275
  apply (erule sym [THEN eqCase])
berghofe@13449
   276
  apply (erule major)
berghofe@13449
   277
  done
berghofe@13449
   278
berghofe@13449
   279
berghofe@13449
   280
subsubsection {* Inductive (?) properties *}
berghofe@13449
   281
paulson@14267
   282
lemma Suc_lessI: "m < n ==> Suc m \<noteq> n ==> Suc m < n"
berghofe@13449
   283
  apply (simp add: nat_neq_iff)
berghofe@13449
   284
  apply (blast elim!: less_irrefl less_SucE elim: less_asym)
berghofe@13449
   285
  done
berghofe@13449
   286
berghofe@13449
   287
lemma Suc_lessD: "Suc m < n ==> m < n"
berghofe@13449
   288
  apply (induct n)
berghofe@13449
   289
  apply (fast intro!: lessI [THEN less_SucI] elim: less_trans lessE)+
berghofe@13449
   290
  done
berghofe@13449
   291
berghofe@13449
   292
lemma Suc_lessE: assumes major: "Suc i < k"
berghofe@13449
   293
  and minor: "!!j. i < j ==> k = Suc j ==> P" shows P
berghofe@13449
   294
  apply (rule major [THEN lessE])
berghofe@13449
   295
  apply (erule lessI [THEN minor])
paulson@14208
   296
  apply (erule Suc_lessD [THEN minor], assumption)
berghofe@13449
   297
  done
berghofe@13449
   298
berghofe@13449
   299
lemma Suc_less_SucD: "Suc m < Suc n ==> m < n"
berghofe@13449
   300
  by (blast elim: lessE dest: Suc_lessD)
wenzelm@4104
   301
berghofe@16635
   302
lemma Suc_less_eq [iff, code]: "(Suc m < Suc n) = (m < n)"
berghofe@13449
   303
  apply (rule iffI)
berghofe@13449
   304
  apply (erule Suc_less_SucD)
berghofe@13449
   305
  apply (erule Suc_mono)
berghofe@13449
   306
  done
berghofe@13449
   307
berghofe@13449
   308
lemma less_trans_Suc:
berghofe@13449
   309
  assumes le: "i < j" shows "j < k ==> Suc i < k"
paulson@14208
   310
  apply (induct k, simp_all)
berghofe@13449
   311
  apply (insert le)
berghofe@13449
   312
  apply (simp add: less_Suc_eq)
berghofe@13449
   313
  apply (blast dest: Suc_lessD)
berghofe@13449
   314
  done
berghofe@13449
   315
berghofe@16635
   316
lemma [code]: "((n::nat) < 0) = False" by simp
berghofe@16635
   317
lemma [code]: "(0 < Suc n) = True" by simp
berghofe@16635
   318
berghofe@13449
   319
text {* Can be used with @{text less_Suc_eq} to get @{term "n = m | n < m"} *}
berghofe@13449
   320
lemma not_less_eq: "(~ m < n) = (n < Suc m)"
paulson@14208
   321
by (rule_tac m = m and n = n in diff_induct, simp_all)
berghofe@13449
   322
berghofe@13449
   323
text {* Complete induction, aka course-of-values induction *}
berghofe@13449
   324
lemma nat_less_induct:
paulson@14267
   325
  assumes prem: "!!n. \<forall>m::nat. m < n --> P m ==> P n" shows "P n"
berghofe@13449
   326
  apply (rule_tac a=n in wf_induct)
berghofe@13449
   327
  apply (rule wf_pred_nat [THEN wf_trancl])
berghofe@13449
   328
  apply (rule prem)
paulson@14208
   329
  apply (unfold less_def, assumption)
berghofe@13449
   330
  done
berghofe@13449
   331
paulson@14131
   332
lemmas less_induct = nat_less_induct [rule_format, case_names less]
paulson@14131
   333
wenzelm@21243
   334
paulson@14131
   335
subsection {* Properties of "less than or equal" *}
berghofe@13449
   336
berghofe@13449
   337
text {* Was @{text le_eq_less_Suc}, but this orientation is more useful *}
paulson@14267
   338
lemma less_Suc_eq_le: "(m < Suc n) = (m \<le> n)"
berghofe@13449
   339
  by (unfold le_def, rule not_less_eq [symmetric])
berghofe@13449
   340
paulson@14267
   341
lemma le_imp_less_Suc: "m \<le> n ==> m < Suc n"
berghofe@13449
   342
  by (rule less_Suc_eq_le [THEN iffD2])
berghofe@13449
   343
paulson@14267
   344
lemma le0 [iff]: "(0::nat) \<le> n"
berghofe@13449
   345
  by (unfold le_def, rule not_less0)
berghofe@13449
   346
paulson@14267
   347
lemma Suc_n_not_le_n: "~ Suc n \<le> n"
berghofe@13449
   348
  by (simp add: le_def)
berghofe@13449
   349
paulson@14267
   350
lemma le_0_eq [iff]: "((i::nat) \<le> 0) = (i = 0)"
berghofe@13449
   351
  by (induct i) (simp_all add: le_def)
berghofe@13449
   352
paulson@14267
   353
lemma le_Suc_eq: "(m \<le> Suc n) = (m \<le> n | m = Suc n)"
berghofe@13449
   354
  by (simp del: less_Suc_eq_le add: less_Suc_eq_le [symmetric] less_Suc_eq)
berghofe@13449
   355
paulson@14267
   356
lemma le_SucE: "m \<le> Suc n ==> (m \<le> n ==> R) ==> (m = Suc n ==> R) ==> R"
nipkow@17589
   357
  by (drule le_Suc_eq [THEN iffD1], iprover+)
berghofe@13449
   358
paulson@14267
   359
lemma Suc_leI: "m < n ==> Suc(m) \<le> n"
berghofe@13449
   360
  apply (simp add: le_def less_Suc_eq)
berghofe@13449
   361
  apply (blast elim!: less_irrefl less_asym)
berghofe@13449
   362
  done -- {* formerly called lessD *}
berghofe@13449
   363
paulson@14267
   364
lemma Suc_leD: "Suc(m) \<le> n ==> m \<le> n"
berghofe@13449
   365
  by (simp add: le_def less_Suc_eq)
berghofe@13449
   366
berghofe@13449
   367
text {* Stronger version of @{text Suc_leD} *}
paulson@14267
   368
lemma Suc_le_lessD: "Suc m \<le> n ==> m < n"
berghofe@13449
   369
  apply (simp add: le_def less_Suc_eq)
berghofe@13449
   370
  using less_linear
berghofe@13449
   371
  apply blast
berghofe@13449
   372
  done
berghofe@13449
   373
paulson@14267
   374
lemma Suc_le_eq: "(Suc m \<le> n) = (m < n)"
berghofe@13449
   375
  by (blast intro: Suc_leI Suc_le_lessD)
berghofe@13449
   376
paulson@14267
   377
lemma le_SucI: "m \<le> n ==> m \<le> Suc n"
berghofe@13449
   378
  by (unfold le_def) (blast dest: Suc_lessD)
berghofe@13449
   379
paulson@14267
   380
lemma less_imp_le: "m < n ==> m \<le> (n::nat)"
berghofe@13449
   381
  by (unfold le_def) (blast elim: less_asym)
berghofe@13449
   382
paulson@14267
   383
text {* For instance, @{text "(Suc m < Suc n) = (Suc m \<le> n) = (m < n)"} *}
berghofe@13449
   384
lemmas le_simps = less_imp_le less_Suc_eq_le Suc_le_eq
berghofe@13449
   385
berghofe@13449
   386
paulson@14267
   387
text {* Equivalence of @{term "m \<le> n"} and @{term "m < n | m = n"} *}
berghofe@13449
   388
paulson@14267
   389
lemma le_imp_less_or_eq: "m \<le> n ==> m < n | m = (n::nat)"
berghofe@13449
   390
  apply (unfold le_def)
berghofe@13449
   391
  using less_linear
berghofe@13449
   392
  apply (blast elim: less_irrefl less_asym)
berghofe@13449
   393
  done
berghofe@13449
   394
paulson@14267
   395
lemma less_or_eq_imp_le: "m < n | m = n ==> m \<le> (n::nat)"
berghofe@13449
   396
  apply (unfold le_def)
berghofe@13449
   397
  using less_linear
berghofe@13449
   398
  apply (blast elim!: less_irrefl elim: less_asym)
berghofe@13449
   399
  done
berghofe@13449
   400
paulson@14267
   401
lemma le_eq_less_or_eq: "(m \<le> (n::nat)) = (m < n | m=n)"
nipkow@17589
   402
  by (iprover intro: less_or_eq_imp_le le_imp_less_or_eq)
berghofe@13449
   403
berghofe@13449
   404
text {* Useful with @{text Blast}. *}
paulson@14267
   405
lemma eq_imp_le: "(m::nat) = n ==> m \<le> n"
berghofe@13449
   406
  by (rule less_or_eq_imp_le, rule disjI2)
berghofe@13449
   407
paulson@14267
   408
lemma le_refl: "n \<le> (n::nat)"
berghofe@13449
   409
  by (simp add: le_eq_less_or_eq)
berghofe@13449
   410
paulson@14267
   411
lemma le_less_trans: "[| i \<le> j; j < k |] ==> i < (k::nat)"
berghofe@13449
   412
  by (blast dest!: le_imp_less_or_eq intro: less_trans)
berghofe@13449
   413
paulson@14267
   414
lemma less_le_trans: "[| i < j; j \<le> k |] ==> i < (k::nat)"
berghofe@13449
   415
  by (blast dest!: le_imp_less_or_eq intro: less_trans)
berghofe@13449
   416
paulson@14267
   417
lemma le_trans: "[| i \<le> j; j \<le> k |] ==> i \<le> (k::nat)"
berghofe@13449
   418
  by (blast dest!: le_imp_less_or_eq intro: less_or_eq_imp_le less_trans)
berghofe@13449
   419
paulson@14267
   420
lemma le_anti_sym: "[| m \<le> n; n \<le> m |] ==> m = (n::nat)"
berghofe@13449
   421
  by (blast dest!: le_imp_less_or_eq elim!: less_irrefl elim: less_asym)
berghofe@13449
   422
paulson@14267
   423
lemma Suc_le_mono [iff]: "(Suc n \<le> Suc m) = (n \<le> m)"
berghofe@13449
   424
  by (simp add: le_simps)
berghofe@13449
   425
berghofe@13449
   426
text {* Axiom @{text order_less_le} of class @{text order}: *}
paulson@14267
   427
lemma nat_less_le: "((m::nat) < n) = (m \<le> n & m \<noteq> n)"
berghofe@13449
   428
  by (simp add: le_def nat_neq_iff) (blast elim!: less_asym)
berghofe@13449
   429
paulson@14267
   430
lemma le_neq_implies_less: "(m::nat) \<le> n ==> m \<noteq> n ==> m < n"
berghofe@13449
   431
  by (rule iffD2, rule nat_less_le, rule conjI)
berghofe@13449
   432
berghofe@13449
   433
text {* Axiom @{text linorder_linear} of class @{text linorder}: *}
paulson@14267
   434
lemma nat_le_linear: "(m::nat) \<le> n | n \<le> m"
berghofe@13449
   435
  apply (simp add: le_eq_less_or_eq)
berghofe@13449
   436
  using less_linear
berghofe@13449
   437
  apply blast
berghofe@13449
   438
  done
berghofe@13449
   439
paulson@14341
   440
text {* Type {@typ nat} is a wellfounded linear order *}
paulson@14341
   441
wenzelm@14691
   442
instance nat :: "{order, linorder, wellorder}"
wenzelm@14691
   443
  by intro_classes
wenzelm@14691
   444
    (assumption |
wenzelm@14691
   445
      rule le_refl le_trans le_anti_sym nat_less_le nat_le_linear wf_less)+
paulson@14341
   446
nipkow@15921
   447
lemmas linorder_neqE_nat = linorder_neqE[where 'a = nat]
nipkow@15921
   448
berghofe@13449
   449
lemma not_less_less_Suc_eq: "~ n < m ==> (n < Suc m) = (n = m)"
berghofe@13449
   450
  by (blast elim!: less_SucE)
berghofe@13449
   451
berghofe@13449
   452
text {*
berghofe@13449
   453
  Rewrite @{term "n < Suc m"} to @{term "n = m"}
paulson@14267
   454
  if @{term "~ n < m"} or @{term "m \<le> n"} hold.
berghofe@13449
   455
  Not suitable as default simprules because they often lead to looping
berghofe@13449
   456
*}
paulson@14267
   457
lemma le_less_Suc_eq: "m \<le> n ==> (n < Suc m) = (n = m)"
berghofe@13449
   458
  by (rule not_less_less_Suc_eq, rule leD)
berghofe@13449
   459
berghofe@13449
   460
lemmas not_less_simps = not_less_less_Suc_eq le_less_Suc_eq
berghofe@13449
   461
berghofe@13449
   462
berghofe@13449
   463
text {*
berghofe@13449
   464
  Re-orientation of the equations @{text "0 = x"} and @{text "1 = x"}. 
berghofe@13449
   465
  No longer added as simprules (they loop) 
berghofe@13449
   466
  but via @{text reorient_simproc} in Bin
berghofe@13449
   467
*}
berghofe@13449
   468
berghofe@13449
   469
text {* Polymorphic, not just for @{typ nat} *}
berghofe@13449
   470
lemma zero_reorient: "(0 = x) = (x = 0)"
berghofe@13449
   471
  by auto
berghofe@13449
   472
berghofe@13449
   473
lemma one_reorient: "(1 = x) = (x = 1)"
berghofe@13449
   474
  by auto
berghofe@13449
   475
wenzelm@21243
   476
berghofe@13449
   477
subsection {* Arithmetic operators *}
oheimb@1660
   478
haftmann@21411
   479
class power =
haftmann@21411
   480
  fixes power :: "'a \<Rightarrow> nat \<Rightarrow> 'a"            (infixr "\<^loc>^" 80)
wenzelm@9436
   481
berghofe@13449
   482
text {* arithmetic operators @{text "+ -"} and @{text "*"} *}
berghofe@13449
   483
haftmann@21456
   484
instance nat :: "{plus, minus, times}" ..
wenzelm@9436
   485
berghofe@13449
   486
primrec
berghofe@13449
   487
  add_0:    "0 + n = n"
berghofe@13449
   488
  add_Suc:  "Suc m + n = Suc (m + n)"
berghofe@13449
   489
berghofe@13449
   490
primrec
berghofe@13449
   491
  diff_0:   "m - 0 = m"
berghofe@13449
   492
  diff_Suc: "m - Suc n = (case m - n of 0 => 0 | Suc k => k)"
wenzelm@9436
   493
wenzelm@9436
   494
primrec
berghofe@13449
   495
  mult_0:   "0 * n = 0"
berghofe@13449
   496
  mult_Suc: "Suc m * n = n + (m * n)"
berghofe@13449
   497
paulson@14341
   498
text {* These two rules ease the use of primitive recursion. 
paulson@14341
   499
NOTE USE OF @{text "=="} *}
berghofe@13449
   500
lemma def_nat_rec_0: "(!!n. f n == nat_rec c h n) ==> f 0 = c"
berghofe@13449
   501
  by simp
berghofe@13449
   502
berghofe@13449
   503
lemma def_nat_rec_Suc: "(!!n. f n == nat_rec c h n) ==> f (Suc n) = h n (f n)"
berghofe@13449
   504
  by simp
berghofe@13449
   505
paulson@14267
   506
lemma not0_implies_Suc: "n \<noteq> 0 ==> \<exists>m. n = Suc m"
berghofe@13449
   507
  by (case_tac n) simp_all
berghofe@13449
   508
paulson@14267
   509
lemma gr_implies_not0: "!!n::nat. m<n ==> n \<noteq> 0"
berghofe@13449
   510
  by (case_tac n) simp_all
berghofe@13449
   511
paulson@14267
   512
lemma neq0_conv [iff]: "!!n::nat. (n \<noteq> 0) = (0 < n)"
berghofe@13449
   513
  by (case_tac n) simp_all
berghofe@13449
   514
berghofe@13449
   515
text {* This theorem is useful with @{text blast} *}
berghofe@13449
   516
lemma gr0I: "((n::nat) = 0 ==> False) ==> 0 < n"
nipkow@17589
   517
  by (rule iffD1, rule neq0_conv, iprover)
berghofe@13449
   518
paulson@14267
   519
lemma gr0_conv_Suc: "(0 < n) = (\<exists>m. n = Suc m)"
berghofe@13449
   520
  by (fast intro: not0_implies_Suc)
berghofe@13449
   521
berghofe@13449
   522
lemma not_gr0 [iff]: "!!n::nat. (~ (0 < n)) = (n = 0)"
berghofe@13449
   523
  apply (rule iffI)
paulson@14208
   524
  apply (rule ccontr, simp_all)
berghofe@13449
   525
  done
berghofe@13449
   526
paulson@14267
   527
lemma Suc_le_D: "(Suc n \<le> m') ==> (? m. m' = Suc m)"
berghofe@13449
   528
  by (induct m') simp_all
berghofe@13449
   529
berghofe@13449
   530
text {* Useful in certain inductive arguments *}
paulson@14267
   531
lemma less_Suc_eq_0_disj: "(m < Suc n) = (m = 0 | (\<exists>j. m = Suc j & j < n))"
berghofe@13449
   532
  by (case_tac m) simp_all
berghofe@13449
   533
paulson@14341
   534
lemma nat_induct2: "[|P 0; P (Suc 0); !!k. P k ==> P (Suc (Suc k))|] ==> P n"
berghofe@13449
   535
  apply (rule nat_less_induct)
berghofe@13449
   536
  apply (case_tac n)
berghofe@13449
   537
  apply (case_tac [2] nat)
berghofe@13449
   538
  apply (blast intro: less_trans)+
berghofe@13449
   539
  done
berghofe@13449
   540
wenzelm@21243
   541
paulson@15341
   542
subsection {* @{text LEAST} theorems for type @{typ nat}*}
berghofe@13449
   543
paulson@14267
   544
lemma Least_Suc:
paulson@14267
   545
     "[| P n; ~ P 0 |] ==> (LEAST n. P n) = Suc (LEAST m. P(Suc m))"
paulson@14208
   546
  apply (case_tac "n", auto)
berghofe@13449
   547
  apply (frule LeastI)
berghofe@13449
   548
  apply (drule_tac P = "%x. P (Suc x) " in LeastI)
paulson@14267
   549
  apply (subgoal_tac " (LEAST x. P x) \<le> Suc (LEAST x. P (Suc x))")
berghofe@13449
   550
  apply (erule_tac [2] Least_le)
paulson@14208
   551
  apply (case_tac "LEAST x. P x", auto)
berghofe@13449
   552
  apply (drule_tac P = "%x. P (Suc x) " in Least_le)
berghofe@13449
   553
  apply (blast intro: order_antisym)
berghofe@13449
   554
  done
berghofe@13449
   555
paulson@14267
   556
lemma Least_Suc2:
paulson@14267
   557
     "[|P n; Q m; ~P 0; !k. P (Suc k) = Q k|] ==> Least P = Suc (Least Q)"
paulson@14267
   558
  by (erule (1) Least_Suc [THEN ssubst], simp)
berghofe@13449
   559
berghofe@13449
   560
berghofe@13449
   561
subsection {* @{term min} and @{term max} *}
berghofe@13449
   562
berghofe@13449
   563
lemma min_0L [simp]: "min 0 n = (0::nat)"
berghofe@13449
   564
  by (rule min_leastL) simp
berghofe@13449
   565
berghofe@13449
   566
lemma min_0R [simp]: "min n 0 = (0::nat)"
berghofe@13449
   567
  by (rule min_leastR) simp
berghofe@13449
   568
berghofe@13449
   569
lemma min_Suc_Suc [simp]: "min (Suc m) (Suc n) = Suc (min m n)"
berghofe@13449
   570
  by (simp add: min_of_mono)
berghofe@13449
   571
paulson@22191
   572
lemma min_Suc1:
paulson@22191
   573
   "min (Suc n) m = (case m of 0 => 0 | Suc m' => Suc(min n m'))"
paulson@22191
   574
  by (simp split: nat.split) 
paulson@22191
   575
paulson@22191
   576
lemma min_Suc2:
paulson@22191
   577
   "min m (Suc n) = (case m of 0 => 0 | Suc m' => Suc(min m' n))"
paulson@22191
   578
  by (simp split: nat.split)
paulson@22191
   579
berghofe@13449
   580
lemma max_0L [simp]: "max 0 n = (n::nat)"
berghofe@13449
   581
  by (rule max_leastL) simp
berghofe@13449
   582
berghofe@13449
   583
lemma max_0R [simp]: "max n 0 = (n::nat)"
berghofe@13449
   584
  by (rule max_leastR) simp
berghofe@13449
   585
berghofe@13449
   586
lemma max_Suc_Suc [simp]: "max (Suc m) (Suc n) = Suc(max m n)"
berghofe@13449
   587
  by (simp add: max_of_mono)
berghofe@13449
   588
paulson@22191
   589
lemma max_Suc1:
paulson@22191
   590
   "max (Suc n) m = (case m of 0 => Suc n | Suc m' => Suc(max n m'))"
paulson@22191
   591
  by (simp split: nat.split) 
paulson@22191
   592
paulson@22191
   593
lemma max_Suc2:
paulson@22191
   594
   "max m (Suc n) = (case m of 0 => Suc n | Suc m' => Suc(max m' n))"
paulson@22191
   595
  by (simp split: nat.split)
paulson@22191
   596
berghofe@13449
   597
berghofe@13449
   598
subsection {* Basic rewrite rules for the arithmetic operators *}
berghofe@13449
   599
berghofe@13449
   600
text {* Difference *}
berghofe@13449
   601
berghofe@14193
   602
lemma diff_0_eq_0 [simp, code]: "0 - n = (0::nat)"
paulson@15251
   603
  by (induct n) simp_all
berghofe@13449
   604
berghofe@14193
   605
lemma diff_Suc_Suc [simp, code]: "Suc(m) - Suc(n) = m - n"
paulson@15251
   606
  by (induct n) simp_all
berghofe@13449
   607
berghofe@13449
   608
berghofe@13449
   609
text {*
berghofe@13449
   610
  Could be (and is, below) generalized in various ways
berghofe@13449
   611
  However, none of the generalizations are currently in the simpset,
berghofe@13449
   612
  and I dread to think what happens if I put them in
berghofe@13449
   613
*}
berghofe@13449
   614
lemma Suc_pred [simp]: "0 < n ==> Suc (n - Suc 0) = n"
berghofe@13449
   615
  by (simp split add: nat.split)
berghofe@13449
   616
berghofe@14193
   617
declare diff_Suc [simp del, code del]
berghofe@13449
   618
berghofe@13449
   619
berghofe@13449
   620
subsection {* Addition *}
berghofe@13449
   621
berghofe@13449
   622
lemma add_0_right [simp]: "m + 0 = (m::nat)"
berghofe@13449
   623
  by (induct m) simp_all
berghofe@13449
   624
berghofe@13449
   625
lemma add_Suc_right [simp]: "m + Suc n = Suc (m + n)"
berghofe@13449
   626
  by (induct m) simp_all
berghofe@13449
   627
haftmann@19890
   628
lemma add_Suc_shift [code]: "Suc m + n = m + Suc n"
haftmann@19890
   629
  by simp
berghofe@14193
   630
berghofe@13449
   631
berghofe@13449
   632
text {* Associative law for addition *}
paulson@14267
   633
lemma nat_add_assoc: "(m + n) + k = m + ((n + k)::nat)"
berghofe@13449
   634
  by (induct m) simp_all
berghofe@13449
   635
berghofe@13449
   636
text {* Commutative law for addition *}
paulson@14267
   637
lemma nat_add_commute: "m + n = n + (m::nat)"
berghofe@13449
   638
  by (induct m) simp_all
berghofe@13449
   639
paulson@14267
   640
lemma nat_add_left_commute: "x + (y + z) = y + ((x + z)::nat)"
berghofe@13449
   641
  apply (rule mk_left_commute [of "op +"])
paulson@14267
   642
  apply (rule nat_add_assoc)
paulson@14267
   643
  apply (rule nat_add_commute)
berghofe@13449
   644
  done
berghofe@13449
   645
paulson@14331
   646
lemma nat_add_left_cancel [simp]: "(k + m = k + n) = (m = (n::nat))"
berghofe@13449
   647
  by (induct k) simp_all
berghofe@13449
   648
paulson@14331
   649
lemma nat_add_right_cancel [simp]: "(m + k = n + k) = (m=(n::nat))"
berghofe@13449
   650
  by (induct k) simp_all
berghofe@13449
   651
paulson@14331
   652
lemma nat_add_left_cancel_le [simp]: "(k + m \<le> k + n) = (m\<le>(n::nat))"
berghofe@13449
   653
  by (induct k) simp_all
berghofe@13449
   654
paulson@14331
   655
lemma nat_add_left_cancel_less [simp]: "(k + m < k + n) = (m<(n::nat))"
berghofe@13449
   656
  by (induct k) simp_all
berghofe@13449
   657
berghofe@13449
   658
text {* Reasoning about @{text "m + 0 = 0"}, etc. *}
berghofe@13449
   659
berghofe@13449
   660
lemma add_is_0 [iff]: "!!m::nat. (m + n = 0) = (m = 0 & n = 0)"
berghofe@13449
   661
  by (case_tac m) simp_all
berghofe@13449
   662
berghofe@13449
   663
lemma add_is_1: "(m+n= Suc 0) = (m= Suc 0 & n=0 | m=0 & n= Suc 0)"
berghofe@13449
   664
  by (case_tac m) simp_all
berghofe@13449
   665
berghofe@13449
   666
lemma one_is_add: "(Suc 0 = m + n) = (m = Suc 0 & n = 0 | m = 0 & n = Suc 0)"
berghofe@13449
   667
  by (rule trans, rule eq_commute, rule add_is_1)
berghofe@13449
   668
berghofe@13449
   669
lemma add_gr_0 [iff]: "!!m::nat. (0 < m + n) = (0 < m | 0 < n)"
berghofe@13449
   670
  by (simp del: neq0_conv add: neq0_conv [symmetric])
berghofe@13449
   671
berghofe@13449
   672
lemma add_eq_self_zero: "!!m::nat. m + n = m ==> n = 0"
berghofe@13449
   673
  apply (drule add_0_right [THEN ssubst])
paulson@14267
   674
  apply (simp add: nat_add_assoc del: add_0_right)
berghofe@13449
   675
  done
berghofe@13449
   676
paulson@14267
   677
nipkow@16733
   678
lemma inj_on_add_nat[simp]: "inj_on (%n::nat. n+k) N"
nipkow@16733
   679
apply(induct k)
nipkow@16733
   680
 apply simp
nipkow@16733
   681
apply(drule comp_inj_on[OF _ inj_Suc])
nipkow@16733
   682
apply (simp add:o_def)
nipkow@16733
   683
done
nipkow@16733
   684
nipkow@16733
   685
paulson@14267
   686
subsection {* Multiplication *}
paulson@14267
   687
paulson@14267
   688
text {* right annihilation in product *}
paulson@14267
   689
lemma mult_0_right [simp]: "(m::nat) * 0 = 0"
paulson@14267
   690
  by (induct m) simp_all
paulson@14267
   691
paulson@14267
   692
text {* right successor law for multiplication *}
paulson@14267
   693
lemma mult_Suc_right [simp]: "m * Suc n = m + (m * n)"
paulson@14267
   694
  by (induct m) (simp_all add: nat_add_left_commute)
paulson@14267
   695
paulson@14267
   696
text {* Commutative law for multiplication *}
paulson@14267
   697
lemma nat_mult_commute: "m * n = n * (m::nat)"
paulson@14267
   698
  by (induct m) simp_all
paulson@14267
   699
paulson@14267
   700
text {* addition distributes over multiplication *}
paulson@14267
   701
lemma add_mult_distrib: "(m + n) * k = (m * k) + ((n * k)::nat)"
paulson@14267
   702
  by (induct m) (simp_all add: nat_add_assoc nat_add_left_commute)
paulson@14267
   703
paulson@14267
   704
lemma add_mult_distrib2: "k * (m + n) = (k * m) + ((k * n)::nat)"
paulson@14267
   705
  by (induct m) (simp_all add: nat_add_assoc)
paulson@14267
   706
paulson@14267
   707
text {* Associative law for multiplication *}
paulson@14267
   708
lemma nat_mult_assoc: "(m * n) * k = m * ((n * k)::nat)"
paulson@14267
   709
  by (induct m) (simp_all add: add_mult_distrib)
paulson@14267
   710
paulson@14267
   711
nipkow@14740
   712
text{*The naturals form a @{text comm_semiring_1_cancel}*}
obua@14738
   713
instance nat :: comm_semiring_1_cancel
paulson@14267
   714
proof
paulson@14267
   715
  fix i j k :: nat
paulson@14267
   716
  show "(i + j) + k = i + (j + k)" by (rule nat_add_assoc)
paulson@14267
   717
  show "i + j = j + i" by (rule nat_add_commute)
paulson@14267
   718
  show "0 + i = i" by simp
paulson@14267
   719
  show "(i * j) * k = i * (j * k)" by (rule nat_mult_assoc)
paulson@14267
   720
  show "i * j = j * i" by (rule nat_mult_commute)
paulson@14267
   721
  show "1 * i = i" by simp
paulson@14267
   722
  show "(i + j) * k = i * k + j * k" by (simp add: add_mult_distrib)
paulson@14267
   723
  show "0 \<noteq> (1::nat)" by simp
paulson@14341
   724
  assume "k+i = k+j" thus "i=j" by simp
paulson@14341
   725
qed
paulson@14341
   726
paulson@14341
   727
lemma mult_is_0 [simp]: "((m::nat) * n = 0) = (m=0 | n=0)"
paulson@15251
   728
  apply (induct m)
paulson@14341
   729
  apply (induct_tac [2] n, simp_all)
paulson@14341
   730
  done
paulson@14341
   731
wenzelm@21243
   732
paulson@14341
   733
subsection {* Monotonicity of Addition *}
paulson@14341
   734
paulson@14341
   735
text {* strict, in 1st argument *}
paulson@14341
   736
lemma add_less_mono1: "i < j ==> i + k < j + (k::nat)"
paulson@14341
   737
  by (induct k) simp_all
paulson@14341
   738
paulson@14341
   739
text {* strict, in both arguments *}
paulson@14341
   740
lemma add_less_mono: "[|i < j; k < l|] ==> i + k < j + (l::nat)"
paulson@14341
   741
  apply (rule add_less_mono1 [THEN less_trans], assumption+)
paulson@15251
   742
  apply (induct j, simp_all)
paulson@14341
   743
  done
paulson@14341
   744
paulson@14341
   745
text {* Deleted @{text less_natE}; use @{text "less_imp_Suc_add RS exE"} *}
paulson@14341
   746
lemma less_imp_Suc_add: "m < n ==> (\<exists>k. n = Suc (m + k))"
paulson@14341
   747
  apply (induct n)
paulson@14341
   748
  apply (simp_all add: order_le_less)
paulson@14341
   749
  apply (blast elim!: less_SucE 
paulson@14341
   750
               intro!: add_0_right [symmetric] add_Suc_right [symmetric])
paulson@14341
   751
  done
paulson@14341
   752
paulson@14341
   753
text {* strict, in 1st argument; proof is by induction on @{text "k > 0"} *}
paulson@14341
   754
lemma mult_less_mono2: "(i::nat) < j ==> 0 < k ==> k * i < k * j"
paulson@14341
   755
  apply (erule_tac m1 = 0 in less_imp_Suc_add [THEN exE], simp)
paulson@14341
   756
  apply (induct_tac x) 
paulson@14341
   757
  apply (simp_all add: add_less_mono)
paulson@14341
   758
  done
paulson@14341
   759
paulson@14341
   760
nipkow@14740
   761
text{*The naturals form an ordered @{text comm_semiring_1_cancel}*}
obua@14738
   762
instance nat :: ordered_semidom
paulson@14341
   763
proof
paulson@14341
   764
  fix i j k :: nat
paulson@14348
   765
  show "0 < (1::nat)" by simp
paulson@14267
   766
  show "i \<le> j ==> k + i \<le> k + j" by simp
paulson@14267
   767
  show "i < j ==> 0 < k ==> k * i < k * j" by (simp add: mult_less_mono2)
paulson@14267
   768
qed
paulson@14267
   769
paulson@14267
   770
lemma nat_mult_1: "(1::nat) * n = n"
paulson@14267
   771
  by simp
paulson@14267
   772
paulson@14267
   773
lemma nat_mult_1_right: "n * (1::nat) = n"
paulson@14267
   774
  by simp
paulson@14267
   775
paulson@14267
   776
paulson@14267
   777
subsection {* Additional theorems about "less than" *}
paulson@14267
   778
paulson@19870
   779
text{*An induction rule for estabilishing binary relations*}
paulson@19870
   780
lemma less_Suc_induct: 
paulson@19870
   781
  assumes less:  "i < j"
paulson@19870
   782
     and  step:  "!!i. P i (Suc i)"
paulson@19870
   783
     and  trans: "!!i j k. P i j ==> P j k ==> P i k"
paulson@19870
   784
  shows "P i j"
paulson@19870
   785
proof -
paulson@19870
   786
  from less obtain k where j: "j = Suc(i+k)" by (auto dest: less_imp_Suc_add) 
paulson@19870
   787
  have "P i (Suc(i+k))"
paulson@19870
   788
  proof (induct k)
paulson@19870
   789
    case 0 
paulson@19870
   790
    show ?case by (simp add: step) 
paulson@19870
   791
  next
paulson@19870
   792
    case (Suc k)
paulson@19870
   793
    thus ?case by (auto intro: prems)
paulson@19870
   794
  qed
paulson@19870
   795
  thus "P i j" by (simp add: j) 
paulson@19870
   796
qed
paulson@19870
   797
paulson@19870
   798
paulson@14267
   799
text {* A [clumsy] way of lifting @{text "<"}
paulson@14267
   800
  monotonicity to @{text "\<le>"} monotonicity *}
paulson@14267
   801
lemma less_mono_imp_le_mono:
paulson@14267
   802
  assumes lt_mono: "!!i j::nat. i < j ==> f i < f j"
paulson@14267
   803
  and le: "i \<le> j" shows "f i \<le> ((f j)::nat)" using le
paulson@14267
   804
  apply (simp add: order_le_less)
paulson@14267
   805
  apply (blast intro!: lt_mono)
paulson@14267
   806
  done
paulson@14267
   807
paulson@14267
   808
text {* non-strict, in 1st argument *}
paulson@14267
   809
lemma add_le_mono1: "i \<le> j ==> i + k \<le> j + (k::nat)"
paulson@14267
   810
  by (rule add_right_mono)
paulson@14267
   811
paulson@14267
   812
text {* non-strict, in both arguments *}
paulson@14267
   813
lemma add_le_mono: "[| i \<le> j;  k \<le> l |] ==> i + k \<le> j + (l::nat)"
paulson@14267
   814
  by (rule add_mono)
paulson@14267
   815
paulson@14267
   816
lemma le_add2: "n \<le> ((m + n)::nat)"
paulson@14341
   817
  by (insert add_right_mono [of 0 m n], simp) 
berghofe@13449
   818
paulson@14267
   819
lemma le_add1: "n \<le> ((n + m)::nat)"
paulson@14341
   820
  by (simp add: add_commute, rule le_add2)
berghofe@13449
   821
berghofe@13449
   822
lemma less_add_Suc1: "i < Suc (i + m)"
berghofe@13449
   823
  by (rule le_less_trans, rule le_add1, rule lessI)
berghofe@13449
   824
berghofe@13449
   825
lemma less_add_Suc2: "i < Suc (m + i)"
berghofe@13449
   826
  by (rule le_less_trans, rule le_add2, rule lessI)
berghofe@13449
   827
paulson@14267
   828
lemma less_iff_Suc_add: "(m < n) = (\<exists>k. n = Suc (m + k))"
nipkow@17589
   829
  by (iprover intro!: less_add_Suc1 less_imp_Suc_add)
berghofe@13449
   830
paulson@14267
   831
lemma trans_le_add1: "(i::nat) \<le> j ==> i \<le> j + m"
berghofe@13449
   832
  by (rule le_trans, assumption, rule le_add1)
berghofe@13449
   833
paulson@14267
   834
lemma trans_le_add2: "(i::nat) \<le> j ==> i \<le> m + j"
berghofe@13449
   835
  by (rule le_trans, assumption, rule le_add2)
berghofe@13449
   836
berghofe@13449
   837
lemma trans_less_add1: "(i::nat) < j ==> i < j + m"
berghofe@13449
   838
  by (rule less_le_trans, assumption, rule le_add1)
berghofe@13449
   839
berghofe@13449
   840
lemma trans_less_add2: "(i::nat) < j ==> i < m + j"
berghofe@13449
   841
  by (rule less_le_trans, assumption, rule le_add2)
berghofe@13449
   842
berghofe@13449
   843
lemma add_lessD1: "i + j < (k::nat) ==> i < k"
paulson@14341
   844
  apply (rule le_less_trans [of _ "i+j"]) 
paulson@14341
   845
  apply (simp_all add: le_add1)
berghofe@13449
   846
  done
berghofe@13449
   847
berghofe@13449
   848
lemma not_add_less1 [iff]: "~ (i + j < (i::nat))"
berghofe@13449
   849
  apply (rule notI)
berghofe@13449
   850
  apply (erule add_lessD1 [THEN less_irrefl])
berghofe@13449
   851
  done
berghofe@13449
   852
berghofe@13449
   853
lemma not_add_less2 [iff]: "~ (j + i < (i::nat))"
berghofe@13449
   854
  by (simp add: add_commute not_add_less1)
berghofe@13449
   855
paulson@14267
   856
lemma add_leD1: "m + k \<le> n ==> m \<le> (n::nat)"
paulson@14341
   857
  apply (rule order_trans [of _ "m+k"]) 
paulson@14341
   858
  apply (simp_all add: le_add1)
paulson@14341
   859
  done
berghofe@13449
   860
paulson@14267
   861
lemma add_leD2: "m + k \<le> n ==> k \<le> (n::nat)"
berghofe@13449
   862
  apply (simp add: add_commute)
berghofe@13449
   863
  apply (erule add_leD1)
berghofe@13449
   864
  done
berghofe@13449
   865
paulson@14267
   866
lemma add_leE: "(m::nat) + k \<le> n ==> (m \<le> n ==> k \<le> n ==> R) ==> R"
berghofe@13449
   867
  by (blast dest: add_leD1 add_leD2)
berghofe@13449
   868
berghofe@13449
   869
text {* needs @{text "!!k"} for @{text add_ac} to work *}
berghofe@13449
   870
lemma less_add_eq_less: "!!k::nat. k < l ==> m + l = k + n ==> m < n"
berghofe@13449
   871
  by (force simp del: add_Suc_right
berghofe@13449
   872
    simp add: less_iff_Suc_add add_Suc_right [symmetric] add_ac)
berghofe@13449
   873
berghofe@13449
   874
berghofe@13449
   875
subsection {* Difference *}
berghofe@13449
   876
berghofe@13449
   877
lemma diff_self_eq_0 [simp]: "(m::nat) - m = 0"
berghofe@13449
   878
  by (induct m) simp_all
berghofe@13449
   879
berghofe@13449
   880
text {* Addition is the inverse of subtraction:
paulson@14267
   881
  if @{term "n \<le> m"} then @{term "n + (m - n) = m"}. *}
berghofe@13449
   882
lemma add_diff_inverse: "~  m < n ==> n + (m - n) = (m::nat)"
berghofe@13449
   883
  by (induct m n rule: diff_induct) simp_all
berghofe@13449
   884
paulson@14267
   885
lemma le_add_diff_inverse [simp]: "n \<le> m ==> n + (m - n) = (m::nat)"
paulson@16796
   886
  by (simp add: add_diff_inverse linorder_not_less)
berghofe@13449
   887
paulson@14267
   888
lemma le_add_diff_inverse2 [simp]: "n \<le> m ==> (m - n) + n = (m::nat)"
berghofe@13449
   889
  by (simp add: le_add_diff_inverse add_commute)
berghofe@13449
   890
berghofe@13449
   891
berghofe@13449
   892
subsection {* More results about difference *}
berghofe@13449
   893
paulson@14267
   894
lemma Suc_diff_le: "n \<le> m ==> Suc m - n = Suc (m - n)"
berghofe@13449
   895
  by (induct m n rule: diff_induct) simp_all
berghofe@13449
   896
berghofe@13449
   897
lemma diff_less_Suc: "m - n < Suc m"
berghofe@13449
   898
  apply (induct m n rule: diff_induct)
berghofe@13449
   899
  apply (erule_tac [3] less_SucE)
berghofe@13449
   900
  apply (simp_all add: less_Suc_eq)
berghofe@13449
   901
  done
berghofe@13449
   902
paulson@14267
   903
lemma diff_le_self [simp]: "m - n \<le> (m::nat)"
berghofe@13449
   904
  by (induct m n rule: diff_induct) (simp_all add: le_SucI)
berghofe@13449
   905
berghofe@13449
   906
lemma less_imp_diff_less: "(j::nat) < k ==> j - n < k"
berghofe@13449
   907
  by (rule le_less_trans, rule diff_le_self)
berghofe@13449
   908
berghofe@13449
   909
lemma diff_diff_left: "(i::nat) - j - k = i - (j + k)"
berghofe@13449
   910
  by (induct i j rule: diff_induct) simp_all
berghofe@13449
   911
berghofe@13449
   912
lemma Suc_diff_diff [simp]: "(Suc m - n) - Suc k = m - n - k"
berghofe@13449
   913
  by (simp add: diff_diff_left)
berghofe@13449
   914
berghofe@13449
   915
lemma diff_Suc_less [simp]: "0<n ==> n - Suc i < n"
paulson@14208
   916
  apply (case_tac "n", safe)
berghofe@13449
   917
  apply (simp add: le_simps)
berghofe@13449
   918
  done
berghofe@13449
   919
berghofe@13449
   920
text {* This and the next few suggested by Florian Kammueller *}
berghofe@13449
   921
lemma diff_commute: "(i::nat) - j - k = i - k - j"
berghofe@13449
   922
  by (simp add: diff_diff_left add_commute)
berghofe@13449
   923
paulson@14267
   924
lemma diff_add_assoc: "k \<le> (j::nat) ==> (i + j) - k = i + (j - k)"
berghofe@13449
   925
  by (induct j k rule: diff_induct) simp_all
berghofe@13449
   926
paulson@14267
   927
lemma diff_add_assoc2: "k \<le> (j::nat) ==> (j + i) - k = (j - k) + i"
berghofe@13449
   928
  by (simp add: add_commute diff_add_assoc)
berghofe@13449
   929
berghofe@13449
   930
lemma diff_add_inverse: "(n + m) - n = (m::nat)"
berghofe@13449
   931
  by (induct n) simp_all
berghofe@13449
   932
berghofe@13449
   933
lemma diff_add_inverse2: "(m + n) - n = (m::nat)"
berghofe@13449
   934
  by (simp add: diff_add_assoc)
berghofe@13449
   935
paulson@14267
   936
lemma le_imp_diff_is_add: "i \<le> (j::nat) ==> (j - i = k) = (j = k + i)"
berghofe@13449
   937
  apply safe
berghofe@13449
   938
  apply (simp_all add: diff_add_inverse2)
berghofe@13449
   939
  done
berghofe@13449
   940
paulson@14267
   941
lemma diff_is_0_eq [simp]: "((m::nat) - n = 0) = (m \<le> n)"
berghofe@13449
   942
  by (induct m n rule: diff_induct) simp_all
berghofe@13449
   943
paulson@14267
   944
lemma diff_is_0_eq' [simp]: "m \<le> n ==> (m::nat) - n = 0"
berghofe@13449
   945
  by (rule iffD2, rule diff_is_0_eq)
berghofe@13449
   946
berghofe@13449
   947
lemma zero_less_diff [simp]: "(0 < n - (m::nat)) = (m < n)"
berghofe@13449
   948
  by (induct m n rule: diff_induct) simp_all
berghofe@13449
   949
paulson@14267
   950
lemma less_imp_add_positive: "i < j  ==> \<exists>k::nat. 0 < k & i + k = j"
berghofe@13449
   951
  apply (rule_tac x = "j - i" in exI)
berghofe@13449
   952
  apply (simp (no_asm_simp) add: add_diff_inverse less_not_sym)
berghofe@13449
   953
  done
wenzelm@9436
   954
berghofe@13449
   955
lemma zero_induct_lemma: "P k ==> (!!n. P (Suc n) ==> P n) ==> P (k - i)"
berghofe@13449
   956
  apply (induct k i rule: diff_induct)
berghofe@13449
   957
  apply (simp_all (no_asm))
nipkow@17589
   958
  apply iprover
berghofe@13449
   959
  done
berghofe@13449
   960
berghofe@13449
   961
lemma zero_induct: "P k ==> (!!n. P (Suc n) ==> P n) ==> P 0"
berghofe@13449
   962
  apply (rule diff_self_eq_0 [THEN subst])
nipkow@17589
   963
  apply (rule zero_induct_lemma, iprover+)
berghofe@13449
   964
  done
berghofe@13449
   965
berghofe@13449
   966
lemma diff_cancel: "(k + m) - (k + n) = m - (n::nat)"
berghofe@13449
   967
  by (induct k) simp_all
berghofe@13449
   968
berghofe@13449
   969
lemma diff_cancel2: "(m + k) - (n + k) = m - (n::nat)"
berghofe@13449
   970
  by (simp add: diff_cancel add_commute)
berghofe@13449
   971
berghofe@13449
   972
lemma diff_add_0: "n - (n + m) = (0::nat)"
berghofe@13449
   973
  by (induct n) simp_all
berghofe@13449
   974
berghofe@13449
   975
berghofe@13449
   976
text {* Difference distributes over multiplication *}
berghofe@13449
   977
berghofe@13449
   978
lemma diff_mult_distrib: "((m::nat) - n) * k = (m * k) - (n * k)"
berghofe@13449
   979
  by (induct m n rule: diff_induct) (simp_all add: diff_cancel)
berghofe@13449
   980
berghofe@13449
   981
lemma diff_mult_distrib2: "k * ((m::nat) - n) = (k * m) - (k * n)"
berghofe@13449
   982
  by (simp add: diff_mult_distrib mult_commute [of k])
berghofe@13449
   983
  -- {* NOT added as rewrites, since sometimes they are used from right-to-left *}
berghofe@13449
   984
berghofe@13449
   985
lemmas nat_distrib =
berghofe@13449
   986
  add_mult_distrib add_mult_distrib2 diff_mult_distrib diff_mult_distrib2
berghofe@13449
   987
berghofe@13449
   988
berghofe@13449
   989
subsection {* Monotonicity of Multiplication *}
berghofe@13449
   990
paulson@14267
   991
lemma mult_le_mono1: "i \<le> (j::nat) ==> i * k \<le> j * k"
paulson@14341
   992
  by (simp add: mult_right_mono) 
berghofe@13449
   993
paulson@14267
   994
lemma mult_le_mono2: "i \<le> (j::nat) ==> k * i \<le> k * j"
paulson@14341
   995
  by (simp add: mult_left_mono) 
berghofe@13449
   996
paulson@14267
   997
text {* @{text "\<le>"} monotonicity, BOTH arguments *}
paulson@14267
   998
lemma mult_le_mono: "i \<le> (j::nat) ==> k \<le> l ==> i * k \<le> j * l"
paulson@14341
   999
  by (simp add: mult_mono) 
berghofe@13449
  1000
berghofe@13449
  1001
lemma mult_less_mono1: "(i::nat) < j ==> 0 < k ==> i * k < j * k"
paulson@14341
  1002
  by (simp add: mult_strict_right_mono) 
berghofe@13449
  1003
paulson@14266
  1004
text{*Differs from the standard @{text zero_less_mult_iff} in that
paulson@14266
  1005
      there are no negative numbers.*}
paulson@14266
  1006
lemma nat_0_less_mult_iff [simp]: "(0 < (m::nat) * n) = (0 < m & 0 < n)"
berghofe@13449
  1007
  apply (induct m)
paulson@14208
  1008
  apply (case_tac [2] n, simp_all)
berghofe@13449
  1009
  done
berghofe@13449
  1010
paulson@14267
  1011
lemma one_le_mult_iff [simp]: "(Suc 0 \<le> m * n) = (1 \<le> m & 1 \<le> n)"
berghofe@13449
  1012
  apply (induct m)
paulson@14208
  1013
  apply (case_tac [2] n, simp_all)
berghofe@13449
  1014
  done
berghofe@13449
  1015
berghofe@13449
  1016
lemma mult_eq_1_iff [simp]: "(m * n = Suc 0) = (m = 1 & n = 1)"
paulson@15251
  1017
  apply (induct m, simp)
paulson@15251
  1018
  apply (induct n, simp, fastsimp)
berghofe@13449
  1019
  done
berghofe@13449
  1020
berghofe@13449
  1021
lemma one_eq_mult_iff [simp]: "(Suc 0 = m * n) = (m = 1 & n = 1)"
berghofe@13449
  1022
  apply (rule trans)
paulson@14208
  1023
  apply (rule_tac [2] mult_eq_1_iff, fastsimp)
berghofe@13449
  1024
  done
berghofe@13449
  1025
paulson@14341
  1026
lemma mult_less_cancel2 [simp]: "((m::nat) * k < n * k) = (0 < k & m < n)"
berghofe@13449
  1027
  apply (safe intro!: mult_less_mono1)
paulson@14208
  1028
  apply (case_tac k, auto)
berghofe@13449
  1029
  apply (simp del: le_0_eq add: linorder_not_le [symmetric])
berghofe@13449
  1030
  apply (blast intro: mult_le_mono1)
berghofe@13449
  1031
  done
berghofe@13449
  1032
berghofe@13449
  1033
lemma mult_less_cancel1 [simp]: "(k * (m::nat) < k * n) = (0 < k & m < n)"
paulson@14341
  1034
  by (simp add: mult_commute [of k])
berghofe@13449
  1035
paulson@14267
  1036
lemma mult_le_cancel1 [simp]: "(k * (m::nat) \<le> k * n) = (0 < k --> m \<le> n)"
paulson@14208
  1037
by (simp add: linorder_not_less [symmetric], auto)
berghofe@13449
  1038
paulson@14267
  1039
lemma mult_le_cancel2 [simp]: "((m::nat) * k \<le> n * k) = (0 < k --> m \<le> n)"
paulson@14208
  1040
by (simp add: linorder_not_less [symmetric], auto)
berghofe@13449
  1041
paulson@14341
  1042
lemma mult_cancel2 [simp]: "(m * k = n * k) = (m = n | (k = (0::nat)))"
paulson@14208
  1043
  apply (cut_tac less_linear, safe, auto)
berghofe@13449
  1044
  apply (drule mult_less_mono1, assumption, simp)+
berghofe@13449
  1045
  done
berghofe@13449
  1046
berghofe@13449
  1047
lemma mult_cancel1 [simp]: "(k * m = k * n) = (m = n | (k = (0::nat)))"
paulson@14341
  1048
  by (simp add: mult_commute [of k])
berghofe@13449
  1049
berghofe@13449
  1050
lemma Suc_mult_less_cancel1: "(Suc k * m < Suc k * n) = (m < n)"
berghofe@13449
  1051
  by (subst mult_less_cancel1) simp
berghofe@13449
  1052
paulson@14267
  1053
lemma Suc_mult_le_cancel1: "(Suc k * m \<le> Suc k * n) = (m \<le> n)"
berghofe@13449
  1054
  by (subst mult_le_cancel1) simp
berghofe@13449
  1055
berghofe@13449
  1056
lemma Suc_mult_cancel1: "(Suc k * m = Suc k * n) = (m = n)"
berghofe@13449
  1057
  by (subst mult_cancel1) simp
berghofe@13449
  1058
berghofe@13449
  1059
text {* Lemma for @{text gcd} *}
berghofe@13449
  1060
lemma mult_eq_self_implies_10: "(m::nat) = m * n ==> n = 1 | m = 0"
berghofe@13449
  1061
  apply (drule sym)
berghofe@13449
  1062
  apply (rule disjCI)
berghofe@13449
  1063
  apply (rule nat_less_cases, erule_tac [2] _)
berghofe@13449
  1064
  apply (fastsimp elim!: less_SucE)
berghofe@13449
  1065
  apply (fastsimp dest: mult_less_mono2)
berghofe@13449
  1066
  done
wenzelm@9436
  1067
haftmann@20588
  1068
haftmann@18702
  1069
subsection {* Code generator setup *}
haftmann@18702
  1070
haftmann@20355
  1071
lemma one_is_suc_zero [code inline]:
haftmann@20355
  1072
  "1 = Suc 0"
haftmann@20355
  1073
  by simp
haftmann@20355
  1074
haftmann@20588
  1075
instance nat :: eq ..
haftmann@20588
  1076
haftmann@20588
  1077
lemma [code func]:
haftmann@21456
  1078
  "(0\<Colon>nat) = 0 \<longleftrightarrow> True" by auto
haftmann@20588
  1079
haftmann@20588
  1080
lemma [code func]:
haftmann@21456
  1081
  "Suc n = Suc m \<longleftrightarrow> n = m" by auto
haftmann@20588
  1082
haftmann@20588
  1083
lemma [code func]:
haftmann@21456
  1084
  "Suc n = 0 \<longleftrightarrow> False" by auto
haftmann@20588
  1085
haftmann@20588
  1086
lemma [code func]:
haftmann@21456
  1087
  "0 = Suc m \<longleftrightarrow> False" by auto
haftmann@20588
  1088
wenzelm@21243
  1089
wenzelm@21243
  1090
subsection {* Further Arithmetic Facts Concerning the Natural Numbers *}
wenzelm@21243
  1091
wenzelm@21243
  1092
use "arith_data.ML"
wenzelm@21243
  1093
setup arith_setup
wenzelm@21243
  1094
wenzelm@21243
  1095
text{*The following proofs may rely on the arithmetic proof procedures.*}
wenzelm@21243
  1096
wenzelm@21243
  1097
lemma le_iff_add: "(m::nat) \<le> n = (\<exists>k. n = m + k)"
wenzelm@21243
  1098
  by (auto simp: le_eq_less_or_eq dest: less_imp_Suc_add)
wenzelm@21243
  1099
wenzelm@21243
  1100
lemma pred_nat_trancl_eq_le: "((m, n) : pred_nat^*) = (m \<le> n)"
wenzelm@21243
  1101
by (simp add: less_eq reflcl_trancl [symmetric]
wenzelm@21243
  1102
            del: reflcl_trancl, arith)
wenzelm@21243
  1103
wenzelm@21243
  1104
lemma nat_diff_split:
wenzelm@21243
  1105
    "P(a - b::nat) = ((a<b --> P 0) & (ALL d. a = b + d --> P d))"
wenzelm@21243
  1106
    -- {* elimination of @{text -} on @{text nat} *}
wenzelm@21243
  1107
  by (cases "a<b" rule: case_split)
wenzelm@21243
  1108
     (auto simp add: diff_is_0_eq [THEN iffD2])
wenzelm@21243
  1109
wenzelm@21243
  1110
lemma nat_diff_split_asm:
wenzelm@21243
  1111
    "P(a - b::nat) = (~ (a < b & ~ P 0 | (EX d. a = b + d & ~ P d)))"
wenzelm@21243
  1112
    -- {* elimination of @{text -} on @{text nat} in assumptions *}
wenzelm@21243
  1113
  by (simp split: nat_diff_split)
wenzelm@21243
  1114
wenzelm@21243
  1115
lemmas [arith_split] = nat_diff_split split_min split_max
wenzelm@21243
  1116
wenzelm@21243
  1117
wenzelm@21243
  1118
wenzelm@21243
  1119
lemma le_square: "m \<le> m * (m::nat)"
wenzelm@21243
  1120
  by (induct m) auto
wenzelm@21243
  1121
wenzelm@21243
  1122
lemma le_cube: "(m::nat) \<le> m * (m * m)"
wenzelm@21243
  1123
  by (induct m) auto
wenzelm@21243
  1124
wenzelm@21243
  1125
wenzelm@21243
  1126
text{*Subtraction laws, mostly by Clemens Ballarin*}
wenzelm@21243
  1127
wenzelm@21243
  1128
lemma diff_less_mono: "[| a < (b::nat); c \<le> a |] ==> a-c < b-c"
wenzelm@21243
  1129
by arith
wenzelm@21243
  1130
wenzelm@21243
  1131
lemma less_diff_conv: "(i < j-k) = (i+k < (j::nat))"
wenzelm@21243
  1132
by arith
wenzelm@21243
  1133
wenzelm@21243
  1134
lemma le_diff_conv: "(j-k \<le> (i::nat)) = (j \<le> i+k)"
wenzelm@21243
  1135
by arith
wenzelm@21243
  1136
wenzelm@21243
  1137
lemma le_diff_conv2: "k \<le> j ==> (i \<le> j-k) = (i+k \<le> (j::nat))"
wenzelm@21243
  1138
by arith
wenzelm@21243
  1139
wenzelm@21243
  1140
lemma diff_diff_cancel [simp]: "i \<le> (n::nat) ==> n - (n - i) = i"
wenzelm@21243
  1141
by arith
wenzelm@21243
  1142
wenzelm@21243
  1143
lemma le_add_diff: "k \<le> (n::nat) ==> m \<le> n + m - k"
wenzelm@21243
  1144
by arith
wenzelm@21243
  1145
wenzelm@21243
  1146
(*Replaces the previous diff_less and le_diff_less, which had the stronger
wenzelm@21243
  1147
  second premise n\<le>m*)
wenzelm@21243
  1148
lemma diff_less[simp]: "!!m::nat. [| 0<n; 0<m |] ==> m - n < m"
wenzelm@21243
  1149
by arith
wenzelm@21243
  1150
wenzelm@21243
  1151
wenzelm@21243
  1152
(** Simplification of relational expressions involving subtraction **)
wenzelm@21243
  1153
wenzelm@21243
  1154
lemma diff_diff_eq: "[| k \<le> m;  k \<le> (n::nat) |] ==> ((m-k) - (n-k)) = (m-n)"
wenzelm@21243
  1155
by (simp split add: nat_diff_split)
wenzelm@21243
  1156
wenzelm@21243
  1157
lemma eq_diff_iff: "[| k \<le> m;  k \<le> (n::nat) |] ==> (m-k = n-k) = (m=n)"
wenzelm@21243
  1158
by (auto split add: nat_diff_split)
wenzelm@21243
  1159
wenzelm@21243
  1160
lemma less_diff_iff: "[| k \<le> m;  k \<le> (n::nat) |] ==> (m-k < n-k) = (m<n)"
wenzelm@21243
  1161
by (auto split add: nat_diff_split)
wenzelm@21243
  1162
wenzelm@21243
  1163
lemma le_diff_iff: "[| k \<le> m;  k \<le> (n::nat) |] ==> (m-k \<le> n-k) = (m\<le>n)"
wenzelm@21243
  1164
by (auto split add: nat_diff_split)
wenzelm@21243
  1165
wenzelm@21243
  1166
wenzelm@21243
  1167
text{*(Anti)Monotonicity of subtraction -- by Stephan Merz*}
wenzelm@21243
  1168
wenzelm@21243
  1169
(* Monotonicity of subtraction in first argument *)
wenzelm@21243
  1170
lemma diff_le_mono: "m \<le> (n::nat) ==> (m-l) \<le> (n-l)"
wenzelm@21243
  1171
by (simp split add: nat_diff_split)
wenzelm@21243
  1172
wenzelm@21243
  1173
lemma diff_le_mono2: "m \<le> (n::nat) ==> (l-n) \<le> (l-m)"
wenzelm@21243
  1174
by (simp split add: nat_diff_split)
wenzelm@21243
  1175
wenzelm@21243
  1176
lemma diff_less_mono2: "[| m < (n::nat); m<l |] ==> (l-n) < (l-m)"
wenzelm@21243
  1177
by (simp split add: nat_diff_split)
wenzelm@21243
  1178
wenzelm@21243
  1179
lemma diffs0_imp_equal: "!!m::nat. [| m-n = 0; n-m = 0 |] ==>  m=n"
wenzelm@21243
  1180
by (simp split add: nat_diff_split)
wenzelm@21243
  1181
wenzelm@21243
  1182
text{*Lemmas for ex/Factorization*}
wenzelm@21243
  1183
wenzelm@21243
  1184
lemma one_less_mult: "[| Suc 0 < n; Suc 0 < m |] ==> Suc 0 < m*n"
wenzelm@21243
  1185
by (case_tac "m", auto)
wenzelm@21243
  1186
wenzelm@21243
  1187
lemma n_less_m_mult_n: "[| Suc 0 < n; Suc 0 < m |] ==> n<m*n"
wenzelm@21243
  1188
by (case_tac "m", auto)
wenzelm@21243
  1189
wenzelm@21243
  1190
lemma n_less_n_mult_m: "[| Suc 0 < n; Suc 0 < m |] ==> n<n*m"
wenzelm@21243
  1191
by (case_tac "m", auto)
wenzelm@21243
  1192
wenzelm@21243
  1193
wenzelm@21243
  1194
text{*Rewriting to pull differences out*}
wenzelm@21243
  1195
wenzelm@21243
  1196
lemma diff_diff_right [simp]: "k\<le>j --> i - (j - k) = i + (k::nat) - j"
wenzelm@21243
  1197
by arith
wenzelm@21243
  1198
wenzelm@21243
  1199
lemma diff_Suc_diff_eq1 [simp]: "k \<le> j ==> m - Suc (j - k) = m + k - Suc j"
wenzelm@21243
  1200
by arith
wenzelm@21243
  1201
wenzelm@21243
  1202
lemma diff_Suc_diff_eq2 [simp]: "k \<le> j ==> Suc (j - k) - m = Suc j - (k + m)"
wenzelm@21243
  1203
by arith
wenzelm@21243
  1204
wenzelm@21243
  1205
(*The others are
wenzelm@21243
  1206
      i - j - k = i - (j + k),
wenzelm@21243
  1207
      k \<le> j ==> j - k + i = j + i - k,
wenzelm@21243
  1208
      k \<le> j ==> i + (j - k) = i + j - k *)
wenzelm@21243
  1209
lemmas add_diff_assoc = diff_add_assoc [symmetric]
wenzelm@21243
  1210
lemmas add_diff_assoc2 = diff_add_assoc2[symmetric]
wenzelm@21243
  1211
declare diff_diff_left [simp]  add_diff_assoc [simp]  add_diff_assoc2[simp]
wenzelm@21243
  1212
wenzelm@21243
  1213
text{*At present we prove no analogue of @{text not_less_Least} or @{text
wenzelm@21243
  1214
Least_Suc}, since there appears to be no need.*}
wenzelm@21243
  1215
wenzelm@21243
  1216
ML
wenzelm@21243
  1217
{*
wenzelm@21243
  1218
val pred_nat_trancl_eq_le = thm "pred_nat_trancl_eq_le";
wenzelm@21243
  1219
val nat_diff_split = thm "nat_diff_split";
wenzelm@21243
  1220
val nat_diff_split_asm = thm "nat_diff_split_asm";
wenzelm@21243
  1221
val le_square = thm "le_square";
wenzelm@21243
  1222
val le_cube = thm "le_cube";
wenzelm@21243
  1223
val diff_less_mono = thm "diff_less_mono";
wenzelm@21243
  1224
val less_diff_conv = thm "less_diff_conv";
wenzelm@21243
  1225
val le_diff_conv = thm "le_diff_conv";
wenzelm@21243
  1226
val le_diff_conv2 = thm "le_diff_conv2";
wenzelm@21243
  1227
val diff_diff_cancel = thm "diff_diff_cancel";
wenzelm@21243
  1228
val le_add_diff = thm "le_add_diff";
wenzelm@21243
  1229
val diff_less = thm "diff_less";
wenzelm@21243
  1230
val diff_diff_eq = thm "diff_diff_eq";
wenzelm@21243
  1231
val eq_diff_iff = thm "eq_diff_iff";
wenzelm@21243
  1232
val less_diff_iff = thm "less_diff_iff";
wenzelm@21243
  1233
val le_diff_iff = thm "le_diff_iff";
wenzelm@21243
  1234
val diff_le_mono = thm "diff_le_mono";
wenzelm@21243
  1235
val diff_le_mono2 = thm "diff_le_mono2";
wenzelm@21243
  1236
val diff_less_mono2 = thm "diff_less_mono2";
wenzelm@21243
  1237
val diffs0_imp_equal = thm "diffs0_imp_equal";
wenzelm@21243
  1238
val one_less_mult = thm "one_less_mult";
wenzelm@21243
  1239
val n_less_m_mult_n = thm "n_less_m_mult_n";
wenzelm@21243
  1240
val n_less_n_mult_m = thm "n_less_n_mult_m";
wenzelm@21243
  1241
val diff_diff_right = thm "diff_diff_right";
wenzelm@21243
  1242
val diff_Suc_diff_eq1 = thm "diff_Suc_diff_eq1";
wenzelm@21243
  1243
val diff_Suc_diff_eq2 = thm "diff_Suc_diff_eq2";
wenzelm@21243
  1244
*}
wenzelm@21243
  1245
wenzelm@21243
  1246
subsection{*Embedding of the Naturals into any @{text
wenzelm@21243
  1247
semiring_1_cancel}: @{term of_nat}*}
wenzelm@21243
  1248
wenzelm@21243
  1249
consts of_nat :: "nat => 'a::semiring_1_cancel"
wenzelm@21243
  1250
wenzelm@21243
  1251
primrec
wenzelm@21243
  1252
  of_nat_0:   "of_nat 0 = 0"
wenzelm@21243
  1253
  of_nat_Suc: "of_nat (Suc m) = of_nat m + 1"
wenzelm@21243
  1254
wenzelm@21243
  1255
lemma of_nat_1 [simp]: "of_nat 1 = 1"
wenzelm@21243
  1256
by simp
wenzelm@21243
  1257
wenzelm@21243
  1258
lemma of_nat_add [simp]: "of_nat (m+n) = of_nat m + of_nat n"
wenzelm@21243
  1259
apply (induct m)
wenzelm@21243
  1260
apply (simp_all add: add_ac)
wenzelm@21243
  1261
done
wenzelm@21243
  1262
wenzelm@21243
  1263
lemma of_nat_mult [simp]: "of_nat (m*n) = of_nat m * of_nat n"
wenzelm@21243
  1264
apply (induct m)
wenzelm@21243
  1265
apply (simp_all add: add_ac left_distrib)
wenzelm@21243
  1266
done
wenzelm@21243
  1267
wenzelm@21243
  1268
lemma zero_le_imp_of_nat: "0 \<le> (of_nat m::'a::ordered_semidom)"
wenzelm@21243
  1269
apply (induct m, simp_all)
wenzelm@21243
  1270
apply (erule order_trans)
wenzelm@21243
  1271
apply (rule less_add_one [THEN order_less_imp_le])
wenzelm@21243
  1272
done
wenzelm@21243
  1273
wenzelm@21243
  1274
lemma less_imp_of_nat_less:
wenzelm@21243
  1275
     "m < n ==> of_nat m < (of_nat n::'a::ordered_semidom)"
wenzelm@21243
  1276
apply (induct m n rule: diff_induct, simp_all)
wenzelm@21243
  1277
apply (insert add_le_less_mono [OF zero_le_imp_of_nat zero_less_one], force)
wenzelm@21243
  1278
done
wenzelm@21243
  1279
wenzelm@21243
  1280
lemma of_nat_less_imp_less:
wenzelm@21243
  1281
     "of_nat m < (of_nat n::'a::ordered_semidom) ==> m < n"
wenzelm@21243
  1282
apply (induct m n rule: diff_induct, simp_all)
wenzelm@21243
  1283
apply (insert zero_le_imp_of_nat)
wenzelm@21243
  1284
apply (force simp add: linorder_not_less [symmetric])
wenzelm@21243
  1285
done
wenzelm@21243
  1286
wenzelm@21243
  1287
lemma of_nat_less_iff [simp]:
wenzelm@21243
  1288
     "(of_nat m < (of_nat n::'a::ordered_semidom)) = (m<n)"
wenzelm@21243
  1289
by (blast intro: of_nat_less_imp_less less_imp_of_nat_less)
wenzelm@21243
  1290
wenzelm@21243
  1291
text{*Special cases where either operand is zero*}
wenzelm@21243
  1292
lemmas of_nat_0_less_iff = of_nat_less_iff [of 0, simplified]
wenzelm@21243
  1293
lemmas of_nat_less_0_iff = of_nat_less_iff [of _ 0, simplified]
wenzelm@21243
  1294
declare of_nat_0_less_iff [simp]
wenzelm@21243
  1295
declare of_nat_less_0_iff [simp]
wenzelm@21243
  1296
wenzelm@21243
  1297
lemma of_nat_le_iff [simp]:
wenzelm@21243
  1298
     "(of_nat m \<le> (of_nat n::'a::ordered_semidom)) = (m \<le> n)"
wenzelm@21243
  1299
by (simp add: linorder_not_less [symmetric])
wenzelm@21243
  1300
wenzelm@21243
  1301
text{*Special cases where either operand is zero*}
wenzelm@21243
  1302
lemmas of_nat_0_le_iff = of_nat_le_iff [of 0, simplified]
wenzelm@21243
  1303
lemmas of_nat_le_0_iff = of_nat_le_iff [of _ 0, simplified]
wenzelm@21243
  1304
declare of_nat_0_le_iff [simp]
wenzelm@21243
  1305
declare of_nat_le_0_iff [simp]
wenzelm@21243
  1306
wenzelm@21243
  1307
text{*The ordering on the @{text semiring_1_cancel} is necessary
wenzelm@21243
  1308
to exclude the possibility of a finite field, which indeed wraps back to
wenzelm@21243
  1309
zero.*}
wenzelm@21243
  1310
lemma of_nat_eq_iff [simp]:
wenzelm@21243
  1311
     "(of_nat m = (of_nat n::'a::ordered_semidom)) = (m = n)"
wenzelm@21243
  1312
by (simp add: order_eq_iff)
wenzelm@21243
  1313
wenzelm@21243
  1314
text{*Special cases where either operand is zero*}
wenzelm@21243
  1315
lemmas of_nat_0_eq_iff = of_nat_eq_iff [of 0, simplified]
wenzelm@21243
  1316
lemmas of_nat_eq_0_iff = of_nat_eq_iff [of _ 0, simplified]
wenzelm@21243
  1317
declare of_nat_0_eq_iff [simp]
wenzelm@21243
  1318
declare of_nat_eq_0_iff [simp]
wenzelm@21243
  1319
wenzelm@21243
  1320
lemma of_nat_diff [simp]:
wenzelm@21243
  1321
     "n \<le> m ==> of_nat (m - n) = of_nat m - (of_nat n :: 'a::ring_1)"
wenzelm@21243
  1322
by (simp del: of_nat_add
wenzelm@21243
  1323
	 add: compare_rls of_nat_add [symmetric] split add: nat_diff_split)
wenzelm@21243
  1324
krauss@22157
  1325
krauss@22157
  1326
subsection {* Size function *}
krauss@22157
  1327
krauss@22157
  1328
lemma nat_size[simp]: "size (n::nat) = n"
krauss@22157
  1329
  by (induct n) simp_all
krauss@22157
  1330
clasohm@923
  1331
end