src/HOL/simpdata.ML
author oheimb
Thu May 14 16:50:09 1998 +0200 (1998-05-14)
changeset 4930 89271bc4e7ed
parent 4830 bd73675adbed
child 5190 4ae031622592
permissions -rw-r--r--
extended addsplits and delsplits to handle also split rules for assumptions
extended const_of_split_thm, renamed it to split_thm_info
clasohm@1465
     1
(*  Title:      HOL/simpdata.ML
clasohm@923
     2
    ID:         $Id$
clasohm@1465
     3
    Author:     Tobias Nipkow
clasohm@923
     4
    Copyright   1991  University of Cambridge
clasohm@923
     5
wenzelm@4794
     6
Instantiation of the generic simplifier.
clasohm@923
     7
*)
clasohm@923
     8
paulson@1984
     9
section "Simplifier";
paulson@1984
    10
paulson@1984
    11
(*** Addition of rules to simpsets and clasets simultaneously ***)
paulson@1984
    12
paulson@1984
    13
(*Takes UNCONDITIONAL theorems of the form A<->B to 
paulson@2031
    14
        the Safe Intr     rule B==>A and 
paulson@2031
    15
        the Safe Destruct rule A==>B.
paulson@1984
    16
  Also ~A goes to the Safe Elim rule A ==> ?R
paulson@1984
    17
  Failing other cases, A is added as a Safe Intr rule*)
paulson@1984
    18
local
paulson@1984
    19
  val iff_const = HOLogic.eq_const HOLogic.boolT;
paulson@1984
    20
paulson@1984
    21
  fun addIff th = 
paulson@1984
    22
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
paulson@2718
    23
                (Const("Not",_) $ A) =>
paulson@2031
    24
                    AddSEs [zero_var_indexes (th RS notE)]
paulson@2031
    25
              | (con $ _ $ _) =>
paulson@2031
    26
                    if con=iff_const
paulson@2031
    27
                    then (AddSIs [zero_var_indexes (th RS iffD2)];  
paulson@2031
    28
                          AddSDs [zero_var_indexes (th RS iffD1)])
paulson@2031
    29
                    else  AddSIs [th]
paulson@2031
    30
              | _ => AddSIs [th];
paulson@1984
    31
       Addsimps [th])
paulson@1984
    32
      handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 
paulson@2031
    33
                         string_of_thm th)
paulson@1984
    34
paulson@1984
    35
  fun delIff th = 
paulson@1984
    36
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
paulson@2718
    37
                (Const("Not",_) $ A) =>
paulson@2031
    38
                    Delrules [zero_var_indexes (th RS notE)]
paulson@2031
    39
              | (con $ _ $ _) =>
paulson@2031
    40
                    if con=iff_const
paulson@2031
    41
                    then Delrules [zero_var_indexes (th RS iffD2),
paulson@3518
    42
                                   make_elim (zero_var_indexes (th RS iffD1))]
paulson@2031
    43
                    else Delrules [th]
paulson@2031
    44
              | _ => Delrules [th];
paulson@1984
    45
       Delsimps [th])
paulson@1984
    46
      handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 
paulson@2031
    47
                          string_of_thm th)
paulson@1984
    48
in
paulson@1984
    49
val AddIffs = seq addIff
paulson@1984
    50
val DelIffs = seq delIff
paulson@1984
    51
end;
paulson@1984
    52
nipkow@4640
    53
qed_goal "meta_eq_to_obj_eq" HOL.thy "x==y ==> x=y"
nipkow@4640
    54
  (fn [prem] => [rewtac prem, rtac refl 1]);
nipkow@4640
    55
clasohm@923
    56
local
clasohm@923
    57
paulson@4769
    58
  fun prover s = prove_goal HOL.thy s (K [Blast_tac 1]);
clasohm@923
    59
paulson@1922
    60
  val P_imp_P_iff_True = prover "P --> (P = True)" RS mp;
