src/HOL/Library/Extended_Nat.thy
author blanchet
Thu Sep 11 18:54:36 2014 +0200 (2014-09-11)
changeset 58306 117ba6cbe414
parent 57514 bdc2c6b40bf2
child 58881 b9556a055632
permissions -rw-r--r--
renamed 'rep_datatype' to 'old_rep_datatype' (HOL)
hoelzl@43919
     1
(*  Title:      HOL/Library/Extended_Nat.thy
haftmann@27110
     2
    Author:     David von Oheimb, TU Muenchen;  Florian Haftmann, TU Muenchen
nipkow@41853
     3
    Contributions: David Trachtenherz, TU Muenchen
oheimb@11351
     4
*)
oheimb@11351
     5
hoelzl@43919
     6
header {* Extended natural numbers (i.e. with infinity) *}
oheimb@11351
     7
hoelzl@43919
     8
theory Extended_Nat
hoelzl@54415
     9
imports Main Countable
nipkow@15131
    10
begin
oheimb@11351
    11
hoelzl@43921
    12
class infinity =
hoelzl@43921
    13
  fixes infinity :: "'a"
hoelzl@43921
    14
hoelzl@43921
    15
notation (xsymbols)
hoelzl@43921
    16
  infinity  ("\<infinity>")
hoelzl@43921
    17
hoelzl@43921
    18
notation (HTML output)
hoelzl@43921
    19
  infinity  ("\<infinity>")
hoelzl@43921
    20
haftmann@27110
    21
subsection {* Type definition *}
oheimb@11351
    22
oheimb@11351
    23
text {*
wenzelm@11355
    24
  We extend the standard natural numbers by a special value indicating
haftmann@27110
    25
  infinity.
oheimb@11351
    26
*}
oheimb@11351
    27
wenzelm@49834
    28
typedef enat = "UNIV :: nat option set" ..
hoelzl@54415
    29
hoelzl@54419
    30
text {* TODO: introduce enat as coinductive datatype, enat is just @{const of_nat} *}
hoelzl@54415
    31
hoelzl@43924
    32
definition enat :: "nat \<Rightarrow> enat" where
hoelzl@43924
    33
  "enat n = Abs_enat (Some n)"
hoelzl@43921
    34
 
hoelzl@43921
    35
instantiation enat :: infinity
hoelzl@43921
    36
begin
hoelzl@43921
    37
  definition "\<infinity> = Abs_enat None"
hoelzl@43921
    38
  instance proof qed
hoelzl@43921
    39
end
hoelzl@54415
    40
hoelzl@54415
    41
instance enat :: countable
hoelzl@54415
    42
proof
hoelzl@54415
    43
  show "\<exists>to_nat::enat \<Rightarrow> nat. inj to_nat"
hoelzl@54415
    44
    by (rule exI[of _ "to_nat \<circ> Rep_enat"]) (simp add: inj_on_def Rep_enat_inject)
hoelzl@54415
    45
qed
hoelzl@43921
    46
 
blanchet@58306
    47
old_rep_datatype enat "\<infinity> :: enat"
hoelzl@43921
    48
proof -
hoelzl@43924
    49
  fix P i assume "\<And>j. P (enat j)" "P \<infinity>"
hoelzl@43921
    50
  then show "P i"
hoelzl@43921
    51
  proof induct
hoelzl@43921
    52
    case (Abs_enat y) then show ?case
hoelzl@43921
    53
      by (cases y rule: option.exhaust)
hoelzl@43924
    54
         (auto simp: enat_def infinity_enat_def)
hoelzl@43921
    55
  qed
hoelzl@43924
    56
qed (auto simp add: enat_def infinity_enat_def Abs_enat_inject)
wenzelm@19736
    57
hoelzl@43924
    58
declare [[coercion "enat::nat\<Rightarrow>enat"]]
wenzelm@19736
    59
noschinl@45934
    60
lemmas enat2_cases = enat.exhaust[case_product enat.exhaust]
noschinl@45934
    61
lemmas enat3_cases = enat.exhaust[case_product enat.exhaust enat.exhaust]
noschinl@45934
    62
hoelzl@54416
    63
lemma not_infinity_eq [iff]: "(x \<noteq> \<infinity>) = (\<exists>i. x = enat i)"
huffman@44019
    64
  by (cases x) auto
nipkow@31084
    65
hoelzl@54416
    66
lemma not_enat_eq [iff]: "(\<forall>y. x \<noteq> enat y) = (x = \<infinity>)"
huffman@44019
    67
  by (cases x) auto
nipkow@31077
    68
hoelzl@43924
    69
primrec the_enat :: "enat \<Rightarrow> nat"
huffman@44019
    70
  where "the_enat (enat n) = n"
nipkow@41855
    71
huffman@47108
    72
haftmann@27110
    73
subsection {* Constructors and numbers *}
haftmann@27110
    74
huffman@47108
    75
instantiation enat :: "{zero, one}"
haftmann@25594
    76
begin
haftmann@25594
    77
haftmann@25594
    78
definition
hoelzl@43924
    79
  "0 = enat 0"
haftmann@25594
    80
haftmann@25594
    81
definition
huffman@47108
    82
  "1 = enat 1"
oheimb@11351
    83
haftmann@25594
    84
instance ..
haftmann@25594
    85
haftmann@25594
    86
end
haftmann@25594
    87
huffman@44019
    88
definition eSuc :: "enat \<Rightarrow> enat" where
huffman@44019
    89
  "eSuc i = (case i of enat n \<Rightarrow> enat (Suc n) | \<infinity> \<Rightarrow> \<infinity>)"
oheimb@11351
    90
huffman@47108
    91
