author  wenzelm 
Mon, 16 Nov 1998 13:54:35 +0100  
changeset 5897  b3548f939dd2 
parent 5553  ae42b36a50c2 
child 6130  30b84ad2131d 
permissions  rwrr 
4  1 
(* Title: Provers/splitter 
2 
ID: $Id$ 

3 
Author: Tobias Nipkow 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

4 
Copyright 1995 TU Munich 
4  5 

6 
Generic casesplitter, suitable for most logics. 

0  7 
*) 
8 

5304  9 
infix 4 addsplits delsplits; 
10 

11 
signature SPLITTER_DATA = 

12 
sig 

13 
structure Simplifier: SIMPLIFIER 

5553  14 
val mk_eq : thm > thm 
5304  15 
val meta_eq_to_iff: thm (* "x == y ==> x = y" *) 
16 
val iffD : thm (* "[ P = Q; Q ] ==> P" *) 

17 
val disjE : thm (* "[ P  Q; P ==> R; Q ==> R ] ==> R" *) 

18 
val conjE : thm (* "[ P & Q; [ P; Q ] ==> R ] ==> R" *) 

19 
val exE : thm (* "[ x. P x; !!x. P x ==> Q ] ==> Q" *) 

20 
val contrapos : thm (* "[ ~ Q; P ==> Q ] ==> ~ P" *) 

21 
val contrapos2 : thm (* "[ Q; ~ P ==> ~ Q ] ==> P" *) 

22 
val notnotD : thm (* "~ ~ P ==> P" *) 

23 
end 

24 

25 
signature SPLITTER = 

26 
sig 

27 
type simpset 

28 
val split_tac : thm list > int > tactic 

29 
val split_inside_tac: thm list > int > tactic 

30 
val split_asm_tac : thm list > int > tactic 

31 
val addsplits : simpset * thm list > simpset 

32 
val delsplits : simpset * thm list > simpset 

33 
val Addsplits : thm list > unit 

34 
val Delsplits : thm list > unit 

35 
end; 

36 

37 
functor SplitterFun(Data: SPLITTER_DATA): SPLITTER = 

38 
struct 

39 

40 
type simpset = Data.Simplifier.simpset; 

41 

42 
val Const ("==>", _) $ (Const ("Trueprop", _) $ 

43 
(Const (const_not, _) $ _ )) $ _ = #prop (rep_thm(Data.notnotD)); 

44 

45 
val Const ("==>", _) $ (Const ("Trueprop", _) $ 

46 
(Const (const_or , _) $ _ $ _)) $ _ = #prop (rep_thm(Data.disjE)); 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

47 

4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4519
diff
changeset

48 
fun split_format_err() = error("Wrong format for split rule"); 
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4519
diff
changeset

49 

5553  50 
fun split_thm_info thm = case concl_of (Data.mk_eq thm) of 
5304  51 
Const("==", _)$(Var _$t)$c => 
52 
(case strip_comb t of 

53 
(Const(a,_),_) => (a,case c of (Const(s,_)$_)=>s=const_not_=> false) 

54 
 _ => split_format_err()) 

55 
 _ => split_format_err(); 

56 

57 
fun mk_case_split_tac order = 

0  58 
let 
59 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

60 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

61 
(************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

62 
Create lifttheorem "trlift" : 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

63 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

64 
[ !! x. Q(x)==R(x) ; P(R) == C ] ==> P(Q)==C 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

65 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

66 
*************************************************************) 
5304  67 

68 
val meta_iffD = Data.meta_eq_to_iff RS Data.iffD; 

