src/HOL/Library/Nat_Infinity.thy
author haftmann
Fri, 20 Aug 2010 17:46:56 +0200
changeset 38621 d6cb7e625d75
parent 38167 ab528533db92
child 41853 258a489c24b2
permissions -rw-r--r--
more concise characterization of of_nat operation and class semiring_char_0
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
11355
wenzelm
parents: 11351
diff changeset
     1
(*  Title:      HOL/Library/Nat_Infinity.thy
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
     2
    Author:     David von Oheimb, TU Muenchen;  Florian Haftmann, TU Muenchen
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
     3
*)
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
     4
14706
71590b7733b7 tuned document;
wenzelm
parents: 14691
diff changeset
     5
header {* Natural numbers with infinity *}
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 14981
diff changeset
     7
theory Nat_Infinity
30663
0b6aff7451b2 Main is (Complex_Main) base entry point in library theories
haftmann
parents: 29668
diff changeset
     8
imports Main
15131
c69542757a4d New theory header syntax.
nipkow
parents: 14981
diff changeset
     9
begin
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    10
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    11
subsection {* Type definition *}
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    12
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    13
text {*
11355
wenzelm
parents: 11351
diff changeset
    14
  We extend the standard natural numbers by a special value indicating
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    15
  infinity.
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    16
*}
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    17
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    18
datatype inat = Fin nat | Infty
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    19
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 19736
diff changeset
    20
notation (xsymbols)
19736
wenzelm
parents: 15140
diff changeset
    21
  Infty  ("\<infinity>")
wenzelm
parents: 15140
diff changeset
    22
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 19736
diff changeset
    23
notation (HTML output)
19736
wenzelm
parents: 15140
diff changeset
    24
  Infty  ("\<infinity>")
wenzelm
parents: 15140
diff changeset
    25
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    26
31084
f4db921165ce fixed HOLCF proofs
nipkow
parents: 31077
diff changeset
    27
lemma not_Infty_eq[iff]: "(x ~= Infty) = (EX i. x = Fin i)"
f4db921165ce fixed HOLCF proofs
nipkow
parents: 31077
diff changeset
    28
by (cases x) auto
f4db921165ce fixed HOLCF proofs
nipkow
parents: 31077
diff changeset
    29
f4db921165ce fixed HOLCF proofs
nipkow
parents: 31077
diff changeset
    30
lemma not_Fin_eq [iff]: "(ALL y. x ~= Fin y) = (x = Infty)"
31077
28dd6fd3d184 more lemmas
nipkow
parents: 30663
diff changeset
    31
by (cases x) auto
28dd6fd3d184 more lemmas
nipkow
parents: 30663
diff changeset
    32
28dd6fd3d184 more lemmas
nipkow
parents: 30663
diff changeset
    33
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    34
subsection {* Constructors and numbers *}
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    35
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    36
instantiation inat :: "{zero, one, number}"
25594
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    37
begin
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    38
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    39
definition
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    40
  "0 = Fin 0"
25594
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    41
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    42
definition
32069
6d28bbd33e2c prefer code_inline over code_unfold; use code_unfold_post where appropriate
haftmann
parents: 31998
diff changeset
    43
  [code_unfold]: "1 = Fin 1"