lemma enat_0 [code_post]: "enat 0 = 0"
hoelzl@43919
    92
  by (simp add: zero_enat_def)
haftmann@27110
    93
huffman@47108
    94
lemma enat_1 [code_post]: "enat 1 = 1"
hoelzl@43919
    95
  by (simp add: one_enat_def)
haftmann@27110
    96
hoelzl@54416
    97
lemma enat_0_iff: "enat x = 0 \<longleftrightarrow> x = 0" "0 = enat x \<longleftrightarrow> x = 0"
hoelzl@54416
    98
  by (auto simp add: zero_enat_def)
hoelzl@54416
    99
hoelzl@54416
   100
lemma enat_1_iff: "enat x = 1 \<longleftrightarrow> x = 1" "1 = enat x \<longleftrightarrow> x = 1"
hoelzl@54416
   101
  by (auto simp add: one_enat_def)
hoelzl@54416
   102
huffman@44019
   103
lemma one_eSuc: "1 = eSuc 0"
huffman@44019
   104
  by (simp add: zero_enat_def one_enat_def eSuc_def)
oheimb@11351
   105
huffman@44019
   106
lemma infinity_ne_i0 [simp]: "(\<infinity>::enat) \<noteq> 0"
hoelzl@43919
   107
  by (simp add: zero_enat_def)
oheimb@11351
   108
huffman@44019
   109
lemma i0_ne_infinity [simp]: "0 \<noteq> (\<infinity>::enat)"
hoelzl@43919
   110
  by (simp add: zero_enat_def)
haftmann@27110
   111
hoelzl@43919
   112
lemma zero_one_enat_neq [simp]:
hoelzl@43919
   113
  "\<not> 0 = (1\<Colon>enat)"
hoelzl@43919
   114
  "\<not> 1 = (0\<Colon>enat)"
hoelzl@43919
   115
  unfolding zero_enat_def one_enat_def by simp_all
oheimb@11351
   116
huffman@44019
   117
lemma infinity_ne_i1 [simp]: "(\<infinity>::enat) \<noteq> 1"
hoelzl@43919
   118
  by (simp add: one_enat_def)
haftmann@27110
   119
huffman@44019
   120
lemma i1_ne_infinity [simp]: "1 \<noteq> (\<infinity>::enat)"
hoelzl@43919
   121
  by (simp add: one_enat_def)
haftmann@27110
   122
huffman@44019
   123
lemma eSuc_enat: "eSuc (enat n) = enat (Suc n)"
huffman@44019
   124
  by (simp add: eSuc_def)
haftmann@27110
   125
huffman@44019
   126
lemma eSuc_infinity [simp]: "eSuc \<infinity> = \<infinity>"
huffman@44019
   127
  by (simp add: eSuc_def)
oheimb@11351
   128
huffman@44019
   129
lemma eSuc_ne_0 [simp]: "eSuc n \<noteq> 0"
huffman@44019
   130
  by (simp add: eSuc_def zero_enat_def split: enat.splits)
haftmann@27110
   131
huffman@44019
   132
lemma zero_ne_eSuc [simp]: "0 \<noteq> eSuc n"
huffman@44019
   133
  by (rule eSuc_ne_0 [symmetric])
oheimb@11351
   134
huffman@44019
   135
lemma eSuc_inject [simp]: "eSuc m = eSuc n \<longleftrightarrow> m = n"
huffman@44019
   136
  by (simp add: eSuc_def split: enat.splits)
haftmann@27110
   137
haftmann@27110
   138
subsection {* Addition *}
haftmann@27110
   139
hoelzl@43919
   140
instantiation enat :: comm_monoid_add
haftmann@27110
   141
begin
haftmann@27110
   142
blanchet@38167
   143
definition [nitpick_simp]:
hoelzl@43924
   144
  "m + n = (case m of \<infinity> \<Rightarrow> \<infinity> | enat m \<Rightarrow> (case n of \<infinity> \<Rightarrow> \<infinity> | enat n \<Rightarrow> enat (m + n)))"
oheimb@11351
   145
hoelzl@43919
   146
lemma plus_enat_simps [simp, code]:
hoelzl@43921
   147
  fixes q :: enat
hoelzl@43924
   148
  shows "enat m + enat n = enat (m + n)"
hoelzl@43921
   149
    and "\<infinity> + q = \<infinity>"
hoelzl@43921
   150
    and "q + \<infinity> = \<infinity>"
hoelzl@43919
   151
  by (simp_all add: plus_enat_def split: enat.splits)
haftmann@27110
   152
haftmann@27110
   153
instance proof
hoelzl@43919
   154
  fix n m q :: enat
haftmann@27110
   155
  show "n + m + q = n + (m + q)"
noschinl@45934
   156
    by (cases n m q rule: enat3_cases) auto
haftmann@27110
   157
  show "n + m = m + n"
noschinl@45934
   158
    by (cases n m rule: enat2_cases) auto
haftmann@27110
   159
  show "0 + n = n"
hoelzl@43919
   160
    by (cases n) (simp_all add: zero_enat_def)
huffman@26089
   161
qed
huffman@26089
   162
haftmann@27110
   163
end
oheimb@11351
   164
huffman@44019
   165
lemma eSuc_plus_1:
huffman@44019
   166
  "eSuc n = n + 1"
huffman@44019
   167
  by (cases n) (simp_all add: eSuc_enat one_enat_def)
haftmann@27110
   168
  
huffman@44019
   169
lemma plus_1_eSuc:
huffman@44019
   170
  "1 + q = eSuc q"
huffman@44019
   171
  "q + 1 = eSuc q"
haftmann@57514
   172
  by (simp_all add: eSuc_plus_1 ac_simps)
nipkow@41853
   173
huffman@44019
   174
