author  lcp 
Fri, 25 Nov 1994 00:02:37 +0100  
changeset 745  45a789407806 
parent 429  888bbb4119f8 
child 756  e0e5c1581e4c 
permissions  rwrr 
0  1 
(* Title: FOL/simpdata 
2 
ID: $Id$ 

3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 

282  4 
Copyright 1994 University of Cambridge 
0  5 

6 
Simplification data for FOL 

7 
*) 

8 

9 
(*** Rewrite rules ***) 

10 

11 
fun int_prove_fun s = 

282  12 
(writeln s; 
13 
prove_goal IFOL.thy s 

14 
(fn prems => [ (cut_facts_tac prems 1), 

15 
(Int.fast_tac 1) ])); 

0  16 

17 
val conj_rews = map int_prove_fun 

282  18 
["P & True <> P", "True & P <> P", 
0  19 
"P & False <> False", "False & P <> False", 
20 
"P & P <> P", 

282  21 
"P & ~P <> False", "~P & P <> False", 
0  22 
"(P & Q) & R <> P & (Q & R)"]; 
23 

24 
val disj_rews = map int_prove_fun 

25 
["P  True <> True", "True  P <> True", 

26 
"P  False <> P", "False  P <> P", 

27 
"P  P <> P", 

28 
"(P  Q)  R <> P  (Q  R)"]; 

29 

30 
val not_rews = map int_prove_fun 

282  31 
["~(PQ) <> ~P & ~Q", 
32 
"~ False <> True", "~ True <> False"]; 

0  33 

34 
val imp_rews = map int_prove_fun 

35 
["(P > False) <> ~P", "(P > True) <> True", 

36 
"(False > P) <> True", "(True > P) <> P", 

37 
"(P > P) <> True", "(P > ~P) <> ~P"]; 

38 

39 
val iff_rews = map int_prove_fun 

40 
["(True <> P) <> P", "(P <> True) <> P", 

41 
"(P <> P) <> True", 

42 
"(False <> P) <> ~P", "(P <> False) <> ~P"]; 

43 

44 
val quant_rews = map int_prove_fun 

45 
["(ALL x.P) <> P", "(EX x.P) <> P"]; 

46 

47 
(*These are NOT supplied by default!*) 

48 
val distrib_rews = map int_prove_fun 

282  49 
["P & (Q  R) <> P&Q  P&R", 
50 
"(Q  R) & P <> Q&P  R&P", 

0  51 
"(P  Q > R) <> (P > R) & (Q > R)"]; 
52 

282  53 
(** Conversion into rewrite rules **) 
0  54 

53  55 
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th; 
56 

282  57 
(*Make atomic rewrite rules*) 
429
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

58 
fun atomize r = 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

59 
case concl_of r of 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

60 
Const("Trueprop",_) $ p => 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

61 
(case p of 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

62 
Const("op >",_)$_$_ => atomize(r RS mp) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

63 
 Const("op &",_)$_$_ => atomize(r RS conjunct1) @ 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

64 
atomize(r RS conjunct2) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

65 
 Const("All",_)$_ => atomize(r RS spec) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

66 
 Const("True",_) => [] (*True is DELETED*) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

67 
 Const("False",_) => [] (*should False do something?*) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

68 
 _ => [r]) 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

69 
 _ => [r]; 
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset

70 

282  71 

72 
val P_iff_F = int_prove_fun "~P ==> (P <> False)"; 

73 
val iff_reflection_F = P_iff_F RS iff_reflection; 

74 

75 
val P_iff_T = int_prove_fun "P ==> (P <> True)"; 

76 
val iff_reflection_T = P_iff_T RS iff_reflection; 

77 

78 
(*Make metaequalities. The operator below is Trueprop*) 

79 
fun mk_meta_eq th = case concl_of th of 

394
432bb9995893
Modified mk_meta_eq to leave metaequlities on unchanged.
nipkow
parents:
371
diff
changeset

80 
Const("==",_)$_$_ => th 
432bb9995893
Modified mk_meta_eq to leave metaequlities on unchanged.
nipkow
parents:
371
diff
changeset

81 
 _ $ (Const("op =",_)$_$_) => th RS eq_reflection 
282  82 
 _ $ (Const("op <>",_)$_$_) => th RS iff_reflection 
83 
 _ $ (Const("Not",_)$_) => th RS iff_reflection_F 

84 
 _ => th RS iff_reflection_T; 

0  85 

86 
structure Induction = InductionFun(struct val spec=IFOL.spec end); 

87 

88 
open Simplifier Induction; 

89 

3  90 
infix addcongs; 
91 
fun ss addcongs congs = 

282  92 
ss addeqcongs (congs RL [eq_reflection,iff_reflection]); 
93 

94 
val IFOL_rews = 

95 
[refl RS P_iff_T] @ conj_rews @ disj_rews @ not_rews @ 

96 
imp_rews @ iff_rews @ quant_rews; 

3  97 

282  98 
val notFalseI = int_prove_fun "~False"; 
99 
val triv_rls = [TrueI,refl,iff_refl,notFalseI]; 

100 

101 
val IFOL_ss = 

102 
empty_ss 

103 
setmksimps (map mk_meta_eq o atomize o gen_all) 

371
3a853818f1d2
FOL/simpdata: added etac FalseE in setsolver call. Toby: "now that the
lcp
parents:
282
diff
changeset

104 
setsolver (fn prems => resolve_tac (triv_rls@prems) 
3a853818f1d2
FOL/simpdata: added etac FalseE in setsolver call. Toby: "now that the
lcp
parents:
282
diff
changeset

105 
ORELSE' assume_tac 
3a853818f1d2
FOL/simpdata: added etac FalseE in setsolver call. Toby: "now that the
lcp
parents:
282
diff
changeset

106 
ORELSE' etac FalseE) 
282  107 
setsubgoaler asm_simp_tac 
108 
addsimps IFOL_rews 

109 
addcongs [imp_cong]; 

0  110 

111 
(*Classical version...*) 

112 
fun prove_fun s = 

282  113 
(writeln s; 
114 
prove_goal FOL.thy s 

115 
(fn prems => [ (cut_facts_tac prems 1), 

116 
(Cla.fast_tac FOL_cs 1) ])); 

745  117 

0  118 
val cla_rews = map prove_fun 
282  119 
["~(P&Q) <> ~P  ~Q", 
120 
"P  ~P", "~P  P", 

0  121 
"~ ~ P <> P", "(~P > P) <> P"]; 
122 

123 
val FOL_ss = IFOL_ss addsimps cla_rews; 

124 

125 
(*** case splitting ***) 

126 

282  127 
val meta_iffD = 
128 
prove_goal FOL.thy "[ P==Q; Q ] ==> P" 

129 
(fn [prem1,prem2] => [rewtac prem1, rtac prem2 1]) 

130 

131 
fun split_tac splits = 

132 
mk_case_split_tac meta_iffD (map mk_meta_eq splits); 