src/ZF/Arith.thy
author wenzelm
Sun, 07 Oct 2007 21:19:31 +0200
changeset 24893 b8ef7afe3a6b
parent 16417 9bc16273c2d4
child 35762 af3ff2ba4c54
permissions -rw-r--r--
modernized specifications; removed legacy ML bindings;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
9654
9754ba005b64 X-symbols for ordinal, cardinal, integer arithmetic
paulson
parents: 9492
diff changeset
     1
(*  Title:      ZF/Arith.thy
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1478
2b8c2a7547ab expanded tabs
clasohm
parents: 1401
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1992  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
     8
(*"Difference" is subtraction of natural numbers.
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
     9
  There are no negative numbers; we have
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    10
     m #- n = 0  iff  m<=n   and     m #- n = succ(k) iff m>n.
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    11
  Also, rec(m, 0, %z w.z) is pred(m).   
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    12
*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    13
13328
703de709a64b better document preparation
paulson
parents: 13185
diff changeset
    14
header{*Arithmetic Operators and Their Definitions*} 
703de709a64b better document preparation
paulson
parents: 13185
diff changeset
    15
16417
9bc16273c2d4 migrated theory headers to new format
haftmann
parents: 15201
diff changeset
    16
theory Arith imports Univ begin
6070
032babd0120b ZF: the natural numbers as a datatype
paulson
parents: 3840
diff changeset
    17
13328
703de709a64b better document preparation
paulson
parents: 13185
diff changeset
    18
text{*Proofs about elementary arithmetic: addition, multiplication, etc.*}
703de709a64b better document preparation
paulson
parents: 13185
diff changeset
    19
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    20
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    21
  pred   :: "i=>i"    (*inverse of succ*)  where
13361
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
    22
    "pred(y) == nat_case(0, %x. x, y)"
6070
032babd0120b ZF: the natural numbers as a datatype
paulson
parents: 3840
diff changeset
    23
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    24
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    25
  natify :: "i=>i"    (*coerces non-nats to nats*)  where
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    26
    "natify == Vrecursor(%f a. if a = succ(pred(a)) then succ(f`pred(a))
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    27
                                                    else 0)"
6070
032babd0120b ZF: the natural numbers as a datatype
paulson
parents: 3840
diff changeset
    28
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    29
consts
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    30
  raw_add  :: "[i,i]=>i"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    31
  raw_diff  :: "[i,i]=>i"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    32
  raw_mult  :: "[i,i]=>i"
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    33
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    34
primrec
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    35
  "raw_add (0, n) = n"
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    36
  "raw_add (succ(m), n) = succ(raw_add(m, n))"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    37
6070
032babd0120b ZF: the natural numbers as a datatype
paulson
parents: 3840
diff changeset
    38
primrec
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    39
  raw_diff_0:     "raw_diff(m, 0) = m"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    40
  raw_diff_succ:  "raw_diff(m, succ(n)) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    41
                     nat_case(0, %x. x, raw_diff(m, n))"
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    42
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    43
primrec
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    44
  "raw_mult(0, n) = 0"
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    45
  "raw_mult(succ(m), n) = raw_add (n, raw_mult(m, n))"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    46
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    47
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    48
  add :: "[i,i]=>i"                    (infixl "#+" 65)  where
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    49
    "m #+ n == raw_add (natify(m), natify(n))"
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    50
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    51
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    52
  diff :: "[i,i]=>i"                    (infixl "#-" 65)  where
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    53
    "m #- n == raw_diff (natify(m), natify(n))"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    55
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    56
  mult :: "[i,i]=>i"                    (infixl "#*" 70)  where
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    57
    "m #* n == raw_mult (natify(m), natify(n))"
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    58
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    59
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    60
  raw_div  :: "[i,i]=>i"  where
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    61
    "raw_div (m, n) ==
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    62
       transrec(m, %j f. if j<n | n=0 then 0 else succ(f`(j#-n)))"
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    63
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    64
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    65
  raw_mod  :: "[i,i]=>i"  where
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    66
    "raw_mod (m, n) ==
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    67
       transrec(m, %j f. if j<n | n=0 then j else f`(j#-n))"
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    68
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    69
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    70
  div  :: "[i,i]=>i"                    (infixl "div" 70)  where
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    71
    "m div n == raw_div (natify(m), natify(n))"
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    72
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    73
definition
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    74
  mod  :: "[i,i]=>i"                    (infixl "mod" 70)  where
9492
72e429c66608 used natify with div and mod; also put in the divide-by-zero trick
paulson
parents: 9491
diff changeset
    75
    "m mod n == raw_mod (natify(m), natify(n))"
9491
1a36151ee2fc natify, a coercion to reduce the number of type constraints in arithmetic
paulson
parents: 6070
diff changeset
    76
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    77
notation (xsymbols)
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    78
  mult  (infixr "#\<times>" 70)
9964
7966a2902266 tuned symbols;
wenzelm
parents: 9683
diff changeset
    79
24893
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    80
notation (HTML output)
b8ef7afe3a6b modernized specifications;
wenzelm
parents: 16417
diff changeset
    81
  mult  (infixr "#\<times>" 70)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    82
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    83
declare rec_type [simp]
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    84
        nat_0_le [simp]
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    85
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    86
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
    87
lemma zero_lt_lemma: "[| 0<k; k \<in> nat |] ==> \<exists>j\<in>nat. k = succ(j)"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    88
apply (erule rev_mp)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    89
apply (induct_tac "k", auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    90
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    91
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
    92
(* [| 0 < k; k \<in> nat; !!j. [| j \<in> nat; k = succ(j) |] ==> Q |] ==> Q *)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    93
lemmas zero_lt_natE = zero_lt_lemma [THEN bexE, standard]
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    94
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    95
13356
c9cfe1638bf2 improved presentation markup
paulson
parents: 13328
diff changeset
    96
subsection{*@{text natify}, the Coercion to @{term nat}*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    97
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    98
lemma pred_succ_eq [simp]: "pred(succ(y)) = y"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
    99
by (unfold pred_def, auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   100
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   101
lemma natify_succ: "natify(succ(x)) = succ(natify(x))"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   102
by (rule natify_def [THEN def_Vrecursor, THEN trans], auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   103
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   104
lemma natify_0 [simp]: "natify(0) = 0"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   105
by (rule natify_def [THEN def_Vrecursor, THEN trans], auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   106
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   107
lemma natify_non_succ: "\<forall>z. x ~= succ(z) ==> natify(x) = 0"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   108
by (rule natify_def [THEN def_Vrecursor, THEN trans], auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   109
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   110
lemma natify_in_nat [iff,TC]: "natify(x) \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   111
apply (rule_tac a=x in eps_induct)
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   112
apply (case_tac "\<exists>z. x = succ(z)")
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   113
apply (auto simp add: natify_succ natify_non_succ)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   114
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   115
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   116
lemma natify_ident [simp]: "n \<in> nat ==> natify(n) = n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   117
apply (induct_tac "n")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   118
apply (auto simp add: natify_succ)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   119
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   120
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   121
lemma natify_eqE: "[|natify(x) = y;  x \<in> nat|] ==> x=y"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   122
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   123
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   124
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   125
(*** Collapsing rules: to remove natify from arithmetic expressions ***)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   126
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   127
lemma natify_idem [simp]: "natify(natify(x)) = natify(x)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   128
by simp
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   129
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   130
(** Addition **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   131
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   132
lemma add_natify1 [simp]: "natify(m) #+ n = m #+ n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   133
by (simp add: add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   134
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   135
lemma add_natify2 [simp]: "m #+ natify(n) = m #+ n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   136
by (simp add: add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   137
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   138
(** Multiplication **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   139
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   140
lemma mult_natify1 [simp]: "natify(m) #* n = m #* n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   141
by (simp add: mult_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   142
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   143
lemma mult_natify2 [simp]: "m #* natify(n) = m #* n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   144
by (simp add: mult_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   145
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   146
(** Difference **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   147
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   148
lemma diff_natify1 [simp]: "natify(m) #- n = m #- n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   149
by (simp add: diff_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   150
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   151
lemma diff_natify2 [simp]: "m #- natify(n) = m #- n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   152
by (simp add: diff_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   153
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   154
(** Remainder **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   155
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   156
lemma mod_natify1 [simp]: "natify(m) mod n = m mod n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   157
by (simp add: mod_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   158
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   159
lemma mod_natify2 [simp]: "m mod natify(n) = m mod n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   160
by (simp add: mod_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   161
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   162
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   163
(** Quotient **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   164
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   165
lemma div_natify1 [simp]: "natify(m) div n = m div n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   166
by (simp add: div_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   167
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   168
lemma div_natify2 [simp]: "m div natify(n) = m div n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   169
by (simp add: div_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   170
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   171
13356
c9cfe1638bf2 improved presentation markup
paulson
parents: 13328
diff changeset
   172
subsection{*Typing rules*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   173
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   174
(** Addition **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   175
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   176
lemma raw_add_type: "[| m\<in>nat;  n\<in>nat |] ==> raw_add (m, n) \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   177
by (induct_tac "m", auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   178
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   179
lemma add_type [iff,TC]: "m #+ n \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   180
by (simp add: add_def raw_add_type)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   181
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   182
(** Multiplication **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   183
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   184
lemma raw_mult_type: "[| m\<in>nat;  n\<in>nat |] ==> raw_mult (m, n) \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   185
apply (induct_tac "m")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   186
apply (simp_all add: raw_add_type)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   187
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   188
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   189
lemma mult_type [iff,TC]: "m #* n \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   190
by (simp add: mult_def raw_mult_type)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   191
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   192
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   193
(** Difference **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   194
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   195
lemma raw_diff_type: "[| m\<in>nat;  n\<in>nat |] ==> raw_diff (m, n) \<in> nat"
13173
8f4680be79cc new version of nat_case, nat_case3
paulson
parents: 13163
diff changeset
   196
by (induct_tac "n", auto)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   197
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   198
lemma diff_type [iff,TC]: "m #- n \<in> nat"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   199
by (simp add: diff_def raw_diff_type)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   200
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   201
lemma diff_0_eq_0 [simp]: "0 #- n = 0"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   202
apply (unfold diff_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   203
apply (rule natify_in_nat [THEN nat_induct], auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   204
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   205
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   206
(*Must simplify BEFORE the induction: else we get a critical pair*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   207
lemma diff_succ_succ [simp]: "succ(m) #- succ(n) = m #- n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   208
apply (simp add: natify_succ diff_def)
13784
b9f6154427a4 tidying (by script)
paulson
parents: 13361
diff changeset
   209
apply (rule_tac x1 = n in natify_in_nat [THEN nat_induct], auto)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   210
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   211
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   212
(*This defining property is no longer wanted*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   213
declare raw_diff_succ [simp del]
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   214
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   215
(*Natify has weakened this law, compared with the older approach*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   216
lemma diff_0 [simp]: "m #- 0 = natify(m)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   217
by (simp add: diff_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   218
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   219
lemma diff_le_self: "m\<in>nat ==> (m #- n) le m"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   220
apply (subgoal_tac " (m #- natify (n)) le m")
13784
b9f6154427a4 tidying (by script)
paulson
parents: 13361
diff changeset
   221
apply (rule_tac [2] m = m and n = "natify (n) " in diff_induct)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   222
apply (erule_tac [6] leE)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   223
apply (simp_all add: le_iff)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   224
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   225
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   226
13356
c9cfe1638bf2 improved presentation markup
paulson
parents: 13328
diff changeset
   227
subsection{*Addition*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   228
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   229
(*Natify has weakened this law, compared with the older approach*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   230
lemma add_0_natify [simp]: "0 #+ m = natify(m)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   231
by (simp add: add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   232
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   233
lemma add_succ [simp]: "succ(m) #+ n = succ(m #+ n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   234
by (simp add: natify_succ add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   235
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   236
lemma add_0: "m \<in> nat ==> 0 #+ m = m"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   237
by simp
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   238
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   239
(*Associative law for addition*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   240
lemma add_assoc: "(m #+ n) #+ k = m #+ (n #+ k)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   241
apply (subgoal_tac "(natify(m) #+ natify(n)) #+ natify(k) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   242
                    natify(m) #+ (natify(n) #+ natify(k))")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   243
apply (rule_tac [2] n = "natify(m)" in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   244
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   245
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   246
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   247
(*The following two lemmas are used for add_commute and sometimes
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   248
  elsewhere, since they are safe for rewriting.*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   249
lemma add_0_right_natify [simp]: "m #+ 0 = natify(m)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   250
apply (subgoal_tac "natify(m) #+ 0 = natify(m)")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   251
apply (rule_tac [2] n = "natify(m)" in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   252
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   253
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   254
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   255
lemma add_succ_right [simp]: "m #+ succ(n) = succ(m #+ n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   256
apply (unfold add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   257
apply (rule_tac n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   258
apply (auto simp add: natify_succ)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   259
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   260
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   261
lemma add_0_right: "m \<in> nat ==> m #+ 0 = m"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   262
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   263
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   264
(*Commutative law for addition*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   265
lemma add_commute: "m #+ n = n #+ m"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   266
apply (subgoal_tac "natify(m) #+ natify(n) = natify(n) #+ natify(m) ")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   267
apply (rule_tac [2] n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   268
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   269
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   270
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   271
(*for a/c rewriting*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   272
lemma add_left_commute: "m#+(n#+k)=n#+(m#+k)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   273
apply (rule add_commute [THEN trans])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   274
apply (rule add_assoc [THEN trans])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   275
apply (rule add_commute [THEN subst_context])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   276
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   277
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   278
(*Addition is an AC-operator*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   279
lemmas add_ac = add_assoc add_commute add_left_commute
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   280
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   281
(*Cancellation law on the left*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   282
lemma raw_add_left_cancel:
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   283
     "[| raw_add(k, m) = raw_add(k, n);  k\<in>nat |] ==> m=n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   284
apply (erule rev_mp)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   285
apply (induct_tac "k", auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   286
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   287
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   288
lemma add_left_cancel_natify: "k #+ m = k #+ n ==> natify(m) = natify(n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   289
apply (unfold add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   290
apply (drule raw_add_left_cancel, auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   291
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   292
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   293
lemma add_left_cancel:
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   294
     "[| i = j;  i #+ m = j #+ n;  m\<in>nat;  n\<in>nat |] ==> m = n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   295
by (force dest!: add_left_cancel_natify)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   296
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   297
(*Thanks to Sten Agerholm*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   298
lemma add_le_elim1_natify: "k#+m le k#+n ==> natify(m) le natify(n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   299
apply (rule_tac P = "natify(k) #+m le natify(k) #+n" in rev_mp)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   300
apply (rule_tac [2] n = "natify(k) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   301
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   302
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   303
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   304
lemma add_le_elim1: "[| k#+m le k#+n; m \<in> nat; n \<in> nat |] ==> m le n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   305
by (drule add_le_elim1_natify, auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   306
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   307
lemma add_lt_elim1_natify: "k#+m < k#+n ==> natify(m) < natify(n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   308
apply (rule_tac P = "natify(k) #+m < natify(k) #+n" in rev_mp)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   309
apply (rule_tac [2] n = "natify(k) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   310
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   311
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   312
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   313
lemma add_lt_elim1: "[| k#+m < k#+n; m \<in> nat; n \<in> nat |] ==> m < n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   314
by (drule add_lt_elim1_natify, auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   315
15201
d73f9d49d835 converted ZF/Induct/Multiset to Isar script
paulson
parents: 14060
diff changeset
   316
lemma zero_less_add: "[| n \<in> nat; m \<in> nat |] ==> 0 < m #+ n <-> (0<m | 0<n)"
d73f9d49d835 converted ZF/Induct/Multiset to Isar script
paulson
parents: 14060
diff changeset
   317
by (induct_tac "n", auto)
d73f9d49d835 converted ZF/Induct/Multiset to Isar script
paulson
parents: 14060
diff changeset
   318
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   319
13356
c9cfe1638bf2 improved presentation markup
paulson
parents: 13328
diff changeset
   320
subsection{*Monotonicity of Addition*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   321
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   322
(*strict, in 1st argument; proof is by rule induction on 'less than'.
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   323
  Still need j\<in>nat, for consider j = omega.  Then we can have i<omega,
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   324
  which is the same as i\<in>nat, but natify(j)=0, so the conclusion fails.*)
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   325
lemma add_lt_mono1: "[| i<j; j\<in>nat |] ==> i#+k < j#+k"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   326
apply (frule lt_nat_in_nat, assumption)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   327
apply (erule succ_lt_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   328
apply (simp_all add: leI)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   329
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   330
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   331
text{*strict, in second argument*}
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   332
lemma add_lt_mono2: "[| i<j; j\<in>nat |] ==> k#+i < k#+j"
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   333
by (simp add: add_commute [of k] add_lt_mono1)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   334
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   335
text{*A [clumsy] way of lifting < monotonicity to @{text "\<le>"} monotonicity*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   336
lemma Ord_lt_mono_imp_le_mono:
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   337
  assumes lt_mono: "!!i j. [| i<j; j:k |] ==> f(i) < f(j)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   338
      and ford:    "!!i. i:k ==> Ord(f(i))"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   339
      and leij:    "i le j"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   340
      and jink:    "j:k"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   341
  shows "f(i) le f(j)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   342
apply (insert leij jink) 
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   343
apply (blast intro!: leCI lt_mono ford elim!: leE)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   344
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   345
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   346
text{*@{text "\<le>"} monotonicity, 1st argument*}
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   347
lemma add_le_mono1: "[| i le j; j\<in>nat |] ==> i#+k le j#+k"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   348
apply (rule_tac f = "%j. j#+k" in Ord_lt_mono_imp_le_mono, typecheck) 
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   349
apply (blast intro: add_lt_mono1 add_type [THEN nat_into_Ord])+
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   350
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   351
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   352
text{*@{text "\<le>"} monotonicity, both arguments*}
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   353
lemma add_le_mono: "[| i le j; k le l; j\<in>nat; l\<in>nat |] ==> i#+k le j#+l"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   354
apply (rule add_le_mono1 [THEN le_trans], assumption+)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   355
apply (subst add_commute, subst add_commute, rule add_le_mono1, assumption+)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   356
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   357
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   358
text{*Combinations of less-than and less-than-or-equals*}
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   359
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   360
lemma add_lt_le_mono: "[| i<j; k\<le>l; j\<in>nat; l\<in>nat |] ==> i#+k < j#+l"
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   361
apply (rule add_lt_mono1 [THEN lt_trans2], assumption+)
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   362
apply (subst add_commute, subst add_commute, rule add_le_mono1, assumption+)
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   363
done
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   364
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   365
lemma add_le_lt_mono: "[| i\<le>j; k<l; j\<in>nat; l\<in>nat |] ==> i#+k < j#+l"
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   366
by (subst add_commute, subst add_commute, erule add_lt_le_mono, assumption+)
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   367
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   368
text{*Less-than: in other words, strict in both arguments*}
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   369
lemma add_lt_mono: "[| i<j; k<l; j\<in>nat; l\<in>nat |] ==> i#+k < j#+l"
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   370
apply (rule add_lt_le_mono) 
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   371
apply (auto intro: leI) 
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   372
done
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   373
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   374
(** Subtraction is the inverse of addition. **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   375
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   376
lemma diff_add_inverse: "(n#+m) #- n = natify(m)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   377
apply (subgoal_tac " (natify(n) #+ m) #- natify(n) = natify(m) ")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   378
apply (rule_tac [2] n = "natify(n) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   379
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   380
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   381
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   382
lemma diff_add_inverse2: "(m#+n) #- n = natify(m)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   383
by (simp add: add_commute [of m] diff_add_inverse)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   384
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   385
lemma diff_cancel: "(k#+m) #- (k#+n) = m #- n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   386
apply (subgoal_tac "(natify(k) #+ natify(m)) #- (natify(k) #+ natify(n)) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   387
                    natify(m) #- natify(n) ")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   388
apply (rule_tac [2] n = "natify(k) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   389
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   390
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   391
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   392
lemma diff_cancel2: "(m#+k) #- (n#+k) = m #- n"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   393
by (simp add: add_commute [of _ k] diff_cancel)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   394
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   395
lemma diff_add_0: "n #- (n#+m) = 0"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   396
apply (subgoal_tac "natify(n) #- (natify(n) #+ natify(m)) = 0")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   397
apply (rule_tac [2] n = "natify(n) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   398
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   399
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   400
13361
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   401
lemma pred_0 [simp]: "pred(0) = 0"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   402
by (simp add: pred_def)
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   403
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   404
lemma eq_succ_imp_eq_m1: "[|i = succ(j); i\<in>nat|] ==> j = i #- 1 & j \<in>nat"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   405
by simp 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   406
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   407
lemma pred_Un_distrib:
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   408
    "[|i\<in>nat; j\<in>nat|] ==> pred(i Un j) = pred(i) Un pred(j)"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   409
apply (erule_tac n=i in natE, simp) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   410
apply (erule_tac n=j in natE, simp) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   411
apply (simp add:  succ_Un_distrib [symmetric])
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   412
done
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   413
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   414
lemma pred_type [TC,simp]:
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   415
    "i \<in> nat ==> pred(i) \<in> nat"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   416
by (simp add: pred_def split: split_nat_case)
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   417
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   418
lemma nat_diff_pred: "[|i\<in>nat; j\<in>nat|] ==> i #- succ(j) = pred(i #- j)";
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   419
apply (rule_tac m=i and n=j in diff_induct) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   420
apply (auto simp add: pred_def nat_imp_quasinat split: split_nat_case)
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   421
done
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   422
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   423
lemma diff_succ_eq_pred: "i #- succ(j) = pred(i #- j)";
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   424
apply (insert nat_diff_pred [of "natify(i)" "natify(j)"])
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   425
apply (simp add: natify_succ [symmetric]) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   426
done
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   427
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   428
lemma nat_diff_Un_distrib:
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   429
    "[|i\<in>nat; j\<in>nat; k\<in>nat|] ==> (i Un j) #- k = (i#-k) Un (j#-k)"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   430
apply (rule_tac n=k in nat_induct) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   431
apply (simp_all add: diff_succ_eq_pred pred_Un_distrib) 
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   432
done
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   433
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   434
lemma diff_Un_distrib:
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   435
    "[|i\<in>nat; j\<in>nat|] ==> (i Un j) #- k = (i#-k) Un (j#-k)"
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   436
by (insert nat_diff_Un_distrib [of i j "natify(k)"], simp)
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   437
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   438
text{*We actually prove @{term "i #- j #- k = i #- (j #+ k)"}*}
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   439
lemma diff_diff_left [simplified]:
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   440
     "natify(i)#-natify(j)#-k = natify(i) #- (natify(j)#+k)";
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   441
by (rule_tac m="natify(i)" and n="natify(j)" in diff_induct, auto)
5005d34425bb new lemmas
paulson
parents: 13356
diff changeset
   442
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   443
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   444
(** Lemmas for the CancelNumerals simproc **)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   445
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   446
lemma eq_add_iff: "(u #+ m = u #+ n) <-> (0 #+ m = natify(n))"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   447
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   448
apply (blast dest: add_left_cancel_natify)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   449
apply (simp add: add_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   450
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   451
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   452
lemma less_add_iff: "(u #+ m < u #+ n) <-> (0 #+ m < natify(n))"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   453
apply (auto simp add: add_lt_elim1_natify)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   454
apply (drule add_lt_mono1)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   455
apply (auto simp add: add_commute [of u])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   456
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   457
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   458
lemma diff_add_eq: "((u #+ m) #- (u #+ n)) = ((0 #+ m) #- n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   459
by (simp add: diff_cancel)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   460
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   461
(*To tidy up the result of a simproc.  Only the RHS will be simplified.*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   462
lemma eq_cong2: "u = u' ==> (t==u) == (t==u')"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   463
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   464
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   465
lemma iff_cong2: "u <-> u' ==> (t==u) == (t==u')"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   466
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   467
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   468
13356
c9cfe1638bf2 improved presentation markup
paulson
parents: 13328
diff changeset
   469
subsection{*Multiplication*}
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   470
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   471
lemma mult_0 [simp]: "0 #* m = 0"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   472
by (simp add: mult_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   473
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   474
lemma mult_succ [simp]: "succ(m) #* n = n #+ (m #* n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   475
by (simp add: add_def mult_def natify_succ raw_mult_type)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   476
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   477
(*right annihilation in product*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   478
lemma mult_0_right [simp]: "m #* 0 = 0"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   479
apply (unfold mult_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   480
apply (rule_tac n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   481
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   482
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   483
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   484
(*right successor law for multiplication*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   485
lemma mult_succ_right [simp]: "m #* succ(n) = m #+ (m #* n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   486
apply (subgoal_tac "natify(m) #* succ (natify(n)) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   487
                    natify(m) #+ (natify(m) #* natify(n))")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   488
apply (simp (no_asm_use) add: natify_succ add_def mult_def)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   489
apply (rule_tac n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   490
apply (simp_all add: add_ac)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   491
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   492
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   493
lemma mult_1_natify [simp]: "1 #* n = natify(n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   494
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   495
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   496
lemma mult_1_right_natify [simp]: "n #* 1 = natify(n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   497
by auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   498
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   499
lemma mult_1: "n \<in> nat ==> 1 #* n = n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   500
by simp
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   501
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   502
lemma mult_1_right: "n \<in> nat ==> n #* 1 = n"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   503
by simp
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   504
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   505
(*Commutative law for multiplication*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   506
lemma mult_commute: "m #* n = n #* m"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   507
apply (subgoal_tac "natify(m) #* natify(n) = natify(n) #* natify(m) ")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   508
apply (rule_tac [2] n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   509
apply auto
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   510
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   511
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   512
(*addition distributes over multiplication*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   513
lemma add_mult_distrib: "(m #+ n) #* k = (m #* k) #+ (n #* k)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   514
apply (subgoal_tac "(natify(m) #+ natify(n)) #* natify(k) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   515
                    (natify(m) #* natify(k)) #+ (natify(n) #* natify(k))")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   516
apply (rule_tac [2] n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   517
apply (simp_all add: add_assoc [symmetric])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   518
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   519
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   520
(*Distributive law on the left*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   521
lemma add_mult_distrib_left: "k #* (m #+ n) = (k #* m) #+ (k #* n)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   522
apply (subgoal_tac "natify(k) #* (natify(m) #+ natify(n)) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   523
                    (natify(k) #* natify(m)) #+ (natify(k) #* natify(n))")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   524
apply (rule_tac [2] n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   525
apply (simp_all add: add_ac)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   526
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   527
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   528
(*Associative law for multiplication*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   529
lemma mult_assoc: "(m #* n) #* k = m #* (n #* k)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   530
apply (subgoal_tac "(natify(m) #* natify(n)) #* natify(k) =
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   531
                    natify(m) #* (natify(n) #* natify(k))")
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   532
apply (rule_tac [2] n = "natify(m) " in nat_induct)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   533
apply (simp_all add: add_mult_distrib)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   534
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   535
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   536
(*for a/c rewriting*)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   537
lemma mult_left_commute: "m #* (n #* k) = n #* (m #* k)"
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   538
apply (rule mult_commute [THEN trans])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   539
apply (rule mult_assoc [THEN trans])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   540
apply (rule mult_commute [THEN subst_context])
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   541
done
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   542
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   543
lemmas mult_ac = mult_assoc mult_commute mult_left_commute
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   544
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   545
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   546
lemma lt_succ_eq_0_disj:
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   547
     "[| m\<in>nat; n\<in>nat |]
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   548
      ==> (m < succ(n)) <-> (m = 0 | (\<exists>j\<in>nat. m = succ(j) & j < n))"
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   549
by (induct_tac "m", auto)
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   550
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   551
lemma less_diff_conv [rule_format]:
14060
c0c4af41fa3b Adding the theory UNITY/AllocImpl.thy, with supporting lemmas
paulson
parents: 13784
diff changeset
   552
     "[| j\<in>nat; k\<in>nat |] ==> \<forall>i\<in>nat. (i < j #- k) <-> (i #+ k < j)"
13784
b9f6154427a4 tidying (by script)
paulson
parents: 13361
diff changeset
   553
by (erule_tac m = k in diff_induct, auto)
13163
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   554
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   555
lemmas nat_typechecks = rec_type nat_0I nat_1I nat_succI Ord_nat
e320a52ff711 converted Arith, Univ, func to Isar format!
paulson
parents: 12114
diff changeset
   556
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   557
end