lemma iadd_Suc: "eSuc m + n = eSuc (m + n)"
haftmann@57514
   175
  by (simp_all add: eSuc_plus_1 ac_simps)
oheimb@11351
   176
huffman@44019
   177
lemma iadd_Suc_right: "m + eSuc n = eSuc (m + n)"
haftmann@57512
   178
  by (simp only: add.commute[of m] iadd_Suc)
nipkow@41853
   179
hoelzl@43919
   180
lemma iadd_is_0: "(m + n = (0::enat)) = (m = 0 \<and> n = 0)"
huffman@44019
   181
  by (cases m, cases n, simp_all add: zero_enat_def)
oheimb@11351
   182
huffman@29014
   183
subsection {* Multiplication *}
huffman@29014
   184
hoelzl@43919
   185
instantiation enat :: comm_semiring_1
huffman@29014
   186
begin
huffman@29014
   187
hoelzl@43919
   188
definition times_enat_def [nitpick_simp]:
hoelzl@43924
   189
  "m * n = (case m of \<infinity> \<Rightarrow> if n = 0 then 0 else \<infinity> | enat m \<Rightarrow>
hoelzl@43924
   190
    (case n of \<infinity> \<Rightarrow> if m = 0 then 0 else \<infinity> | enat n \<Rightarrow> enat (m * n)))"
huffman@29014
   191
hoelzl@43919
   192
lemma times_enat_simps [simp, code]:
hoelzl@43924
   193
  "enat m * enat n = enat (m * n)"
hoelzl@43921
   194
  "\<infinity> * \<infinity> = (\<infinity>::enat)"
hoelzl@43924
   195
  "\<infinity> * enat n = (if n = 0 then 0 else \<infinity>)"
hoelzl@43924
   196
  "enat m * \<infinity> = (if m = 0 then 0 else \<infinity>)"
hoelzl@43919
   197
  unfolding times_enat_def zero_enat_def
hoelzl@43919
   198
  by (simp_all split: enat.split)
huffman@29014
   199
huffman@29014
   200
instance proof
hoelzl@43919
   201
  fix a b c :: enat
huffman@29014
   202
  show "(a * b) * c = a * (b * c)"
hoelzl@43919
   203
    unfolding times_enat_def zero_enat_def
hoelzl@43919
   204
    by (simp split: enat.split)
huffman@29014
   205
  show "a * b = b * a"
hoelzl@43919
   206
    unfolding times_enat_def zero_enat_def
hoelzl@43919
   207
    by (simp split: enat.split)
huffman@29014
   208
  show "1 * a = a"
hoelzl@43919
   209
    unfolding times_enat_def zero_enat_def one_enat_def
hoelzl@43919
   210
    by (simp split: enat.split)
huffman@29014
   211
  show "(a + b) * c = a * c + b * c"
hoelzl@43919
   212
    unfolding times_enat_def zero_enat_def
webertj@49962
   213
    by (simp split: enat.split add: distrib_right)
huffman@29014
   214
  show "0 * a = 0"
hoelzl@43919
   215
    unfolding times_enat_def zero_enat_def
hoelzl@43919
   216
    by (simp split: enat.split)
huffman@29014
   217
  show "a * 0 = 0"
hoelzl@43919
   218
    unfolding times_enat_def zero_enat_def
hoelzl@43919
   219
    by (simp split: enat.split)
hoelzl@43919
   220
  show "(0::enat) \<noteq> 1"
hoelzl@43919
   221
    unfolding zero_enat_def one_enat_def
huffman@29014
   222
    by simp
huffman@29014
   223
qed
huffman@29014
   224
huffman@29014
   225
end
huffman@29014
   226
huffman@44019
   227
lemma mult_eSuc: "eSuc m * n = n + m * n"
huffman@44019
   228
  unfolding eSuc_plus_1 by (simp add: algebra_simps)
huffman@29014
   229
huffman@44019
   230
lemma mult_eSuc_right: "m * eSuc n = m + m * n"
huffman@44019
   231
  unfolding eSuc_plus_1 by (simp add: algebra_simps)
huffman@29014
   232
hoelzl@43924
   233
lemma of_nat_eq_enat: "of_nat n = enat n"
huffman@29023
   234
  apply (induct n)
hoelzl@43924
   235
  apply (simp add: enat_0)
huffman@44019
   236
  apply (simp add: plus_1_eSuc eSuc_enat)
huffman@29023
   237
  done
huffman@29023
   238
hoelzl@43919
   239
instance enat :: semiring_char_0 proof
hoelzl@43924
   240
  have "inj enat" by (rule injI) simp
hoelzl@43924
   241
  then show "inj (\<lambda>n. of_nat n :: enat)" by (simp add: of_nat_eq_enat)
haftmann@38621
   242
qed
huffman@29023
   243
huffman@44019
   244
lemma imult_is_0 [simp]: "((m::enat) * n = 0) = (m = 0 \<or> n = 0)"
huffman@44019
   245
  by (auto simp add: times_enat_def zero_enat_def split: enat.split)
nipkow@41853
   246
huffman@44019
   247
lemma imult_is_infinity: "((a::enat) * b = \<infinity>) = (a = \<infinity> \<and> b \<noteq> 0 \<or> b = \<infinity> \<and> a \<noteq> 0)"
huffman@44019
   248
  by (auto simp add: times_enat_def zero_enat_def split: enat.split)
nipkow@41853
   249
nipkow@41853
   250
huffman@47108
   251
subsection {* Numerals *}
huffman@47108
   252
huffman@47108
   253
lemma numeral_eq_enat:
huffman@47108
   254
  "numeral k = enat (numeral k)"
huffman@47108
   255
  using of_nat_eq_enat [of "numeral k"] by simp