943  69 
val lift = 
5304  70 
let val ct = read_cterm (#sign(rep_thm Data.iffD)) 
943  71 
("[ !!x::'b::logic. Q(x) == R(x) ] ==> \ 
3835  72 
\P(%x. Q(x)) == P(%x. R(x))::'a::logic",propT) 
943  73 
in prove_goalw_cterm [] ct 
74 
(fn [prem] => [rewtac prem, rtac reflexive_thm 1]) 

75 
end; 

4  76 

0  77 
val trlift = lift RS transitive_thm; 
78 
val _ $ (Var(P,PT)$_) $ _ = concl_of trlift; 

79 

80 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

81 
(************************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

82 
Set up term for instantiation of P in the lifttheorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

83 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

84 
Ts : types of parameters (i.e. variables bound by metaquantifiers) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

85 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

86 
the lift theorem is applied to (see select) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

87 
pos : "path" leading to abstraction, coded as a list 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

88 
T : type of body of P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

89 
maxi : maximum index of Vars 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

90 
*************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

91 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

92 
fun mk_cntxt Ts t pos T maxi = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

93 
let fun var (t,i) = Var(("X",i),type_of1(Ts,t)); 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

94 
fun down [] t i = Bound 0 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

95 
 down (p::ps) t i = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

96 
let val (h,ts) = strip_comb t 
2266  97 
val v1 = ListPair.map var (take(p,ts), i upto (i+p1)) 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

98 
val u::us = drop(p,ts) 
2266  99 
val v2 = ListPair.map var (us, (i+p) upto (i+length(ts)2)) 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

100 
in list_comb(h,v1@[down ps u (i+length ts)]@v2) end; 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

101 
in Abs("", T, down (rev pos) t maxi) end; 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

102 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

103 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

104 
(************************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

105 
Set up term for instantiation of P in the splittheorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

106 
P(...) == rhs 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

107 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

108 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

109 
the split theorem is applied to (see select) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

110 
T : type of body of P(...) 
4232  111 
tt : the term Const(key,..) $ ... 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

112 
*************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

113 

4232  114 
fun mk_cntxt_splitthm t tt T = 
115 
let fun repl lev t = 

116 
if incr_boundvars lev tt = t then Bound lev 

117 
else case t of 

118 
(Abs (v, T2, t)) => Abs (v, T2, repl (lev+1) t) 

119 
 (Bound i) => Bound (if i>=lev then i+1 else i) 

120 
 (t1 $ t2) => (repl lev t1) $ (repl lev t2) 

121 
 t => t 

122 
in Abs("", T, repl 0 t) end; 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

123 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

124 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

125 
(* add all loose bound variables in t to list is *) 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

126 
fun add_lbnos(is,t) = add_loose_bnos(t,0,is); 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

127 

1064  128 
(* check if the innermost quantifier that needs to be removed 
129 
has a body of type T; otherwise the expansion thm will fail later on 

130 
*) 

131 
fun type_test(T,lbnos,apsns) = 

2143  132 
let val (_,U,_) = nth_elem(foldl Int.min (hd lbnos, tl lbnos), apsns) 
1064  133 
in T=U end; 
0  134 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

135 
(************************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

136 
Create a "split_pack". 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

137 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

138 
thm : the relevant splittheorem, i.e. P(...) == rhs , where P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

139 
is of the form 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

140 
P( Const(key,...) $ t_1 $ ... $ t_n ) (e.g. key = "if") 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

141 
T : type of P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

142 
n : number of arguments expected by Const(key,...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

143 
ts : list of arguments actually found 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

144 
apsns : list of tuples of the form (T,U,pos), one tuple for each 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

145 
abstraction that is encountered on the way to the position where 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

146 
Const(key, ...) $ ... occurs, where 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

147 
T : type of the variable bound by the abstraction 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

148 
U : type of the abstraction's body 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

149 
pos : "path" leading to the body of the abstraction 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

150 
pos : "path" leading to the position where Const(key, ...) $ ... occurs. 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

151 
TB : type of Const(key,...) $ t_1 $ ... $ t_n 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

152 
t : the term Const(key,...) $ t_1 $ ... $ t_n 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

153 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

154 
A split pack is a tuple of the form 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

155 
(thm, apsns, pos, TB) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

156 
Note : apsns is reversed, so that the outermost quantifier's position 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

157 
comes first ! If the terms in ts don't contain variables bound 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

158 
by other than metaquantifiers, apsns is empty, because no further 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

159 
lifting is required before applying the splittheorem. 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

160 
******************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

161 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

162 
fun mk_split_pack(thm,T,n,ts,apsns,pos,TB,t) = 
1064  163 
if n > length ts then [] 
164 
else let val lev = length apsns 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

165 
val lbnos = foldl add_lbnos ([],take(n,ts)) 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

166 
val flbnos = filter (fn i => i < lev) lbnos 
4232  167 
val tt = incr_boundvars (~lev) t 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

168 
in if null flbnos then [(thm,[],pos,TB,tt)] 
2143  169 
else if type_test(T,flbnos,apsns) then [(thm, rev apsns,pos,TB,tt)] 
170 
else [] 

1064  171 
end; 
0  172 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

173 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

174 
(**************************************************************************** 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

175 
Recursively scans term for occurences of Const(key,...) $ ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

176 
Returns a list of "splitpacks" (one for each occurence of Const(key,...) ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

177 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

178 
cmap : association list of splittheorems that should be tried. 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

179 
The elements have the format (key,(thm,T,n)) , where 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

180 
key : the theorem's key constant ( Const(key,...) $ ... ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

181 
thm : the theorem itself 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

182 
T : type of P( Const(key,...) $ ... ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

183 
n : number of arguments expected by Const(key,...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

184 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

185 
t : the term to be scanned 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

186 
******************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

187 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

188 
fun split_posns cmap Ts t = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

189 
let fun posns Ts pos apsns (Abs(_,T,t)) = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

190 
let val U = fastype_of1(T::Ts,t) 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

191 
in posns (T::Ts) (0::pos) ((T,U,pos)::apsns) t end 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

192 
 posns Ts pos apsns t = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

193 
let val (h,ts) = strip_comb t 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

194 
fun iter((i,a),t) = (i+1, (posns Ts (i::pos) apsns t) @ a); 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

195 
val a = case h of 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

196 
Const(c,_) => 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

197 
(case assoc(cmap,c) of 
4232  198 
Some(thm, T, n) => 
199 
let val t2 = list_comb (h, take (n, ts)) in 

200 
mk_split_pack(thm,T,n,ts,apsns,pos,type_of1(Ts, t2),t2) 

201 
end 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

202 
 None => []) 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

203 
 _ => [] 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

204 
in snd(foldl iter ((0,a),ts)) end 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

205 
in posns Ts [] [] t end; 
0  206 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

207 

0  208 
fun nth_subgoal i thm = nth_elem(i1,prems_of thm); 
209 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

210 
fun shorter((_,ps,pos,_,_),(_,qs,qos,_,_)) = 
4519  211 
prod_ord (int_ord o pairself length) (order o pairself length) 
212 
((ps, pos), (qs, qos)); 

213 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

214 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

215 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

216 
(************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

217 
call split_posns with appropriate parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

218 
*************************************************************) 
0  219 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

220 
fun select cmap state i = 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

221 
let val goali = nth_subgoal i state 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

222 
val Ts = rev(map #2 (Logic.strip_params goali)) 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

223 
val _ $ t $ _ = Logic.strip_assums_concl goali; 
4519  224 
in (Ts,t, sort shorter (split_posns cmap Ts t)) end; 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

225 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

226 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

227 
(************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

228 
instantiate lift theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

229 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

230 
if t is of the form 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

231 
... ( Const(...,...) $ Abs( .... ) ) ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

232 
then 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

233 
P = %a. ... ( Const(...,...) $ a ) ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

234 
where a has type T > U 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

235 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

236 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

237 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

238 
the split theorem is applied to (see cmap) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

239 
T,U,pos : see mk_split_pack 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

240 
state : current proof state 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

241 
lift : the lift theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

242 
i : no. of subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

243 
**************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

244 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

245 
fun inst_lift Ts t (T,U,pos) state lift i = 
0  246 
let val sg = #sign(rep_thm state) 
247 
val tsig = #tsig(Sign.rep_sg sg) 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

248 
val cntxt = mk_cntxt Ts t pos (T>U) (#maxidx(rep_thm lift)) 
231  249 
val cu = cterm_of sg cntxt 
250 
val uT = #T(rep_cterm cu) 

251 
val cP' = cterm_of sg (Var(P,uT)) 

0  252 
val ixnTs = Type.typ_match tsig ([],(PT,uT)); 
231  253 
val ixncTs = map (fn (x,y) => (x,ctyp_of sg y)) ixnTs; 
0  254 
in instantiate (ixncTs, [(cP',cu)]) lift end; 
255 

256 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

257 
(************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

258 
instantiate split theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

259 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

260 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

261 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

262 
the split theorem is applied to (see cmap) 
4232  263 
tt : the term Const(key,..) $ ... 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

264 
thm : the split theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

265 
TB : type of body of P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

266 
state : current proof state 
4232  267 
i : number of subgoal 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

268 
**************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

269 

4232  270 
fun inst_split Ts t tt thm TB state i = 
271 
let val _ $ ((Var (P2, PT2)) $ _) $ _ = concl_of thm; 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

272 
val sg = #sign(rep_thm state) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

273 
val tsig = #tsig(Sign.rep_sg sg) 
4232  274 
val cntxt = mk_cntxt_splitthm t tt TB; 
4236  275 
val T = fastype_of1 (Ts, cntxt); 
4232  276 
val ixnTs = Type.typ_match tsig ([],(PT2, T)) 
277 
val abss = foldl (fn (t, T) => Abs ("", T, t)) 

278 
in 

279 
term_lift_inst_rule (state, i, ixnTs, [((P2, T), abss (cntxt, Ts))], thm) 

280 
end; 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

281 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

282 
(***************************************************************************** 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

283 
The splittactic 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

284 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

285 
splits : list of splittheorems to be tried 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

286 
i : number of subgoal the tactic should be applied to 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

287 
*****************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

288 

0  289 
fun split_tac [] i = no_tac 
290 
 split_tac splits i = 

5553  291 
let val splits = map Data.mk_eq splits; 
5304  292 
fun const(thm) = 
3918  293 
(case concl_of thm of _$(t as _$lhs)$_ => 
294 
(case strip_comb lhs of (Const(a,_),args) => 

295 
(a,(thm,fastype_of t,length args)) 

4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4519
diff
changeset

296 
 _ => split_format_err()) 
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4519
diff
changeset

297 
 _ => split_format_err()) 
0  298 
val cmap = map const splits; 
3537  299 
fun lift_tac Ts t p st = (rtac (inst_lift Ts t p st trlift i) i) st 
300 
fun lift_split_tac st = st > 

301 
let val (Ts,t,splits) = select cmap st i 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

302 
in case splits of 
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

303 
[] => no_tac 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

304 
 (thm,apsns,pos,TB,tt)::_ => 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

305 
(case apsns of 
3537  306 
[] => (fn state => state > 
4232  307 
compose_tac (false, inst_split Ts t tt thm TB state i, 0) i) 
3537  308 
 p::_ => EVERY[lift_tac Ts t p, 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

309 
rtac reflexive_thm (i+1), 
3537  310 
lift_split_tac]) 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

311 
end 
3537  312 
in COND (has_fewer_prems i) no_tac 
5304  313 
(rtac meta_iffD i THEN lift_split_tac) 
0  314 
end; 
315 

316 
in split_tac end; 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

317 

5304  318 

319 
val split_tac = mk_case_split_tac int_ord; 

4189  320 

5304  321 
val split_inside_tac = mk_case_split_tac (rev_order o int_ord); 
322 

4189  323 

324 
(***************************************************************************** 

325 
The splittactic for premises 

326 

327 
splits : list of splittheorems to be tried 

5304  328 
****************************************************************************) 
4202  329 
fun split_asm_tac [] = K no_tac 
330 
 split_asm_tac splits = 

5304  331 

4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4668
diff
changeset

332 
let val cname_list = map (fst o split_thm_info) splits; 
4189  333 
fun is_case (a,_) = a mem cname_list; 
334 
fun tac (t,i) = 

335 
let val n = find_index (exists_Const is_case) 

336 
(Logic.strip_assums_hyp t); 

337 
fun first_prem_is_disj (Const ("==>", _) $ (Const ("Trueprop", _) 

5304  338 
$ (Const (s, _) $ _ $ _ )) $ _ ) = (s=const_or) 
4202  339 
 first_prem_is_disj (Const("all",_)$Abs(_,_,t)) = 
340 
first_prem_is_disj t 

4189  341 
 first_prem_is_disj _ = false; 
5437  342 
(* does not work properly if the split variable is bound by a quantfier *) 
4202  343 
fun flat_prems_tac i = SUBGOAL (fn (t,i) => 
5304  344 
(if first_prem_is_disj t 
345 
then EVERY[etac Data.disjE i,rotate_tac ~1 i, 

346 
rotate_tac ~1 (i+1), 

347 
flat_prems_tac (i+1)] 

348 
else all_tac) 

349 
THEN REPEAT (eresolve_tac [Data.conjE,Data.exE] i) 

350 
THEN REPEAT (dresolve_tac [Data.notnotD] i)) i; 

4189  351 
in if n<0 then no_tac else DETERM (EVERY' 
5304  352 
[rotate_tac n, etac Data.contrapos2, 
4189  353 
split_tac splits, 
5304  354 
rotate_tac ~1, etac Data.contrapos, rotate_tac ~1, 
4202  355 
flat_prems_tac] i) 
4189  356 
end; 
357 
in SUBGOAL tac 

358 
end; 

359 

5304  360 
fun split_name name asm = "split " ^ name ^ (if asm then " asm" else ""); 
4189  361 

5304  362 
fun ss addsplits splits = 
363 
let fun addsplit (ss,split) = 

364 
let val (name,asm) = split_thm_info split 

365 
in Data.Simplifier.addloop(ss,(split_name name asm, 

366 
(if asm then split_asm_tac else split_tac) [split])) end 

367 
in foldl addsplit (ss,splits) end; 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

368 

5304  369 
fun ss delsplits splits = 
370 
let fun delsplit(ss,split) = 

371 
let val (name,asm) = split_thm_info split 

372 
in Data.Simplifier.delloop(ss,split_name name asm) 

373 
end in foldl delsplit (ss,splits) end; 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

374 

5304  375 
fun Addsplits splits = (Data.Simplifier.simpset_ref() := 
376 
Data.Simplifier.simpset() addsplits splits); 

377 
fun Delsplits splits = (Data.Simplifier.simpset_ref() := 

378 
Data.Simplifier.simpset() delsplits splits); 

4189  379 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

380 
end; 