src/HOL/simpdata.ML
author paulson
Thu Oct 16 15:23:53 1997 +0200 (1997-10-16)
changeset 3904 c0d56e4c823e
parent 3896 ee8ebb74ec00
child 3913 96e28b16861c
permissions -rw-r--r--
New simprules imp_disj1, imp_disj2
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
clasohm@923
     6
Instantiation of the generic simplifier
clasohm@923
     7
*)
clasohm@923
     8
paulson@1984
     9
section "Simplifier";
paulson@1984
    10
clasohm@923
    11
open Simplifier;
clasohm@923
    12
paulson@1984
    13
(*** Addition of rules to simpsets and clasets simultaneously ***)
paulson@1984
    14
paulson@1984
    15
(*Takes UNCONDITIONAL theorems of the form A<->B to 
paulson@2031
    16
        the Safe Intr     rule B==>A and 
paulson@2031
    17
        the Safe Destruct rule A==>B.
paulson@1984
    18
  Also ~A goes to the Safe Elim rule A ==> ?R
paulson@1984
    19
  Failing other cases, A is added as a Safe Intr rule*)
paulson@1984
    20
local
paulson@1984
    21
  val iff_const = HOLogic.eq_const HOLogic.boolT;
paulson@1984
    22
paulson@1984
    23
  fun addIff th = 
paulson@1984
    24
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
paulson@2718
    25
                (Const("Not",_) $ A) =>
paulson@2031
    26
                    AddSEs [zero_var_indexes (th RS notE)]
paulson@2031
    27
              | (con $ _ $ _) =>
paulson@2031
    28
                    if con=iff_const
paulson@2031
    29
                    then (AddSIs [zero_var_indexes (th RS iffD2)];  
paulson@2031
    30
                          AddSDs [zero_var_indexes (th RS iffD1)])
paulson@2031
    31
                    else  AddSIs [th]
paulson@2031
    32
              | _ => AddSIs [th];
paulson@1984
    33
       Addsimps [th])
paulson@1984
    34
      handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 
paulson@2031
    35
                         string_of_thm th)
paulson@1984
    36
paulson@1984
    37
  fun delIff th = 
paulson@1984
    38
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
paulson@2718
    39
                (Const("Not",_) $ A) =>
paulson@2031
    40
                    Delrules [zero_var_indexes (th RS notE)]
paulson@2031
    41
              | (con $ _ $ _) =>
paulson@2031
    42
                    if con=iff_const
paulson@2031
    43
                    then Delrules [zero_var_indexes (th RS iffD2),
paulson@3518
    44
                                   make_elim (zero_var_indexes (th RS iffD1))]
paulson@2031
    45
                    else Delrules [th]
paulson@2031
    46
              | _ => Delrules [th];
paulson@1984
    47
       Delsimps [th])
paulson@1984
    48
      handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 
paulson@2031
    49
                          string_of_thm th)
paulson@1984
    50
in
paulson@1984
    51
val AddIffs = seq addIff
paulson@1984
    52
val DelIffs = seq delIff
paulson@1984
    53
end;
paulson@1984
    54
paulson@1984
    55
clasohm@923
    56
local
clasohm@923
    57