huffman@47108
   256
huffman@47108
   257
lemma enat_numeral [code_abbrev]:
huffman@47108
   258
  "enat (numeral k) = numeral k"
huffman@47108
   259
  using numeral_eq_enat ..
huffman@47108
   260
huffman@47108
   261
lemma infinity_ne_numeral [simp]: "(\<infinity>::enat) \<noteq> numeral k"
huffman@47108
   262
  by (simp add: numeral_eq_enat)
huffman@47108
   263
huffman@47108
   264
lemma numeral_ne_infinity [simp]: "numeral k \<noteq> (\<infinity>::enat)"
huffman@47108
   265
  by (simp add: numeral_eq_enat)
huffman@47108
   266
huffman@47108
   267
lemma eSuc_numeral [simp]: "eSuc (numeral k) = numeral (k + Num.One)"
huffman@47108
   268
  by (simp only: eSuc_plus_1 numeral_plus_one)
huffman@47108
   269
nipkow@41853
   270
subsection {* Subtraction *}
nipkow@41853
   271
hoelzl@43919
   272
instantiation enat :: minus
nipkow@41853
   273
begin
nipkow@41853
   274
hoelzl@43919
   275
definition diff_enat_def:
hoelzl@43924
   276
"a - b = (case a of (enat x) \<Rightarrow> (case b of (enat y) \<Rightarrow> enat (x - y) | \<infinity> \<Rightarrow> 0)
nipkow@41853
   277
          | \<infinity> \<Rightarrow> \<infinity>)"
nipkow@41853
   278
nipkow@41853
   279
instance ..
nipkow@41853
   280
nipkow@41853
   281
end
nipkow@41853
   282
huffman@47108
   283
lemma idiff_enat_enat [simp, code]: "enat a - enat b = enat (a - b)"
huffman@44019
   284
  by (simp add: diff_enat_def)
nipkow@41853
   285
huffman@47108
   286
lemma idiff_infinity [simp, code]: "\<infinity> - n = (\<infinity>::enat)"
huffman@44019
   287
  by (simp add: diff_enat_def)
nipkow@41853
   288
huffman@47108
   289
lemma idiff_infinity_right [simp, code]: "enat a - \<infinity> = 0"
huffman@44019
   290
  by (simp add: diff_enat_def)
nipkow@41853
   291
huffman@44019
   292
lemma idiff_0 [simp]: "(0::enat) - n = 0"
huffman@44019
   293
  by (cases n, simp_all add: zero_enat_def)
nipkow@41853
   294
huffman@44019
   295
lemmas idiff_enat_0 [simp] = idiff_0 [unfolded zero_enat_def]
nipkow@41853
   296
huffman@44019
   297
lemma idiff_0_right [simp]: "(n::enat) - 0 = n"
huffman@44019
   298
  by (cases n) (simp_all add: zero_enat_def)
nipkow@41853
   299
huffman@44019
   300
lemmas idiff_enat_0_right [simp] = idiff_0_right [unfolded zero_enat_def]
nipkow@41853
   301
huffman@44019
   302
lemma idiff_self [simp]: "n \<noteq> \<infinity> \<Longrightarrow> (n::enat) - n = 0"
huffman@44019
   303
  by (auto simp: zero_enat_def)
nipkow@41853
   304
huffman@44019
   305
lemma eSuc_minus_eSuc [simp]: "eSuc n - eSuc m = n - m"
huffman@44019
   306
  by (simp add: eSuc_def split: enat.split)
nipkow@41855
   307
huffman@44019
   308
lemma eSuc_minus_1 [simp]: "eSuc n - 1 = n"
huffman@44019
   309
  by (simp add: one_enat_def eSuc_enat[symmetric] zero_enat_def[symmetric])
nipkow@41855
   310
hoelzl@43924
   311
(*lemmas idiff_self_eq_0_enat = idiff_self_eq_0[unfolded zero_enat_def]*)
nipkow@41853
   312
haftmann@27110
   313
subsection {* Ordering *}
haftmann@27110
   314
hoelzl@43919
   315
instantiation enat :: linordered_ab_semigroup_add
haftmann@27110
   316
begin
oheimb@11351
   317
blanchet@38167
   318
definition [nitpick_simp]:
hoelzl@43924
   319
  "m \<le> n = (case n of enat n1 \<Rightarrow> (case m of enat m1 \<Rightarrow> m1 \<le> n1 | \<infinity> \<Rightarrow> False)
haftmann@27110
   320
    | \<infinity> \<Rightarrow> True)"
oheimb@11351
   321
blanchet@38167
   322
definition [nitpick_simp]:
hoelzl@43924
   323
  "m < n = (case m of enat m1 \<Rightarrow> (case n of enat n1 \<Rightarrow> m1 < n1 | \<infinity> \<Rightarrow> True)
haftmann@27110
   324
    | \<infinity> \<Rightarrow> False)"
oheimb@11351
   325
hoelzl@43919
   326
lemma enat_ord_simps [simp]:
hoelzl@43924
   327
  "enat m \<le> enat n \<longleftrightarrow> m \<le> n"
hoelzl@43924
   328
  "enat m < enat n \<longleftrightarrow> m < n"
hoelzl@43921
   329
  "q \<le> (\<infinity>::enat)"
hoelzl@43921
   330
  "q < (\<infinity>::enat) \<longleftrightarrow> q \<noteq> \<infinity>"
hoelzl@43921
   331
  "(\<infinity>::enat) \<le> q \<longleftrightarrow> q = \<infinity>"
hoelzl@43921
   332
  "(\<infinity>::enat) < q \<longleftrightarrow> False"