25594
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    44
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    45
definition
32069
6d28bbd33e2c prefer code_inline over code_unfold; use code_unfold_post where appropriate
haftmann
parents: 31998
diff changeset
    46
  [code_unfold, code del]: "number_of k = Fin (number_of k)"
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    47
25594
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    48
instance ..
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    49
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    50
end
43c718438f9f switched import from Main to PreList
haftmann
parents: 25134
diff changeset
    51
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    52
definition iSuc :: "inat \<Rightarrow> inat" where
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    53
  "iSuc i = (case i of Fin n \<Rightarrow> Fin (Suc n) | \<infinity> \<Rightarrow> \<infinity>)"
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    54
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    55
lemma Fin_0: "Fin 0 = 0"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    56
  by (simp add: zero_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    57
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    58
lemma Fin_1: "Fin 1 = 1"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    59
  by (simp add: one_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    60
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    61
lemma Fin_number: "Fin (number_of k) = number_of k"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    62
  by (simp add: number_of_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    63
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    64
lemma one_iSuc: "1 = iSuc 0"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    65
  by (simp add: zero_inat_def one_inat_def iSuc_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    66
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    67
lemma Infty_ne_i0 [simp]: "\<infinity> \<noteq> 0"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    68
  by (simp add: zero_inat_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    69
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    70
lemma i0_ne_Infty [simp]: "0 \<noteq> \<infinity>"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    71
  by (simp add: zero_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    72
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    73
lemma zero_inat_eq [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    74
  "number_of k = (0\<Colon>inat) \<longleftrightarrow> number_of k = (0\<Colon>nat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    75
  "(0\<Colon>inat) = number_of k \<longleftrightarrow> number_of k = (0\<Colon>nat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    76
  unfolding zero_inat_def number_of_inat_def by simp_all
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    77
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    78
lemma one_inat_eq [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    79
  "number_of k = (1\<Colon>inat) \<longleftrightarrow> number_of k = (1\<Colon>nat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    80
  "(1\<Colon>inat) = number_of k \<longleftrightarrow> number_of k = (1\<Colon>nat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    81
  unfolding one_inat_def number_of_inat_def by simp_all
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    82
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    83
lemma zero_one_inat_neq [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    84
  "\<not> 0 = (1\<Colon>inat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    85
  "\<not> 1 = (0\<Colon>inat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    86
  unfolding zero_inat_def one_inat_def by simp_all
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
    87
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    88
lemma Infty_ne_i1 [simp]: "\<infinity> \<noteq> 1"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    89
  by (simp add: one_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    90
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    91
lemma i1_ne_Infty [simp]: "1 \<noteq> \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    92
  by (simp add: one_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    93
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    94
lemma Infty_ne_number [simp]: "\<infinity> \<noteq> number_of k"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    95
  by (simp add: number_of_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    96
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    97
lemma number_ne_Infty [simp]: "number_of k \<noteq> \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    98
  by (simp add: number_of_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
    99
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   100
lemma iSuc_Fin: "iSuc (Fin n) = Fin (Suc n)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   101
  by (simp add: iSuc_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   102
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   103
lemma iSuc_number_of: "iSuc (number_of k) = Fin (Suc (number_of k))"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   104
  by (simp add: iSuc_Fin number_of_inat_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   105
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   106
lemma iSuc_Infty [simp]: "iSuc \<infinity> = \<infinity>"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   107
  by (simp add: iSuc_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   108
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   109
lemma iSuc_ne_0 [simp]: "iSuc n \<noteq> 0"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   110
  by (simp add: iSuc_def zero_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   111
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   112
lemma zero_ne_iSuc [simp]: "0 \<noteq> iSuc n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   113
  by (rule iSuc_ne_0 [symmetric])
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   114
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   115
lemma iSuc_inject [simp]: "iSuc m = iSuc n \<longleftrightarrow> m = n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   116
  by (simp add: iSuc_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   117
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   118
lemma number_of_inat_inject [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   119
  "(number_of k \<Colon> inat) = number_of l \<longleftrightarrow> (number_of k \<Colon> nat) = number_of l"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   120
  by (simp add: number_of_inat_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   121
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   122
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   123
subsection {* Addition *}
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   124
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   125
instantiation inat :: comm_monoid_add
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   126
begin
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   127
38167
ab528533db92 help Nitpick
blanchet
parents: 37765
diff changeset
   128
definition [nitpick_simp]:
37765
26bdfb7b680b dropped superfluous [code del]s
haftmann
parents: 35028
diff changeset
   129
  "m + n = (case m of \<infinity> \<Rightarrow> \<infinity> | Fin m \<Rightarrow> (case n of \<infinity> \<Rightarrow> \<infinity> | Fin n \<Rightarrow> Fin (m + n)))"
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   130
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   131
lemma plus_inat_simps [simp, code]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   132
  "Fin m + Fin n = Fin (m + n)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   133
  "\<infinity> + q = \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   134
  "q + \<infinity> = \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   135
  by (simp_all add: plus_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   136
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   137
instance proof
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   138
  fix n m q :: inat
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   139
  show "n + m + q = n + (m + q)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   140
    by (cases n, auto, cases m, auto, cases q, auto)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   141
  show "n + m = m + n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   142
    by (cases n, auto, cases m, auto)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   143
  show "0 + n = n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   144
    by (cases n) (simp_all add: zero_inat_def)
26089
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   145
qed
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   146
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   147
end
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   148
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   149
lemma plus_inat_0 [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   150
  "0 + (q\<Colon>inat) = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   151
  "(q\<Colon>inat) + 0 = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   152
  by (simp_all add: plus_inat_def zero_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   153
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   154
lemma plus_inat_number [simp]:
29012
9140227dc8c5 change lemmas to avoid using neg
huffman
parents: 28562
diff changeset
   155
  "(number_of k \<Colon> inat) + number_of l = (if k < Int.Pls then number_of l
9140227dc8c5 change lemmas to avoid using neg
huffman
parents: 28562
diff changeset
   156
    else if l < Int.Pls then number_of k else number_of (k + l))"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   157
  unfolding number_of_inat_def plus_inat_simps nat_arith(1) if_distrib [symmetric, of _ Fin] ..
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   158
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   159
lemma iSuc_number [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   160
  "iSuc (number_of k) = (if neg (number_of k \<Colon> int) then 1 else number_of (Int.succ k))"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   161
  unfolding iSuc_number_of
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   162
  unfolding one_inat_def number_of_inat_def Suc_nat_number_of if_distrib [symmetric] ..
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   163
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   164
lemma iSuc_plus_1:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   165
  "iSuc n = n + 1"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   166
  by (cases n) (simp_all add: iSuc_Fin one_inat_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   167
  
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   168
lemma plus_1_iSuc:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   169
  "1 + q = iSuc q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   170
  "q + 1 = iSuc q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   171
  unfolding iSuc_plus_1 by (simp_all add: add_ac)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   172
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   173
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   174
subsection {* Multiplication *}
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   175
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   176
instantiation inat :: comm_semiring_1
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   177
begin
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   178
38167
ab528533db92 help Nitpick
blanchet
parents: 37765
diff changeset
   179
definition times_inat_def [nitpick_simp]:
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   180
  "m * n = (case m of \<infinity> \<Rightarrow> if n = 0 then 0 else \<infinity> | Fin m \<Rightarrow>
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   181
    (case n of \<infinity> \<Rightarrow> if m = 0 then 0 else \<infinity> | Fin n \<Rightarrow> Fin (m * n)))"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   182
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   183
lemma times_inat_simps [simp, code]:
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   184
  "Fin m * Fin n = Fin (m * n)"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   185
  "\<infinity> * \<infinity> = \<infinity>"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   186
  "\<infinity> * Fin n = (if n = 0 then 0 else \<infinity>)"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   187
  "Fin m * \<infinity> = (if m = 0 then 0 else \<infinity>)"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   188
  unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   189
  by (simp_all split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   190
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   191
instance proof
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   192
  fix a b c :: inat
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   193
  show "(a * b) * c = a * (b * c)"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   194
    unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   195
    by (simp split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   196
  show "a * b = b * a"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   197
    unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   198
    by (simp split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   199
  show "1 * a = a"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   200
    unfolding times_inat_def zero_inat_def one_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   201
    by (simp split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   202
  show "(a + b) * c = a * c + b * c"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   203
    unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   204
    by (simp split: inat.split add: left_distrib)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   205
  show "0 * a = 0"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   206
    unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   207
    by (simp split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   208
  show "a * 0 = 0"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   209
    unfolding times_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   210
    by (simp split: inat.split)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   211
  show "(0::inat) \<noteq> 1"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   212
    unfolding zero_inat_def one_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   213
    by simp
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   214
qed
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   215
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   216
end
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   217
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   218
lemma mult_iSuc: "iSuc m * n = n + m * n"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29337
diff changeset
   219
  unfolding iSuc_plus_1 by (simp add: algebra_simps)
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   220
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   221
lemma mult_iSuc_right: "m * iSuc n = m + m * n"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29337
diff changeset
   222
  unfolding iSuc_plus_1 by (simp add: algebra_simps)
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   223
29023
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   224
lemma of_nat_eq_Fin: "of_nat n = Fin n"
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   225
  apply (induct n)
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   226
  apply (simp add: Fin_0)
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   227
  apply (simp add: plus_1_iSuc iSuc_Fin)
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   228
  done
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   229
38621
d6cb7e625d75 more concise characterization of of_nat operation and class semiring_char_0
haftmann
parents: 38167
diff changeset
   230
instance inat :: semiring_char_0 proof
d6cb7e625d75 more concise characterization of of_nat operation and class semiring_char_0
haftmann
parents: 38167
diff changeset
   231
  have "inj Fin" by (rule injI) simp
d6cb7e625d75 more concise characterization of of_nat operation and class semiring_char_0
haftmann
parents: 38167
diff changeset
   232
  then show "inj (\<lambda>n. of_nat n :: inat)" by (simp add: of_nat_eq_Fin)
d6cb7e625d75 more concise characterization of of_nat operation and class semiring_char_0
haftmann
parents: 38167
diff changeset
   233
qed
29023
ef3adebc6d98 instance inat :: semiring_char_0
huffman
parents: 29014
diff changeset
   234
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   235
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   236
subsection {* Ordering *}
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   237
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 32069
diff changeset
   238
instantiation inat :: linordered_ab_semigroup_add
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   239
begin
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   240
38167
ab528533db92 help Nitpick
blanchet
parents: 37765
diff changeset
   241
definition [nitpick_simp]:
37765
26bdfb7b680b dropped superfluous [code del]s
haftmann
parents: 35028
diff changeset
   242
  "m \<le> n = (case n of Fin n1 \<Rightarrow> (case m of Fin m1 \<Rightarrow> m1 \<le> n1 | \<infinity> \<Rightarrow> False)
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   243
    | \<infinity> \<Rightarrow> True)"
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   244
38167
ab528533db92 help Nitpick
blanchet
parents: 37765
diff changeset
   245
definition [nitpick_simp]:
37765
26bdfb7b680b dropped superfluous [code del]s
haftmann
parents: 35028
diff changeset
   246
  "m < n = (case m of Fin m1 \<Rightarrow> (case n of Fin n1 \<Rightarrow> m1 < n1 | \<infinity> \<Rightarrow> True)
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   247
    | \<infinity> \<Rightarrow> False)"
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   248
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   249
lemma inat_ord_simps [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   250
  "Fin m \<le> Fin n \<longleftrightarrow> m \<le> n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   251
  "Fin m < Fin n \<longleftrightarrow> m < n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   252
  "q \<le> \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   253
  "q < \<infinity> \<longleftrightarrow> q \<noteq> \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   254
  "\<infinity> \<le> q \<longleftrightarrow> q = \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   255
  "\<infinity> < q \<longleftrightarrow> False"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   256
  by (simp_all add: less_eq_inat_def less_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   257
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   258
lemma inat_ord_code [code]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   259
  "Fin m \<le> Fin n \<longleftrightarrow> m \<le> n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   260
  "Fin m < Fin n \<longleftrightarrow> m < n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   261
  "q \<le> \<infinity> \<longleftrightarrow> True"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   262
  "Fin m < \<infinity> \<longleftrightarrow> True"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   263
  "\<infinity> \<le> Fin n \<longleftrightarrow> False"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   264
  "\<infinity> < q \<longleftrightarrow> False"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   265
  by simp_all
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   266
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   267
instance by default
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   268
  (auto simp add: less_eq_inat_def less_inat_def plus_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   269
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   270
end
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   271
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 32069
diff changeset
   272
instance inat :: ordered_comm_semiring
29014
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   273
proof
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   274
  fix a b c :: inat
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   275
  assume "a \<le> b" and "0 \<le> c"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   276
  thus "c * a \<le> c * b"
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   277
    unfolding times_inat_def less_eq_inat_def zero_inat_def
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   278
    by (simp split: inat.splits)
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   279
qed
e515f42d1db7 multiplication for type inat
huffman
parents: 29012
diff changeset
   280
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   281
lemma inat_ord_number [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   282
  "(number_of m \<Colon> inat) \<le> number_of n \<longleftrightarrow> (number_of m \<Colon> nat) \<le> number_of n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   283
  "(number_of m \<Colon> inat) < number_of n \<longleftrightarrow> (number_of m \<Colon> nat) < number_of n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   284
  by (simp_all add: number_of_inat_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   285
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   286
lemma i0_lb [simp]: "(0\<Colon>inat) \<le> n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   287
  by (simp add: zero_inat_def less_eq_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   288
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   289
lemma i0_neq [simp]: "n \<le> (0\<Colon>inat) \<longleftrightarrow> n = 0"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   290
  by (simp add: zero_inat_def less_eq_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   291
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   292
lemma Infty_ileE [elim!]: "\<infinity> \<le> Fin m \<Longrightarrow> R"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   293
  by (simp add: zero_inat_def less_eq_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   294
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   295
lemma Infty_ilessE [elim!]: "\<infinity> < Fin m \<Longrightarrow> R"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   296
  by simp
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   297
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   298
lemma not_ilessi0 [simp]: "\<not> n < (0\<Colon>inat)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   299
  by (simp add: zero_inat_def less_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   300
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   301
lemma i0_eq [simp]: "(0\<Colon>inat) < n \<longleftrightarrow> n \<noteq> 0"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   302
  by (simp add: zero_inat_def less_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   303
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   304
lemma iSuc_ile_mono [simp]: "iSuc n \<le> iSuc m \<longleftrightarrow> n \<le> m"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   305
  by (simp add: iSuc_def less_eq_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   306
 
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   307
lemma iSuc_mono [simp]: "iSuc n < iSuc m \<longleftrightarrow> n < m"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   308
  by (simp add: iSuc_def less_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   309
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   310
lemma ile_iSuc [simp]: "n \<le> iSuc n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   311
  by (simp add: iSuc_def less_eq_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   312
11355
wenzelm
parents: 11351
diff changeset
   313
lemma not_iSuc_ilei0 [simp]: "\<not> iSuc n \<le> 0"
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   314
  by (simp add: zero_inat_def iSuc_def less_eq_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   315
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   316
lemma i0_iless_iSuc [simp]: "0 < iSuc n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   317
  by (simp add: zero_inat_def iSuc_def less_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   318
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   319
lemma ileI1: "m < n \<Longrightarrow> iSuc m \<le> n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   320
  by (simp add: iSuc_def less_eq_inat_def less_inat_def split: inat.splits)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   321
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   322
lemma Suc_ile_eq: "Fin (Suc m) \<le> n \<longleftrightarrow> Fin m < n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   323
  by (cases n) auto
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   324
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   325
lemma iless_Suc_eq [simp]: "Fin m < iSuc n \<longleftrightarrow> Fin m \<le> n"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   326
  by (auto simp add: iSuc_def less_inat_def split: inat.splits)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   327
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   328
lemma min_inat_simps [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   329
  "min (Fin m) (Fin n) = Fin (min m n)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   330
  "min q 0 = 0"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   331
  "min 0 q = 0"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   332
  "min q \<infinity> = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   333
  "min \<infinity> q = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   334
  by (auto simp add: min_def)
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   335
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   336
lemma max_inat_simps [simp]:
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   337
  "max (Fin m) (Fin n) = Fin (max m n)"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   338
  "max q 0 = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   339
  "max 0 q = q"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   340
  "max q \<infinity> = \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   341
  "max \<infinity> q = \<infinity>"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   342
  by (simp_all add: max_def)
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   343
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   344
lemma Fin_ile: "n \<le> Fin m \<Longrightarrow> \<exists>k. n = Fin k"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   345
  by (cases n) simp_all
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   346
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   347
lemma Fin_iless: "n < Fin m \<Longrightarrow> \<exists>k. n = Fin k"
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   348
  by (cases n) simp_all
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   349
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   350
lemma chain_incr: "\<forall>i. \<exists>j. Y i < Y j ==> \<exists>j. Fin k < Y j"
25134
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   351
apply (induct_tac k)
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   352
 apply (simp (no_asm) only: Fin_0)
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   353
 apply (fast intro: le_less_trans [OF i0_lb])
25134
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   354
apply (erule exE)
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   355
apply (drule spec)
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   356
apply (erule exE)
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   357
apply (drule ileI1)
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   358
apply (rule iSuc_Fin [THEN subst])
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   359
apply (rule exI)
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   360
apply (erule (1) le_less_trans)
25134
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 25112
diff changeset
   361
done
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   362
29337
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   363
instantiation inat :: "{bot, top}"
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   364
begin
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   365
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   366
definition bot_inat :: inat where
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   367
  "bot_inat = 0"
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   368
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   369
definition top_inat :: inat where
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   370
  "top_inat = \<infinity>"
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   371
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   372
instance proof
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   373
qed (simp_all add: bot_inat_def top_inat_def)
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   374
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   375
end
450805a4a91f added instance for bot, top
haftmann
parents: 29023
diff changeset
   376
26089
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   377
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   378
subsection {* Well-ordering *}
26089
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   379
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   380
lemma less_FinE:
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   381
  "[| n < Fin m; !!k. n = Fin k ==> k < m ==> P |] ==> P"
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   382
by (induct n) auto
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   383
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   384
lemma less_InftyE:
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   385
  "[| n < Infty; !!k. n = Fin k ==> P |] ==> P"
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   386
by (induct n) auto
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   387
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   388
lemma inat_less_induct:
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   389
  assumes prem: "!!n. \<forall>m::inat. m < n --> P m ==> P n" shows "P n"
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   390
proof -
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   391
  have P_Fin: "!!k. P (Fin k)"
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   392
    apply (rule nat_less_induct)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   393
    apply (rule prem, clarify)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   394
    apply (erule less_FinE, simp)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   395
    done
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   396
  show ?thesis
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   397
  proof (induct n)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   398
    fix nat
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   399
    show "P (Fin nat)" by (rule P_Fin)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   400
  next
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   401
    show "P Infty"
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   402
      apply (rule prem, clarify)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   403
      apply (erule less_InftyE)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   404
      apply (simp add: P_Fin)
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   405
      done
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   406
  qed
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   407
qed
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   408
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   409
instance inat :: wellorder
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   410
proof
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27487
diff changeset
   411
  fix P and n
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27487
diff changeset
   412
  assume hyp: "(\<And>n\<Colon>inat. (\<And>m\<Colon>inat. m < n \<Longrightarrow> P m) \<Longrightarrow> P n)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27487
diff changeset
   413
  show "P n" by (blast intro: inat_less_induct hyp)
26089
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   414
qed
373221497340 proved linorder and wellorder class instances
huffman
parents: 25691
diff changeset
   415
27110
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   416
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   417
subsection {* Traditional theorem names *}
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   418
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   419
lemmas inat_defs = zero_inat_def one_inat_def number_of_inat_def iSuc_def
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   420
  plus_inat_def less_eq_inat_def less_inat_def
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   421
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   422
lemmas inat_splits = inat.splits
194aa674c2a1 refactoring; addition, numerals
haftmann
parents: 26089
diff changeset
   423
11351
c5c403d30c77 added Library/Nat_Infinity.thy and Library/Continuity.thy
oheimb
parents:
diff changeset
   424
end