| author | wenzelm |
| Sat, 02 Sep 2000 21:49:51 +0200 | |
| changeset 9803 | bc883b390d91 |
| parent 9531 | 7a0d4a6299b4 |
| child 9846 | bb848beb53f6 |
| permissions | -rw-r--r-- |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
1 |
(* Title: HOL/cladata.ML |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
2 |
ID: $Id$ |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
3 |
Author: Tobias Nipkow |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
4 |
Copyright 1996 University of Cambridge |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
5 |
|
| 4085 | 6 |
Setting up the classical reasoner. |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
7 |
*) |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
8 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
9 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
10 |
(** Applying HypsubstFun to generate hyp_subst_tac **) |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
11 |
section "Classical Reasoner"; |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
12 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
13 |
structure Hypsubst_Data = |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
14 |
struct |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
15 |
structure Simplifier = Simplifier |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
16 |
(*Take apart an equality judgement; otherwise raise Match!*) |
|
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4305
diff
changeset
|
17 |
fun dest_eq (Const("op =",T) $ t $ u) = (t, u, domain_type T)
|
|
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4305
diff
changeset
|
18 |
val dest_Trueprop = HOLogic.dest_Trueprop |
|
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4305
diff
changeset
|
19 |
val dest_imp = HOLogic.dest_imp |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
20 |
val eq_reflection = eq_reflection |
| 9531 | 21 |
val rev_eq_reflection = def_imp_eq |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
22 |
val imp_intr = impI |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
23 |
val rev_mp = rev_mp |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
24 |
val subst = subst |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
25 |
val sym = sym |
| 7357 | 26 |
val thin_refl = prove_goal (the_context ()) |
| 4223 | 27 |
"!!X. [|x=x; PROP W|] ==> PROP W" (K [atac 1]); |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
28 |
end; |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
29 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
30 |
structure Hypsubst = HypsubstFun(Hypsubst_Data); |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
31 |
open Hypsubst; |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
32 |
|
| 9158 | 33 |
|
34 |
(*** Applying Make_Elim_Fun to create a classical "make_elim" rule ***) |
|
35 |
structure Make_Elim_Data = |
|
36 |
struct |
|
37 |
val classical = classical |
|
38 |
end; |
|
39 |
||
40 |
structure Make_Elim = Make_Elim_Fun (Make_Elim_Data); |
|
41 |
||
42 |
(*we don't redeclare the original make_elim (Tactic.make_elim) for |
|
43 |
compatibliity with strange things done in many existing proofs *) |
|
44 |
val cla_make_elim = Make_Elim.make_elim; |
|
45 |
||
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
46 |
(*** Applying ClassicalFun to create a classical prover ***) |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
47 |
structure Classical_Data = |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
48 |
struct |
| 9158 | 49 |
val make_elim = cla_make_elim |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
50 |
val mp = mp |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
51 |
val not_elim = notE |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
52 |
val classical = classical |
| 9158 | 53 |
val sizef = size_of_thm |
| 4206 | 54 |
val hyp_subst_tacs=[hyp_subst_tac] |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
55 |
end; |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
56 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
57 |
structure Classical = ClassicalFun(Classical_Data); |
| 8099 | 58 |
structure BasicClassical: BASIC_CLASSICAL = Classical; open BasicClassical; |
| 9472 | 59 |
structure Obtain = ObtainFun(val atomic_thesis = HOLogic.atomic_Trueprop and |
60 |
that_atts = [Simplifier.simp_add_local, Classical.haz_intro_local]); |
|
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
61 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
62 |
(*Propositional rules*) |
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
63 |
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI] |
|
4305
03d7de40ee4f
The change from iffE to iffCE means fewer case splits in most cases. Very few
paulson
parents:
4240
diff
changeset
|
64 |
addSEs [conjE,disjE,impCE,FalseE,iffCE]; |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
65 |
|
|
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
66 |
(*Quantifier rules*) |
| 4535 | 67 |
val HOL_cs = prop_cs addSIs [allI,ex_ex1I] addIs [exI, select_equality] |
| 3004 | 68 |
addSEs [exE] addEs [allE]; |
|
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff
changeset
|
69 |
|
| 7357 | 70 |
val clasetup = [fn thy => (claset_ref_of thy := HOL_cs; thy)]; |