hoelzl@43919
   333
  by (simp_all add: less_eq_enat_def less_enat_def split: enat.splits)
oheimb@11351
   334
huffman@47108
   335
lemma numeral_le_enat_iff[simp]:
huffman@47108
   336
  shows "numeral m \<le> enat n \<longleftrightarrow> numeral m \<le> n"
huffman@47108
   337
by (auto simp: numeral_eq_enat)
noschinl@45934
   338
huffman@47108
   339
lemma numeral_less_enat_iff[simp]:
huffman@47108
   340
  shows "numeral m < enat n \<longleftrightarrow> numeral m < n"
huffman@47108
   341
by (auto simp: numeral_eq_enat)
noschinl@45934
   342
hoelzl@43919
   343
lemma enat_ord_code [code]:
hoelzl@43924
   344
  "enat m \<le> enat n \<longleftrightarrow> m \<le> n"
hoelzl@43924
   345
  "enat m < enat n \<longleftrightarrow> m < n"
hoelzl@43921
   346
  "q \<le> (\<infinity>::enat) \<longleftrightarrow> True"
hoelzl@43924
   347
  "enat m < \<infinity> \<longleftrightarrow> True"
hoelzl@43924
   348
  "\<infinity> \<le> enat n \<longleftrightarrow> False"
hoelzl@43921
   349
  "(\<infinity>::enat) < q \<longleftrightarrow> False"
haftmann@27110
   350
  by simp_all
oheimb@11351
   351
haftmann@27110
   352
instance by default
hoelzl@43919
   353
  (auto simp add: less_eq_enat_def less_enat_def plus_enat_def split: enat.splits)
oheimb@11351
   354
haftmann@27110
   355
end
haftmann@27110
   356
hoelzl@43919
   357
instance enat :: ordered_comm_semiring
huffman@29014
   358
proof
hoelzl@43919
   359
  fix a b c :: enat
huffman@29014
   360
  assume "a \<le> b" and "0 \<le> c"
huffman@29014
   361
  thus "c * a \<le> c * b"
hoelzl@43919
   362
    unfolding times_enat_def less_eq_enat_def zero_enat_def
hoelzl@43919
   363
    by (simp split: enat.splits)
huffman@29014
   364
qed
huffman@29014
   365
huffman@47108
   366
(* BH: These equations are already proven generally for any type in
huffman@47108
   367
class linordered_semidom. However, enat is not in that class because
huffman@47108
   368
it does not have the cancellation property. Would it be worthwhile to
huffman@47108
   369
a generalize linordered_semidom to a new class that includes enat? *)
huffman@47108
   370
hoelzl@43919
   371
lemma enat_ord_number [simp]:
huffman@47108
   372
  "(numeral m \<Colon> enat) \<le> numeral n \<longleftrightarrow> (numeral m \<Colon> nat) \<le> numeral n"
huffman@47108
   373
  "(numeral m \<Colon> enat) < numeral n \<longleftrightarrow> (numeral m \<Colon> nat) < numeral n"
huffman@47108
   374
  by (simp_all add: numeral_eq_enat)
oheimb@11351
   375
hoelzl@43919
   376
lemma i0_lb [simp]: "(0\<Colon>enat) \<le> n"
hoelzl@43919
   377
  by (simp add: zero_enat_def less_eq_enat_def split: enat.splits)
oheimb@11351
   378
hoelzl@43919
   379
lemma ile0_eq [simp]: "n \<le> (0\<Colon>enat) \<longleftrightarrow> n = 0"
hoelzl@43919
   380
  by (simp add: zero_enat_def less_eq_enat_def split: enat.splits)
oheimb@11351
   381
huffman@44019
   382
lemma infinity_ileE [elim!]: "\<infinity> \<le> enat m \<Longrightarrow> R"
huffman@44019
   383
  by (simp add: zero_enat_def less_eq_enat_def split: enat.splits)
huffman@44019
   384
huffman@44019
   385
lemma infinity_ilessE [elim!]: "\<infinity> < enat m \<Longrightarrow> R"
haftmann@27110
   386
  by simp
oheimb@11351
   387
hoelzl@43919
   388
lemma not_iless0 [simp]: "\<not> n < (0\<Colon>enat)"
hoelzl@43919
   389
  by (simp add: zero_enat_def less_enat_def split: enat.splits)
haftmann@27110
   390
hoelzl@43919
   391
lemma i0_less [simp]: "(0\<Colon>enat) < n \<longleftrightarrow> n \<noteq> 0"
huffman@44019
   392
  by (simp add: zero_enat_def less_enat_def split: enat.splits)
oheimb@11351
   393
huffman@44019
   394
lemma eSuc_ile_mono [simp]: "eSuc n \<le> eSuc m \<longleftrightarrow> n \<le> m"
huffman@44019
   395
  by (simp add: eSuc_def less_eq_enat_def split: enat.splits)
haftmann@27110
   396
 
huffman@44019
   397
lemma eSuc_mono [simp]: "eSuc n < eSuc m \<longleftrightarrow> n < m"
huffman@44019
   398
  by (simp add: eSuc_def less_enat_def split: enat.splits)
oheimb@11351
   399
huffman@44019
   400
lemma ile_eSuc [simp]: "n \<le> eSuc n"
huffman@44019
   401
  by (simp add: eSuc_def less_eq_enat_def split: enat.splits)
oheimb@11351
   402
huffman@44019
   403
lemma not_eSuc_ilei0 [simp]: "\<not> eSuc n \<le> 0"
huffman@44019
   404
  by (simp add: zero_enat_def eSuc_def less_eq_enat_def split: enat.splits)
haftmann@27110
   405
huffman@44019
   406