paulson@1922
    61
  val P_imp_P_eq_True = P_imp_P_iff_True RS eq_reflection;
clasohm@923
    62
paulson@1922
    63
  val not_P_imp_P_iff_F = prover "~P --> (P = False)" RS mp;
paulson@1922
    64
  val not_P_imp_P_eq_False = not_P_imp_P_iff_F RS eq_reflection;
clasohm@923
    65
paulson@1922
    66
  fun atomize pairs =
paulson@1922
    67
    let fun atoms th =
paulson@2031
    68
          (case concl_of th of
paulson@2031
    69
             Const("Trueprop",_) $ p =>
paulson@2031
    70
               (case head_of p of
paulson@2031
    71
                  Const(a,_) =>
paulson@2031
    72
                    (case assoc(pairs,a) of
paulson@2031
    73
                       Some(rls) => flat (map atoms ([th] RL rls))
paulson@2031
    74
                     | None => [th])
paulson@2031
    75
                | _ => [th])
paulson@2031
    76
           | _ => [th])
paulson@1922
    77
    in atoms end;
clasohm@923
    78
nipkow@2134
    79
  fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th;
nipkow@2134
    80
nipkow@2134
    81
in
nipkow@2134
    82
nipkow@3896
    83
  fun mk_meta_eq r = r RS eq_reflection;
nipkow@4677
    84
  fun mk_meta_eq_True r = Some(r RS meta_eq_to_obj_eq RS P_imp_P_eq_True);
nipkow@3896
    85
nipkow@3896
    86
  fun mk_meta_eq_simp r = case concl_of r of
paulson@2031
    87
          Const("==",_)$_$_ => r
nipkow@4677
    88
      |   _$(Const("op =",_)$lhs$rhs) => mk_meta_eq r
paulson@2718
    89
      |   _$(Const("Not",_)$_) => r RS not_P_imp_P_eq_False
paulson@1922
    90
      |   _ => r RS P_imp_P_eq_True;
paulson@1922
    91
  (* last 2 lines requires all formulae to be of the from Trueprop(.) *)
clasohm@923
    92
paulson@2082
    93
val simp_thms = map prover
paulson@2082
    94
 [ "(x=x) = True",
paulson@2082
    95
   "(~True) = False", "(~False) = True", "(~ ~ P) = P",
paulson@2082
    96
   "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
nipkow@4640
    97
   "(True=P) = P", "(P=True) = P", "(False=P) = (~P)", "(P=False) = (~P)",
paulson@2082
    98
   "(True --> P) = P", "(False --> P) = True", 
paulson@2082
    99
   "(P --> True) = True", "(P --> P) = True",
paulson@2082
   100
   "(P --> False) = (~P)", "(P --> ~P) = (~P)",
paulson@2082
   101
   "(P & True) = P", "(True & P) = P", 
nipkow@2800
   102
   "(P & False) = False", "(False & P) = False",
nipkow@2800
   103
   "(P & P) = P", "(P & (P & Q)) = (P & Q)",
paulson@3913
   104
   "(P & ~P) = False",    "(~P & P) = False",
paulson@2082
   105
   "(P | True) = True", "(True | P) = True", 
nipkow@2800
   106
   "(P | False) = P", "(False | P) = P",
nipkow@2800
   107
   "(P | P) = P", "(P | (P | Q)) = (P | Q)",
paulson@3913
   108
   "(P | ~P) = True",    "(~P | P) = True",
paulson@2082
   109
   "((~P) = (~Q)) = (P=Q)",
wenzelm@3842
   110
   "(!x. P) = P", "(? x. P) = P", "? x. x=t", "? x. t=x", 
paulson@4351
   111
(*two needed for the one-point-rule quantifier simplification procs*)
paulson@4351
   112
   "(? x. x=t & P(x)) = P(t)",		(*essential for termination!!*)
paulson@4351
   113
   "(! x. t=x --> P(x)) = P(t)" ];      (*covers a stray case*)
