10603
|
1 |
(* ID: $Id$ *)
|
10764
|
2 |
theory Numbers = Real:
|
10603
|
3 |
|
|
4 |
ML "Pretty.setmargin 64"
|
10777
|
5 |
ML "IsarOutput.indent := 0" (*we don't want 5 for listing theorems*)
|
10603
|
6 |
|
|
7 |
text{*
|
|
8 |
|
|
9 |
numeric literals; default simprules; can re-orient
|
|
10 |
*}
|
|
11 |
|
11711
|
12 |
lemma "2 * m = m + m"
|
10880
|
13 |
txt{*
|
|
14 |
@{subgoals[display,indent=0,margin=65]}
|
|
15 |
*};
|
10603
|
16 |
oops
|
|
17 |
|
10880
|
18 |
consts h :: "nat \<Rightarrow> nat"
|
|
19 |
recdef h "{}"
|
11711
|
20 |
"h i = (if i = 3 then 2 else i)"
|
10880
|
21 |
|
10603
|
22 |
text{*
|
11711
|
23 |
@{term"h 3 = 2"}
|
10880
|
24 |
@{term"h i = i"}
|
|
25 |
*}
|
10603
|
26 |
|
10880
|
27 |
text{*
|
10603
|
28 |
@{thm[display] numeral_0_eq_0[no_vars]}
|
|
29 |
\rulename{numeral_0_eq_0}
|
|
30 |
|
|
31 |
@{thm[display] numeral_1_eq_1[no_vars]}
|
|
32 |
\rulename{numeral_1_eq_1}
|
|
33 |
|
|
34 |
@{thm[display] add_2_eq_Suc[no_vars]}
|
|
35 |
\rulename{add_2_eq_Suc}
|
|
36 |
|
|
37 |
@{thm[display] add_2_eq_Suc'[no_vars]}
|
|
38 |
\rulename{add_2_eq_Suc'}
|
|
39 |
|
|
40 |
@{thm[display] add_assoc[no_vars]}
|
|
41 |
\rulename{add_assoc}
|
|
42 |
|
|
43 |
@{thm[display] add_commute[no_vars]}
|
|
44 |
\rulename{add_commute}
|
|
45 |
|
|
46 |
@{thm[display] add_left_commute[no_vars]}
|
|
47 |
\rulename{add_left_commute}
|
|
48 |
|
|
49 |
these form add_ac; similarly there is mult_ac
|
|
50 |
*}
|
|
51 |
|
|
52 |
lemma "Suc(i + j*l*k + m*n) = f (n*m + i + k*j*l)"
|
10880
|
53 |
txt{*
|
|
54 |
@{subgoals[display,indent=0,margin=65]}
|
|
55 |
*};
|
10603
|
56 |
apply (simp add: add_ac mult_ac)
|
10880
|
57 |
txt{*
|
|
58 |
@{subgoals[display,indent=0,margin=65]}
|
|
59 |
*};
|
10603
|
60 |
oops
|
|
61 |
|
|
62 |
text{*
|
|
63 |
@{thm[display] mult_le_mono[no_vars]}
|
|
64 |
\rulename{mult_le_mono}
|
|
65 |
|
|
66 |
@{thm[display] mult_less_mono1[no_vars]}
|
|
67 |
\rulename{mult_less_mono1}
|
|
68 |
|
|
69 |
@{thm[display] div_le_mono[no_vars]}
|
|
70 |
\rulename{div_le_mono}
|
|
71 |
|
|
72 |
@{thm[display] add_mult_distrib[no_vars]}
|
|
73 |
\rulename{add_mult_distrib}
|
|
74 |
|
|
75 |
@{thm[display] diff_mult_distrib[no_vars]}
|
|
76 |
\rulename{diff_mult_distrib}
|
|
77 |
|
|
78 |
@{thm[display] mod_mult_distrib[no_vars]}
|
|
79 |
\rulename{mod_mult_distrib}
|
|
80 |
|
|
81 |
@{thm[display] nat_diff_split[no_vars]}
|
|
82 |
\rulename{nat_diff_split}
|
|
83 |
*}
|
|
84 |
|
|
85 |
|
11711
|
86 |
lemma "(n - 2) * (n + 2) = n * n - (4::nat)"
|
11480
|
87 |
apply (clarsimp split: nat_diff_split)
|
|
88 |
--{* @{subgoals[display,indent=0,margin=65]} *}
|
|
89 |
apply (subgoal_tac "n=0 | n=1", force, arith)
|
10603
|
90 |
done
|
|
91 |
|
|
92 |
text{*
|
|
93 |
@{thm[display] mod_if[no_vars]}
|
|
94 |
\rulename{mod_if}
|
|
95 |
|
|
96 |
@{thm[display] mod_div_equality[no_vars]}
|
|
97 |
\rulename{mod_div_equality}
|
|
98 |
|
|
99 |
|
|
100 |
@{thm[display] div_mult1_eq[no_vars]}
|
|
101 |
\rulename{div_mult1_eq}
|
|
102 |
|
|
103 |
@{thm[display] mod_mult1_eq[no_vars]}
|
|
104 |
\rulename{mod_mult1_eq}
|
|
105 |
|
|
106 |
@{thm[display] div_mult2_eq[no_vars]}
|
|
107 |
\rulename{div_mult2_eq}
|
|
108 |
|
|
109 |
@{thm[display] mod_mult2_eq[no_vars]}
|
|
110 |
\rulename{mod_mult2_eq}
|
|
111 |
|
|
112 |
@{thm[display] div_mult_mult1[no_vars]}
|
|
113 |
\rulename{div_mult_mult1}
|
|
114 |
|
|
115 |
@{thm[display] DIVISION_BY_ZERO_DIV[no_vars]}
|
|
116 |
\rulename{DIVISION_BY_ZERO_DIV}
|
|
117 |
|
|
118 |
@{thm[display] DIVISION_BY_ZERO_MOD[no_vars]}
|
|
119 |
\rulename{DIVISION_BY_ZERO_MOD}
|
|
120 |
|
|
121 |
@{thm[display] dvd_anti_sym[no_vars]}
|
|
122 |
\rulename{dvd_anti_sym}
|
|
123 |
|
|
124 |
@{thm[display] dvd_add[no_vars]}
|
|
125 |
\rulename{dvd_add}
|
|
126 |
|
|
127 |
For the integers, I'd list a few theorems that somehow involve negative
|
|
128 |
numbers.
|
|
129 |
|
|
130 |
Division, remainder of negatives
|
|
131 |
|
|
132 |
|
|
133 |
@{thm[display] pos_mod_sign[no_vars]}
|
|
134 |
\rulename{pos_mod_sign}
|
|
135 |
|
|
136 |
@{thm[display] pos_mod_bound[no_vars]}
|
|
137 |
\rulename{pos_mod_bound}
|
|
138 |
|
|
139 |
@{thm[display] neg_mod_sign[no_vars]}
|
|
140 |
\rulename{neg_mod_sign}
|
|
141 |
|
|
142 |
@{thm[display] neg_mod_bound[no_vars]}
|
|
143 |
\rulename{neg_mod_bound}
|
|
144 |
|
|
145 |
@{thm[display] zdiv_zadd1_eq[no_vars]}
|
|
146 |
\rulename{zdiv_zadd1_eq}
|
|
147 |
|
|
148 |
@{thm[display] zmod_zadd1_eq[no_vars]}
|
|
149 |
\rulename{zmod_zadd1_eq}
|
|
150 |
|
|
151 |
@{thm[display] zdiv_zmult1_eq[no_vars]}
|
|
152 |
\rulename{zdiv_zmult1_eq}
|
|
153 |
|
|
154 |
@{thm[display] zmod_zmult1_eq[no_vars]}
|
|
155 |
\rulename{zmod_zmult1_eq}
|
|
156 |
|
|
157 |
@{thm[display] zdiv_zmult2_eq[no_vars]}
|
|
158 |
\rulename{zdiv_zmult2_eq}
|
|
159 |
|
|
160 |
@{thm[display] zmod_zmult2_eq[no_vars]}
|
|
161 |
\rulename{zmod_zmult2_eq}
|
|
162 |
|
|
163 |
@{thm[display] abs_mult[no_vars]}
|
|
164 |
\rulename{abs_mult}
|
|
165 |
*}
|
|
166 |
|
11174
|
167 |
lemma "abs (x+y) \<le> abs x + abs (y :: int)"
|
10880
|
168 |
by arith
|
|
169 |
|
11711
|
170 |
lemma "abs (2*x) = 2 * abs (x :: int)"
|
11174
|
171 |
by (simp add: zabs_def)
|
|
172 |
|
10764
|
173 |
text {*REALS
|
|
174 |
|
|
175 |
@{thm[display] realpow_abs[no_vars]}
|
|
176 |
\rulename{realpow_abs}
|
|
177 |
|
|
178 |
@{thm[display] real_dense[no_vars]}
|
|
179 |
\rulename{real_dense}
|
10603
|
180 |
|
|
181 |
@{thm[display] realpow_abs[no_vars]}
|
|
182 |
\rulename{realpow_abs}
|
|
183 |
|
10764
|
184 |
@{thm[display] real_times_divide1_eq[no_vars]}
|
|
185 |
\rulename{real_times_divide1_eq}
|
|
186 |
|
|
187 |
@{thm[display] real_times_divide2_eq[no_vars]}
|
|
188 |
\rulename{real_times_divide2_eq}
|
|
189 |
|
|
190 |
@{thm[display] real_divide_divide1_eq[no_vars]}
|
|
191 |
\rulename{real_divide_divide1_eq}
|
|
192 |
|
|
193 |
@{thm[display] real_divide_divide2_eq[no_vars]}
|
|
194 |
\rulename{real_divide_divide2_eq}
|
|
195 |
|
|
196 |
@{thm[display] real_minus_divide_eq[no_vars]}
|
|
197 |
\rulename{real_minus_divide_eq}
|
|
198 |
|
|
199 |
@{thm[display] real_divide_minus_eq[no_vars]}
|
|
200 |
\rulename{real_divide_minus_eq}
|
|
201 |
|
|
202 |
This last NOT a simprule
|
|
203 |
|
10777
|
204 |
@{thm[display] real_add_divide_distrib[no_vars]}
|
|
205 |
\rulename{real_add_divide_distrib}
|
10764
|
206 |
*}
|
10603
|
207 |
|
11711
|
208 |
lemma "3/4 < (7/8 :: real)"
|
11174
|
209 |
by simp
|
|
210 |
|
11711
|
211 |
lemma "P ((3/4) * (8/15 :: real))"
|
11174
|
212 |
txt{*
|
|
213 |
@{subgoals[display,indent=0,margin=65]}
|
|
214 |
*};
|
|
215 |
apply simp
|
|
216 |
txt{*
|
|
217 |
@{subgoals[display,indent=0,margin=65]}
|
|
218 |
*};
|
|
219 |
oops
|
|
220 |
|
11711
|
221 |
lemma "(3/4) * (8/15) < (x :: real)"
|
11174
|
222 |
txt{*
|
|
223 |
@{subgoals[display,indent=0,margin=65]}
|
|
224 |
*};
|
|
225 |
apply simp
|
|
226 |
txt{*
|
|
227 |
@{subgoals[display,indent=0,margin=65]}
|
|
228 |
*};
|
|
229 |
oops
|
|
230 |
|
11711
|
231 |
lemma "(3/4) * (10^15) < (x :: real)"
|
11174
|
232 |
apply simp
|
|
233 |
oops
|
|
234 |
|
|
235 |
|
|
236 |
|
10603
|
237 |
end
|