lemma i0_iless_eSuc [simp]: "0 < eSuc n"
huffman@44019
   407
  by (simp add: zero_enat_def eSuc_def less_enat_def split: enat.splits)
haftmann@27110
   408
huffman@44019
   409
lemma iless_eSuc0[simp]: "(n < eSuc 0) = (n = 0)"
huffman@44019
   410
  by (simp add: zero_enat_def eSuc_def less_enat_def split: enat.split)
nipkow@41853
   411
huffman@44019
   412
lemma ileI1: "m < n \<Longrightarrow> eSuc m \<le> n"
huffman@44019
   413
  by (simp add: eSuc_def less_eq_enat_def less_enat_def split: enat.splits)
haftmann@27110
   414
hoelzl@43924
   415
lemma Suc_ile_eq: "enat (Suc m) \<le> n \<longleftrightarrow> enat m < n"
haftmann@27110
   416
  by (cases n) auto
haftmann@27110
   417
huffman@44019
   418
lemma iless_Suc_eq [simp]: "enat m < eSuc n \<longleftrightarrow> enat m \<le> n"
huffman@44019
   419
  by (auto simp add: eSuc_def less_enat_def split: enat.splits)
oheimb@11351
   420
huffman@44019
   421
lemma imult_infinity: "(0::enat) < n \<Longrightarrow> \<infinity> * n = \<infinity>"
huffman@44019
   422
  by (simp add: zero_enat_def less_enat_def split: enat.splits)
nipkow@41853
   423
huffman@44019
   424
lemma imult_infinity_right: "(0::enat) < n \<Longrightarrow> n * \<infinity> = \<infinity>"
huffman@44019
   425
  by (simp add: zero_enat_def less_enat_def split: enat.splits)
nipkow@41853
   426
hoelzl@43919
   427
lemma enat_0_less_mult_iff: "(0 < (m::enat) * n) = (0 < m \<and> 0 < n)"
huffman@44019
   428
  by (simp only: i0_less imult_is_0, simp)
nipkow@41853
   429
huffman@44019
   430
lemma mono_eSuc: "mono eSuc"
huffman@44019
   431
  by (simp add: mono_def)
nipkow@41853
   432
nipkow@41853
   433
hoelzl@43919
   434
lemma min_enat_simps [simp]:
hoelzl@43924
   435
  "min (enat m) (enat n) = enat (min m n)"
haftmann@27110
   436
  "min q 0 = 0"
haftmann@27110
   437
  "min 0 q = 0"
hoelzl@43921
   438
  "min q (\<infinity>::enat) = q"
hoelzl@43921
   439
  "min (\<infinity>::enat) q = q"
haftmann@27110
   440
  by (auto simp add: min_def)
oheimb@11351
   441
hoelzl@43919
   442
lemma max_enat_simps [simp]:
hoelzl@43924
   443
  "max (enat m) (enat n) = enat (max m n)"
haftmann@27110
   444
  "max q 0 = q"
haftmann@27110
   445
  "max 0 q = q"
hoelzl@43921
   446
  "max q \<infinity> = (\<infinity>::enat)"
hoelzl@43921
   447
  "max \<infinity> q = (\<infinity>::enat)"
haftmann@27110
   448
  by (simp_all add: max_def)
haftmann@27110
   449
hoelzl@43924
   450
lemma enat_ile: "n \<le> enat m \<Longrightarrow> \<exists>k. n = enat k"
haftmann@27110
   451
  by (cases n) simp_all
haftmann@27110
   452
hoelzl@43924
   453
lemma enat_iless: "n < enat m \<Longrightarrow> \<exists>k. n = enat k"
haftmann@27110
   454
  by (cases n) simp_all
oheimb@11351
   455
hoelzl@43924
   456
lemma chain_incr: "\<forall>i. \<exists>j. Y i < Y j ==> \<exists>j. enat k < Y j"
nipkow@25134
   457
apply (induct_tac k)
hoelzl@43924
   458
 apply (simp (no_asm) only: enat_0)
haftmann@27110
   459
 apply (fast intro: le_less_trans [OF i0_lb])
nipkow@25134
   460
apply (erule exE)
nipkow@25134
   461
apply (drule spec)
nipkow@25134
   462
apply (erule exE)
nipkow@25134
   463
apply (drule ileI1)
huffman@44019
   464
apply (rule eSuc_enat [THEN subst])
nipkow@25134
   465
apply (rule exI)
haftmann@27110
   466
apply (erule (1) le_less_trans)
nipkow@25134
   467
done
oheimb@11351
   468
haftmann@52729
   469
instantiation enat :: "{order_bot, order_top}"
haftmann@29337
   470
begin
haftmann@29337
   471
hoelzl@43919
   472
definition bot_enat :: enat where
hoelzl@43919
   473
  "bot_enat = 0"
haftmann@29337
   474
hoelzl@43919
   475
definition top_enat :: enat where
hoelzl@43919
   476
  "top_enat = \<infinity>"
haftmann@29337
   477
haftmann@29337
   478
instance proof
hoelzl@43919
   479
qed (simp_all add: bot_enat_def top_enat_def)
haftmann@29337
   480
haftmann@29337
   481
end
haftmann@29337
   482
hoelzl@43924
   483
lemma finite_enat_bounded:
hoelzl@43924
   484
  assumes le_fin: "\<And>y. y \<in> A \<Longrightarrow> y \<le> enat n"
noschinl@42993
   485
  shows "finite A"
noschinl@42993
   486
proof (rule finite_subset)
hoelzl@43924
   487
  show "finite (enat ` {..n})" by blast
noschinl@42993
   488
nipkow@44890
   489
  have "A \<subseteq> {..enat n}" using le_fin by fastforce
hoelzl@43924
   490
  also have "\<dots> \<subseteq> enat ` {..n}"
