src/HOL/simpdata.ML
author berghofe
Tue Oct 05 15:24:58 1999 +0200 (1999-10-05)
changeset 7711 4dae7a4fceaf
parent 7648 8258b93cdd32
child 8114 09a7a180cc99
permissions -rw-r--r--
Rule not_not is now stored in theory (needed by Inductive).
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
oheimb@5304
     6
Instantiation of the generic simplifier for HOL.
clasohm@923
     7
*)
clasohm@923
     8
paulson@1984
     9
section "Simplifier";
paulson@1984
    10
wenzelm@6514
    11
(*** Addition of rules to simpsets and clasets simultaneously ***)	(* FIXME move to Provers/clasimp.ML? *)
paulson@1984
    12
berghofe@5190
    13
infix 4 addIffs delIffs;
berghofe@5190
    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
berghofe@5190
    23
  fun addIff ((cla, simp), th) = 
berghofe@5190
    24
      (case HOLogic.dest_Trueprop (#prop (rep_thm th)) of
berghofe@5190
    25
                (Const("Not", _) $ A) =>
berghofe@5190
    26
                    cla addSEs [zero_var_indexes (th RS notE)]
paulson@2031
    27
              | (con $ _ $ _) =>
berghofe@5190
    28
                    if con = iff_const
berghofe@5190
    29
                    then cla addSIs [zero_var_indexes (th RS iffD2)]  
berghofe@5190
    30
                              addSDs [zero_var_indexes (th RS iffD1)]
berghofe@5190
    31
                    else  cla addSIs [th]
berghofe@5190
    32
              | _ => cla addSIs [th],
berghofe@5190
    33
       simp addsimps [th])
wenzelm@6968
    34
      handle TERM _ => error ("AddIffs: theorem must be unconditional\n" ^ 
berghofe@5190
    35
                         string_of_thm th);
paulson@1984
    36
berghofe@5190
    37
  fun delIff ((cla, simp), th) = 
berghofe@5190
    38
      (case HOLogic.dest_Trueprop (#prop (rep_thm th)) of
berghofe@5190
    39
                (Const ("Not", _) $ A) =>
berghofe@5190
    40
                    cla delrules [zero_var_indexes (th RS notE)]
paulson@2031
    41
              | (con $ _ $ _) =>
berghofe@5190
    42
                    if con = iff_const
berghofe@5190
    43
                    then cla delrules [zero_var_indexes (th RS iffD2),
berghofe@5190
    44
                                       make_elim (zero_var_indexes (th RS iffD1))]
berghofe@5190
    45
                    else cla delrules [th]
berghofe@5190
    46
              | _ => cla delrules [th],
berghofe@5190
    47
       simp delsimps [th])
wenzelm@6968
    48
      handle TERM _ => (warning("DelIffs: ignoring conditional theorem\n" ^ 
berghofe@5190
    49
                          string_of_thm th); (cla, simp));
berghofe@5190
    50
berghofe@5190
    51
  fun store_clasimp (cla, simp) = (claset_ref () := cla; simpset_ref () := simp)
paulson@1984
    52
in
berghofe@5190
    53
val op addIffs = foldl addIff;
berghofe@5190
    54
val op delIffs = foldl delIff;
berghofe@5190
    55
fun AddIffs thms = store_clasimp ((claset (), simpset ()) addIffs thms);
berghofe@5190
    56
fun DelIffs thms = store_clasimp ((claset (), simpset ()) delIffs thms);
paulson@1984
    57
end;
paulson@1984
    58
oheimb@5304
    59
wenzelm@6514
    60
(* "iff" attribute *)
wenzelm@6514
    61
wenzelm@6514
    62
local
wenzelm@6514
    63
  fun change_global_css f (thy, th) =
wenzelm@6514
    64
    let
wenzelm@6514
    65
      val cs_ref = Classical.claset_ref_of thy;
wenzelm@6514
    66
      val ss_ref = Simplifier.simpset_ref_of thy;
wenzelm@6514
    67
      val (cs', ss') = f ((! cs_ref, ! ss_ref), [th]);
wenzelm@6514
    68
    in cs_ref := cs'; ss_ref := ss'; (thy, th) end;
wenzelm@6514
    69
wenzelm@6514
    70
  fun change_local_css f (ctxt, th) =
wenzelm@6514
    71
    let
wenzelm@6514
    72
      val cs = Classical.get_local_claset ctxt;
wenzelm@6514
    73
      val ss = Simplifier.get_local_simpset ctxt;
wenzelm@6514
    74
      val (cs', ss') = f ((cs, ss), [th]);
wenzelm@6514
    75
      val ctxt' =
wenzelm@6514
    76
        ctxt
wenzelm@6514
    77
        |> Classical.put_local_claset cs'
wenzelm@6514
    78
        |> Simplifier.put_local_simpset ss';
wenzelm@6514
    79
    in (ctxt', th) end;
wenzelm@6514
    80
in
wenzelm@6514
    81
wenzelm@6514
    82
val iff_add_global = change_global_css (op addIffs);
wenzelm@6514
    83
val iff_add_local = change_local_css (op addIffs);
wenzelm@6514
    84
wenzelm@7369
    85
val iff_attrib_setup =
wenzelm@6514
    86
  [Attrib.add_attributes [("iff", (Attrib.no_args iff_add_global, Attrib.no_args iff_add_local),
wenzelm@6514
    87
    "add rules to simpset and claset simultaneously")]];
wenzelm@6514
    88
wenzelm@6514
    89
end;
wenzelm@6514
    90
wenzelm@6514
    91
wenzelm@7357
    92
val [prem] = goal (the_context ()) "x==y ==> x=y";
paulson@7031
    93
by (rewtac prem);
paulson@7031
    94
by (rtac refl 1);
paulson@7031
    95
qed "meta_eq_to_obj_eq";
nipkow@4640
    96
clasohm@923
    97
local
clasohm@923
    98
wenzelm@7357
    99
  fun prover s = prove_goal (the_context ()) s (fn _ => [(Blast_tac 1)]);
clasohm@923
   100
nipkow@2134
   101
in
nipkow@2134
   102
oheimb@5552
   103
(*Make meta-equalities.  The operator below is Trueprop*)
oheimb@5552
   104
nipkow@6128
   105
fun mk_meta_eq r = r RS eq_reflection;
nipkow@6128
   106
nipkow@6128
   107
val Eq_TrueI  = mk_meta_eq(prover  "P --> (P = True)"  RS mp);
nipkow@6128
   108
val Eq_FalseI = mk_meta_eq(prover "~P --> (P = False)" RS mp);
oheimb@5304
   109
nipkow@6128
   110
fun mk_eq th = case concl_of th of
nipkow@6128
   111
        Const("==",_)$_$_       => th
nipkow@6128
   112
    |   _$(Const("op =",_)$_$_) => mk_meta_eq th
nipkow@6128
   113
    |   _$(Const("Not",_)$_)    => th RS Eq_FalseI
nipkow@6128
   114
    |   _                       => th RS Eq_TrueI;
nipkow@6128
   115
(* last 2 lines requires all formulae to be of the from Trueprop(.) *)
oheimb@5304
   116
nipkow@6128
   117
fun mk_eq_True r = Some(r RS meta_eq_to_obj_eq RS Eq_TrueI);
oheimb@5552
   118
nipkow@6128
   119
fun mk_meta_cong rl =
nipkow@6128
   120
  standard(mk_meta_eq(replicate (nprems_of rl) meta_eq_to_obj_eq MRS rl))
nipkow@6128
   121
  handle THM _ =>
nipkow@6128
   122
  error("Premises and conclusion of congruence rules must be =-equalities");
nipkow@3896
   123
nipkow@5975
   124
val not_not = prover "(~ ~ P) = P";
clasohm@923
   125
nipkow@5975
   126
val simp_thms = [not_not] @ map prover
paulson@2082
   127
 [ "(x=x) = True",
nipkow@5975
   128
   "(~True) = False", "(~False) = True",
paulson@2082
   129
   "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
nipkow@4640
   130
   "(True=P) = P", "(P=True) = P", "(False=P) = (~P)", "(P=False) = (~P)",
paulson@2082
   131
   "(True --> P) = P", "(False --> P) = True", 
paulson@2082
   132
   "(P --> True) = True", "(P --> P) = True",
paulson@2082
   133
   "(P --> False) = (~P)", "(P --> ~P) = (~P)",
paulson@2082
   134
   "(P & True) = P", "(True & P) = P", 
nipkow@2800
   135
   "(P & False) = False", "(False & P) = False",
nipkow@2800
   136
   "(P & P) = P", "(P & (P & Q)) = (P & Q)",
paulson@3913
   137
   "(P & ~P) = False",    "(~P & P) = False",
paulson@2082
   138
   "(P | True) = True", "(True | P) = True", 
nipkow@2800
   139
   "(P | False) = P", "(False | P) = P",
nipkow@2800
   140
   "(P | P) = P", "(P | (P | Q)) = (P | Q)",
paulson@3913
   141
   "(P | ~P) = True",    "(~P | P) = True",
paulson@2082
   142
   "((~P) = (~Q)) = (P=Q)",
wenzelm@3842
   143
   "(!x. P) = P", "(? x. P) = P", "? x. x=t", "? x. t=x", 
paulson@4351
   144
(*two needed for the one-point-rule quantifier simplification procs*)
paulson@4351
   145
   "(? x. x=t & P(x)) = P(t)",		(*essential for termination!!*)
paulson@4351
   146
   "(! x. t=x --> P(x)) = P(t)" ];      (*covers a stray case*)
clasohm@923
   147
oheimb@5552
   148
(* Add congruence rules for = (instead of ==) *)
paulson@4351
   149
oheimb@5552
   150
(* ###FIXME: Move to simplifier, 
oheimb@5552
   151
   taking mk_meta_cong as input, eliminating addeqcongs and deleqcongs *)
oheimb@5552
   152
infix 4 addcongs delcongs;
nipkow@4640
   153
fun ss addcongs congs = ss addeqcongs (map mk_meta_cong congs);
nipkow@4640
   154
fun ss delcongs congs = ss deleqcongs (map mk_meta_cong congs);
wenzelm@4086
   155
fun Addcongs congs = (simpset_ref() := simpset() addcongs congs);
wenzelm@4086
   156
fun Delcongs congs = (simpset_ref() := simpset() delcongs congs);
clasohm@1264
   157
oheimb@5552
   158
paulson@1922
   159
val imp_cong = impI RSN
wenzelm@7357
   160
    (2, prove_goal (the_context ()) "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
paulson@7031
   161
        (fn _=> [(Blast_tac 1)]) RS mp RS mp);
paulson@1922
   162
paulson@1948
   163
(*Miniscoping: pushing in existential quantifiers*)
wenzelm@7648
   164
val ex_simps = map prover
wenzelm@3842
   165
                ["(EX x. P x & Q)   = ((EX x. P x) & Q)",
wenzelm@3842
   166
                 "(EX x. P & Q x)   = (P & (EX x. Q x))",
wenzelm@3842
   167
                 "(EX x. P x | Q)   = ((EX x. P x) | Q)",
wenzelm@3842
   168
                 "(EX x. P | Q x)   = (P | (EX x. Q x))",
wenzelm@3842
   169
                 "(EX x. P x --> Q) = ((ALL x. P x) --> Q)",
wenzelm@3842
   170
                 "(EX x. P --> Q x) = (P --> (EX x. Q x))"];
paulson@1948
   171
paulson@1948
   172
(*Miniscoping: pushing in universal quantifiers*)
paulson@1948
   173
val all_simps = map prover
wenzelm@3842
   174
                ["(ALL x. P x & Q)   = ((ALL x. P x) & Q)",
wenzelm@3842
   175
                 "(ALL x. P & Q x)   = (P & (ALL x. Q x))",
wenzelm@3842
   176
                 "(ALL x. P x | Q)   = ((ALL x. P x) | Q)",
wenzelm@3842
   177
                 "(ALL x. P | Q x)   = (P | (ALL x. Q x))",
wenzelm@3842
   178
                 "(ALL x. P x --> Q) = ((EX x. P x) --> Q)",
wenzelm@3842
   179
                 "(ALL x. P --> Q x) = (P --> (ALL x. Q x))"];
paulson@1948
   180
clasohm@923
   181
paulson@2022
   182
(* elimination of existential quantifiers in assumptions *)
clasohm@923
   183
clasohm@923
   184
val ex_all_equiv =
wenzelm@7357
   185
  let val lemma1 = prove_goal (the_context ())
clasohm@923
   186
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
clasohm@923
   187
        (fn prems => [resolve_tac prems 1, etac exI 1]);
wenzelm@7357
   188
      val lemma2 = prove_goalw (the_context ()) [Ex_def]
clasohm@923
   189
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
paulson@7031
   190
        (fn prems => [(REPEAT(resolve_tac prems 1))])
clasohm@923
   191
  in equal_intr lemma1 lemma2 end;
clasohm@923
   192
clasohm@923
   193
end;
clasohm@923
   194
wenzelm@7648
   195
bind_thms ("ex_simps", ex_simps);
wenzelm@7648
   196
bind_thms ("all_simps", all_simps);
berghofe@7711
   197
bind_thm ("not_not", not_not);
wenzelm@7648
   198
nipkow@3654
   199
(* Elimination of True from asumptions: *)
nipkow@3654
   200
wenzelm@7357
   201
val True_implies_equals = prove_goal (the_context ())
nipkow@3654
   202
 "(True ==> PROP P) == PROP P"
paulson@7031
   203
(fn _ => [rtac equal_intr_rule 1, atac 2,
nipkow@3654
   204
          METAHYPS (fn prems => resolve_tac prems 1) 1,
nipkow@3654
   205
          rtac TrueI 1]);
nipkow@3654
   206
wenzelm@7357
   207
fun prove nm thm  = qed_goal nm (the_context ()) thm (fn _ => [(Blast_tac 1)]);
clasohm@923
   208
paulson@7623
   209
prove "eq_commute" "(a=b)=(b=a)";
paulson@7623
   210
prove "eq_left_commute" "(P=(Q=R)) = (Q=(P=R))";
paulson@7623
   211
prove "eq_assoc" "((P=Q)=R) = (P=(Q=R))";
paulson@7623
   212
val eq_ac = [eq_commute, eq_left_commute, eq_assoc];
paulson@7623
   213
clasohm@923
   214
prove "conj_commute" "(P&Q) = (Q&P)";
clasohm@923
   215
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
clasohm@923
   216
val conj_comms = [conj_commute, conj_left_commute];
nipkow@2134
   217
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))";
clasohm@923
   218
paulson@1922
   219
prove "disj_commute" "(P|Q) = (Q|P)";
paulson@1922
   220
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
paulson@1922
   221
val disj_comms = [disj_commute, disj_left_commute];
nipkow@2134
   222
prove "disj_assoc" "((P|Q)|R) = (P|(Q|R))";
paulson@1922
   223
clasohm@923
   224
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
clasohm@923
   225
prove "conj_disj_distribR" "((P|Q)&R) = (P&R | Q&R)";
nipkow@1485
   226
paulson@1892
   227
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
paulson@1892
   228
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
paulson@1892
   229
nipkow@2134
   230
prove "imp_conjR" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
nipkow@2134
   231
prove "imp_conjL" "((P&Q) -->R)  = (P --> (Q --> R))";
nipkow@2134
   232
prove "imp_disjL" "((P|Q) --> R) = ((P-->R)&(Q-->R))";
paulson@1892
   233
paulson@3448
   234
(*These two are specialized, but imp_disj_not1 is useful in Auth/Yahalom.ML*)
paulson@3448
   235
prove "imp_disj_not1" "((P --> Q | R)) = (~Q --> P --> R)";
paulson@3448
   236
prove "imp_disj_not2" "((P --> Q | R)) = (~R --> P --> Q)";
paulson@3448
   237
paulson@3904
   238
prove "imp_disj1" "((P-->Q)|R) = (P--> Q|R)";
paulson@3904
   239
prove "imp_disj2" "(Q|(P-->R)) = (P--> Q|R)";
paulson@3904
   240
nipkow@1485
   241
prove "de_Morgan_disj" "(~(P | Q)) = (~P & ~Q)";
nipkow@1485
   242
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
paulson@3446
   243
prove "not_imp" "(~(P --> Q)) = (P & ~Q)";
paulson@1922
   244
prove "not_iff" "(P~=Q) = (P = (~Q))";
oheimb@4743
   245
prove "disj_not1" "(~P | Q) = (P --> Q)";
oheimb@4743
   246
prove "disj_not2" "(P | ~Q) = (Q --> P)"; (* changes orientation :-( *)
nipkow@5975
   247
prove "imp_conv_disj" "(P --> Q) = ((~P) | Q)";
nipkow@5975
   248
nipkow@5975
   249
prove "iff_conv_conj_imp" "(P = Q) = ((P --> Q) & (Q --> P))";
nipkow@5975
   250
nipkow@1485
   251
nipkow@4830
   252
(*Avoids duplication of subgoals after split_if, when the true and false 
nipkow@2134
   253
  cases boil down to the same thing.*) 
nipkow@2134
   254
prove "cases_simp" "((P --> Q) & (~P --> Q)) = Q";
nipkow@2134
   255
wenzelm@3842
   256
prove "not_all" "(~ (! x. P(x))) = (? x.~P(x))";
paulson@1922
   257
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
wenzelm@3842
   258
prove "not_ex"  "(~ (? x. P(x))) = (! x.~P(x))";
paulson@1922
   259
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
oheimb@1660
   260
nipkow@1655
   261
prove "ex_disj_distrib" "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))";
nipkow@1655
   262
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))";
nipkow@1655
   263