clasohm@923
   114
lcp@988
   115
(*Add congruence rules for = (instead of ==) *)
oheimb@2636
   116
infix 4 addcongs delcongs;
paulson@4351
   117
nipkow@4640
   118
fun mk_meta_cong rl =
nipkow@4640
   119
  standard(mk_meta_eq(replicate (nprems_of rl) meta_eq_to_obj_eq MRS rl))
nipkow@4640
   120
  handle THM _ =>
nipkow@4640
   121
  error("Premises and conclusion of congruence rules must be =-equalities");
nipkow@4640
   122
nipkow@4640
   123
fun ss addcongs congs = ss addeqcongs (map mk_meta_cong congs);
nipkow@4640
   124
nipkow@4640
   125
fun ss delcongs congs = ss deleqcongs (map mk_meta_cong congs);
clasohm@923
   126
wenzelm@4086
   127
fun Addcongs congs = (simpset_ref() := simpset() addcongs congs);
wenzelm@4086
   128
fun Delcongs congs = (simpset_ref() := simpset() delcongs congs);
clasohm@1264
   129
nipkow@3896
   130
fun mksimps pairs = map mk_meta_eq_simp o atomize pairs o gen_all;
clasohm@923
   131
paulson@1922
   132
val imp_cong = impI RSN
paulson@1922
   133
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
paulson@4769
   134
        (fn _=> [Blast_tac 1]) RS mp RS mp);
paulson@1922
   135
paulson@1948
   136
(*Miniscoping: pushing in existential quantifiers*)
paulson@1948
   137
val ex_simps = map prover 
wenzelm@3842
   138
                ["(EX x. P x & Q)   = ((EX x. P x) & Q)",
wenzelm@3842
   139
                 "(EX x. P & Q x)   = (P & (EX x. Q x))",
wenzelm@3842
   140
                 "(EX x. P x | Q)   = ((EX x. P x) | Q)",
wenzelm@3842
   141
                 "(EX x. P | Q x)   = (P | (EX x. Q x))",
wenzelm@3842
   142
                 "(EX x. P x --> Q) = ((ALL x. P x) --> Q)",
wenzelm@3842
   143
                 "(EX x. P --> Q x) = (P --> (EX x. Q x))"];
paulson@1948
   144
paulson@1948
   145
(*Miniscoping: pushing in universal quantifiers*)
paulson@1948
   146
val all_simps = map prover
wenzelm@3842
   147
                ["(ALL x. P x & Q)   = ((ALL x. P x) & Q)",
wenzelm@3842
   148
                 "(ALL x. P & Q x)   = (P & (ALL x. Q x))",
wenzelm@3842
   149
                 "(ALL x. P x | Q)   = ((ALL x. P x) | Q)",
wenzelm@3842
   150
                 "(ALL x. P | Q x)   = (P | (ALL x. Q x))",
wenzelm@3842
   151
                 "(ALL x. P x --> Q) = ((EX x. P x) --> Q)",
wenzelm@3842
   152
                 "(ALL x. P --> Q x) = (P --> (ALL x. Q x))"];
paulson@1948
   153
clasohm@923
   154
paulson@2022
   155
(* elimination of existential quantifiers in assumptions *)
clasohm@923
   156
clasohm@923
   157
val ex_all_equiv =
clasohm@923
   158
  let val lemma1 = prove_goal HOL.thy
clasohm@923
   159
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
clasohm@923
   160
        (fn prems => [resolve_tac prems 1, etac exI 1]);
clasohm@923
   161
      val lemma2 = prove_goalw HOL.thy [Ex_def]
clasohm@923
   162
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
clasohm@923
   163
        (fn prems => [REPEAT(resolve_tac prems 1)])
clasohm@923
   164
  in equal_intr lemma1 lemma2 end;
clasohm@923
   165
clasohm@923
   166
end;
clasohm@923
   167
nipkow@3654
   168
