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