noschinl@42993
   491
    by (rule subsetI) (case_tac x, auto)
hoelzl@43924
   492
  finally show "A \<subseteq> enat ` {..n}" .
noschinl@42993
   493
qed
noschinl@42993
   494
huffman@26089
   495
huffman@45775
   496
subsection {* Cancellation simprocs *}
huffman@45775
   497
huffman@45775
   498
lemma enat_add_left_cancel: "a + b = a + c \<longleftrightarrow> a = (\<infinity>::enat) \<or> b = c"
huffman@45775
   499
  unfolding plus_enat_def by (simp split: enat.split)
huffman@45775
   500
huffman@45775
   501
lemma enat_add_left_cancel_le: "a + b \<le> a + c \<longleftrightarrow> a = (\<infinity>::enat) \<or> b \<le> c"
huffman@45775
   502
  unfolding plus_enat_def by (simp split: enat.split)
huffman@45775
   503
huffman@45775
   504
lemma enat_add_left_cancel_less: "a + b < a + c \<longleftrightarrow> a \<noteq> (\<infinity>::enat) \<and> b < c"
huffman@45775
   505
  unfolding plus_enat_def by (simp split: enat.split)
huffman@45775
   506
huffman@45775
   507
ML {*
huffman@45775
   508
structure Cancel_Enat_Common =
huffman@45775
   509
struct
huffman@45775
   510
  (* copied from src/HOL/Tools/nat_numeral_simprocs.ML *)
huffman@45775
   511
  fun find_first_t _    _ []         = raise TERM("find_first_t", [])
huffman@45775
   512
    | find_first_t past u (t::terms) =
huffman@45775
   513
          if u aconv t then (rev past @ terms)
huffman@45775
   514
          else find_first_t (t::past) u terms
huffman@45775
   515
huffman@51366
   516
  fun dest_summing (Const (@{const_name Groups.plus}, _) $ t $ u, ts) =
huffman@51366
   517
        dest_summing (t, dest_summing (u, ts))
huffman@51366
   518
    | dest_summing (t, ts) = t :: ts
huffman@51366
   519
huffman@45775
   520
  val mk_sum = Arith_Data.long_mk_sum
huffman@51366
   521
  fun dest_sum t = dest_summing (t, [])
huffman@45775
   522
  val find_first = find_first_t []
huffman@45775
   523
  val trans_tac = Numeral_Simprocs.trans_tac
wenzelm@51717
   524
  val norm_ss =
wenzelm@51717
   525
    simpset_of (put_simpset HOL_basic_ss @{context}
haftmann@57514
   526
      addsimps @{thms ac_simps add_0_left add_0_right})
wenzelm@51717
   527
  fun norm_tac ctxt = ALLGOALS (simp_tac (put_simpset norm_ss ctxt))
wenzelm@51717
   528
  fun simplify_meta_eq ctxt cancel_th th =
wenzelm@51717
   529
    Arith_Data.simplify_meta_eq [] ctxt
huffman@45775
   530
      ([th, cancel_th] MRS trans)
huffman@45775
   531
  fun mk_eq (a, b) = HOLogic.mk_Trueprop (HOLogic.mk_eq (a, b))
huffman@45775
   532
end
huffman@45775
   533
huffman@45775
   534
structure Eq_Enat_Cancel = ExtractCommonTermFun
huffman@45775
   535
(open Cancel_Enat_Common
huffman@45775
   536
  val mk_bal = HOLogic.mk_eq
huffman@45775
   537
  val dest_bal = HOLogic.dest_bin @{const_name HOL.eq} @{typ enat}
huffman@45775
   538
  fun simp_conv _ _ = SOME @{thm enat_add_left_cancel}
huffman@45775
   539
)
huffman@45775
   540
huffman@45775
   541
structure Le_Enat_Cancel = ExtractCommonTermFun
huffman@45775
   542
(open Cancel_Enat_Common
huffman@45775
   543
  val mk_bal = HOLogic.mk_binrel @{const_name Orderings.less_eq}
huffman@45775
   544
  val dest_bal = HOLogic.dest_bin @{const_name Orderings.less_eq} @{typ enat}
huffman@45775
   545
  fun simp_conv _ _ = SOME @{thm enat_add_left_cancel_le}
huffman@45775
   546
)
huffman@45775
   547
huffman@45775
   548
structure Less_Enat_Cancel = ExtractCommonTermFun
huffman@45775
   549
(open Cancel_Enat_Common
huffman@45775
   550
  val mk_bal = HOLogic.mk_binrel @{const_name Orderings.less}
huffman@45775
   551
  val dest_bal = HOLogic.dest_bin @{const_name Orderings.less} @{typ enat}
huffman@45775
   552
  fun simp_conv _ _ = SOME @{thm enat_add_left_cancel_less}
huffman@45775
   553
)
huffman@45775
   554
*}
huffman@45775
   555
huffman@45775
   556
simproc_setup enat_eq_cancel
huffman@45775
   557
  ("(l::enat) + m = n" | "(l::enat) = m + n") =
wenzelm@51717
   558
  {* fn phi => fn ctxt => fn ct => Eq_Enat_Cancel.proc ctxt (term_of ct) *}
huffman@45775
   559
huffman@45775
   560
simproc_setup enat_le_cancel
huffman@45775
   561
  ("(l::enat) + m \<le> n" | "(l::enat) \<le> m + n") =
wenzelm@51717
   562
  {* fn phi => fn ctxt => fn ct => Le_Enat_Cancel.proc ctxt (term_of ct) *}
huffman@45775
   563
huffman@45775
   564
simproc_setup enat_less_cancel
huffman@45775
   565
  ("(l::enat) + m < n" | "(l::enat) < m + n") =