(* Elimination of True from asumptions: *)
nipkow@3654
   169
nipkow@3654
   170
val True_implies_equals = prove_goal HOL.thy
nipkow@3654
   171
 "(True ==> PROP P) == PROP P"
oheimb@4525
   172
(K [rtac equal_intr_rule 1, atac 2,
nipkow@3654
   173
          METAHYPS (fn prems => resolve_tac prems 1) 1,
nipkow@3654
   174
          rtac TrueI 1]);
nipkow@3654
   175
paulson@4769
   176
fun prove nm thm  = qed_goal nm HOL.thy thm (K [Blast_tac 1]);
clasohm@923
   177
clasohm@923
   178
prove "conj_commute" "(P&Q) = (Q&P)";
clasohm@923
   179
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
clasohm@923
   180
val conj_comms = [conj_commute, conj_left_commute];
nipkow@2134
   181
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))";
clasohm@923
   182
paulson@1922
   183
prove "disj_commute" "(P|Q) = (Q|P)";
paulson@1922
   184
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
paulson@1922
   185
val disj_comms = [disj_commute, disj_left_commute];
nipkow@2134
   186
prove "disj_assoc" "((P|Q)|R) = (P|(Q|R))";
paulson@1922
   187
clasohm@923
   188
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
clasohm@923
   189
prove "conj_disj_distribR" "((P|Q)&R) = (P&R | Q&R)";
nipkow@1485
   190
paulson@1892
   191
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
paulson@1892
   192
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
paulson@1892
   193
nipkow@2134
   194
prove "imp_conjR" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
nipkow@2134
   195
prove "imp_conjL" "((P&Q) -->R)  = (P --> (Q --> R))";
nipkow@2134
   196
prove "imp_disjL" "((P|Q) --> R) = ((P-->R)&(Q-->R))";
paulson@1892
   197
paulson@3448
   198
(*These two are specialized, but imp_disj_not1 is useful in Auth/Yahalom.ML*)
paulson@3448
   199
prove "imp_disj_not1" "((P --> Q | R)) = (~Q --> P --> R)";
paulson@3448
   200
prove "imp_disj_not2" "((P --> Q | R)) = (~R --> P --> Q)";
paulson@3448
   201
paulson@3904
   202
prove "imp_disj1" "((P-->Q)|R) = (P--> Q|R)";
paulson@3904
   203
prove "imp_disj2" "(Q|(P-->R)) = (P--> Q|R)";
paulson@3904
   204
nipkow@1485
   205
prove "de_Morgan_disj" "(~(P | Q)) = (~P & ~Q)";
nipkow@1485
   206
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
paulson@3446
   207
prove "not_imp" "(~(P --> Q)) = (P & ~Q)";
paulson@1922
   208
prove "not_iff" "(P~=Q) = (P = (~Q))";
oheimb@4743
   209
prove "disj_not1" "(~P | Q) = (P --> Q)";
oheimb@4743
   210
prove "disj_not2" "(P | ~Q) = (Q --> P)"; (* changes orientation :-( *)
nipkow@1485
   211
nipkow@4830
   212
(*Avoids duplication of subgoals after split_if, when the true and false 
nipkow@2134
   213
  cases boil down to the same thing.*) 
nipkow@2134
   214
prove "cases_simp" "((P --> Q) & (~P --> Q)) = Q";
nipkow@2134
   215
wenzelm@3842
   216
prove "not_all" "(~ (! x. P(x))) = (? x.~P(x))";
paulson@1922
   217
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
wenzelm@3842
   218
prove "not_ex"  "(~ (? x. P(x))) = (! x.~P(x))";
paulson@1922
   219
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
oheimb@1660
   220
nipkow@1655
   221
prove "ex_disj_distrib" "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))";
nipkow@1655
   222
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))";
nipkow@1655
   223
nipkow@2134
   224
(* '&' congruence rule: not included by default!
nipkow@2134
   225
   May slow rewrite proofs down by as much as 50% *)
