src/HOL/simpdata.ML
author schirmer
Sat, 18 Dec 2004 17:14:33 +0100
changeset 15423 761a4f8e6ad6
parent 15184 d2c19aea17bc
child 15531 08c8dad8e399
permissions -rw-r--r--
added simproc for Let
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
     1
(*  Title:      HOL/simpdata.ML
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
     3
    Author:     Tobias Nipkow
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
    Copyright   1991  University of Cambridge
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
     6
Instantiation of the generic simplifier for HOL.
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
     9
(* legacy ML bindings *)
3904
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
    10
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    11
val Eq_FalseI = thm "Eq_FalseI";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    12
val Eq_TrueI = thm "Eq_TrueI";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    13
val all_conj_distrib = thm "all_conj_distrib";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    14
val all_simps = thms "all_simps";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    15
val cases_simp = thm "cases_simp";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    16
val conj_assoc = thm "conj_assoc";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    17
val conj_comms = thms "conj_comms";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    18
val conj_commute = thm "conj_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    19
val conj_cong = thm "conj_cong";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    20
val conj_disj_distribL = thm "conj_disj_distribL";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    21
val conj_disj_distribR = thm "conj_disj_distribR";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    22
val conj_left_commute = thm "conj_left_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    23
val de_Morgan_conj = thm "de_Morgan_conj";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    24
val de_Morgan_disj = thm "de_Morgan_disj";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    25
val disj_assoc = thm "disj_assoc";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    26
val disj_comms = thms "disj_comms";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    27
val disj_commute = thm "disj_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    28
val disj_cong = thm "disj_cong";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    29
val disj_conj_distribL = thm "disj_conj_distribL";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    30
val disj_conj_distribR = thm "disj_conj_distribR";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    31
val disj_left_commute = thm "disj_left_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    32
val disj_not1 = thm "disj_not1";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    33
val disj_not2 = thm "disj_not2";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    34
val eq_ac = thms "eq_ac";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    35
val eq_assoc = thm "eq_assoc";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    36
val eq_commute = thm "eq_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    37
val eq_left_commute = thm "eq_left_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    38
val eq_sym_conv = thm "eq_sym_conv";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    39
val eta_contract_eq = thm "eta_contract_eq";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    40
val ex_disj_distrib = thm "ex_disj_distrib";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    41
val ex_simps = thms "ex_simps";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    42
val if_False = thm "if_False";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    43
val if_P = thm "if_P";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    44
val if_True = thm "if_True";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    45
val if_bool_eq_conj = thm "if_bool_eq_conj";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    46
val if_bool_eq_disj = thm "if_bool_eq_disj";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    47
val if_cancel = thm "if_cancel";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    48
val if_def2 = thm "if_def2";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    49
val if_eq_cancel = thm "if_eq_cancel";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    50
val if_not_P = thm "if_not_P";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    51
val if_splits = thms "if_splits";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    52
val iff_conv_conj_imp = thm "iff_conv_conj_imp";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    53
val imp_all = thm "imp_all";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    54
val imp_cong = thm "imp_cong";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    55
val imp_conjL = thm "imp_conjL";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    56
val imp_conjR = thm "imp_conjR";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    57
val imp_conv_disj = thm "imp_conv_disj";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    58
val imp_disj1 = thm "imp_disj1";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    59
val imp_disj2 = thm "imp_disj2";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    60
val imp_disjL = thm "imp_disjL";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    61
val imp_disj_not1 = thm "imp_disj_not1";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    62
val imp_disj_not2 = thm "imp_disj_not2";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    63
val imp_ex = thm "imp_ex";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    64
val meta_eq_to_obj_eq = thm "meta_eq_to_obj_eq";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    65
val neq_commute = thm "neq_commute";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    66
val not_all = thm "not_all";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    67
val not_ex = thm "not_ex";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    68
val not_iff = thm "not_iff";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    69
val not_imp = thm "not_imp";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    70
val not_not = thm "not_not";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    71
val rev_conj_cong = thm "rev_conj_cong";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    72
val simp_thms = thms "simp_thms";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    73
val split_if = thm "split_if";
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12278
diff changeset
    74
val split_if_asm = thm "split_if_asm";
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14430
diff changeset
    75
val atomize_not = thm"atomize_not";
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
    76
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    77
local
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    78
val uncurry = prove_goal (the_context()) "P --> Q --> R ==> P & Q --> R"
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    79
              (fn prems => [cut_facts_tac prems 1, Blast_tac 1]);
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    80
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    81
val iff_allI = allI RS
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    82
    prove_goal (the_context()) "!x. P x = Q x ==> (!x. P x) = (!x. Q x)"
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    83
               (fn prems => [cut_facts_tac prems 1, Blast_tac 1])
12524
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    84
val iff_exI = allI RS
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    85
    prove_goal (the_context()) "!x. P x = Q x ==> (? x. P x) = (? x. Q x)"
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    86
               (fn prems => [cut_facts_tac prems 1, Blast_tac 1])
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    87
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    88
val all_comm = prove_goal (the_context()) "(!x y. P x y) = (!y x. P x y)"
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    89
               (fn _ => [Blast_tac 1])
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    90
val ex_comm = prove_goal (the_context()) "(? x y. P x y) = (? y x. P x y)"
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
    91
               (fn _ => [Blast_tac 1])
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
    92
in
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
    93
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
    94
(*** make simplification procedures for quantifier elimination ***)
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
    95
9851
e22db9397e17 iff declarations moved to clasimp.ML;
wenzelm
parents: 9832
diff changeset
    96
structure Quantifier1 = Quantifier1Fun
e22db9397e17 iff declarations moved to clasimp.ML;
wenzelm
parents: 9832
diff changeset
    97
(struct
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
    98
  (*abstract syntax*)
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
    99
  fun dest_eq((c as Const("op =",_)) $ s $ t) = Some(c,s,t)
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   100
    | dest_eq _ = None;
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   101
  fun dest_conj((c as Const("op &",_)) $ s $ t) = Some(c,s,t)
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   102
    | dest_conj _ = None;
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   103
  fun dest_imp((c as Const("op -->",_)) $ s $ t) = Some(c,s,t)
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   104
    | dest_imp _ = None;
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   105
  val conj = HOLogic.conj
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   106
  val imp  = HOLogic.imp
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   107
  (*rules*)
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   108
  val iff_reflection = eq_reflection
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   109
  val iffI = iffI
12524
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
   110
  val iff_trans = trans
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   111
  val conjI= conjI
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   112
  val conjE= conjE
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   113
  val impI = impI
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   114
  val mp   = mp
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   115
  val uncurry = uncurry
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   116
  val exI  = exI
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   117
  val exE  = exE
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   118
  val iff_allI = iff_allI
12524
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
   119
  val iff_exI = iff_exI
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
   120
  val all_comm = all_comm
66eb843b1d35 mods due to mor powerful simprocs for 1-point rules (quantifier1).
nipkow
parents: 12475
diff changeset
   121
  val ex_comm = ex_comm
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   122
end);
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   123
11232
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   124
end;
558a4feebb04 generalization of 1 point rules for ALL
nipkow
parents: 11220
diff changeset
   125
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   126
val defEX_regroup =
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   127
  Simplifier.simproc (Theory.sign_of (the_context ()))
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   128
    "defined EX" ["EX x. P x"] Quantifier1.rearrange_ex;
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   129
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   130
val defALL_regroup =
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   131
  Simplifier.simproc (Theory.sign_of (the_context ()))
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 12975
diff changeset
   132
    "defined ALL" ["ALL x. P x"] Quantifier1.rearrange_all;
3913
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   133
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   134
(*** Simproc for Let ***)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   135
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   136
val use_let_simproc = ref true;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   137
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   138
local
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   139
val Let_folded = thm "Let_folded";
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   140
val Let_unfold = thm "Let_unfold";
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   141
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   142
val f_Let_unfold = 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   143
      let val [(_$(f$_)$_)] = prems_of Let_unfold in cterm_of (sign_of (the_context ())) f end
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   144
val f_Let_folded = 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   145
      let val [(_$(f$_)$_)] = prems_of Let_folded in cterm_of (sign_of (the_context ())) f end;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   146
val g_Let_folded = 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   147
      let val [(_$_$(g$_))] = prems_of Let_folded in cterm_of (sign_of (the_context ())) g end;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   148
in
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   149
val let_simproc =
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   150
  Simplifier.simproc (Theory.sign_of (the_context ())) "let_simp" ["Let x f"] 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   151
   (fn sg => fn ss => fn t =>
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   152
      (case t of (Const ("Let",_)$x$f) => (* x and f are already in normal form *)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   153
         if not (!use_let_simproc) then None
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   154
         else if is_Free x orelse is_Bound x orelse is_Const x 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   155
         then Some Let_def  
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   156
         else
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   157
          let
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   158
             val n = case f of (Abs (x,_,_)) => x | _ => "x";
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   159
             val cx = cterm_of sg x;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   160
             val {T=xT,...} = rep_cterm cx;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   161
             val cf = cterm_of sg f;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   162
             val fx_g = Simplifier.rewrite ss (Thm.capply cf cx);
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   163
             val (_$_$g) = prop_of fx_g;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   164
             val g' = abstract_over (x,g);
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   165
           in (if (g aconv g') 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   166
               then
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   167
                  let
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   168
                    val rl = cterm_instantiate [(f_Let_unfold,cf)] Let_unfold;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   169
                  in Some (rl OF [fx_g]) end 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   170
               else if betapply (f,x) aconv g then None (* avoid identity conversion *)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   171
               else let 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   172
                     val abs_g'= Abs (n,xT,g');
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   173
                     val g'x = abs_g'$x;
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   174
                     val g_g'x = symmetric (beta_conversion false (cterm_of sg g'x));
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   175
                     val rl = cterm_instantiate
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   176
                               [(f_Let_folded,cterm_of sg f),
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   177
                                (g_Let_folded,cterm_of sg abs_g')]
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   178
                               Let_folded; 
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   179
                   in Some (rl OF [transitive fx_g g_g'x]) end)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   180
           end
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   181
        | _ => None))
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   182
end
4351
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   183
36b28f78ed1b Tidying and some comments
paulson
parents: 4327
diff changeset
   184
(*** Case splitting ***)
3913
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   185
12278
wenzelm
parents: 12038
diff changeset
   186
(*Make meta-equalities.  The operator below is Trueprop*)
wenzelm
parents: 12038
diff changeset
   187
13600
9702c8636a7b Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents: 13568
diff changeset
   188
fun mk_meta_eq r = r RS eq_reflection;
12278
wenzelm
parents: 12038
diff changeset
   189
fun safe_mk_meta_eq r = mk_meta_eq r handle Thm.THM _ => r;
wenzelm
parents: 12038
diff changeset
   190
wenzelm
parents: 12038
diff changeset
   191
fun mk_eq th = case concl_of th of
wenzelm
parents: 12038
diff changeset
   192
        Const("==",_)$_$_       => th
wenzelm
parents: 12038
diff changeset
   193
    |   _$(Const("op =",_)$_$_) => mk_meta_eq th
13600
9702c8636a7b Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents: 13568
diff changeset
   194
    |   _$(Const("Not",_)$_)    => th RS Eq_FalseI
9702c8636a7b Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents: 13568
diff changeset
   195
    |   _                       => th RS Eq_TrueI;
13568
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   196
(* Expects Trueprop(.) if not == *)
12278
wenzelm
parents: 12038
diff changeset
   197
wenzelm
parents: 12038
diff changeset
   198
fun mk_eq_True r =
13600
9702c8636a7b Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents: 13568
diff changeset
   199
  Some (r RS meta_eq_to_obj_eq RS Eq_TrueI) handle Thm.THM _ => None;
12278
wenzelm
parents: 12038
diff changeset
   200
wenzelm
parents: 12038
diff changeset
   201
(*Congruence rules for = (instead of ==)*)
wenzelm
parents: 12038
diff changeset
   202
fun mk_meta_cong rl =
13743
f8f9393be64c Fixed bug in simpdata.ML that prevented the use of congruence rules from a
ballarin
parents: 13600
diff changeset
   203
  zero_var_indexes(mk_meta_eq(replicate (nprems_of rl) meta_eq_to_obj_eq MRS rl))
12278
wenzelm
parents: 12038
diff changeset
   204
  handle THM _ =>
wenzelm
parents: 12038
diff changeset
   205
  error("Premises and conclusion of congruence rules must be =-equalities");
wenzelm
parents: 12038
diff changeset
   206
wenzelm
parents: 12038
diff changeset
   207
(* Elimination of True from asumptions: *)
wenzelm
parents: 12038
diff changeset
   208
wenzelm
parents: 12038
diff changeset
   209
local fun rd s = read_cterm (sign_of (the_context())) (s, propT);
wenzelm
parents: 12038
diff changeset
   210
in val True_implies_equals = standard' (equal_intr
wenzelm
parents: 12038
diff changeset
   211
  (implies_intr_hyps (implies_elim (assume (rd "True ==> PROP P")) TrueI))
wenzelm
parents: 12038
diff changeset
   212
  (implies_intr_hyps (implies_intr (rd "True") (assume (rd "PROP P")))));
wenzelm
parents: 12038
diff changeset
   213
end;
wenzelm
parents: 12038
diff changeset
   214
wenzelm
parents: 12038
diff changeset
   215
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   216
structure SplitterData =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   217
  struct
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   218
  structure Simplifier = Simplifier
5552
dcd3e7711cac simplified CLASIMP_DATA
oheimb
parents: 5447
diff changeset
   219
  val mk_eq          = mk_eq
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   220
  val meta_eq_to_iff = meta_eq_to_obj_eq
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   221
  val iffD           = iffD2
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   222
  val disjE          = disjE
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   223
  val conjE          = conjE
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   224
  val exE            = exE
10231
178a272bceeb renaming of contrapos rules
paulson
parents: 9969
diff changeset
   225
  val contrapos      = contrapos_nn
178a272bceeb renaming of contrapos rules
paulson
parents: 9969
diff changeset
   226
  val contrapos2     = contrapos_pp
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   227
  val notnotD        = notnotD
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   228
  end;
4681
a331c1f5a23e expand_if is now by default part of the simpset.
nipkow
parents: 4677
diff changeset
   229
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   230
structure Splitter = SplitterFun(SplitterData);
2263
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   231
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   232
val split_tac        = Splitter.split_tac;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   233
val split_inside_tac = Splitter.split_inside_tac;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   234
val split_asm_tac    = Splitter.split_asm_tac;
5307
6a699d5cdef4 minor adaption for SML/NJ
oheimb
parents: 5304
diff changeset
   235
val op addsplits     = Splitter.addsplits;
6a699d5cdef4 minor adaption for SML/NJ
oheimb
parents: 5304
diff changeset
   236
val op delsplits     = Splitter.delsplits;
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   237
val Addsplits        = Splitter.Addsplits;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   238
val Delsplits        = Splitter.Delsplits;
4718
fc2ba9fb2135 new rewrite rules not1_or, not2_or, and if_eq_cancel
oheimb
parents: 4681
diff changeset
   239
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   240
val mksimps_pairs =
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   241
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   242
   ("All", [spec]), ("True", []), ("False", []),
4769
bb60149fe21b changed if_bool_eq to if_bool_eq_conj and added if_bool_eq_disj
paulson
parents: 4744
diff changeset
   243
   ("If", [if_bool_eq_conj RS iffD1])];
1758
60613b065e9b Added ex_imp
nipkow
parents: 1722
diff changeset
   244
13568
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   245
(*
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   246
val mk_atomize:      (string * thm list) list -> thm -> thm list
13568
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   247
looks too specific to move it somewhere else
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   248
*)
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   249
fun mk_atomize pairs =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   250
  let fun atoms th =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   251
        (case concl_of th of
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   252
           Const("Trueprop",_) $ p =>
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   253
             (case head_of p of
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   254
                Const(a,_) =>
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   255
                  (case assoc(pairs,a) of
13600
9702c8636a7b Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents: 13568
diff changeset
   256
                     Some(rls) => flat (map atoms ([th] RL rls))
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   257
                   | None => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   258
              | _ => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   259
         | _ => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   260
  in atoms end;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   261
11624
8a45c7abef04 mksimps and mk_eq_True no longer raise THM exception.
berghofe
parents: 11534
diff changeset
   262
fun mksimps pairs =
12725
7ede865e1fe5 renamed forall_elim_vars_safe to gen_all;
wenzelm
parents: 12524
diff changeset
   263
  (mapfilter (try mk_eq) o mk_atomize pairs o gen_all);
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   264
7570
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   265
fun unsafe_solver_tac prems =
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   266
  FIRST'[resolve_tac(reflexive_thm::TrueI::refl::prems), atac, etac FalseE];
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   267
val unsafe_solver = mk_solver "HOL unsafe" unsafe_solver_tac;
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   268
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   269
(*No premature instantiation of variables during simplification*)
7570
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   270
fun safe_solver_tac prems =
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   271
  FIRST'[match_tac(reflexive_thm::TrueI::refl::prems),
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   272
         eq_assume_tac, ematch_tac [FalseE]];
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7369
diff changeset
   273
val safe_solver = mk_solver "HOL safe" safe_solver_tac;
2443
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   274
9713
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   275
val HOL_basic_ss =
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   276
  empty_ss setsubgoaler asm_simp_tac
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   277
    setSSolver safe_solver
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   278
    setSolver unsafe_solver
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   279
    setmksimps (mksimps mksimps_pairs)
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   280
    setmkeqTrue mk_eq_True
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   281
    setmkcong mk_meta_cong;
2443
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   282
13568
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   283
(*In general it seems wrong to add distributive laws by default: they
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   284
  might cause exponential blow-up.  But imp_disjL has been in for a while
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   285
  and cannot be removed without affecting existing proofs.  Moreover,
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   286
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   287
  grounds that it allows simplification of R in the two cases.*)
6b12df05f358 preserve names of rewrite rules when transforming them
nipkow
parents: 13462
diff changeset
   288
9713
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   289
val HOL_ss =
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   290
    HOL_basic_ss addsimps
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   291
     ([triv_forall_equality, (* prunes params *)
3654
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   292
       True_implies_equals, (* prune asms `True' *)
9023
09d02e7365c1 added eta_contract_eq, also to simpset
oheimb
parents: 8955
diff changeset
   293
       eta_contract_eq, (* prunes eta-expansions *)
4718
fc2ba9fb2135 new rewrite rules not1_or, not2_or, and if_eq_cancel
oheimb
parents: 4681
diff changeset
   294
       if_True, if_False, if_cancel, if_eq_cancel,
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5278
diff changeset
   295
       imp_disjL, conj_assoc, disj_assoc,
3904
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
   296
       de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, not_imp,
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11434
diff changeset
   297
       disj_not1, not_all, not_ex, cases_simp,
14430
5cb24165a2e1 new material from Avigad, and simplified treatment of division by 0
paulson
parents: 13743
diff changeset
   298
       thm "the_eq_trivial", the_sym_eq_trivial]
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   299
     @ ex_simps @ all_simps @ simp_thms)
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15184
diff changeset
   300
     addsimprocs [defALL_regroup,defEX_regroup,let_simproc]
4744
4469d498cd48 moved addsplits [expand_if] from HOL_basic_ss to HOL_ss;
wenzelm
parents: 4743
diff changeset
   301
     addcongs [imp_cong]
4830
bd73675adbed Added a few lemmas.
nipkow
parents: 4794
diff changeset
   302
     addsplits [split_if];
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   303
11034
568eb11f8d52 added hol_simplify, hol_rewrite_cterm;
wenzelm
parents: 11003
diff changeset
   304
fun hol_simplify rews = Simplifier.full_simplify (HOL_basic_ss addsimps rews);
568eb11f8d52 added hol_simplify, hol_rewrite_cterm;
wenzelm
parents: 11003
diff changeset
   305
568eb11f8d52 added hol_simplify, hol_rewrite_cterm;
wenzelm
parents: 11003
diff changeset
   306
6293
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   307
(*Simplifies x assuming c and y assuming ~c*)
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   308
val prems = Goalw [if_def]
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   309
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==> \
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   310
\  (if b then x else y) = (if c then u else v)";
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   311
by (asm_simp_tac (HOL_ss addsimps prems) 1);
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   312
qed "if_cong";
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   313
7127
48e235179ffb added parentheses to cope with a possible reduction of the precedence of unary
paulson
parents: 7031
diff changeset
   314
(*Prevents simplification of x and y: faster and allows the execution
48e235179ffb added parentheses to cope with a possible reduction of the precedence of unary
paulson
parents: 7031
diff changeset
   315
  of functional programs. NOW THE DEFAULT.*)
7031
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   316
Goal "b=c ==> (if b then x else y) = (if c then x else y)";
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   317
by (etac arg_cong 1);
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   318
qed "if_weak_cong";
6293
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   319
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   320
(*Prevents simplification of t: much faster*)
7031
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   321
Goal "a = b ==> (let x=a in t(x)) = (let x=b in t(x))";
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   322
by (etac arg_cong 1);
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   323
qed "let_weak_cong";
6293
2a4357301973 simpler proofs of congruence rules
paulson
parents: 6128
diff changeset
   324
12975
d796a2fd6c69 fixing nat_combine_numerals simprocs (again)
paulson
parents: 12725
diff changeset
   325
(*To tidy up the result of a simproc.  Only the RHS will be simplified.*)
d796a2fd6c69 fixing nat_combine_numerals simprocs (again)
paulson
parents: 12725
diff changeset
   326
Goal "u = u' ==> (t==u) == (t==u')";
d796a2fd6c69 fixing nat_combine_numerals simprocs (again)
paulson
parents: 12725
diff changeset
   327
by (asm_simp_tac HOL_ss 1);
d796a2fd6c69 fixing nat_combine_numerals simprocs (again)
paulson
parents: 12725
diff changeset
   328
qed "eq_cong2";
d796a2fd6c69 fixing nat_combine_numerals simprocs (again)
paulson
parents: 12725
diff changeset
   329
7031
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   330
Goal "f(if c then x else y) = (if c then f x else f y)";
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   331
by (simp_tac (HOL_ss setloop (split_tac [split_if])) 1);
972b5f62f476 getting rid of qed_goal
paulson
parents: 6968
diff changeset
   332
qed "if_distrib";
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   333
4327
2335f6584a1b Added comments
paulson
parents: 4321
diff changeset
   334
(*For expand_case_tac*)
7584
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   335
val prems = Goal "[| P ==> Q(True); ~P ==> Q(False) |] ==> Q(P)";
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   336
by (case_tac "P" 1);
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   337
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems)));
7584
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   338
qed "expand_case";
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   339
4327
2335f6584a1b Added comments
paulson
parents: 4321
diff changeset
   340
(*Used in Auth proofs.  Typically P contains Vars that become instantiated
2335f6584a1b Added comments
paulson
parents: 4321
diff changeset
   341
  during unification.*)
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   342
fun expand_case_tac P i =
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   343
    res_inst_tac [("P",P)] expand_case i THEN
9713
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   344
    Simp_tac (i+1) THEN
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   345
    Simp_tac i;
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   346
7584
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   347
(*This lemma restricts the effect of the rewrite rule u=v to the left-hand
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   348
  side of an equality.  Used in {Integ,Real}/simproc.ML*)
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   349
Goal "x=y ==> (x=z) = (y=z)";
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   350
by (asm_simp_tac HOL_ss 1);
5be4bb8e4e3f tidied; added lemma restrict_to_left
paulson
parents: 7570
diff changeset
   351
qed "restrict_to_left";
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   352
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7213
diff changeset
   353
(* default simpset *)
9713
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   354
val simpsetup =
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   355
  [fn thy => (simpset_ref_of thy := HOL_ss addcongs [if_weak_cong]; thy)];
3615
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   356
4652
d24cca140eeb factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
oheimb
parents: 4651
diff changeset
   357
5219
924359415f09 functorized Clasimp module;
wenzelm
parents: 5190
diff changeset
   358
(*** integration of simplifier with classical reasoner ***)
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   359
5219
924359415f09 functorized Clasimp module;
wenzelm
parents: 5190
diff changeset
   360
structure Clasimp = ClasimpFun
8473
2798d2f71ec2 splitter setup;
wenzelm
parents: 8114
diff changeset
   361
 (structure Simplifier = Simplifier and Splitter = Splitter
9851
e22db9397e17 iff declarations moved to clasimp.ML;
wenzelm
parents: 9832
diff changeset
   362
  and Classical  = Classical and Blast = Blast
11344
57b7ad51971c streamlined addIffs/delIffs, added warnings
oheimb
parents: 11232
diff changeset
   363
  val iffD1 = iffD1 val iffD2 = iffD2 val notE = notE
9851
e22db9397e17 iff declarations moved to clasimp.ML;
wenzelm
parents: 9832
diff changeset
   364
  val cla_make_elim = cla_make_elim);
4652
d24cca140eeb factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
oheimb
parents: 4651
diff changeset
   365
open Clasimp;
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   366
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   367
val HOL_css = (HOL_cs, HOL_ss);
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   368
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   369
8641
978db2870862 change_global/local_css move to Provers/clasimp.ML;
wenzelm
parents: 8473
diff changeset
   370
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   371
(*** A general refutation procedure ***)
9713
2c5b42311eb0 cong setup now part of Simplifier;
wenzelm
parents: 9511
diff changeset
   372
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   373
(* Parameters:
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   374
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   375
   test: term -> bool
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   376
   tests if a term is at all relevant to the refutation proof;
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   377
   if not, then it can be discarded. Can improve performance,
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   378
   esp. if disjunctions can be discarded (no case distinction needed!).
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   379
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   380
   prep_tac: int -> tactic
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   381
   A preparation tactic to be applied to the goal once all relevant premises
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   382
   have been moved to the conclusion.
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   383
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   384
   ref_tac: int -> tactic
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   385
   the actual refutation tactic. Should be able to deal with goals
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   386
   [| A1; ...; An |] ==> False
9876
wenzelm
parents: 9875
diff changeset
   387
   where the Ai are atomic, i.e. no top-level &, | or EX
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   388
*)
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   389
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   390
local
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   391
  val nnf_simps =
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   392
        [imp_conv_disj,iff_conv_conj_imp,de_Morgan_disj,de_Morgan_conj,
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   393
         not_all,not_ex,not_not];
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   394
  val nnf_simpset =
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   395
        empty_ss setmkeqTrue mk_eq_True
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   396
                 setmksimps (mksimps mksimps_pairs)
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   397
                 addsimps nnf_simps;
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   398
  val prem_nnf_tac = full_simp_tac nnf_simpset
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   399
in
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   400
fun refute_tac test prep_tac ref_tac =
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   401
  let val refute_prems_tac =
12475
18ba10cc782f Removed pointless backtracking from arith_tac
nipkow
parents: 12281
diff changeset
   402
        REPEAT_DETERM
18ba10cc782f Removed pointless backtracking from arith_tac
nipkow
parents: 12281
diff changeset
   403
              (eresolve_tac [conjE, exE] 1 ORELSE
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   404
               filter_prems_tac test 1 ORELSE
6301
08245f5a436d expandshort
paulson
parents: 6293
diff changeset
   405
               etac disjE 1) THEN
11200
f43fa07536c0 arith_tac now copes with propositional reasoning as well.
nipkow
parents: 11162
diff changeset
   406
        ((etac notE 1 THEN eq_assume_tac 1) ORELSE
f43fa07536c0 arith_tac now copes with propositional reasoning as well.
nipkow
parents: 11162
diff changeset
   407
         ref_tac 1);
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   408
  in EVERY'[TRY o filter_prems_tac test,
12475
18ba10cc782f Removed pointless backtracking from arith_tac
nipkow
parents: 12281
diff changeset
   409
            REPEAT_DETERM o etac rev_mp, prep_tac, rtac ccontr, prem_nnf_tac,
5975
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   410
            SELECT_GOAL (DEPTH_SOLVE refute_prems_tac)]
cd19eaa90f45 Added a general refutation tactic which works by putting things into nnf first.
nipkow
parents: 5552
diff changeset
   411
  end;
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 14749
diff changeset
   412
end;