equal
deleted
inserted
replaced
3 Author: Tobias Nipkow |
3 Author: Tobias Nipkow |
4 Copyright 1997 TU Muenchen |
4 Copyright 1997 TU Muenchen |
5 *) |
5 *) |
6 |
6 |
7 goal thy "min 0 n = 0"; |
7 goal thy "min 0 n = 0"; |
8 br min_leastL 1; |
8 by (rtac min_leastL 1); |
9 by(trans_tac 1); |
9 by (trans_tac 1); |
10 qed "min_0L"; |
10 qed "min_0L"; |
11 |
11 |
12 goal thy "min n 0 = 0"; |
12 goal thy "min n 0 = 0"; |
13 br min_leastR 1; |
13 by (rtac min_leastR 1); |
14 by(trans_tac 1); |
14 by (trans_tac 1); |
15 qed "min_0R"; |
15 qed "min_0R"; |
16 |
16 |
17 goalw thy [min_def] "min (Suc m) (Suc n) = Suc(min m n)"; |
17 goalw thy [min_def] "min (Suc m) (Suc n) = Suc(min m n)"; |
18 by(split_tac [expand_if] 1); |
18 by (split_tac [expand_if] 1); |
19 by(Simp_tac 1); |
19 by (Simp_tac 1); |
20 qed "min_Suc_Suc"; |
20 qed "min_Suc_Suc"; |
21 |
21 |
22 Addsimps [min_0L,min_0R,min_Suc_Suc]; |
22 Addsimps [min_0L,min_0R,min_Suc_Suc]; |