author | huffman |
Thu, 04 Dec 2008 18:37:46 -0800 | |
changeset 28990 | 3d8f01383117 |
parent 26512 | 682dfb674df3 |
child 29013 | 62a6ddcbb53b |
permissions | -rw-r--r-- |
23664 | 1 |
theory ComputeNumeral |
26512
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
2 |
imports ComputeHOL "~~/src/HOL/Real/Float" |
23664 | 3 |
begin |
4 |
||
5 |
(* normalization of bit strings *) |
|
26075
815f3ccc0b45
added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps
huffman
parents:
25919
diff
changeset
|
6 |
lemmas bitnorm = normalize_bin_simps |
23664 | 7 |
|
8 |
(* neg for bit strings *) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
9 |
lemma neg1: "neg Int.Pls = False" by (simp add: Int.Pls_def) |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
10 |
lemma neg2: "neg Int.Min = True" apply (subst Int.Min_def) by auto |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
11 |
lemma neg3: "neg (Int.Bit0 x) = neg x" apply (simp add: neg_def) apply (subst Bit0_def) by auto |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
12 |
lemma neg4: "neg (Int.Bit1 x) = neg x" apply (simp add: neg_def) apply (subst Bit1_def) by auto |
23664 | 13 |
lemmas bitneg = neg1 neg2 neg3 neg4 |
14 |
||
15 |
(* iszero for bit strings *) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
16 |
lemma iszero1: "iszero Int.Pls = True" by (simp add: Int.Pls_def iszero_def) |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
17 |
lemma iszero2: "iszero Int.Min = False" apply (subst Int.Min_def) apply (subst iszero_def) by simp |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
18 |
lemma iszero3: "iszero (Int.Bit0 x) = iszero x" apply (subst Int.Bit0_def) apply (subst iszero_def)+ by auto |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
19 |
lemma iszero4: "iszero (Int.Bit1 x) = False" apply (subst Int.Bit1_def) apply (subst iszero_def)+ apply simp by arith |
23664 | 20 |
lemmas bitiszero = iszero1 iszero2 iszero3 iszero4 |
21 |
||
22 |
(* lezero for bit strings *) |
|
23 |
constdefs |
|
24 |
"lezero x == (x \<le> 0)" |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
25 |
lemma lezero1: "lezero Int.Pls = True" unfolding Int.Pls_def lezero_def by auto |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
26 |
lemma lezero2: "lezero Int.Min = True" unfolding Int.Min_def lezero_def by auto |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
27 |
lemma lezero3: "lezero (Int.Bit0 x) = lezero x" unfolding Int.Bit0_def lezero_def by auto |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
28 |
lemma lezero4: "lezero (Int.Bit1 x) = neg x" unfolding Int.Bit1_def lezero_def neg_def by auto |
23664 | 29 |
lemmas bitlezero = lezero1 lezero2 lezero3 lezero4 |
30 |
||
31 |
(* equality for bit strings *) |
|
26512
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
32 |
lemma biteq1: "(Int.Pls = Int.Pls) = True" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
33 |
lemma biteq2: "(Int.Min = Int.Min) = True" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
34 |
lemma biteq3: "(Int.Pls = Int.Min) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
35 |
lemma biteq4: "(Int.Min = Int.Pls) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
36 |
lemma biteq5: "(Int.Bit0 x = Int.Bit0 y) = (x = y)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
37 |
lemma biteq6: "(Int.Bit1 x = Int.Bit1 y) = (x = y)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
38 |
lemma biteq7: "(Int.Bit0 x = Int.Bit1 y) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
39 |
lemma biteq8: "(Int.Bit1 x = Int.Bit0 y) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
40 |
lemma biteq9: "(Int.Pls = Int.Bit0 x) = (Int.Pls = x)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
41 |
lemma biteq10: "(Int.Pls = Int.Bit1 x) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
42 |
lemma biteq11: "(Int.Min = Int.Bit0 x) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
43 |
lemma biteq12: "(Int.Min = Int.Bit1 x) = (Int.Min = x)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
44 |
lemma biteq13: "(Int.Bit0 x = Int.Pls) = (x = Int.Pls)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
45 |
lemma biteq14: "(Int.Bit1 x = Int.Pls) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
46 |
lemma biteq15: "(Int.Bit0 x = Int.Min) = False" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
47 |
lemma biteq16: "(Int.Bit1 x = Int.Min) = (x = Int.Min)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
23664 | 48 |
lemmas biteq = biteq1 biteq2 biteq3 biteq4 biteq5 biteq6 biteq7 biteq8 biteq9 biteq10 biteq11 biteq12 biteq13 biteq14 biteq15 biteq16 |
49 |
||
50 |
(* x < y for bit strings *) |
|
26512
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
51 |
lemma bitless1: "(Int.Pls < Int.Min) = False" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
52 |
lemma bitless2: "(Int.Pls < Int.Pls) = False" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
53 |
lemma bitless3: "(Int.Min < Int.Pls) = True" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
54 |
lemma bitless4: "(Int.Min < Int.Min) = False" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
55 |
lemma bitless5: "(Int.Bit0 x < Int.Bit0 y) = (x < y)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
56 |
lemma bitless6: "(Int.Bit1 x < Int.Bit1 y) = (x < y)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
57 |
lemma bitless7: "(Int.Bit0 x < Int.Bit1 y) = (x \<le> y)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
58 |
lemma bitless8: "(Int.Bit1 x < Int.Bit0 y) = (x < y)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
59 |
lemma bitless9: "(Int.Pls < Int.Bit0 x) = (Int.Pls < x)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
60 |
lemma bitless10: "(Int.Pls < Int.Bit1 x) = (Int.Pls \<le> x)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
61 |
lemma bitless11: "(Int.Min < Int.Bit0 x) = (Int.Pls \<le> x)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
62 |
lemma bitless12: "(Int.Min < Int.Bit1 x) = (Int.Min < x)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
63 |
lemma bitless13: "(Int.Bit0 x < Int.Pls) = (x < Int.Pls)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
64 |
lemma bitless14: "(Int.Bit1 x < Int.Pls) = (x < Int.Pls)" by (simp add: less_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
65 |
lemma bitless15: "(Int.Bit0 x < Int.Min) = (x < Int.Pls)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
66 |
lemma bitless16: "(Int.Bit1 x < Int.Min) = (x < Int.Min)" by (simp add: less_int_code) |
23664 | 67 |
lemmas bitless = bitless1 bitless2 bitless3 bitless4 bitless5 bitless6 bitless7 bitless8 |
68 |
bitless9 bitless10 bitless11 bitless12 bitless13 bitless14 bitless15 bitless16 |
|
69 |
||
70 |
(* x \<le> y for bit strings *) |
|
26512
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
71 |
lemma bitle1: "(Int.Pls \<le> Int.Min) = False" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
72 |
lemma bitle2: "(Int.Pls \<le> Int.Pls) = True" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
73 |
lemma bitle3: "(Int.Min \<le> Int.Pls) = True" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
74 |
lemma bitle4: "(Int.Min \<le> Int.Min) = True" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
75 |
lemma bitle5: "(Int.Bit0 x \<le> Int.Bit0 y) = (x \<le> y)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
76 |
lemma bitle6: "(Int.Bit1 x \<le> Int.Bit1 y) = (x \<le> y)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
77 |
lemma bitle7: "(Int.Bit0 x \<le> Int.Bit1 y) = (x \<le> y)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
78 |
lemma bitle8: "(Int.Bit1 x \<le> Int.Bit0 y) = (x < y)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
79 |
lemma bitle9: "(Int.Pls \<le> Int.Bit0 x) = (Int.Pls \<le> x)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
80 |
lemma bitle10: "(Int.Pls \<le> Int.Bit1 x) = (Int.Pls \<le> x)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
81 |
lemma bitle11: "(Int.Min \<le> Int.Bit0 x) = (Int.Pls \<le> x)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
82 |
lemma bitle12: "(Int.Min \<le> Int.Bit1 x) = (Int.Min \<le> x)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
83 |
lemma bitle13: "(Int.Bit0 x \<le> Int.Pls) = (x \<le> Int.Pls)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
84 |
lemma bitle14: "(Int.Bit1 x \<le> Int.Pls) = (x < Int.Pls)" by (simp add: less_eq_int_code) |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
85 |
lemma bitle15: "(Int.Bit0 x \<le> Int.Min) = (x < Int.Pls)" unfolding Pls_def Min_def Bit0_def Bit1_def by presburger |
682dfb674df3
proofs adjusted to new situation in Int.thy/Presburger.thy
haftmann
parents:
26086
diff
changeset
|
86 |
lemma bitle16: "(Int.Bit1 x \<le> Int.Min) = (x \<le> Int.Min)" by (simp add: less_eq_int_code) |
23664 | 87 |
lemmas bitle = bitle1 bitle2 bitle3 bitle4 bitle5 bitle6 bitle7 bitle8 |
88 |
bitle9 bitle10 bitle11 bitle12 bitle13 bitle14 bitle15 bitle16 |
|
89 |
||
90 |
(* succ for bit strings *) |
|
26075
815f3ccc0b45
added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps
huffman
parents:
25919
diff
changeset
|
91 |
lemmas bitsucc = succ_bin_simps |
23664 | 92 |
|
93 |
(* pred for bit strings *) |
|
26075
815f3ccc0b45
added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps
huffman
parents:
25919
diff
changeset
|
94 |
lemmas bitpred = pred_bin_simps |
23664 | 95 |
|
96 |
(* unary minus for bit strings *) |
|
26075
815f3ccc0b45
added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps
huffman
parents:
25919
diff
changeset
|
97 |
lemmas bituminus = minus_bin_simps |
23664 | 98 |
|
99 |
(* addition for bit strings *) |
|
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
100 |
lemmas bitadd = add_bin_simps |
23664 | 101 |
|
102 |
(* multiplication for bit strings *) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
103 |
lemma mult_Pls_right: "x * Int.Pls = Int.Pls" by (simp add: Pls_def) |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
104 |
lemma mult_Min_right: "x * Int.Min = - x" by (subst mult_commute, simp add: mult_Min) |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
105 |
lemma multb0x: "(Int.Bit0 x) * y = Int.Bit0 (x * y)" by (rule mult_Bit0) |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
106 |
lemma multxb0: "x * (Int.Bit0 y) = Int.Bit0 (x * y)" unfolding Bit0_def by simp |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
107 |
lemma multb1: "(Int.Bit1 x) * (Int.Bit1 y) = Int.Bit1 (Int.Bit0 (x * y) + x + y)" |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
108 |
unfolding Bit0_def Bit1_def by (simp add: ring_simps) |
23664 | 109 |
lemmas bitmul = mult_Pls mult_Min mult_Pls_right mult_Min_right multb0x multxb0 multb1 |
110 |
||
111 |
lemmas bitarith = bitnorm bitiszero bitneg bitlezero biteq bitless bitle bitsucc bitpred bituminus bitadd bitmul |
|
112 |
||
113 |
constdefs |
|
114 |
"nat_norm_number_of (x::nat) == x" |
|
115 |
||
116 |
lemma nat_norm_number_of: "nat_norm_number_of (number_of w) = (if lezero w then 0 else number_of w)" |
|
117 |
apply (simp add: nat_norm_number_of_def) |
|
118 |
unfolding lezero_def iszero_def neg_def |
|
28990 | 119 |
apply (simp add: numeral_simps) |
23664 | 120 |
done |
121 |
||
122 |
(* Normalization of nat literals *) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
123 |
lemma natnorm0: "(0::nat) = number_of (Int.Pls)" by auto |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
124 |
lemma natnorm1: "(1 :: nat) = number_of (Int.Bit1 Int.Pls)" by auto |
23664 | 125 |
lemmas natnorm = natnorm0 natnorm1 nat_norm_number_of |
126 |
||
127 |
(* Suc *) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
128 |
lemma natsuc: "Suc (number_of x) = (if neg x then 1 else number_of (Int.succ x))" by (auto simp add: number_of_is_id) |
23664 | 129 |
|
130 |
(* Addition for nat *) |
|
131 |
lemma natadd: "number_of x + ((number_of y)::nat) = (if neg x then (number_of y) else (if neg y then number_of x else (number_of (x + y))))" |
|
132 |
by (auto simp add: number_of_is_id) |
|
133 |
||
134 |
(* Subtraction for nat *) |
|
135 |
lemma natsub: "(number_of x) - ((number_of y)::nat) = |
|
136 |
(if neg x then 0 else (if neg y then number_of x else (nat_norm_number_of (number_of (x + (- y))))))" |
|
137 |
unfolding nat_norm_number_of |
|
138 |
by (auto simp add: number_of_is_id neg_def lezero_def iszero_def Let_def nat_number_of_def) |
|
139 |
||
140 |
(* Multiplication for nat *) |
|
141 |
lemma natmul: "(number_of x) * ((number_of y)::nat) = |
|
142 |
(if neg x then 0 else (if neg y then 0 else number_of (x * y)))" |
|
143 |
apply (auto simp add: number_of_is_id neg_def iszero_def) |
|
144 |
apply (case_tac "x > 0") |
|
145 |
apply auto |
|
28990 | 146 |
apply (rule order_less_imp_le) |
23664 | 147 |
apply (simp add: mult_strict_left_mono[where a=y and b=0 and c=x, simplified]) |
148 |
done |
|
149 |
||
150 |
lemma nateq: "(((number_of x)::nat) = (number_of y)) = ((lezero x \<and> lezero y) \<or> (x = y))" |
|
151 |
by (auto simp add: iszero_def lezero_def neg_def number_of_is_id) |
|
152 |
||
153 |
lemma natless: "(((number_of x)::nat) < (number_of y)) = ((x < y) \<and> (\<not> (lezero y)))" |
|
154 |
by (auto simp add: number_of_is_id neg_def lezero_def) |
|
155 |
||
156 |
lemma natle: "(((number_of x)::nat) \<le> (number_of y)) = (y < x \<longrightarrow> lezero x)" |
|
157 |
by (auto simp add: number_of_is_id lezero_def nat_number_of_def) |
|
158 |
||
159 |
fun natfac :: "nat \<Rightarrow> nat" |
|
160 |
where |
|
161 |
"natfac n = (if n = 0 then 1 else n * (natfac (n - 1)))" |
|
162 |
||
163 |
lemmas compute_natarith = bitarith natnorm natsuc natadd natsub natmul nateq natless natle natfac.simps |
|
164 |
||
165 |
lemma number_eq: "(((number_of x)::'a::{number_ring, ordered_idom}) = (number_of y)) = (x = y)" |
|
166 |
unfolding number_of_eq |
|
167 |
apply simp |
|
168 |
done |
|
169 |
||
170 |
lemma number_le: "(((number_of x)::'a::{number_ring, ordered_idom}) \<le> (number_of y)) = (x \<le> y)" |
|
171 |
unfolding number_of_eq |
|
172 |
apply simp |
|
173 |
done |
|
174 |
||
175 |
lemma number_less: "(((number_of x)::'a::{number_ring, ordered_idom}) < (number_of y)) = (x < y)" |
|
176 |
unfolding number_of_eq |
|
177 |
apply simp |
|
178 |
done |
|
179 |
||
180 |
lemma number_diff: "((number_of x)::'a::{number_ring, ordered_idom}) - number_of y = number_of (x + (- y))" |
|
181 |
apply (subst diff_number_of_eq) |
|
182 |
apply simp |
|
183 |
done |
|
184 |
||
185 |
lemmas number_norm = number_of_Pls[symmetric] numeral_1_eq_1[symmetric] |
|
186 |
||
187 |
lemmas compute_numberarith = number_of_minus[symmetric] number_of_add[symmetric] number_diff number_of_mult[symmetric] number_norm number_eq number_le number_less |
|
188 |
||
189 |
lemma compute_real_of_nat_number_of: "real ((number_of v)::nat) = (if neg v then 0 else number_of v)" |
|
190 |
by (simp only: real_of_nat_number_of number_of_is_id) |
|
191 |
||
192 |
lemma compute_nat_of_int_number_of: "nat ((number_of v)::int) = (number_of v)" |
|
193 |
by simp |
|
194 |
||
195 |
lemmas compute_num_conversions = compute_real_of_nat_number_of compute_nat_of_int_number_of real_number_of |
|
196 |
||
197 |
lemmas zpowerarith = zpower_number_of_even |
|
198 |
zpower_number_of_odd[simplified zero_eq_Numeral0_nring one_eq_Numeral1_nring] |
|
199 |
zpower_Pls zpower_Min |
|
200 |
||
201 |
(* div, mod *) |
|
202 |
||
203 |
lemma adjust: "adjust b (q, r) = (if 0 \<le> r - b then (2 * q + 1, r - b) else (2 * q, r))" |
|
204 |
by (auto simp only: adjust_def) |
|
205 |
||
206 |
lemma negateSnd: "negateSnd (q, r) = (q, -r)" |
|
207 |
by (auto simp only: negateSnd_def) |
|
208 |
||
209 |
lemma divAlg: "divAlg (a, b) = (if 0\<le>a then |
|
210 |
if 0\<le>b then posDivAlg a b |
|
211 |
else if a=0 then (0, 0) |
|
212 |
else negateSnd (negDivAlg (-a) (-b)) |
|
213 |
else |
|
214 |
if 0<b then negDivAlg a b |
|
215 |
else negateSnd (posDivAlg (-a) (-b)))" |
|
216 |
by (auto simp only: divAlg_def) |
|
217 |
||
218 |
lemmas compute_div_mod = div_def mod_def divAlg adjust negateSnd posDivAlg.simps negDivAlg.simps |
|
219 |
||
220 |
||
221 |
||
222 |
(* collecting all the theorems *) |
|
223 |
||
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
224 |
lemma even_Pls: "even (Int.Pls) = True" |
23664 | 225 |
apply (unfold Pls_def even_def) |
226 |
by simp |
|
227 |
||
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
23664
diff
changeset
|
228 |
lemma even_Min: "even (Int.Min) = False" |
23664 | 229 |
apply (unfold Min_def even_def) |
230 |
by simp |
|
231 |
||
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
232 |
lemma even_B0: "even (Int.Bit0 x) = True" |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
233 |
apply (unfold Bit0_def) |
23664 | 234 |
by simp |
235 |
||
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
236 |
lemma even_B1: "even (Int.Bit1 x) = False" |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26075
diff
changeset
|
237 |
apply (unfold Bit1_def) |
23664 | 238 |
by simp |
239 |
||
240 |
lemma even_number_of: "even ((number_of w)::int) = even w" |
|
241 |
by (simp only: number_of_is_id) |
|
242 |
||
243 |
lemmas compute_even = even_Pls even_Min even_B0 even_B1 even_number_of |
|
244 |
||
245 |
lemmas compute_numeral = compute_if compute_let compute_pair compute_bool |
|
246 |
compute_natarith compute_numberarith max_def min_def compute_num_conversions zpowerarith compute_div_mod compute_even |
|
247 |
||
248 |
end |
|
249 |
||
250 |
||
251 |