nipkow@2134
   264
(* '&' congruence rule: not included by default!
nipkow@2134
   265
   May slow rewrite proofs down by as much as 50% *)
nipkow@2134
   266
wenzelm@7357
   267
let val th = prove_goal (the_context ()) 
nipkow@2134
   268
                "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
paulson@7031
   269
                (fn _=> [(Blast_tac 1)])
nipkow@2134
   270
in  bind_thm("conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   271
wenzelm@7357
   272
let val th = prove_goal (the_context ()) 
nipkow@2134
   273
                "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
paulson@7031
   274
                (fn _=> [(Blast_tac 1)])
nipkow@2134
   275
in  bind_thm("rev_conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   276
nipkow@2134
   277
(* '|' congruence rule: not included by default! *)
nipkow@2134
   278
wenzelm@7357
   279
let val th = prove_goal (the_context ()) 
nipkow@2134
   280
                "(P=P')--> (~P'--> (Q=Q'))--> ((P|Q) = (P'|Q'))"
paulson@7031
   281
                (fn _=> [(Blast_tac 1)])
nipkow@2134
   282
in  bind_thm("disj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
nipkow@2134
   283
nipkow@2134
   284
prove "eq_sym_conv" "(x=y) = (y=x)";
nipkow@2134
   285
paulson@5278
   286
paulson@5278
   287
(** if-then-else rules **)
paulson@5278
   288
paulson@7031
   289
Goalw [if_def] "(if True then x else y) = x";
paulson@7031
   290
by (Blast_tac 1);
paulson@7031
   291
qed "if_True";
nipkow@2134
   292
paulson@7031
   293
Goalw [if_def] "(if False then x else y) = y";
paulson@7031
   294
by (Blast_tac 1);
paulson@7031
   295
qed "if_False";
nipkow@2134
   296
paulson@7127
   297
Goalw [if_def] "P ==> (if P then x else y) = x";
paulson@7031
   298
by (Blast_tac 1);
paulson@7031
   299
qed "if_P";
oheimb@5304
   300
paulson@7127
   301
Goalw [if_def] "~P ==> (if P then x else y) = y";
paulson@7031
   302
by (Blast_tac 1);
paulson@7031
   303
qed "if_not_P";
nipkow@2134
   304
paulson@7031
   305
Goal "P(if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))";
paulson@7031
   306
by (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1);
paulson@7031
   307
by (stac if_P 2);
paulson@7031
   308
by (stac if_not_P 1);
paulson@7031
   309
by (ALLGOALS (Blast_tac));
paulson@7031
   310
qed "split_if";
paulson@7031
   311
nipkow@4830
   312
(* for backwards compatibility: *)
nipkow@4830
   313
val expand_if = split_if;
oheimb@4205
   314
paulson@7031
   315
Goal "P(if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))";
paulson@7031
   316
by (stac split_if 1);
paulson@7031
   317
by (Blast_tac 1);
paulson@7031
   318
qed "split_if_asm";
nipkow@2134
   319
paulson@7031
   320
Goal "(if c then x else x) = x";
paulson@7031
   321
by (stac split_if 1);
paulson@7031
   322
by (Blast_tac 1);
paulson@7031
   323
qed "if_cancel";
oheimb@5304
   324
paulson@7031
   325
Goal "(if x = y then y else x) = x";
paulson@7031
   326
by (stac split_if 1);
paulson@7031
   327
by (Blast_tac 1);
paulson@7031
   328
qed "if_eq_cancel";
oheimb@5304
   329
paulson@4769
   330
(*This form is useful for expanding IFs on the RIGHT of the ==> symbol*)
paulson@7127
   331
Goal "(if P then Q else R) = ((P-->Q) & (~P-->R))";
paulson@7031
   332
by (rtac split_if 1);
paulson@7031
   333
qed "if_bool_eq_conj";
paulson@4769
   334
paulson@4769
   335
(*And this form is useful for expanding IFs on the LEFT*)
paulson@7031
   336
Goal "(if P then Q else R) = ((P&Q) | (~P&R))";
paulson@7031
   337
by (stac split_if 1);
paulson@7031
   338
by (Blast_tac 1);
paulson@7031
   339
qed "if_bool_eq_disj";
nipkow@2134
   340
paulson@4351
   341
paulson@4351
   342
(*** make simplification procedures for quantifier elimination ***)
paulson@4351
   343
paulson@4351
   344
structure Quantifier1 = Quantifier1Fun(
paulson@4351
   345
struct
paulson@4351
   346
  (*abstract syntax*)
paulson@4351
   347
  fun dest_eq((c as Const("op =",_)) $ s $ t) = Some(c,s,t)
paulson@4351
   348
    | dest_eq _ = None;
paulson@4351
   349
  fun dest_conj((c as Const("op &",_)) $ s $ t) = Some(c,s,t)
paulson@4351
   350
    | dest_conj _ = None;
paulson@4351
   351
  val conj = HOLogic.conj
paulson@4351
   352
  val imp  = HOLogic.imp
paulson@4351
   353
  (*rules*)
paulson@4351
   354
  val iff_reflection = eq_reflection
paulson@4351
   355
  val iffI = iffI
paulson@4351
   356
  val sym  = sym
paulson@4351
   357
  val conjI= conjI
paulson@4351
   358
  val conjE= conjE
paulson@4351
   359
  val impI = impI
paulson@4351
   360
  val impE = impE
paulson@4351
   361
  val mp   = mp
paulson@4351
   362
  val exI  = exI
paulson@4351
   363
  val exE  = exE
paulson@4351
   364
  val allI = allI
paulson@4351
   365
  val allE = allE
paulson@4351
   366
end);
paulson@4351
   367
nipkow@4320
   368
local
nipkow@4320
   369
val ex_pattern =
wenzelm@7357
   370
  Thm.read_cterm (Theory.sign_of (the_context ())) ("EX x. P(x) & Q(x)",HOLogic.boolT)
paulson@3913
   371
nipkow@4320
   372
val all_pattern =
wenzelm@7357
   373
  Thm.read_cterm (Theory.sign_of (the_context ())) ("ALL x. P(x) & P'(x) --> Q(x)",HOLogic.boolT)
nipkow@4320
   374
nipkow@4320
   375
in
nipkow@4320
   376
val defEX_regroup =
nipkow@4320
   377
  mk_simproc "defined EX" [ex_pattern] Quantifier1.rearrange_ex;
nipkow@4320
   378
val defALL_regroup =
nipkow@4320
   379
  mk_simproc "defined ALL" [all_pattern] Quantifier1.rearrange_all;
nipkow@4320
   380
end;
paulson@3913
   381
paulson@4351
   382
paulson@4351
   383
(*** Case splitting ***)
paulson@3913
   384
oheimb@5304
   385
structure SplitterData =
oheimb@5304
   386
  struct
oheimb@5304
   387
  structure Simplifier = Simplifier
oheimb@5552
   388
  val mk_eq          = mk_eq
oheimb@5304
   389
  val meta_eq_to_iff = meta_eq_to_obj_eq
oheimb@5304
   390
  val iffD           = iffD2
oheimb@5304
   391
  val disjE          = disjE
oheimb@5304
   392
  val conjE          = conjE
oheimb@5304
   393
  val exE            = exE
oheimb@5304
   394
  val contrapos      = contrapos
oheimb@5304
   395
  val contrapos2     = contrapos2
oheimb@5304
   396
  val notnotD        = notnotD
oheimb@5304
   397
  end;
nipkow@4681
   398
oheimb@5304
   399
structure Splitter = SplitterFun(SplitterData);
oheimb@2263
   400
oheimb@5304
   401
val split_tac        = Splitter.split_tac;
oheimb@5304
   402
val split_inside_tac = Splitter.split_inside_tac;
oheimb@5304
   403
val split_asm_tac    = Splitter.split_asm_tac;
oheimb@5307
   404
val op addsplits     = Splitter.addsplits;
oheimb@5307
   405
val op delsplits     = Splitter.delsplits;
oheimb@5304
   406
val Addsplits        = Splitter.Addsplits;
oheimb@5304
   407
val Delsplits        = Splitter.Delsplits;
oheimb@4718
   408
nipkow@2134
   409
(*In general it seems wrong to add distributive laws by default: they
nipkow@2134
   410
  might cause exponential blow-up.  But imp_disjL has been in for a while
nipkow@2134
   411
  and cannot be removed without affecting existing proofs.  Moreover, 
nipkow@2134
   412
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
nipkow@2134
   413
  grounds that it allows simplification of R in the two cases.*)
nipkow@2134
   414
oheimb@5304
   415
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th;
oheimb@5304
   416
nipkow@2134
   417
val mksimps_pairs =
nipkow@2134
   418
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
nipkow@2134
   419
   ("All", [spec]), ("True", []), ("False", []),
paulson@4769
   420
   ("If", [if_bool_eq_conj RS iffD1])];
nipkow@1758
   421
oheimb@5552
   422
(* ###FIXME: move to Provers/simplifier.ML
oheimb@5304
   423
val mk_atomize:      (string * thm list) list -> thm -> thm list
oheimb@5304
   424
*)
oheimb@5552
   425
(* ###FIXME: move to Provers/simplifier.ML *)
oheimb@5304
   426
fun mk_atomize pairs =
oheimb@5304
   427
  let fun atoms th =
oheimb@5304
   428
        (case concl_of th of
oheimb@5304
   429
           Const("Trueprop",_) $ p =>
oheimb@5304
   430
             (case head_of p of
oheimb@5304
   431
                Const(a,_) =>
oheimb@5304
   432
                  (case assoc(pairs,a) of
oheimb@5304
   433
                     Some(rls) => flat (map atoms ([th] RL rls))
oheimb@5304
   434
                   | None => [th])
oheimb@5304
   435
              | _ => [th])
oheimb@5304
   436
         | _ => [th])
oheimb@5304
   437
  in atoms end;
oheimb@5304
   438
oheimb@5552
   439
fun mksimps pairs = (map mk_eq o mk_atomize pairs o gen_all);
oheimb@5304
   440
nipkow@7570
   441
fun unsafe_solver_tac prems =
nipkow@7570
   442
  FIRST'[resolve_tac(reflexive_thm::TrueI::refl::prems), atac, etac FalseE];
nipkow@7570
   443
val unsafe_solver = mk_solver "HOL unsafe" unsafe_solver_tac;
nipkow@7570
   444
oheimb@2636
   445
(*No premature instantiation of variables during simplification*)
nipkow@7570
   446
fun safe_solver_tac prems =
nipkow@7570
   447
  FIRST'[match_tac(reflexive_thm::TrueI::refl::prems),
nipkow@7570
   448
         eq_assume_tac, ematch_tac [FalseE]];
nipkow@7570
   449
val safe_solver = mk_solver "HOL safe" safe_solver_tac;
oheimb@2443
   450
oheimb@2636
   451
val HOL_basic_ss = empty_ss setsubgoaler asm_simp_tac
nipkow@7570
   452
			    setSSolver safe_solver
oheimb@2636
   453
			    setSolver  unsafe_solver
nipkow@4677
   454
			    setmksimps (mksimps mksimps_pairs)
oheimb@5552
   455
			    setmkeqTrue mk_eq_True;
oheimb@2443
   456
paulson@3446
   457
val HOL_ss = 
paulson@3446
   458
    HOL_basic_ss addsimps 
paulson@3446
   459
     ([triv_forall_equality, (* prunes params *)
nipkow@3654
   460
       True_implies_equals, (* prune asms `True' *)
oheimb@4718
   461
       if_True, if_False, if_cancel, if_eq_cancel,
oheimb@5304
   462
       imp_disjL, conj_assoc, disj_assoc,
paulson@3904
   463
       de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, not_imp,
nipkow@5447
   464
       disj_not1, not_all, not_ex, cases_simp, Eps_eq, Eps_sym_eq]
paulson@3446
   465
     @ ex_simps @ all_simps @ simp_thms)
nipkow@4032
   466
     addsimprocs [defALL_regroup,defEX_regroup]
wenzelm@4744
   467
     addcongs [imp_cong]
nipkow@4830
   468
     addsplits [split_if];
paulson@2082
   469
paulson@6293
   470
(*Simplifies x assuming c and y assuming ~c*)
paulson@6293
   471
val prems = Goalw [if_def]
paulson@6293
   472
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==> \
paulson@6293
   473
\  (if b then x else y) = (if c then u else v)";
paulson@6293
   474
by (asm_simp_tac (HOL_ss addsimps prems) 1);
paulson@6293
   475
qed "if_cong";
paulson@6293
   476
paulson@7127
   477
(*Prevents simplification of x and y: faster and allows the execution
paulson@7127
   478
  of functional programs. NOW THE DEFAULT.*)
paulson@7031
   479
Goal "b=c ==> (if b then x else y) = (if c then x else y)";
paulson@7031
   480
by (etac arg_cong 1);
paulson@7031
   481
qed "if_weak_cong";
paulson@6293
   482
paulson@6293
   483
(*Prevents simplification of t: much faster*)
paulson@7031
   484
Goal "a = b ==> (let x=a in t(x)) = (let x=b in t(x))";
paulson@7031
   485
by (etac arg_cong 1);
paulson@7031
   486
qed "let_weak_cong";
paulson@6293
   487
paulson@7031
   488
Goal "f(if c then x else y) = (if c then f x else f y)";
paulson@7031
   489
by (simp_tac (HOL_ss setloop (split_tac [split_if])) 1);
paulson@7031
   490
qed "if_distrib";
nipkow@1655
   491
paulson@4327
   492
(*For expand_case_tac*)
paulson@7584
   493
val prems = Goal "[| P ==> Q(True); ~P ==> Q(False) |] ==> Q(P)";
paulson@2948
   494
by (case_tac "P" 1);
paulson@2948
   495
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems)));
paulson@7584
   496
qed "expand_case";
paulson@2948
   497
paulson@4327
   498
(*Used in Auth proofs.  Typically P contains Vars that become instantiated
paulson@4327
   499
  during unification.*)
paulson@2948
   500
fun expand_case_tac P i =
paulson@2948
   501
    res_inst_tac [("P",P)] expand_case i THEN
paulson@2948
   502
    Simp_tac (i+1) THEN 
paulson@2948
   503
    Simp_tac i;
paulson@2948
   504
paulson@7584
   505
(*This lemma restricts the effect of the rewrite rule u=v to the left-hand
paulson@7584
   506
  side of an equality.  Used in {Integ,Real}/simproc.ML*)
paulson@7584
   507
Goal "x=y ==> (x=z) = (y=z)";
paulson@7584
   508
by (asm_simp_tac HOL_ss 1);
paulson@7584
   509
qed "restrict_to_left";
paulson@2948
   510
wenzelm@7357
   511
(* default simpset *)
paulson@7584
   512
val simpsetup = 
paulson@7584
   513
    [fn thy => (simpset_ref_of thy := HOL_ss addcongs [if_weak_cong]; 
paulson@7584
   514
		thy)];
berghofe@3615
   515
oheimb@4652
   516
wenzelm@5219
   517
(*** integration of simplifier with classical reasoner ***)
oheimb@2636
   518
wenzelm@5219
   519
structure Clasimp = ClasimpFun
oheimb@5552
   520
 (structure Simplifier = Simplifier 
oheimb@5552
   521
        and Classical  = Classical 
oheimb@5552
   522
        and Blast      = Blast);
oheimb@4652
   523
open Clasimp;
oheimb@2636
   524
oheimb@2636
   525
val HOL_css = (HOL_cs, HOL_ss);
nipkow@5975
   526
nipkow@5975
   527
nipkow@5975
   528
(*** A general refutation procedure ***)
nipkow@5975
   529
 
nipkow@5975
   530
(* Parameters:
nipkow@5975
   531
nipkow@5975
   532
   test: term -> bool
nipkow@5975
   533
   tests if a term is at all relevant to the refutation proof;
nipkow@5975
   534
   if not, then it can be discarded. Can improve performance,
nipkow@5975
   535
   esp. if disjunctions can be discarded (no case distinction needed!).
nipkow@5975
   536
nipkow@5975
   537
   prep_tac: int -> tactic
nipkow@5975
   538
   A preparation tactic to be applied to the goal once all relevant premises
nipkow@5975
   539
   have been moved to the conclusion.
nipkow@5975
   540
nipkow@5975
   541
   ref_tac: int -> tactic
nipkow@5975
   542
   the actual refutation tactic. Should be able to deal with goals
nipkow@5975
   543
   [| A1; ...; An |] ==> False
nipkow@5975
   544
   where the Ai are atomic, i.e. no top-level &, | or ?
nipkow@5975
   545
*)
nipkow@5975
   546
nipkow@5975
   547
fun refute_tac test prep_tac ref_tac =
nipkow@5975
   548
  let val nnf_simps =
nipkow@5975
   549
        [imp_conv_disj,iff_conv_conj_imp,de_Morgan_disj,de_Morgan_conj,
nipkow@5975
   550
         not_all,not_ex,not_not];
nipkow@5975
   551
      val nnf_simpset =
nipkow@5975
   552
        empty_ss setmkeqTrue mk_eq_True
nipkow@5975
   553
                 setmksimps (mksimps mksimps_pairs)
nipkow@5975
   554
                 addsimps nnf_simps;
nipkow@5975
   555
      val prem_nnf_tac = full_simp_tac nnf_simpset;
nipkow@5975
   556
nipkow@5975
   557
      val refute_prems_tac =
nipkow@5975
   558
        REPEAT(eresolve_tac [conjE, exE] 1 ORELSE
nipkow@5975
   559
               filter_prems_tac test 1 ORELSE
paulson@6301
   560
               etac disjE 1) THEN
nipkow@5975
   561
        ref_tac 1;
nipkow@5975
   562
  in EVERY'[TRY o filter_prems_tac test,
nipkow@6128
   563
            DETERM o REPEAT o etac rev_mp, prep_tac, rtac ccontr, prem_nnf_tac,
nipkow@5975
   564
            SELECT_GOAL (DEPTH_SOLVE refute_prems_tac)]
nipkow@5975
   565
  end;