paulson@2935
    58
  fun prover s = prove_goal HOL.thy s (fn _ => [blast_tac HOL_cs 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@3896
    84
nipkow@3896
    85
  fun mk_meta_eq_simp r = case concl_of r of
paulson@2031
    86
          Const("==",_)$_$_ => r
nipkow@3896
    87
      |   _$(Const("op =",_)$lhs$rhs) =>
nipkow@3896
    88
             (case fst(Logic.loops (#sign(rep_thm r)) (prems_of r) lhs rhs) of
nipkow@3896
    89
                None => mk_meta_eq r
nipkow@3896
    90
              | Some _ => r RS P_imp_P_eq_True)
paulson@2718
    91
      |   _$(Const("Not",_)$_) => r RS not_P_imp_P_eq_False
paulson@1922
    92
      |   _ => r RS P_imp_P_eq_True;
paulson@1922
    93
  (* last 2 lines requires all formulae to be of the from Trueprop(.) *)
clasohm@923
    94
paulson@2082
    95
val simp_thms = map prover
paulson@2082
    96
 [ "(x=x) = True",
paulson@2082
    97
   "(~True) = False", "(~False) = True", "(~ ~ P) = P",
paulson@2082
    98
   "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
paulson@2082
    99
   "(True=P) = P", "(P=True) = P",
paulson@2082
   100
   "(True --> P) = P", "(False --> P) = True", 
paulson@2082
   101
   "(P --> True) = True", "(P --> P) = True",
paulson@2082
   102
   "(P --> False) = (~P)", "(P --> ~P) = (~P)",
paulson@2082
   103
   "(P & True) = P", "(True & P) = P", 
nipkow@2800
   104
   "(P & False) = False", "(False & P) = False",
nipkow@2800
   105
   "(P & P) = P", "(P & (P & Q)) = (P & Q)",
paulson@2082
   106
   "(P | True) = True", "(True | P) = True", 
nipkow@2800
   107
   "(P | False) = P", "(False | P) = P",
nipkow@2800
   108
   "(P | P) = P", "(P | (P | Q)) = (P | Q)",
paulson@2082
   109
   "((~P) = (~Q)) = (P=Q)",
wenzelm@3842
   110
   "(!x. P) = P", "(? x. P) = P", "? x. x=t", "? x. t=x", 
nipkow@3573
   111
   "(? x. x=t & P(x)) = P(t)",
nipkow@3568
   112
   "(! x. t=x --> P(x)) = P(t)" ];
clasohm@923
   113
lcp@988
   114
(*Add congruence rules for = (instead of ==) *)
oheimb@2636
   115
infix 4 addcongs delcongs;
wenzelm@3559
   116
fun ss addcongs congs = ss addeqcongs (map standard (congs RL [eq_reflection]));
wenzelm@3559
   117
fun ss delcongs congs = ss deleqcongs (map standard (congs RL [eq_reflection]));
clasohm@923
   118
clasohm@1264
   119
fun Addcongs congs = (simpset := !simpset addcongs congs);
oheimb@2636
   120
fun Delcongs congs = (simpset := !simpset delcongs congs);
clasohm@1264
   121
nipkow@3896
   122
fun mksimps pairs = map mk_meta_eq_simp o atomize pairs o gen_all;
clasohm@923
   123
paulson@1922
   124
val imp_cong = impI RSN
paulson@1922
   125
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
paulson@2935
   126
        (fn _=> [blast_tac HOL_cs 1]) RS mp RS mp);
paulson@1922
   127
paulson@1948
   128
(*Miniscoping: pushing in existential quantifiers*)
paulson@1948
   129
val ex_simps = map prover 
wenzelm@3842
   130
                ["(EX x. P x & Q)   = ((EX x. P x) & Q)",
wenzelm@3842
   131
                 "(EX x. P & Q x)   = (P & (EX x. Q x))",
wenzelm@3842
   132
                 "(EX x. P x | Q)   = ((EX x. P x) | Q)",
wenzelm@3842
   133
                 "(EX x. P | Q x)   = (P | (EX x. Q x))",
wenzelm@3842
   134
                 "(EX x. P x --> Q) = ((ALL x. P x) --> Q)",
wenzelm@3842
   135
                 "(EX x. P --> Q x) = (P --> (EX x. Q x))"];
paulson@1948
   136
paulson@1948
   137
(*Miniscoping: pushing in universal quantifiers*)
paulson@1948
   138
val all_simps = map prover
wenzelm@3842
   139
                ["(ALL x. P x & Q)   = ((ALL x. P x) & Q)",
wenzelm@3842
   140
                 "(ALL x. P & Q x)   = (P & (ALL x. Q x))",
wenzelm@3842
   141
                 "(ALL x. P x | Q)   = ((ALL x. P x) | Q)",
wenzelm@3842
   142
                 "(ALL x. P | Q x)   = (P | (ALL x. Q x))",
wenzelm@3842
   143
                 "(ALL x. P x --> Q) = ((EX x. P x) --> Q)",
wenzelm@3842
   144
                 "(ALL x. P --> Q x) = (P --> (ALL x. Q x))"];
paulson@1948
   145
nipkow@3568
   146
(*** Simplification procedure for turning  ? x. ... & x = t & ...
nipkow@3568
   147
     into                                  ? x. x = t & ... & ...
nipkow@3568
   148
     where the latter can be rewritten via (? x. x = t & P(x)) = P(t)
nipkow@3568
   149
 ***)
nipkow@3568
   150
nipkow@3568
   151
local
nipkow@3568
   152
nipkow@3568
   153
fun def(eq as (c as Const("op =",_)) $ s $ t) =
nipkow@3568
   154
      if s = Bound 0 andalso not(loose_bvar1(t,0)) then Some eq else
nipkow@3568
   155
      if t = Bound 0 andalso not(loose_bvar1(s,0)) then Some(c$t$s)
nipkow@3568
   156
      else None
nipkow@3568
   157
  | def _ = None;
nipkow@3568
   158
nipkow@3568
   159
fun extract(Const("op &",_) $ P $ Q) =
nipkow@3568
   160
      (case def P of
nipkow@3568
   161
         Some eq => Some(eq,Q)
nipkow@3568
   162
       | None => (case def Q of
nipkow@3568
   163
                   Some eq => Some(eq,P)
nipkow@3568
   164
                 | None =>
nipkow@3568
   165
       (case extract P of
nipkow@3568
   166
         Some(eq,P') => Some(eq, HOLogic.conj $ P' $ Q)
nipkow@3568
   167
       | None => (case extract Q of
nipkow@3568
   168
                   Some(eq,Q') => Some(eq,HOLogic.conj $ P $ Q')
nipkow@3568
   169
                 | None => None))))
nipkow@3568
   170
  | extract _ = None;
nipkow@3568
   171
nipkow@3568
   172
fun prove_eq(ceqt) =
nipkow@3568
   173
  let val tac = rtac eq_reflection 1 THEN rtac iffI 1 THEN
nipkow@3568
   174
                ALLGOALS(EVERY'[etac exE, REPEAT o (etac conjE),
nipkow@3568
   175
                 rtac exI, REPEAT o (ares_tac [conjI] ORELSE' etac sym)])
nipkow@3568
   176
  in rule_by_tactic tac (trivial ceqt) end;
nipkow@3568
   177
wenzelm@3577
   178
fun rearrange sg _ (F as ex $ Abs(x,T,P)) =
nipkow@3568
   179
     (case extract P of
nipkow@3568
   180
        None => None
nipkow@3568
   181
      | Some(eq,Q) =>
nipkow@3568
   182
          let val ceqt = cterm_of sg
nipkow@3568
   183
                       (Logic.mk_equals(F,ex $ Abs(x,T,HOLogic.conj$eq$Q)))
nipkow@3568
   184
          in Some(prove_eq ceqt) end)
wenzelm@3577
   185
  | rearrange _ _ _ = None;
nipkow@3568
   186
wenzelm@3842
   187
val pattern = read_cterm (sign_of HOL.thy) ("? x. P(x) & Q(x)",HOLogic.boolT)
nipkow@3568
   188
nipkow@3568
   189
in
nipkow@3568
   190
val defEX_regroup = mk_simproc "defined EX" [pattern] rearrange;
nipkow@3568
   191
end;
berghofe@1722
   192
clasohm@923
   193
paulson@2022
   194
(* elimination of existential quantifiers in assumptions *)
clasohm@923
   195
clasohm@923
   196
val ex_all_equiv =
clasohm@923
   197
  let val lemma1 = prove_goal HOL.thy
clasohm@923
   198
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
clasohm@923
   199
        (fn prems => [resolve_tac prems 1, etac exI 1]);
clasohm@923
   200
      val lemma2 = prove_goalw HOL.thy [Ex_def]
clasohm@923
   201
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
clasohm@923
   202
        (fn prems => [REPEAT(resolve_tac prems 1)])
clasohm@923
   203
  in equal_intr lemma1 lemma2 end;
clasohm@923
   204
clasohm@923
   205
end;
clasohm@923
   206
nipkow@3654
   207
(* Elimination of True from asumptions: *)
nipkow@3654
   208
nipkow@3654
   209
val True_implies_equals = prove_goal HOL.thy
nipkow@3654
   210
 "(True ==> PROP P) == PROP P"
nipkow@3654
   211
(fn _ => [rtac equal_intr_rule 1, atac 2,
nipkow@3654
   212
          METAHYPS (fn prems => resolve_tac prems 1) 1,
nipkow@3654
   213
          rtac TrueI 1]);
nipkow@3654
   214
paulson@2935
   215
fun prove nm thm  = qed_goal nm HOL.thy thm (fn _ => [blast_tac HOL_cs 1]);
clasohm@923
   216
clasohm@923
   217
prove "conj_commute" "(P&Q) = (Q&P)";
clasohm@923
   218
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
clasohm@923
   219
val conj_comms = [conj_commute, conj_left_commute];
nipkow@2134
   220
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))";
clasohm@923
   221
paulson@1922
   222
prove "disj_commute" "(P|Q) = (Q|P)";
paulson@1922
   223
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
paulson@1922
   224
val disj_comms = [disj_commute, disj_left_commute];
nipkow@2134
   225
prove "disj_assoc" "((P|Q)|R) = (P|(Q|R))";
paulson@1922
   226
clasohm@923
   227
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
clasohm@923
   228
prove "conj_disj_distribR" "((P|Q)&R) = (P&R | Q&R)";
nipkow@1485
   229
paulson@1892
   230
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
paulson@1892
   231
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
paulson@1892
   232
nipkow@2134
   233
prove "imp_conjR" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
nipkow@2134
   234
prove "imp_conjL" "((P&Q) -->R)  = (P --> (Q --> R))";
nipkow@2134
   235
prove "imp_disjL" "((P|Q) --> R) = ((P-->R)&(Q-->R))";
paulson@1892
   236
paulson@3448
   237
(*These two are specialized, but imp_disj_not1 is useful in Auth/Yahalom.ML*)
paulson@3448
   238
prove "imp_disj_not1" "((P --> Q | R)) = (~Q --> P --> R)";
paulson@3448
   239
prove "imp_disj_not2" "((P --> Q | R)) = (~R --> P --> Q)";
paulson@3448
   240
paulson@3904
   241
prove "imp_disj1" "((P-->Q)|R) = (P--> Q|R)";
paulson@3904
   242
prove "imp_disj2" "(Q|(P-->R)) = (P--> Q|R)";
paulson@3904
   243
nipkow@1485
   244
prove "de_Morgan_disj" "(~(P | Q)) = (~P & ~Q)";
nipkow@1485
   245
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
paulson@3446
   246
prove "not_imp" "(~(P --> Q)) = (P & ~Q)";
paulson@1922
   247
prove "not_iff" "(P~=Q) = (P = (~Q))";
nipkow@1485
   248
nipkow@2134
   249
(*Avoids duplication of subgoals after expand_if, when the true and false 
nipkow@2134
   250
  cases boil down to the same thing.*) 
nipkow@2134
   251
prove "cases_simp" "((P --> Q) & (~P --> Q)) = Q";
nipkow@2134
   252
wenzelm@3842
   253
prove "not_all" "(~ (! x. P(x))) = (? x.~P(x))";
paulson@1922
   254
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
wenzelm@3842
   255
prove "not_ex"  "(~ (? x. P(x))) = (! x.~P(x))";
paulson@1922
   256
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
oheimb@1660
   257
nipkow@1655
   258
prove "ex_disj_distrib" "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))";
nipkow@1655
   259
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))";
nipkow@1655
   260
nipkow@2134
   261
(* '&' congruence rule: not included by default!
nipkow@2134
   262
   May slow rewrite proofs down by as much as 50% *)
nipkow@2134
   263
nipkow@2134
   264
let val th = prove_goal HOL.thy 
nipkow@2134
   265
                "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
paulson@2935
   266
                (fn _=> [blast_tac HOL_cs 1])
nipkow@2134
   267
in  bind_thm("conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   268
nipkow@2134
   269
let val th = prove_goal HOL.thy 
nipkow@2134
   270
                "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
paulson@2935
   271
                (fn _=> [blast_tac HOL_cs 1])
nipkow@2134
   272
in  bind_thm("rev_conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   273
nipkow@2134
   274
(* '|' congruence rule: not included by default! *)
nipkow@2134
   275
nipkow@2134
   276
let val th = prove_goal HOL.thy 
nipkow@2134
   277
                "(P=P')--> (~P'--> (Q=Q'))--> ((P|Q) = (P'|Q'))"
paulson@2935
   278
                (fn _=> [blast_tac HOL_cs 1])
nipkow@2134
   279
in  bind_thm("disj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   280
nipkow@2134
   281
prove "eq_sym_conv" "(x=y) = (y=x)";
nipkow@2134
   282
nipkow@2134
   283
qed_goalw "o_apply" HOL.thy [o_def] "(f o g) x = f (g x)"
nipkow@2134
   284
 (fn _ => [rtac refl 1]);
nipkow@2134
   285
nipkow@2134
   286
qed_goal "meta_eq_to_obj_eq" HOL.thy "x==y ==> x=y"
nipkow@2134
   287
  (fn [prem] => [rewtac prem, rtac refl 1]);
nipkow@2134
   288
nipkow@2134
   289
qed_goalw "if_True" HOL.thy [if_def] "(if True then x else y) = x"
paulson@2935
   290
 (fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]);
nipkow@2134
   291
nipkow@2134
   292
qed_goalw "if_False" HOL.thy [if_def] "(if False then x else y) = y"
paulson@2935
   293
 (fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]);
nipkow@2134
   294
nipkow@2134
   295
qed_goal "if_P" HOL.thy "P ==> (if P then x else y) = x"
nipkow@2134
   296
 (fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]);
nipkow@2134
   297
(*
nipkow@2134
   298
qed_goal "if_not_P" HOL.thy "~P ==> (if P then x else y) = y"
nipkow@2134
   299
 (fn [prem] => [ stac (prem RS not_P_imp_P_iff_F) 1, rtac if_False 1 ]);
nipkow@2134
   300
*)
nipkow@2134
   301
qed_goalw "if_not_P" HOL.thy [if_def] "!!P. ~P ==> (if P then x else y) = y"
paulson@2935
   302
 (fn _ => [blast_tac (HOL_cs addIs [select_equality]) 1]);
nipkow@2134
   303
nipkow@2134
   304
qed_goal "expand_if" HOL.thy
nipkow@2134
   305
    "P(if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
nipkow@2134
   306
 (fn _=> [ (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1),
nipkow@2134
   307
         stac if_P 2,
nipkow@2134
   308
         stac if_not_P 1,
paulson@2935
   309
         REPEAT(blast_tac HOL_cs 1) ]);
nipkow@2134
   310
nipkow@2134
   311
qed_goal "if_bool_eq" HOL.thy
nipkow@2134
   312
                   "(if P then Q else R) = ((P-->Q) & (~P-->R))"
nipkow@2134
   313
                   (fn _ => [rtac expand_if 1]);
nipkow@2134
   314
oheimb@2263
   315
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2)
oheimb@2263
   316