nipkow@2134
   226
nipkow@2134
   227
let val th = prove_goal HOL.thy 
nipkow@2134
   228
                "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
paulson@4769
   229
                (fn _=> [Blast_tac 1])
nipkow@2134
   230
in  bind_thm("conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   231
nipkow@2134
   232
let val th = prove_goal HOL.thy 
nipkow@2134
   233
                "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
paulson@4769
   234
                (fn _=> [Blast_tac 1])
nipkow@2134
   235
in  bind_thm("rev_conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   236
nipkow@2134
   237
(* '|' congruence rule: not included by default! *)
nipkow@2134
   238
nipkow@2134
   239
let val th = prove_goal HOL.thy 
nipkow@2134
   240
                "(P=P')--> (~P'--> (Q=Q'))--> ((P|Q) = (P'|Q'))"
paulson@4769
   241
                (fn _=> [Blast_tac 1])
nipkow@2134
   242
in  bind_thm("disj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   243
nipkow@2134
   244
prove "eq_sym_conv" "(x=y) = (y=x)";
nipkow@2134
   245
nipkow@2134
   246
qed_goalw "o_apply" HOL.thy [o_def] "(f o g) x = f (g x)"
oheimb@4525
   247
 (K [rtac refl 1]);
nipkow@2134
   248
nipkow@2134
   249
qed_goalw "if_True" HOL.thy [if_def] "(if True then x else y) = x"
oheimb@4525
   250
 (K [Blast_tac 1]);
nipkow@2134
   251
nipkow@2134
   252
qed_goalw "if_False" HOL.thy [if_def] "(if False then x else y) = y"
oheimb@4525
   253
 (K [Blast_tac 1]);
nipkow@2134
   254
nipkow@2134
   255
qed_goal "if_P" HOL.thy "P ==> (if P then x else y) = x"
nipkow@2134
   256
 (fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]);
nipkow@2134
   257
(*
nipkow@2134
   258
qed_goal "if_not_P" HOL.thy "~P ==> (if P then x else y) = y"
nipkow@2134
   259
 (fn [prem] => [ stac (prem RS not_P_imp_P_iff_F) 1, rtac if_False 1 ]);
nipkow@2134
   260
*)
nipkow@2134
   261
qed_goalw "if_not_P" HOL.thy [if_def] "!!P. ~P ==> (if P then x else y) = y"
oheimb@4525
   262
 (K [Blast_tac 1]);
nipkow@2134
   263
nipkow@4830
   264
qed_goal "split_if" HOL.thy
oheimb@4205
   265
    "P(if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))" (K [
oheimb@4205
   266
	res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1,
nipkow@2134
   267
         stac if_P 2,
nipkow@2134
   268
         stac if_not_P 1,
paulson@4769
   269
         ALLGOALS (Blast_tac)]);
nipkow@4830
   270
(* for backwards compatibility: *)
nipkow@4830
   271
val expand_if = split_if;
oheimb@4205
   272
oheimb@4205
   273
qed_goal "split_if_asm" HOL.thy
paulson@4769
   274
    "P(if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
nipkow@4830
   275
    (K [stac split_if 1,
paulson@4769
   276
	Blast_tac 1]);
nipkow@2134
   277
paulson@4769
   278
(*This form is useful for expanding IFs on the RIGHT of the ==> symbol*)
paulson@4769
   279
qed_goal "if_bool_eq_conj" HOL.thy
paulson@4769
   280
    "(if P then Q else R) = ((P-->Q) & (~P-->R))"
nipkow@4830
   281
    (K [rtac split_if 1]);
paulson@4769
   282
paulson@4769
   283
(*And this form is useful for expanding IFs on the LEFT*)
paulson@4769
   284
qed_goal "if_bool_eq_disj" HOL.thy
paulson@4769
   285
    "(if P then Q else R) = ((P&Q) | (~P&R))"
nipkow@4830
   286
    (K [stac split_if 1,
paulson@4769
   287
	Blast_tac 1]);
nipkow@2134
   288
paulson@4351
   289
paulson@4351
   290
(*** make simplification procedures for quantifier elimination ***)
paulson@4351
   291
paulson@4351
   292
structure Quantifier1 = Quantifier1Fun(
paulson@4351
   293
struct
paulson@4351
   294
  (*abstract syntax*)
paulson@4351
   295
  fun dest_eq((c as Const("op =",_)) $ s $ t) = Some(c,s,t)
paulson@4351
   296
    | dest_eq _ = None;
paulson@4351
   297
  fun dest_conj((c as Const("op &",_)) $ s $ t) = Some(c,s,t)
paulson@4351
   298
    | dest_conj _ = None;
paulson@4351
   299
  val conj = HOLogic.conj
paulson@4351
   300
  val imp  = HOLogic.imp
paulson@4351
   301
  (*rules*)
paulson@4351
   302
  val iff_reflection = eq_reflection
paulson@4351
   303
  val iffI = iffI
paulson@4351
   304
  val sym  = sym
paulson@4351
   305
  val conjI= conjI
paulson@4351
   306
  val conjE= conjE
paulson@4351
   307
  val impI = impI
paulson@4351
   308
  val impE = impE
paulson@4351
   309
  val mp   = mp
paulson@4351
   310
  val exI  = exI
paulson@4351
   311
  val exE  = exE
paulson@4351
   312
  val allI = allI
paulson@4351
   313
  val allE = allE
paulson@4351
   314
end);
paulson@4351
   315
nipkow@4320
   316
local
nipkow@4320
   317
val ex_pattern =
paulson@4351
   318
  read_cterm (sign_of HOL.thy) ("EX x. P(x) & Q(x)",HOLogic.boolT)
paulson@3913
   319
nipkow@4320
   320
val all_pattern =
paulson@4351
   321
  read_cterm (sign_of HOL.thy) ("ALL x. P(x) & P'(x) --> Q(x)",HOLogic.boolT)
nipkow@4320
   322
nipkow@4320
   323
in
nipkow@4320
   324
val defEX_regroup =
nipkow@4320
   325
  mk_simproc "defined EX" [ex_pattern] Quantifier1.rearrange_ex;
nipkow@4320
   326
val defALL_regroup =
nipkow@4320
   327
  mk_simproc "defined ALL" [all_pattern] Quantifier1.rearrange_all;
nipkow@4320
   328
end;
paulson@3913
   329
paulson@4351
   330
paulson@4351
   331
(*** Case splitting ***)
paulson@3913
   332
oheimb@2263
   333
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2)
oheimb@2263
   334
in
oheimb@2263
   335
fun split_tac splits = mktac (map mk_meta_eq splits)
oheimb@2263
   336
end;
oheimb@2263
   337
oheimb@2263
   338
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2)
oheimb@2263
   339
