| author | wenzelm |
| Sun, 25 Jun 2000 23:58:54 +0200 | |
| changeset 9142 | d5a841f89e92 |
| parent 9035 | 371f023d3dbd |
| child 9228 | 672b03038110 |
| permissions | -rw-r--r-- |
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
1 |
(* Title: HOL/Calculation.thy |
|
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
2 |
ID: $Id$ |
|
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
4 |
|
| 6873 | 5 |
Setup transitivity rules for calculational proofs. Note that in the |
6 |
list below later rules have priority. |
|
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
7 |
*) |
|
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
8 |
|
| 9035 | 9 |
theory Calculation = IntArith: |
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
10 |
|
| 9142 | 11 |
theorem [trans]: "[| s = t; P t |] ==> P s" (* = x x *) |
| 9035 | 12 |
by (rule ssubst) |
| 6873 | 13 |
|
| 9142 | 14 |
theorem [trans]: "[| P s; s = t |] ==> P t" (* x = x *) |
| 9035 | 15 |
by (rule subst) |
| 7381 | 16 |
|
| 9142 | 17 |
theorems [trans] = rev_mp mp (* x --> x *) |
18 |
(* --> x x *) |
|
19 |
||
20 |
theorems [trans] = dvd_trans (* dvd dvd dvd *) |
|
| 7202 | 21 |
|
| 9035 | 22 |
theorem [trans]: "[| c:A; A <= B |] ==> c:B" |
23 |
by (rule subsetD) |
|
| 7657 | 24 |
|
| 9035 | 25 |
theorem [trans]: "[| A <= B; c:A |] ==> c:B" |
26 |
by (rule subsetD) |
|
| 7657 | 27 |
|
| 9142 | 28 |
theorem [trans]: "[| x ~= y; (x::'a::order) <= y |] ==> x < y" (* ~= <= < *) |
| 9035 | 29 |
by (simp! add: order_less_le) |
| 7561 | 30 |
|
| 9142 | 31 |
theorem [trans]: "[| (x::'a::order) <= y; x ~= y |] ==> x < y" (* <= ~= < *) |
| 9035 | 32 |
by (simp! add: order_less_le) |
| 7561 | 33 |
|
| 9142 | 34 |
theorem [trans]: "[| (x::'a::order) < y; y < x |] ==> P" (* < > P *) |
| 9035 | 35 |
by (rule order_less_asym) |
| 6873 | 36 |
|
| 9142 | 37 |
theorems [trans] = order_less_trans (* < < < *) |
38 |
theorems [trans] = order_le_less_trans (* <= < < *) |
|
39 |
theorems [trans] = order_less_le_trans (* < <= < *) |
|
40 |
theorems [trans] = order_trans (* <= <= <= *) |
|
41 |
theorems [trans] = order_antisym (* <= >= = *) |
|
| 6862 | 42 |
|
| 9142 | 43 |
theorem [trans]: "[| x <= y; y = z |] ==> x <= z" (* <= = <= *) |
| 9035 | 44 |
by (rule subst) |
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
45 |
|
| 9142 | 46 |
theorem [trans]: "[| x = y; y <= z |] ==> x <= z" (* = <= <= *) |
| 9035 | 47 |
by (rule ssubst) |
| 6862 | 48 |
|
| 9142 | 49 |
theorem [trans]: "[| x < y; y = z |] ==> x < z" (* < = < *) |
| 9035 | 50 |
by (rule subst) |
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
51 |
|
| 9142 | 52 |
theorem [trans]: "[| x = y; y < z |] ==> x < z" (* = < < *) |
| 9035 | 53 |
by (rule ssubst) |
|
6779
2912aff958bd
Calculation.thy: Setup transitivity rules for calculational proofs.
wenzelm
parents:
diff
changeset
|
54 |
|
| 9142 | 55 |
theorems [trans] = trans (* = = = *) |
| 6945 | 56 |
|
| 8229 | 57 |
theorems [elim??] = sym |
58 |
||
| 9035 | 59 |
end |