in
oheimb@2263
   317
fun split_tac splits = mktac (map mk_meta_eq splits)
oheimb@2263
   318
end;
oheimb@2263
   319
oheimb@2263
   320
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2)
oheimb@2263
   321
in
oheimb@2263
   322
fun split_inside_tac splits = mktac (map mk_meta_eq splits)
oheimb@2263
   323
end;
oheimb@2263
   324
oheimb@2263
   325
oheimb@2251
   326
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x"
paulson@2935
   327
  (fn _ => [split_tac [expand_if] 1, blast_tac HOL_cs 1]);
oheimb@2251
   328
nipkow@2134
   329
(** 'if' congruence rules: neither included by default! *)
nipkow@2134
   330
nipkow@2134
   331
(*Simplifies x assuming c and y assuming ~c*)
nipkow@2134
   332
qed_goal "if_cong" HOL.thy
nipkow@2134
   333
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==>\
nipkow@2134
   334
\  (if b then x else y) = (if c then u else v)"
nipkow@2134
   335
  (fn rew::prems =>
nipkow@2134
   336
   [stac rew 1, stac expand_if 1, stac expand_if 1,
paulson@2935
   337
    blast_tac (HOL_cs addDs prems) 1]);
nipkow@2134
   338
nipkow@2134
   339
