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