in
oheimb@2263
   340
fun split_inside_tac splits = mktac (map mk_meta_eq splits)
oheimb@2263
   341
end;
oheimb@2263
   342
oheimb@4205
   343
val split_asm_tac = mk_case_split_asm_tac split_tac 
oheimb@4205
   344
			(disjE,conjE,exE,contrapos,contrapos2,notnotD);
oheimb@4189
   345
nipkow@4681
   346
infix 4 addsplits delsplits;
nipkow@4681
   347
nipkow@4669
   348
fun ss addsplits splits =
oheimb@4930
   349
  let fun addsplit (ss,split) =
oheimb@4930
   350
        let val (name,asm) = split_thm_info split 
oheimb@4930
   351
        in ss addloop ("split "^ name ^ (if asm then " asm" else ""),
oheimb@4930
   352
		       (if asm then split_asm_tac else split_tac) [split]) end
nipkow@4669
   353
  in foldl addsplit (ss,splits) end;
oheimb@2263
   354
nipkow@4681
   355
fun ss delsplits splits =
nipkow@4681
   356
  let fun delsplit(ss,split) =
oheimb@4930
   357
        let val (name,asm) = split_thm_info split 
oheimb@4930
   358
        in ss delloop ("split "^ name ^ (if asm then " asm" else "")) end