wenzelm@51717
   566
  {* fn phi => fn ctxt => fn ct => Less_Enat_Cancel.proc ctxt (term_of ct) *}
huffman@45775
   567
huffman@45775
   568
text {* TODO: add regression tests for these simprocs *}
huffman@45775
   569
huffman@45775
   570
text {* TODO: add simprocs for combining and cancelling numerals *}
huffman@45775
   571
haftmann@27110
   572
subsection {* Well-ordering *}
huffman@26089
   573
hoelzl@43924
   574
lemma less_enatE:
hoelzl@43924
   575
  "[| n < enat m; !!k. n = enat k ==> k < m ==> P |] ==> P"
huffman@26089
   576
by (induct n) auto
huffman@26089
   577
huffman@44019
   578
lemma less_infinityE:
hoelzl@43924
   579
  "[| n < \<infinity>; !!k. n = enat k ==> P |] ==> P"
huffman@26089
   580
by (induct n) auto
huffman@26089
   581
hoelzl@43919
   582
lemma enat_less_induct:
hoelzl@43919
   583
  assumes prem: "!!n. \<forall>m::enat. m < n --> P m ==> P n" shows "P n"
huffman@26089
   584
proof -
hoelzl@43924
   585
  have P_enat: "!!k. P (enat k)"
huffman@26089
   586
    apply (rule nat_less_induct)
huffman@26089
   587
    apply (rule prem, clarify)
hoelzl@43924
   588
    apply (erule less_enatE, simp)
huffman@26089
   589
    done
huffman@26089
   590
  show ?thesis
huffman@26089
   591
  proof (induct n)
huffman@26089
   592
    fix nat
hoelzl@43924
   593
    show "P (enat nat)" by (rule P_enat)
huffman@26089
   594
  next
hoelzl@43921
   595
    show "P \<infinity>"
huffman@26089
   596
      apply (rule prem, clarify)
huffman@44019
   597
      apply (erule less_infinityE)
hoelzl@43924
   598
      apply (simp add: P_enat)
huffman@26089
   599
      done
huffman@26089
   600
  qed
huffman@26089
   601
qed
huffman@26089
   602
hoelzl@43919
   603
instance enat :: wellorder
huffman@26089
   604
proof
haftmann@27823
   605
  fix P and n
hoelzl@43919
   606
  assume hyp: "(\<And>n\<Colon>enat. (\<And>m\<Colon>enat. m < n \<Longrightarrow> P m) \<Longrightarrow> P n)"
hoelzl@43919
   607
  show "P n" by (blast intro: enat_less_induct hyp)
huffman@26089
   608
qed
huffman@26089
   609
noschinl@42993
   610
subsection {* Complete Lattice *}
noschinl@42993
   611
hoelzl@54415
   612
text {* TODO: enat as order topology? *}
hoelzl@54415
   613
hoelzl@43919
   614
instantiation enat :: complete_lattice
noschinl@42993
   615
begin
noschinl@42993
   616
hoelzl@43919
   617
definition inf_enat :: "enat \<Rightarrow> enat \<Rightarrow> enat" where
wenzelm@56777
   618
  "inf_enat = min"
noschinl@42993
   619
hoelzl@43919
   620
definition sup_enat :: "enat \<Rightarrow> enat \<Rightarrow> enat" where
wenzelm@56777
   621
  "sup_enat = max"
noschinl@42993
   622
hoelzl@43919
   623
definition Inf_enat :: "enat set \<Rightarrow> enat" where
wenzelm@56777
   624
  "Inf_enat A = (if A = {} then \<infinity> else (LEAST x. x \<in> A))"
noschinl@42993
   625
hoelzl@43919
   626
definition Sup_enat :: "enat set \<Rightarrow> enat" where
wenzelm@56777
   627
  "Sup_enat A = (if A = {} then 0 else if finite A then Max A else \<infinity>)"
wenzelm@56777
   628
instance
wenzelm@56777
   629
proof
hoelzl@43919
   630
  fix x :: "enat" and A :: "enat set"
noschinl@42993
   631
  { assume "x \<in> A" then show "Inf A \<le> x"
hoelzl@43919
   632
      unfolding Inf_enat_def by (auto intro: Least_le) }
noschinl@42993
   633
  { assume "\<And>y. y \<in> A \<Longrightarrow> x \<le> y" then show "x \<le> Inf A"
hoelzl@43919
   634
      unfolding Inf_enat_def
noschinl@42993
   635
      by (cases "A = {}") (auto intro: LeastI2_ex) }
noschinl@42993
   636
  { assume "x \<in> A" then show "x \<le> Sup A"
hoelzl@43919
   637
      unfolding Sup_enat_def by (cases "finite A") auto }
noschinl@42993
   638
  { assume "\<And>y. y \<in> A \<Longrightarrow> y \<le> x" then show "Sup A \<le> x"
hoelzl@43924
   639
      unfolding Sup_enat_def using finite_enat_bounded by auto }
haftmann@52729
   640
qed (simp_all add:
haftmann@52729
   641
 inf_enat_def sup_enat_def bot_enat_def top_enat_def Inf_enat_def Sup_enat_def)
noschinl@42993
   642
end
noschinl@42993
   643
hoelzl@43978
   644
instance enat :: complete_linorder ..
haftmann@27110
   645
haftmann@27110
   646
subsection {* Traditional theorem names *}
haftmann@27110
   647
huffman@47108
   648
lemmas enat_defs = zero_enat_def one_enat_def eSuc_def
hoelzl@43919
   649
  plus_enat_def less_eq_enat_def less_enat_def
haftmann@27110
   650
oheimb@11351
   651
end