(*Prevents simplification of x and y: much faster*)
nipkow@2134
   340
qed_goal "if_weak_cong" HOL.thy
nipkow@2134
   341
  "b=c ==> (if b then x else y) = (if c then x else y)"
nipkow@2134
   342
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
nipkow@2134
   343
nipkow@2134
   344
(*Prevents simplification of t: much faster*)
nipkow@2134
   345
qed_goal "let_weak_cong" HOL.thy
nipkow@2134
   346
  "a = b ==> (let x=a in t(x)) = (let x=b in t(x))"
nipkow@2134
   347
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
nipkow@2134
   348
nipkow@2134
   349
(*In general it seems wrong to add distributive laws by default: they
nipkow@2134
   350
  might cause exponential blow-up.  But imp_disjL has been in for a while
nipkow@2134
   351
  and cannot be removed without affecting existing proofs.  Moreover, 
nipkow@2134
   352
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
nipkow@2134
   353
  grounds that it allows simplification of R in the two cases.*)
nipkow@2134
   354
nipkow@2134
   355
val mksimps_pairs =
nipkow@2134
   356
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
nipkow@2134
   357
   ("All", [spec]), ("True", []), ("False", []),
nipkow@2134
   358
   ("If", [if_bool_eq RS iffD1])];
nipkow@1758
   359