nipkow@4681
   359
  in foldl delsplit (ss,splits) end;
nipkow@4681
   360
nipkow@4681
   361
fun Addsplits splits = (simpset_ref() := simpset() addsplits splits);
nipkow@4681
   362
fun Delsplits splits = (simpset_ref() := simpset() delsplits splits);
nipkow@4681
   363
oheimb@2251
   364
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x"
nipkow@4830
   365
  (K [split_tac [split_if] 1, Blast_tac 1]);
oheimb@2251
   366
oheimb@4718
   367
qed_goal "if_eq_cancel" HOL.thy "(if x = y then y else x) = x"
nipkow@4830
   368
  (K [split_tac [split_if] 1, Blast_tac 1]);
oheimb@4718
   369
nipkow@2134
   370
(** 'if' congruence rules: neither included by default! *)
nipkow@2134
   371
nipkow@2134
   372
(*Simplifies x assuming c and y assuming ~c*)
nipkow@2134
   373
qed_goal "if_cong" HOL.thy
nipkow@2134
   374
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==>\
nipkow@2134
   375
\  (if b then x else y) = (if c then u else v)"
nipkow@2134
   376
  (fn rew::prems =>
nipkow@4830
   377
   [stac rew 1, stac split_if 1, stac split_if 1,
paulson@2935
   378
    blast_tac (HOL_cs addDs prems) 1]);
nipkow@2134
   379
nipkow@2134
   380
(*Prevents simplification of x and y: much faster*)
nipkow@2134
   381
qed_goal "if_weak_cong" HOL.thy
nipkow@2134
   382
  "b=c ==> (if b then x else y) = (if c then x else y)"
nipkow@2134
   383
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
nipkow@2134
   384
nipkow@2134
   385
(*Prevents simplification of t: much faster*)
nipkow@2134
   386
qed_goal "let_weak_cong" HOL.thy
nipkow@2134
   387
  "a = b ==> (let x=a in t(x)) = (let x=b in t(x))"
nipkow@2134
   388
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
nipkow@2134
   389
nipkow@2134
   390
(*In general it seems wrong to add distributive laws by default: they
nipkow@2134
   391
  might cause exponential blow-up.  But imp_disjL has been in for a while
nipkow@2134
   392
  and cannot be removed without affecting existing proofs.  Moreover, 
nipkow@2134
   393
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
nipkow@2134
   394
  grounds that it allows simplification of R in the two cases.*)
nipkow@2134
   395
nipkow@2134
   396
val mksimps_pairs =
nipkow@2134
   397
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
nipkow@2134
   398
   ("All", [spec]), ("True", []), ("False", []),
paulson@4769
   399
   ("If", [if_bool_eq_conj RS iffD1])];
nipkow@1758
   400
nipkow@4640
   401
fun unsafe_solver prems = FIRST'[resolve_tac (reflexive_thm::TrueI::refl::prems),
oheimb@2636
   402
				 atac, etac FalseE];
oheimb@2636
   403
(*No premature instantiation of variables during simplification*)
nipkow@4640
   404
fun   safe_solver prems = FIRST'[match_tac (reflexive_thm::TrueI::prems),
oheimb@2636
   405
				 eq_assume_tac, ematch_tac [FalseE]];
oheimb@2443
   406
oheimb@2636
   407
val HOL_basic_ss = empty_ss setsubgoaler asm_simp_tac
oheimb@2636
   408
			    setSSolver   safe_solver
oheimb@2636
   409
			    setSolver  unsafe_solver
nipkow@4677
   410
			    setmksimps (mksimps mksimps_pairs)
