| author | berghofe | 
| Mon, 11 Jun 2001 19:21:13 +0200 | |
| changeset 11371 | 1d5d181b7e28 | 
| parent 10906 | de95ba2760fe | 
| child 11440 | e389e4338604 | 
| 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 ***)  | 
|
| 9846 | 35  | 
structure Make_Elim = Make_Elim_Fun (val classical = classical);  | 
| 9158 | 36  | 
|
37  | 
(*we don't redeclare the original make_elim (Tactic.make_elim) for  | 
|
38  | 
compatibliity with strange things done in many existing proofs *)  | 
|
39  | 
val cla_make_elim = Make_Elim.make_elim;  | 
|
40  | 
||
| 10906 | 41  | 
val atomize_rules = thms "atomize'";  | 
42  | 
val atomize_tac = Method.atomize_tac atomize_rules;  | 
|
43  | 
val atomize_strip_tac = Method.atomize_strip_tac (atomize_rules, [impI, allI]);  | 
|
44  | 
||
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
45  | 
(*** Applying ClassicalFun to create a classical prover ***)  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
46  | 
structure Classical_Data =  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
47  | 
struct  | 
| 9158 | 48  | 
val make_elim = cla_make_elim  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
49  | 
val mp = mp  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
50  | 
val not_elim = notE  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
51  | 
val classical = classical  | 
| 9158 | 52  | 
val sizef = size_of_thm  | 
| 4206 | 53  | 
val hyp_subst_tacs=[hyp_subst_tac]  | 
| 10906 | 54  | 
val atomize = atomize_rules  | 
| 
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);  | 
| 10197 | 58  | 
|
59  | 
structure BasicClassical: BASIC_CLASSICAL = Classical;  | 
|
60  | 
open BasicClassical;  | 
|
61  | 
||
| 10231 | 62  | 
bind_thm ("contrapos_np", inst "Pa" "?Q" swap);
 | 
| 10197 | 63  | 
|
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
64  | 
(*Propositional rules*)  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
65  | 
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
 | 
66  | 
addSEs [conjE,disjE,impCE,FalseE,iffCE];  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
67  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
68  | 
(*Quantifier rules*)  | 
| 9969 | 69  | 
val HOL_cs = prop_cs addSIs [allI,ex_ex1I] addIs [exI, some_equality]  | 
| 3004 | 70  | 
addSEs [exE] addEs [allE];  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
71  | 
|
| 7357 | 72  | 
val clasetup = [fn thy => (claset_ref_of thy := HOL_cs; thy)];  |