oheimb@2636
   360
fun unsafe_solver prems = FIRST'[resolve_tac (TrueI::refl::prems),
oheimb@2636
   361
				 atac, etac FalseE];
oheimb@2636
   362
(*No premature instantiation of variables during simplification*)
oheimb@2636
   363
fun   safe_solver prems = FIRST'[match_tac (TrueI::refl::prems),
oheimb@2636
   364
				 eq_assume_tac, ematch_tac [FalseE]];
oheimb@2443
   365
oheimb@2636
   366
val HOL_basic_ss = empty_ss setsubgoaler asm_simp_tac
oheimb@2636
   367
			    setSSolver   safe_solver
oheimb@2636
   368
			    setSolver  unsafe_solver
oheimb@2636
   369
			    setmksimps (mksimps mksimps_pairs);
oheimb@2443
   370
paulson@3446
   371
val HOL_ss = 
paulson@3446
   372
    HOL_basic_ss addsimps 
paulson@3446
   373
     ([triv_forall_equality, (* prunes params *)
nipkow@3654
   374
       True_implies_equals, (* prune asms `True' *)
paulson@3446
   375
       if_True, if_False, if_cancel,
paulson@3446
   376
       o_apply, imp_disjL, conj_assoc, disj_assoc,
paulson@3904
   377
       de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, not_imp,
paulson@3446
   378
       not_all, not_ex, cases_simp]
paulson@3446
   379
     @ ex_simps @ all_simps @ simp_thms)
nipkow@3568
   380
     addsimprocs [defEX_regroup]
paulson@3446
   381
     addcongs [imp_cong];
paulson@2082
   382
nipkow@1655
   383
qed_goal "if_distrib" HOL.thy
nipkow@1655
   384
  "f(if c then x else y) = (if c then f x else f y)" 
nipkow@1655
   385
  (fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]);
nipkow@1655
   386
oheimb@2097
   387
qed_goalw "o_assoc" HOL.thy [o_def] "f o (g o h) = f o g o h"
oheimb@2098
   388
  (fn _ => [rtac ext 1, rtac refl 1]);
paulson@1984
   389
paulson@1984
   390
paulson@2948
   391
val prems = goal HOL.thy "[| P ==> Q(True); ~P ==> Q(False) |] ==> Q(P)";
paulson@2948
   392
by (case_tac "P" 1);
paulson@2948
   393
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems)));
paulson@2948
   394
val expand_case = result();
paulson@2948
   395
paulson@2948
   396
fun expand_case_tac P i =
paulson@2948
   397
    res_inst_tac [("P",P)] expand_case i THEN
paulson@2948
   398
    Simp_tac (i+1) THEN 
paulson@2948
   399
    Simp_tac i;
paulson@2948
   400
paulson@2948
   401
paulson@1984
   402
paulson@1984
   403
paulson@1984
   404
(*** Install simpsets and datatypes in theory structure ***)
paulson@1984
   405
oheimb@2251
   406
simpset := HOL_ss;
paulson@1984
   407
paulson@1984
   408
exception SS_DATA of simpset;
paulson@1984
   409
paulson@1984
   410
let fun merge [] = SS_DATA empty_ss
paulson@1984
   411
      | merge ss = let val ss = map (fn SS_DATA x => x) ss;
paulson@1984
   412
                   in SS_DATA (foldl merge_ss (hd ss, tl ss)) end;
paulson@1984
   413
paulson@1984
   414
    fun put (SS_DATA ss) = simpset := ss;
paulson@1984
   415
paulson@1984
   416
    fun get () = SS_DATA (!simpset);
paulson@1984
   417
in add_thydata "HOL"
paulson@1984
   418
     ("simpset", ThyMethods {merge = merge, put = put, get = get})
paulson@1984
   419
end;
paulson@1984
   420
berghofe@3615
   421
fun simpset_of tname =
berghofe@3615
   422
  case get_thydata tname "simpset" of
berghofe@3615
   423
      None => empty_ss
berghofe@3615
   424
    | Some (SS_DATA ss) => ss;
berghofe@3615
   425
nipkow@3040
   426
type dtype_info = {case_const:term,
nipkow@3040
   427
                   case_rewrites:thm list,
nipkow@3040
   428
                   constructors:term list,
nipkow@3040
   429
                   induct_tac: string -> int -> tactic,
nipkow@3282
   430
                   nchotomy: thm,
nipkow@3282
   431
                   exhaustion: thm,
nipkow@3282
   432
                   exhaust_tac: string -> int -> tactic,
nipkow@3040
   433
                   case_cong:thm};
paulson@1984
   434
paulson@1984
   435
exception DT_DATA of (string * dtype_info) list;
paulson@1984
   436
val datatypes = ref [] : (string * dtype_info) list ref;
paulson@1984
   437
paulson@1984
   438
let fun merge [] = DT_DATA []
paulson@1984
   439
      | merge ds =
paulson@1984
   440
          let val ds = map (fn DT_DATA x => x) ds;
paulson@1984
   441
          in DT_DATA (foldl (gen_union eq_fst) (hd ds, tl ds)) end;
paulson@1984
   442
paulson@1984
   443
    fun put (DT_DATA ds) = datatypes := ds;
paulson@1984
   444
paulson@1984
   445
    fun get () = DT_DATA (!datatypes);
paulson@1984
   446
in add_thydata "HOL"
paulson@1984
   447
     ("datatypes", ThyMethods {merge = merge, put = put, get = get})
paulson@1984
   448
end;
paulson@1984
   449
paulson@1984
   450
oheimb@2636
   451
oheimb@2636
   452
(*** Integration of simplifier with classical reasoner ***)
oheimb@2636
   453
oheimb@2636
   454
(* rot_eq_tac rotates the first equality premise of subgoal i to the front,
oheimb@2636
   455
   fails if there is no equaliy or if an equality is already at the front *)
paulson@3538
   456
local
paulson@3538
   457
  fun is_eq (Const ("Trueprop", _) $ (Const("op ="  ,_) $ _ $ _)) = true
paulson@3538
   458
    | is_eq _ = false;
paulson@3538
   459
  fun find_eq n [] = None
paulson@3538
   460
    | find_eq n (t :: ts) = if (is_eq t) then Some n 
paulson@3538
   461
			    else find_eq (n + 1) ts;
paulson@3538
   462
in
paulson@3538
   463
val rot_eq_tac = 
paulson@3538
   464
     SUBGOAL (fn (Bi,i) => 
paulson@3538
   465
	      case find_eq 0 (Logic.strip_assums_hyp Bi) of
paulson@2805
   466
		  None   => no_tac
paulson@2805
   467
		| Some 0 => no_tac
paulson@3538
   468
		| Some n => rotate_tac n i)
paulson@3538
   469
end;
oheimb@2636
   470
oheimb@2636
   471
(*an unsatisfactory fix for the incomplete asm_full_simp_tac!
oheimb@2636
   472
  better: asm_really_full_simp_tac, a yet to be implemented version of
oheimb@2636
   473
			asm_full_simp_tac that applies all equalities in the
oheimb@2636
   474
			premises to all the premises *)
oheimb@2636
   475
fun safe_asm_more_full_simp_tac ss = TRY o rot_eq_tac THEN' 
oheimb@2636
   476
				     safe_asm_full_simp_tac ss;
oheimb@2636
   477
oheimb@2636
   478
(*Add a simpset to a classical set!*)
oheimb@3206
   479
infix 4 addSss addss;
oheimb@3206
   480
fun cs addSss ss = cs addSaltern (CHANGED o (safe_asm_more_full_simp_tac ss));
oheimb@3206
   481
fun cs addss  ss = cs addbefore                        asm_full_simp_tac ss;
oheimb@2636
   482
oheimb@2636
   483
fun Addss ss = (claset := !claset addss ss);
oheimb@2636
   484
oheimb@2636
   485
(*Designed to be idempotent, except if best_tac instantiates variables
oheimb@2636
   486
  in some of the subgoals*)
oheimb@2636
   487
oheimb@2636
   488
type clasimpset = (claset * simpset);
oheimb@2636
   489
oheimb@2636
   490
val HOL_css = (HOL_cs, HOL_ss);
oheimb@2636
   491
oheimb@2636
   492
fun pair_upd1 f ((a,b),x) = (f(a,x), b);
oheimb@2636
   493
fun pair_upd2 f ((a,b),x) = (a, f(b,x));
oheimb@2636
   494
oheimb@2636
   495
infix 4 addSIs2 addSEs2 addSDs2 addIs2 addEs2 addDs2
oheimb@2636
   496
	addsimps2 delsimps2 addcongs2 delcongs2;
paulson@2748
   497
fun op addSIs2   arg = pair_upd1 (op addSIs) arg;
paulson@2748
   498
fun op addSEs2   arg = pair_upd1 (op addSEs) arg;
paulson@2748
   499
fun op addSDs2   arg = pair_upd1 (op addSDs) arg;
paulson@2748
   500
fun op addIs2    arg = pair_upd1 (op addIs ) arg;
paulson@2748
   501
fun op addEs2    arg = pair_upd1 (op addEs ) arg;
paulson@2748
   502
fun op addDs2    arg = pair_upd1 (op addDs ) arg;
paulson@2748
   503
fun op addsimps2 arg = pair_upd2 (op addsimps) arg;
paulson@2748
   504
fun op delsimps2 arg = pair_upd2 (op delsimps) arg;
paulson@2748
   505
fun op addcongs2 arg = pair_upd2 (op addcongs) arg;
paulson@2748
   506
fun op delcongs2 arg = pair_upd2 (op delcongs) arg;
oheimb@2636
   507
paulson@2805
   508
fun auto_tac (cs,ss) = 
paulson@2805
   509
    let val cs' = cs addss ss 
paulson@2805
   510
    in  EVERY [TRY (safe_tac cs'),
paulson@2805
   511
	       REPEAT (FIRSTGOAL (fast_tac cs')),
oheimb@3206
   512
               TRY (safe_tac (cs addSss ss)),
paulson@2805
   513
	       prune_params_tac] 
paulson@2805
   514
    end;
oheimb@2636
   515
oheimb@2636
   516
fun Auto_tac () = auto_tac (!claset, !simpset);
oheimb@2636
   517
oheimb@2636
   518
fun auto () = by (Auto_tac ());