wenzelm@4744
   411
			    setmkeqTrue mk_meta_eq_True;
oheimb@2443
   412
paulson@3446
   413
val HOL_ss = 
paulson@3446
   414
    HOL_basic_ss addsimps 
paulson@3446
   415
     ([triv_forall_equality, (* prunes params *)
nipkow@3654
   416
       True_implies_equals, (* prune asms `True' *)
oheimb@4718
   417
       if_True, if_False, if_cancel, if_eq_cancel,
paulson@3446
   418
       o_apply, imp_disjL, conj_assoc, disj_assoc,
paulson@3904
   419
       de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, not_imp,
oheimb@4743
   420
       disj_not1, not_all, not_ex, cases_simp]
paulson@3446
   421
     @ ex_simps @ all_simps @ simp_thms)
nipkow@4032
   422
     addsimprocs [defALL_regroup,defEX_regroup]
wenzelm@4744
   423
     addcongs [imp_cong]
nipkow@4830
   424
     addsplits [split_if];
paulson@2082
   425
nipkow@1655
   426
qed_goal "if_distrib" HOL.thy
nipkow@1655
   427
  "f(if c then x else y) = (if c then f x else f y)" 
nipkow@4830
   428
  (K [simp_tac (HOL_ss setloop (split_tac [split_if])) 1]);
nipkow@1655
   429
oheimb@2097
   430
qed_goalw "o_assoc" HOL.thy [o_def] "f o (g o h) = f o g o h"
oheimb@4525
   431
  (K [rtac ext 1, rtac refl 1]);
paulson@1984
   432
paulson@1984
   433
paulson@4327
   434
(*For expand_case_tac*)
paulson@2948
   435
val prems = goal HOL.thy "[| P ==> Q(True); ~P ==> Q(False) |] ==> Q(P)";
paulson@2948
   436
by (case_tac "P" 1);
paulson@2948
   437
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems)));
paulson@2948
   438
val expand_case = result();
paulson@2948
   439
paulson@4327
   440
(*Used in Auth proofs.  Typically P contains Vars that become instantiated
paulson@4327
   441
  during unification.*)
paulson@2948
   442
fun expand_case_tac P i =
paulson@2948
   443
    res_inst_tac [("P",P)] expand_case i THEN
paulson@2948
   444
    Simp_tac (i+1) THEN 
paulson@2948
   445
    Simp_tac i;
paulson@2948
   446
paulson@2948
   447
wenzelm@4119
   448
(* install implicit simpset *)
paulson@1984
   449
wenzelm@4086
   450
simpset_ref() := HOL_ss;
paulson@1984
   451
berghofe@3615
   452
oheimb@4652
   453
oheimb@2636
   454
(*** Integration of simplifier with classical reasoner ***)
oheimb@2636
   455
oheimb@2636
   456
(* rot_eq_tac rotates the first equality premise of subgoal i to the front,
oheimb@2636
   457
   fails if there is no equaliy or if an equality is already at the front *)
paulson@3538
   458
local
paulson@3538
   459
  fun is_eq (Const ("Trueprop", _) $ (Const("op ="  ,_) $ _ $ _)) = true
paulson@3538
   460
    | is_eq _ = false;
oheimb@4188
   461
  val find_eq = find_index is_eq;
paulson@3538
   462
in
paulson@3538
   463
val rot_eq_tac = 
oheimb@4188
   464
     SUBGOAL (fn (Bi,i) => let val n = find_eq (Logic.strip_assums_hyp Bi) in
oheimb@4188
   465
		if n>0 then rotate_tac n i else no_tac end)
paulson@3538
   466
end;
oheimb@2636
   467
oheimb@4652
   468
use "$ISABELLE_HOME/src/Provers/clasimp.ML";
oheimb@4652
   469
open Clasimp;
oheimb@2636
   470
oheimb@2636
   471
val HOL_css = (HOL_cs, HOL_ss);