| author | wenzelm | 
| Mon, 12 Jul 1999 22:29:38 +0200 | |
| changeset 6986 | 82a4ac9c6b03 | 
| parent 5929 | 890f2f9b926d | 
| child 7007 | b46ccfee8e59 | 
| 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  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
21  | 
val imp_intr = impI  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
22  | 
val rev_mp = rev_mp  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
23  | 
val subst = subst  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
24  | 
val sym = sym  | 
| 4223 | 25  | 
val thin_refl = prove_goal HOL.thy  | 
26  | 
"!!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
 | 
27  | 
end;  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
28  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
29  | 
structure Hypsubst = HypsubstFun(Hypsubst_Data);  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
30  | 
open Hypsubst;  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
31  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
32  | 
(*** Applying ClassicalFun to create a classical prover ***)  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
33  | 
structure Classical_Data =  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
34  | 
struct  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
35  | 
val sizef = size_of_thm  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
36  | 
val mp = mp  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
37  | 
val not_elim = notE  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
38  | 
val classical = classical  | 
| 4206 | 39  | 
val hyp_subst_tacs=[hyp_subst_tac]  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
40  | 
end;  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
41  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
42  | 
structure Classical = ClassicalFun(Classical_Data);  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
43  | 
open Classical;  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
44  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
45  | 
(*Propositional rules*)  | 
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
46  | 
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
 | 
47  | 
addSEs [conjE,disjE,impCE,FalseE,iffCE];  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
48  | 
|
| 
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
49  | 
(*Quantifier rules*)  | 
| 4535 | 50  | 
val HOL_cs = prop_cs addSIs [allI,ex_ex1I] addIs [exI, select_equality]  | 
| 3004 | 51  | 
addSEs [exE] addEs [allE];  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
52  | 
|
| 4085 | 53  | 
claset_ref() := HOL_cs;  | 
| 
1985
 
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
 
paulson 
parents:  
diff
changeset
 | 
54  | 
|
| 3004 | 55  | 
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)  | 
56  | 
qed_goal "alt_ex1E" thy  | 
|
| 3842 | 57  | 
"[| ?! x. P(x); \  | 
| 3004 | 58  | 
\ !!x. [| P(x); ALL y y'. P(y) & P(y') --> y=y' |] ==> R \  | 
59  | 
\ |] ==> R"  | 
|
60  | 
(fn major::prems =>  | 
|
61  | 
[ (rtac (major RS ex1E) 1),  | 
|
62  | 
(REPEAT (ares_tac (allI::prems) 1)),  | 
|
63  | 
(etac (dup_elim allE) 1),  | 
|
64  | 
(Fast_tac 1)]);  | 
|
65  | 
||
66  | 
AddSEs [alt_ex1E];  | 
|
| 2860 | 67  | 
|
68  | 
(*** Applying BlastFun to create Blast_tac ***)  | 
|
69  | 
structure Blast_Data =  | 
|
70  | 
struct  | 
|
71  | 
type claset = Classical.claset  | 
|
72  | 
val notE = notE  | 
|
73  | 
val ccontr = ccontr  | 
|
74  | 
val contr_tac = Classical.contr_tac  | 
|
75  | 
val dup_intr = Classical.dup_intr  | 
|
| 
4466
 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
 
paulson 
parents: 
4305 
diff
changeset
 | 
76  | 
val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac  | 
| 2860 | 77  | 
val claset = Classical.claset  | 
| 4653 | 78  | 
val rep_cs = Classical.rep_cs  | 
| 5929 | 79  | 
val cla_method' = Classical.cla_method'  | 
| 2860 | 80  | 
end;  | 
81  | 
||
82  | 
structure Blast = BlastFun(Blast_Data);  | 
|
| 
4240
 
8ba60a4cd380
Renamed "overload" to "overloaded" for sml/nj compatibility
 
paulson 
parents: 
4223 
diff
changeset
 | 
83  | 
Blast.overloaded ("op =", domain_type);	(*overloading of equality as iff*)
 | 
| 2860 | 84  | 
|
85  | 
val Blast_tac = Blast.Blast_tac  | 
|
86  | 
and blast_tac = Blast.blast_tac;  |