author | clasohm |
Sun, 24 Apr 1994 11:27:38 +0200 | |
changeset 70 | 9459592608e2 |
parent 57 | 194d088c1511 |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: HOL/nat |
2 |
ID: $Id$ |
|
3 |
Author: Tobias Nipkow, Cambridge University Computer Laboratory |
|
4 |
Copyright 1991 University of Cambridge |
|
5 |
||
6 |
For nat.thy. Type nat is defined as a set (Nat) over the type ind. |
|
7 |
*) |
|
8 |
||
9 |
open Nat; |
|
10 |
||
11 |
goal Nat.thy "mono(%X. {Zero_Rep} Un (Suc_Rep``X))"; |
|
12 |
by (REPEAT (ares_tac [monoI, subset_refl, image_mono, Un_mono] 1)); |
|
13 |
val Nat_fun_mono = result(); |
|
14 |
||
15 |
val Nat_unfold = Nat_fun_mono RS (Nat_def RS def_lfp_Tarski); |
|
16 |
||
17 |
(* Zero is a natural number -- this also justifies the type definition*) |
|
18 |
goal Nat.thy "Zero_Rep: Nat"; |
|
19 |
by (rtac (Nat_unfold RS ssubst) 1); |
|
20 |
by (rtac (singletonI RS UnI1) 1); |
|
21 |
val Zero_RepI = result(); |
|
22 |
||
23 |
val prems = goal Nat.thy "i: Nat ==> Suc_Rep(i) : Nat"; |
|
24 |
by (rtac (Nat_unfold RS ssubst) 1); |
|
25 |
by (rtac (imageI RS UnI2) 1); |
|
26 |
by (resolve_tac prems 1); |
|
27 |
val Suc_RepI = result(); |
|
28 |
||
29 |
(*** Induction ***) |
|
30 |
||
31 |
val major::prems = goal Nat.thy |
|
32 |
"[| i: Nat; P(Zero_Rep); \ |
|
33 |
\ !!j. [| j: Nat; P(j) |] ==> P(Suc_Rep(j)) |] ==> P(i)"; |
|
34 |
by (rtac (major RS (Nat_def RS def_induct)) 1); |
|
35 |
by (rtac Nat_fun_mono 1); |
|
36 |
by (fast_tac (set_cs addIs prems) 1); |
|
37 |
val Nat_induct = result(); |
|
38 |
||
39 |
val prems = goalw Nat.thy [Zero_def,Suc_def] |
|
40 |
"[| P(0); \ |
|
41 |
\ !!k. P(k) ==> P(Suc(k)) |] ==> P(n)"; |
|
42 |
by (rtac (Rep_Nat_inverse RS subst) 1); (*types force good instantiation*) |
|
43 |
by (rtac (Rep_Nat RS Nat_induct) 1); |
|
44 |
by (REPEAT (ares_tac prems 1 |
|
45 |
ORELSE eresolve_tac [Abs_Nat_inverse RS subst] 1)); |
|
46 |
val nat_induct = result(); |
|
47 |
||
48 |
(*Perform induction on n. *) |
|
49 |
fun nat_ind_tac a i = |
|
50 |
EVERY [res_inst_tac [("n",a)] nat_induct i, |
|
51 |
rename_last_tac a ["1"] (i+1)]; |
|
52 |
||
53 |
(*A special form of induction for reasoning about m<n and m-n*) |
|
54 |
val prems = goal Nat.thy |
|
55 |
"[| !!x. P(x,0); \ |
|
56 |
\ !!y. P(0,Suc(y)); \ |
|
57 |
\ !!x y. [| P(x,y) |] ==> P(Suc(x),Suc(y)) \ |
|
58 |
\ |] ==> P(m,n)"; |
|
59 |
by (res_inst_tac [("x","m")] spec 1); |
|
60 |
by (nat_ind_tac "n" 1); |
|
61 |
by (rtac allI 2); |
|
62 |
by (nat_ind_tac "x" 2); |
|
63 |
by (REPEAT (ares_tac (prems@[allI]) 1 ORELSE etac spec 1)); |
|
64 |
val diff_induct = result(); |
|
65 |
||
66 |
(*Case analysis on the natural numbers*) |
|
67 |
val prems = goal Nat.thy |
|
68 |
"[| n=0 ==> P; !!x. n = Suc(x) ==> P |] ==> P"; |
|
69 |
by (subgoal_tac "n=0 | (EX x. n = Suc(x))" 1); |
|
70 |
by (fast_tac (HOL_cs addSEs prems) 1); |
|
71 |
by (nat_ind_tac "n" 1); |
|
72 |
by (rtac (refl RS disjI1) 1); |
|
73 |
by (fast_tac HOL_cs 1); |
|
74 |
val natE = result(); |
|
75 |
||
76 |
(*** Isomorphisms: Abs_Nat and Rep_Nat ***) |
|
77 |
||
78 |
(*We can't take these properties as axioms, or take Abs_Nat==Inv(Rep_Nat), |
|
79 |
since we assume the isomorphism equations will one day be given by Isabelle*) |
|
80 |
||
81 |
goal Nat.thy "inj(Rep_Nat)"; |
|
82 |
by (rtac inj_inverseI 1); |
|
83 |
by (rtac Rep_Nat_inverse 1); |
|
84 |
val inj_Rep_Nat = result(); |
|
85 |
||
86 |
goal Nat.thy "inj_onto(Abs_Nat,Nat)"; |
|
87 |
by (rtac inj_onto_inverseI 1); |
|
88 |
by (etac Abs_Nat_inverse 1); |
|
89 |
val inj_onto_Abs_Nat = result(); |
|
90 |
||
91 |
(*** Distinctness of constructors ***) |
|
92 |
||
5 | 93 |
goalw Nat.thy [Zero_def,Suc_def] "Suc(m) ~= 0"; |
0 | 94 |
by (rtac (inj_onto_Abs_Nat RS inj_onto_contraD) 1); |
95 |
by (rtac Suc_Rep_not_Zero_Rep 1); |
|
96 |
by (REPEAT (resolve_tac [Rep_Nat, Suc_RepI, Zero_RepI] 1)); |
|
97 |
val Suc_not_Zero = result(); |
|
98 |
||
99 |
val Zero_not_Suc = standard (Suc_not_Zero RS not_sym); |
|
100 |
||
101 |
val Suc_neq_Zero = standard (Suc_not_Zero RS notE); |
|
102 |
val Zero_neq_Suc = sym RS Suc_neq_Zero; |
|
103 |
||
104 |
(** Injectiveness of Suc **) |
|
105 |
||
106 |
goalw Nat.thy [Suc_def] "inj(Suc)"; |
|
107 |
by (rtac injI 1); |
|
108 |
by (dtac (inj_onto_Abs_Nat RS inj_ontoD) 1); |
|
109 |
by (REPEAT (resolve_tac [Rep_Nat, Suc_RepI] 1)); |
|
110 |
by (dtac (inj_Suc_Rep RS injD) 1); |
|
111 |
by (etac (inj_Rep_Nat RS injD) 1); |
|
112 |
val inj_Suc = result(); |
|
113 |
||
114 |
val Suc_inject = inj_Suc RS injD;; |
|
115 |
||
116 |
goal Nat.thy "(Suc(m)=Suc(n)) = (m=n)"; |
|
117 |
by (EVERY1 [rtac iffI, etac Suc_inject, etac arg_cong]); |
|
118 |
val Suc_Suc_eq = result(); |
|
119 |
||
5 | 120 |
goal Nat.thy "n ~= Suc(n)"; |
0 | 121 |
by (nat_ind_tac "n" 1); |
122 |
by (ALLGOALS(asm_simp_tac (HOL_ss addsimps [Zero_not_Suc,Suc_Suc_eq]))); |
|
123 |
val n_not_Suc_n = result(); |
|
124 |
||
45 | 125 |
val Suc_n_not_n = n_not_Suc_n RS not_sym; |
126 |
||
0 | 127 |
(*** nat_case -- the selection operator for nat ***) |
128 |
||
129 |
goalw Nat.thy [nat_case_def] "nat_case(0, a, f) = a"; |
|
130 |
by (fast_tac (set_cs addIs [select_equality] addEs [Zero_neq_Suc]) 1); |
|
131 |
val nat_case_0 = result(); |
|
132 |
||
133 |
goalw Nat.thy [nat_case_def] "nat_case(Suc(k), a, f) = f(k)"; |
|
134 |
by (fast_tac (set_cs addIs [select_equality] |
|
135 |
addEs [make_elim Suc_inject, Suc_neq_Zero]) 1); |
|
136 |
val nat_case_Suc = result(); |
|
137 |
||
138 |
(** Introduction rules for 'pred_nat' **) |
|
139 |
||
140 |
goalw Nat.thy [pred_nat_def] "<n, Suc(n)> : pred_nat"; |
|
141 |
by (fast_tac set_cs 1); |
|
142 |
val pred_natI = result(); |
|
143 |
||
144 |
val major::prems = goalw Nat.thy [pred_nat_def] |
|
145 |
"[| p : pred_nat; !!x n. [| p = <n, Suc(n)> |] ==> R \ |
|
146 |
\ |] ==> R"; |
|
147 |
by (rtac (major RS CollectE) 1); |
|
148 |
by (REPEAT (eresolve_tac ([asm_rl,exE]@prems) 1)); |
|
149 |
val pred_natE = result(); |
|
150 |
||
151 |
goalw Nat.thy [wf_def] "wf(pred_nat)"; |
|
152 |
by (strip_tac 1); |
|
153 |
by (nat_ind_tac "x" 1); |
|
154 |
by (fast_tac (HOL_cs addSEs [mp, pred_natE, Pair_inject, |
|
155 |
make_elim Suc_inject]) 2); |
|
156 |
by (fast_tac (HOL_cs addSEs [mp, pred_natE, Pair_inject, Zero_neq_Suc]) 1); |
|
157 |
val wf_pred_nat = result(); |
|
158 |
||
159 |
||
160 |
(*** nat_rec -- by wf recursion on pred_nat ***) |
|
161 |
||
162 |
val nat_rec_unfold = standard (wf_pred_nat RS (nat_rec_def RS def_wfrec)); |
|
163 |
||
164 |
(** conversion rules **) |
|
165 |
||
166 |
goal Nat.thy "nat_rec(0,c,h) = c"; |
|
167 |
by (rtac (nat_rec_unfold RS trans) 1); |
|
168 |
by (rtac nat_case_0 1); |
|
169 |
val nat_rec_0 = result(); |
|
170 |
||
171 |
goal Nat.thy "nat_rec(Suc(n), c, h) = h(n, nat_rec(n,c,h))"; |
|
172 |
by (rtac (nat_rec_unfold RS trans) 1); |
|
173 |
by (rtac (nat_case_Suc RS trans) 1); |
|
174 |
by(simp_tac (HOL_ss addsimps [pred_natI,cut_apply]) 1); |
|
175 |
val nat_rec_Suc = result(); |
|
176 |
||
177 |
(*These 2 rules ease the use of primitive recursion. NOTE USE OF == *) |
|
178 |
val [rew] = goal Nat.thy |
|
179 |
"[| !!n. f(n) == nat_rec(n,c,h) |] ==> f(0) = c"; |
|
180 |
by (rewtac rew); |
|
181 |
by (rtac nat_rec_0 1); |
|
182 |
val def_nat_rec_0 = result(); |
|
183 |
||
184 |
val [rew] = goal Nat.thy |
|
185 |
"[| !!n. f(n) == nat_rec(n,c,h) |] ==> f(Suc(n)) = h(n,f(n))"; |
|
186 |
by (rewtac rew); |
|
187 |
by (rtac nat_rec_Suc 1); |
|
188 |
val def_nat_rec_Suc = result(); |
|
189 |
||
190 |
fun nat_recs def = |
|
191 |
[standard (def RS def_nat_rec_0), |
|
192 |
standard (def RS def_nat_rec_Suc)]; |
|
193 |
||
194 |
||
195 |
(*** Basic properties of "less than" ***) |
|
196 |
||
197 |
(** Introduction properties **) |
|
198 |
||
199 |
val prems = goalw Nat.thy [less_def] "[| i<j; j<k |] ==> i<k::nat"; |
|
200 |
by (rtac (trans_trancl RS transD) 1); |
|
201 |
by (resolve_tac prems 1); |
|
202 |
by (resolve_tac prems 1); |
|
203 |
val less_trans = result(); |
|
204 |
||
205 |
goalw Nat.thy [less_def] "n < Suc(n)"; |
|
206 |
by (rtac (pred_natI RS r_into_trancl) 1); |
|
207 |
val lessI = result(); |
|
208 |
||
209 |
(* i<j ==> i<Suc(j) *) |
|
210 |
val less_SucI = lessI RSN (2, less_trans); |
|
211 |
||
212 |
goal Nat.thy "0 < Suc(n)"; |
|
213 |
by (nat_ind_tac "n" 1); |
|
214 |
by (rtac lessI 1); |
|
215 |
by (etac less_trans 1); |
|
216 |
by (rtac lessI 1); |
|
217 |
val zero_less_Suc = result(); |
|
218 |
||
219 |
(** Elimination properties **) |
|
220 |
||
45 | 221 |
val prems = goalw Nat.thy [less_def] "n<m ==> ~ m<n::nat"; |
222 |
by(fast_tac (HOL_cs addIs ([wf_pred_nat, wf_trancl RS wf_anti_sym]@prems))1); |
|
0 | 223 |
val less_not_sym = result(); |
224 |
||
225 |
(* [| n<m; m<n |] ==> R *) |
|
45 | 226 |
val less_anti_sym = standard (less_not_sym RS notE); |
0 | 227 |
|
228 |
goalw Nat.thy [less_def] "~ n<n::nat"; |
|
229 |
by (rtac notI 1); |
|
230 |
by (etac (wf_pred_nat RS wf_trancl RS wf_anti_refl) 1); |
|
231 |
val less_not_refl = result(); |
|
232 |
||
233 |
(* n<n ==> R *) |
|
234 |
val less_anti_refl = standard (less_not_refl RS notE); |
|
235 |
||
45 | 236 |
goal Nat.thy "!!m. n<m ==> m ~= n::nat"; |
237 |
by(fast_tac (HOL_cs addEs [less_anti_refl]) 1); |
|
238 |
val less_not_refl2 = result(); |
|
239 |
||
0 | 240 |
|
241 |
val major::prems = goalw Nat.thy [less_def] |
|
242 |
"[| i<k; k=Suc(i) ==> P; !!j. [| i<j; k=Suc(j) |] ==> P \ |
|
243 |
\ |] ==> P"; |
|
244 |
by (rtac (major RS tranclE) 1); |
|
245 |
by (fast_tac (HOL_cs addSEs (prems@[pred_natE, Pair_inject])) 1); |
|
246 |
by (fast_tac (HOL_cs addSEs (prems@[pred_natE, Pair_inject])) 1); |
|
247 |
val lessE = result(); |
|
248 |
||
249 |
goal Nat.thy "~ n<0"; |
|
250 |
by (rtac notI 1); |
|
251 |
by (etac lessE 1); |
|
252 |
by (etac Zero_neq_Suc 1); |
|
253 |
by (etac Zero_neq_Suc 1); |
|
254 |
val not_less0 = result(); |
|
255 |
||
256 |
(* n<0 ==> R *) |
|
257 |
val less_zeroE = standard (not_less0 RS notE); |
|
258 |
||
259 |
val [major,less,eq] = goal Nat.thy |
|
260 |
"[| m < Suc(n); m<n ==> P; m=n ==> P |] ==> P"; |
|
261 |
by (rtac (major RS lessE) 1); |
|
262 |
by (rtac eq 1); |
|
263 |
by (fast_tac (HOL_cs addSDs [Suc_inject]) 1); |
|
264 |
by (rtac less 1); |
|
265 |
by (fast_tac (HOL_cs addSDs [Suc_inject]) 1); |
|
266 |
val less_SucE = result(); |
|
267 |
||
268 |
goal Nat.thy "(m < Suc(n)) = (m < n | m = n)"; |
|
269 |
by (fast_tac (HOL_cs addSIs [lessI] |
|
270 |
addEs [less_trans, less_SucE]) 1); |
|
271 |
val less_Suc_eq = result(); |
|
272 |
||
273 |
||
274 |
(** Inductive (?) properties **) |
|
275 |
||
276 |
val [prem] = goal Nat.thy "Suc(m) < n ==> m<n"; |
|
277 |
by (rtac (prem RS rev_mp) 1); |
|
278 |
by (nat_ind_tac "n" 1); |
|
279 |
by (rtac impI 1); |
|
280 |
by (etac less_zeroE 1); |
|
281 |
by (fast_tac (HOL_cs addSIs [lessI RS less_SucI] |
|
282 |
addSDs [Suc_inject] |
|
283 |
addEs [less_trans, lessE]) 1); |
|
284 |
val Suc_lessD = result(); |
|
285 |
||
286 |
val [major,minor] = goal Nat.thy |
|
287 |
"[| Suc(i)<k; !!j. [| i<j; k=Suc(j) |] ==> P \ |
|
288 |
\ |] ==> P"; |
|
289 |
by (rtac (major RS lessE) 1); |
|
290 |
by (etac (lessI RS minor) 1); |
|
291 |
by (etac (Suc_lessD RS minor) 1); |
|
292 |
by (assume_tac 1); |
|
293 |
val Suc_lessE = result(); |
|
294 |
||
295 |
val [major] = goal Nat.thy "Suc(m) < Suc(n) ==> m<n"; |
|
296 |
by (rtac (major RS lessE) 1); |
|
297 |
by (REPEAT (rtac lessI 1 |
|
298 |
ORELSE eresolve_tac [make_elim Suc_inject, ssubst, Suc_lessD] 1)); |
|
299 |
val Suc_less_SucD = result(); |
|
300 |
||
301 |
val prems = goal Nat.thy "m<n ==> Suc(m) < Suc(n)"; |
|
302 |
by (subgoal_tac "m<n --> Suc(m) < Suc(n)" 1); |
|
303 |
by (fast_tac (HOL_cs addIs prems) 1); |
|
304 |
by (nat_ind_tac "n" 1); |
|
305 |
by (rtac impI 1); |
|
306 |
by (etac less_zeroE 1); |
|
307 |
by (fast_tac (HOL_cs addSIs [lessI] |
|
308 |
addSDs [Suc_inject] |
|
309 |
addEs [less_trans, lessE]) 1); |
|
310 |
val Suc_mono = result(); |
|
311 |
||
312 |
goal Nat.thy "(Suc(m) < Suc(n)) = (m<n)"; |
|
313 |
by (EVERY1 [rtac iffI, etac Suc_less_SucD, etac Suc_mono]); |
|
314 |
val Suc_less_eq = result(); |
|
315 |
||
45 | 316 |
goal Nat.thy "~(Suc(n) < n)"; |
317 |
by(fast_tac (HOL_cs addEs [Suc_lessD RS less_anti_refl]) 1); |
|
0 | 318 |
val not_Suc_n_less_n = result(); |
319 |
||
320 |
(*"Less than" is a linear ordering*) |
|
321 |
goal Nat.thy "m<n | m=n | n<m::nat"; |
|
322 |
by (nat_ind_tac "m" 1); |
|
323 |
by (nat_ind_tac "n" 1); |
|
324 |
by (rtac (refl RS disjI1 RS disjI2) 1); |
|
325 |
by (rtac (zero_less_Suc RS disjI1) 1); |
|
326 |
by (fast_tac (HOL_cs addIs [lessI, Suc_mono, less_SucI] addEs [lessE]) 1); |
|
327 |
val less_linear = result(); |
|
328 |
||
329 |
(*Can be used with less_Suc_eq to get n=m | n<m *) |
|
330 |
goal Nat.thy "(~ m < n) = (n < Suc(m))"; |
|
331 |
by (res_inst_tac [("m","m"),("n","n")] diff_induct 1); |
|
332 |
by(ALLGOALS(asm_simp_tac (HOL_ss addsimps |
|
333 |
[not_less0,zero_less_Suc,Suc_less_eq]))); |
|
334 |
val not_less_eq = result(); |
|
335 |
||
336 |
(*Complete induction, aka course-of-values induction*) |
|
337 |
val prems = goalw Nat.thy [less_def] |
|
338 |
"[| !!n. [| ! m::nat. m<n --> P(m) |] ==> P(n) |] ==> P(n)"; |
|
339 |
by (wf_ind_tac "n" [wf_pred_nat RS wf_trancl] 1); |
|
340 |
by (eresolve_tac prems 1); |
|
341 |
val less_induct = result(); |
|
342 |
||
343 |
||
344 |
(*** Properties of <= ***) |
|
345 |
||
346 |
goalw Nat.thy [le_def] "0 <= n"; |
|
347 |
by (rtac not_less0 1); |
|
348 |
val le0 = result(); |
|
349 |
||
350 |
val nat_simps = [not_less0, less_not_refl, zero_less_Suc, lessI, |
|
45 | 351 |
Suc_less_eq, less_Suc_eq, le0, not_Suc_n_less_n, |
352 |
Suc_not_Zero, Zero_not_Suc, Suc_Suc_eq, |
|
353 |
n_not_Suc_n, Suc_n_not_n, |
|
0 | 354 |
nat_case_0, nat_case_Suc, nat_rec_0, nat_rec_Suc]; |
355 |
||
20 | 356 |
val nat_ss = sum_ss addsimps nat_simps; |
0 | 357 |
|
2
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
358 |
(*Prevents simplification of f and g: much faster*) |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
359 |
val nat_case_weak_cong = prove_goal Nat.thy |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
360 |
"m=n ==> nat_case(m,a,f) = nat_case(n,a,f)" |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
361 |
(fn [prem] => [rtac (prem RS arg_cong) 1]); |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
362 |
|
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
363 |
val nat_rec_weak_cong = prove_goal Nat.thy |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
364 |
"m=n ==> nat_rec(m,a,f) = nat_rec(n,a,f)" |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
365 |
(fn [prem] => [rtac (prem RS arg_cong) 1]); |
befa4e9f7c90
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
lcp
parents:
0
diff
changeset
|
366 |
|
0 | 367 |
val prems = goalw Nat.thy [le_def] "~(n<m) ==> m<=n::nat"; |
368 |
by (resolve_tac prems 1); |
|
369 |
val leI = result(); |
|
370 |
||
371 |
val prems = goalw Nat.thy [le_def] "m<=n ==> ~(n<m::nat)"; |
|
372 |
by (resolve_tac prems 1); |
|
373 |
val leD = result(); |
|
374 |
||
375 |
val leE = make_elim leD; |
|
376 |
||
377 |
goalw Nat.thy [le_def] "!!m. ~ m <= n ==> n<m::nat"; |
|
378 |
by (fast_tac HOL_cs 1); |
|
379 |
val not_leE = result(); |
|
380 |
||
381 |
goalw Nat.thy [le_def] "!!m. m < n ==> Suc(m) <= n"; |
|
45 | 382 |
by(simp_tac nat_ss 1); |
0 | 383 |
by (fast_tac (HOL_cs addEs [less_anti_refl,less_anti_sym]) 1); |
384 |
val lessD = result(); |
|
385 |
||
40 | 386 |
goalw Nat.thy [le_def] "!!m. Suc(m) <= n ==> m <= n"; |
45 | 387 |
by(asm_full_simp_tac nat_ss 1); |
40 | 388 |
by(fast_tac HOL_cs 1); |
389 |
val Suc_leD = result(); |
|
390 |
||
0 | 391 |
goalw Nat.thy [le_def] "!!m. m < n ==> m <= n::nat"; |
392 |
by (fast_tac (HOL_cs addEs [less_anti_sym]) 1); |
|
393 |
val less_imp_le = result(); |
|
394 |
||
395 |
goalw Nat.thy [le_def] "!!m. m <= n ==> m < n | m=n::nat"; |
|
396 |
by (cut_facts_tac [less_linear] 1); |
|
397 |
by (fast_tac (HOL_cs addEs [less_anti_refl,less_anti_sym]) 1); |
|
398 |
val le_imp_less_or_eq = result(); |
|
399 |
||
400 |
goalw Nat.thy [le_def] "!!m. m<n | m=n ==> m <= n::nat"; |
|
401 |
by (cut_facts_tac [less_linear] 1); |
|
402 |
by (fast_tac (HOL_cs addEs [less_anti_refl,less_anti_sym]) 1); |
|
403 |
by (flexflex_tac); |
|
404 |
val less_or_eq_imp_le = result(); |
|
405 |
||
406 |
goal Nat.thy "(x <= y::nat) = (x < y | x=y)"; |
|
407 |
by (REPEAT(ares_tac [iffI,less_or_eq_imp_le,le_imp_less_or_eq] 1)); |
|
408 |
val le_eq_less_or_eq = result(); |
|
409 |
||
410 |
goal Nat.thy "n <= n::nat"; |
|
411 |
by(simp_tac (HOL_ss addsimps [le_eq_less_or_eq]) 1); |
|
412 |
val le_refl = result(); |
|
413 |
||
414 |
val prems = goal Nat.thy "!!i. [| i <= j; j < k |] ==> i < k::nat"; |
|
415 |
by (dtac le_imp_less_or_eq 1); |
|
416 |
by (fast_tac (HOL_cs addIs [less_trans]) 1); |
|
417 |
val le_less_trans = result(); |
|
418 |
||
419 |
goal Nat.thy "!!i. [| i <= j; j <= k |] ==> i <= k::nat"; |
|
420 |
by (EVERY1[dtac le_imp_less_or_eq, dtac le_imp_less_or_eq, |
|
421 |
rtac less_or_eq_imp_le, fast_tac (HOL_cs addIs [less_trans])]); |
|
422 |
val le_trans = result(); |
|
423 |
||
424 |
val prems = goal Nat.thy "!!m. [| m <= n; n <= m |] ==> m = n::nat"; |
|
425 |
by (EVERY1[dtac le_imp_less_or_eq, dtac le_imp_less_or_eq, |
|
426 |
fast_tac (HOL_cs addEs [less_anti_refl,less_anti_sym])]); |
|
427 |
val le_anti_sym = result(); |
|
57 | 428 |
|
429 |
val nat_ss = nat_ss addsimps [le_refl]; |