src/HOL/simpdata.ML
author nipkow
Fri, 07 Feb 1997 14:13:20 +0100
changeset 2595 548f8ed89a80
parent 2443 a81d4c219c3c
child 2636 4b30dbe4a020
permissions -rw-r--r--
Added "triv_forall_equality" to HOL_ss.
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
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     6
Instantiation of the generic simplifier
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
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
     9
section "Simplifier";
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    10
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    11
open Simplifier;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    12
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    13
(*** Integration of simplifier with classical reasoner ***)
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    14
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    15
(*Add a simpset to a classical set!*)
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    16
infix 4 addss;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    17
fun cs addss ss = cs addbefore asm_full_simp_tac ss 1;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    18
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    19
fun Addss ss = (claset := !claset addbefore asm_full_simp_tac ss 1);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    20
1968
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    21
(*Designed to be idempotent, except if best_tac instantiates variables
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    22
  in some of the subgoals*)
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    23
fun auto_tac (cs,ss) = 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    24
    ALLGOALS (asm_full_simp_tac ss) THEN
1968
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    25
    REPEAT (safe_tac cs THEN ALLGOALS (asm_full_simp_tac ss)) THEN
2036
62ff902eeffc Ran expandshort; used stac instead of ssubst
paulson
parents: 2031
diff changeset
    26
    REPEAT (FIRSTGOAL (best_tac (cs addss ss))) THEN
62ff902eeffc Ran expandshort; used stac instead of ssubst
paulson
parents: 2031
diff changeset
    27
    prune_params_tac;
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    28
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    29
fun Auto_tac() = auto_tac (!claset, !simpset);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    30
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    31
fun auto() = by (Auto_tac());
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    32
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    33
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    34
(*** Addition of rules to simpsets and clasets simultaneously ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    35
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    36
(*Takes UNCONDITIONAL theorems of the form A<->B to 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    37
        the Safe Intr     rule B==>A and 
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    38
        the Safe Destruct rule A==>B.
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    39
  Also ~A goes to the Safe Elim rule A ==> ?R
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    40
  Failing other cases, A is added as a Safe Intr rule*)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    41
local
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    42
  val iff_const = HOLogic.eq_const HOLogic.boolT;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    43
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    44
  fun addIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    45
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    46
                (Const("not",_) $ A) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    47
                    AddSEs [zero_var_indexes (th RS notE)]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    48
              | (con $ _ $ _) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    49
                    if con=iff_const
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    50
                    then (AddSIs [zero_var_indexes (th RS iffD2)];  
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    51
                          AddSDs [zero_var_indexes (th RS iffD1)])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    52
                    else  AddSIs [th]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    53
              | _ => AddSIs [th];
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    54
       Addsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    55
      handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    56
                         string_of_thm th)
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    57
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    58
  fun delIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    59
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    60
                (Const("not",_) $ A) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    61
                    Delrules [zero_var_indexes (th RS notE)]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    62
              | (con $ _ $ _) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    63
                    if con=iff_const
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    64
                    then Delrules [zero_var_indexes (th RS iffD2),
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    65
                                   zero_var_indexes (th RS iffD1)]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    66
                    else Delrules [th]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    67
              | _ => Delrules [th];
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    68
       Delsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    69
      handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    70
                          string_of_thm th)
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    71
in
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    72
val AddIffs = seq addIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    73
val DelIffs = seq delIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    74
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    75
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    76
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    77
local
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    78
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    79
  fun prover s = prove_goal HOL.thy s (fn _ => [fast_tac HOL_cs 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    80
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    81
  val P_imp_P_iff_True = prover "P --> (P = True)" RS mp;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    82
  val P_imp_P_eq_True = P_imp_P_iff_True RS eq_reflection;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    83
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    84
  val not_P_imp_P_iff_F = prover "~P --> (P = False)" RS mp;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    85
  val not_P_imp_P_eq_False = not_P_imp_P_iff_F RS eq_reflection;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    86
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    87
  fun atomize pairs =
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    88
    let fun atoms th =
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    89
          (case concl_of th of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    90
             Const("Trueprop",_) $ p =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    91
               (case head_of p of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    92
                  Const(a,_) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    93
                    (case assoc(pairs,a) of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    94
                       Some(rls) => flat (map atoms ([th] RL rls))
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    95
                     | None => [th])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    96
                | _ => [th])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    97
           | _ => [th])
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    98
    in atoms end;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    99
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   100
  fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th;
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   101
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   102
in
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   103
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   104
  fun mk_meta_eq r = case concl_of r of
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   105
          Const("==",_)$_$_ => r
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   106
      |   _$(Const("op =",_)$_$_) => r RS eq_reflection
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   107
      |   _$(Const("not",_)$_) => r RS not_P_imp_P_eq_False
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   108
      |   _ => r RS P_imp_P_eq_True;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   109
  (* last 2 lines requires all formulae to be of the from Trueprop(.) *)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   111
val simp_thms = map prover
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   112
 [ "(x=x) = True",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   113
   "(~True) = False", "(~False) = True", "(~ ~ P) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   114
   "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   115
   "(True=P) = P", "(P=True) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   116
   "(True --> P) = P", "(False --> P) = True", 
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   117
   "(P --> True) = True", "(P --> P) = True",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   118
   "(P --> False) = (~P)", "(P --> ~P) = (~P)",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   119
   "(P & True) = P", "(True & P) = P", 
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   120
   "(P & False) = False", "(False & P) = False", "(P & P) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   121
   "(P | True) = True", "(True | P) = True", 
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   122
   "(P | False) = P", "(False | P) = P", "(P | P) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   123
   "((~P) = (~Q)) = (P=Q)",
2129
2ffe6e24f38d Added (? x. t=x) = True
nipkow
parents: 2098
diff changeset
   124
   "(!x.P) = P", "(? x.P) = P", "? x. x=t", "? x. t=x", 
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   125
   "(? x. x=t & P(x)) = P(t)", "(? x. t=x & P(x)) = P(t)", 
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   126
   "(! x. x=t --> P(x)) = P(t)", "(! x. t=x --> P(x)) = P(t)" ];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   127
988
8317adb1c444 Defined addss to perform simplification in a claset.
lcp
parents: 965
diff changeset
   128
(*Add congruence rules for = (instead of ==) *)
8317adb1c444 Defined addss to perform simplification in a claset.
lcp
parents: 965
diff changeset
   129
infix 4 addcongs;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   130
fun ss addcongs congs = ss addeqcongs (congs RL [eq_reflection]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   131
1264
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   132
fun Addcongs congs = (simpset := !simpset addcongs congs);
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   133
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   134
fun mksimps pairs = map mk_meta_eq o atomize pairs o gen_all;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   135
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   136
val imp_cong = impI RSN
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   137
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   138
        (fn _=> [fast_tac HOL_cs 1]) RS mp RS mp);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   139
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   140
(*Miniscoping: pushing in existential quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   141
val ex_simps = map prover 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   142
                ["(EX x. P x & Q)   = ((EX x.P x) & Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   143
                 "(EX x. P & Q x)   = (P & (EX x.Q x))",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   144
                 "(EX x. P x | Q)   = ((EX x.P x) | Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   145
                 "(EX x. P | Q x)   = (P | (EX x.Q x))",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   146
                 "(EX x. P x --> Q) = ((ALL x.P x) --> Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   147
                 "(EX x. P --> Q x) = (P --> (EX x.Q x))"];
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   148
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   149
(*Miniscoping: pushing in universal quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   150
val all_simps = map prover
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   151
                ["(ALL x. P x & Q)   = ((ALL x.P x) & Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   152
                 "(ALL x. P & Q x)   = (P & (ALL x.Q x))",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   153
                 "(ALL x. P x | Q)   = ((ALL x.P x) | Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   154
                 "(ALL x. P | Q x)   = (P | (ALL x.Q x))",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   155
                 "(ALL x. P x --> Q) = ((EX x.P x) --> Q)",
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
   156
                 "(ALL x. P --> Q x) = (P --> (ALL x.Q x))"];
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   157
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   158
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   159
2022
9d47e2962edd Fixed spelling error in comment
paulson
parents: 1984
diff changeset
   160
(* elimination of existential quantifiers in assumptions *)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   161
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   162
val ex_all_equiv =
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   163
  let val lemma1 = prove_goal HOL.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   164
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   165
        (fn prems => [resolve_tac prems 1, etac exI 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   166
      val lemma2 = prove_goalw HOL.thy [Ex_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   167
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   168
        (fn prems => [REPEAT(resolve_tac prems 1)])
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   169
  in equal_intr lemma1 lemma2 end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   170
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   171
end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   172
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   173
fun prove nm thm  = qed_goal nm HOL.thy thm (fn _ => [fast_tac HOL_cs 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   174
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   175
prove "conj_commute" "(P&Q) = (Q&P)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   176
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   177
val conj_comms = [conj_commute, conj_left_commute];
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   178
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   179
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   180
prove "disj_commute" "(P|Q) = (Q|P)";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   181
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   182
val disj_comms = [disj_commute, disj_left_commute];
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   183
prove "disj_assoc" "((P|Q)|R) = (P|(Q|R))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   184
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   185
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   186
prove "conj_disj_distribR" "((P|Q)&R) = (P&R | Q&R)";
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   187
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   188
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   189
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   190
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   191
prove "imp_conjR" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   192
prove "imp_conjL" "((P&Q) -->R)  = (P --> (Q --> R))";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   193
prove "imp_disjL" "((P|Q) --> R) = ((P-->R)&(Q-->R))";
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   194
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   195
prove "de_Morgan_disj" "(~(P | Q)) = (~P & ~Q)";
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   196
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   197
prove "not_iff" "(P~=Q) = (P = (~Q))";
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   198
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   199
(*Avoids duplication of subgoals after expand_if, when the true and false 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   200
  cases boil down to the same thing.*) 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   201
prove "cases_simp" "((P --> Q) & (~P --> Q)) = Q";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   202
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   203
prove "not_all" "(~ (! x.P(x))) = (? x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   204
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   205
prove "not_ex"  "(~ (? x.P(x))) = (! x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   206
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   207
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   208
prove "ex_disj_distrib" "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))";
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   209
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))";
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   210
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   211
(* '&' congruence rule: not included by default!
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   212
   May slow rewrite proofs down by as much as 50% *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   213
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   214
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   215
                "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   216
                (fn _=> [fast_tac HOL_cs 1])
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   217
in  bind_thm("conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   218
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   219
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   220
                "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   221
                (fn _=> [fast_tac HOL_cs 1])
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   222
in  bind_thm("rev_conj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   223
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   224
(* '|' congruence rule: not included by default! *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   225
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   226
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   227
                "(P=P')--> (~P'--> (Q=Q'))--> ((P|Q) = (P'|Q'))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   228
                (fn _=> [fast_tac HOL_cs 1])
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   229
in  bind_thm("disj_cong",standard (impI RSN (2, th RS mp RS mp)))  end;
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   230
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   231
prove "eq_sym_conv" "(x=y) = (y=x)";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   232
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   233
qed_goalw "o_apply" HOL.thy [o_def] "(f o g) x = f (g x)"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   234
 (fn _ => [rtac refl 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   235
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   236
qed_goal "meta_eq_to_obj_eq" HOL.thy "x==y ==> x=y"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   237
  (fn [prem] => [rewtac prem, rtac refl 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   238
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   239
qed_goalw "if_True" HOL.thy [if_def] "(if True then x else y) = x"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   240
 (fn _=>[fast_tac (HOL_cs addIs [select_equality]) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   241
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   242
qed_goalw "if_False" HOL.thy [if_def] "(if False then x else y) = y"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   243
 (fn _=>[fast_tac (HOL_cs addIs [select_equality]) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   244
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   245
qed_goal "if_P" HOL.thy "P ==> (if P then x else y) = x"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   246
 (fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   247
(*
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   248
qed_goal "if_not_P" HOL.thy "~P ==> (if P then x else y) = y"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   249
 (fn [prem] => [ stac (prem RS not_P_imp_P_iff_F) 1, rtac if_False 1 ]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   250
*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   251
qed_goalw "if_not_P" HOL.thy [if_def] "!!P. ~P ==> (if P then x else y) = y"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   252
 (fn _ => [fast_tac (HOL_cs addIs [select_equality]) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   253
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   254
qed_goal "expand_if" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   255
    "P(if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   256
 (fn _=> [ (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   257
         stac if_P 2,
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   258
         stac if_not_P 1,
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   259
         REPEAT(fast_tac HOL_cs 1) ]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   260
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   261
qed_goal "if_bool_eq" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   262
                   "(if P then Q else R) = ((P-->Q) & (~P-->R))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   263
                   (fn _ => [rtac expand_if 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   264
2263
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   265
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   266
in
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   267
fun split_tac splits = mktac (map mk_meta_eq splits)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   268
end;
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   269
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   270
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   271
in
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   272
fun split_inside_tac splits = mktac (map mk_meta_eq splits)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   273
end;
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   274
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   275
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   276
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x"
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   277
  (fn _ => [split_tac [expand_if] 1, fast_tac HOL_cs 1]);
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   278
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   279
(** 'if' congruence rules: neither included by default! *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   280
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   281
(*Simplifies x assuming c and y assuming ~c*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   282
qed_goal "if_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   283
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==>\
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   284
\  (if b then x else y) = (if c then u else v)"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   285
  (fn rew::prems =>
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   286
   [stac rew 1, stac expand_if 1, stac expand_if 1,
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   287
    fast_tac (HOL_cs addDs prems) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   288
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   289
(*Prevents simplification of x and y: much faster*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   290
qed_goal "if_weak_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   291
  "b=c ==> (if b then x else y) = (if c then x else y)"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   292
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   293
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   294
(*Prevents simplification of t: much faster*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   295
qed_goal "let_weak_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   296
  "a = b ==> (let x=a in t(x)) = (let x=b in t(x))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   297
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   298
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   299
(*In general it seems wrong to add distributive laws by default: they
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   300
  might cause exponential blow-up.  But imp_disjL has been in for a while
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   301
  and cannot be removed without affecting existing proofs.  Moreover, 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   302
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   303
  grounds that it allows simplification of R in the two cases.*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   304
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   305
val mksimps_pairs =
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   306
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   307
   ("All", [spec]), ("True", []), ("False", []),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   308
   ("If", [if_bool_eq RS iffD1])];
1758
60613b065e9b Added ex_imp
nipkow
parents: 1722
diff changeset
   309
2443
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   310
val HOL_base_ss = empty_ss
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   311
      setmksimps (mksimps mksimps_pairs)
2443
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   312
      setsubgoaler asm_simp_tac;
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   313
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   314
val HOL_min_ss = HOL_base_ss setsolver (fn ps => 
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   315
	FIRST'[resolve_tac (TrueI::refl::ps), atac, etac FalseE]);
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   316
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   317
val HOL_safe_min_ss = HOL_base_ss setsolver (fn ps => 
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   318
	FIRST'[match_tac (TrueI::refl::ps), eq_assume_tac, ematch_tac[FalseE]]);
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   319
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   320
val HOL_ss = HOL_min_ss
2595
548f8ed89a80 Added "triv_forall_equality" to HOL_ss.
nipkow
parents: 2443
diff changeset
   321
      addsimps ([triv_forall_equality, (* prunes params *)
548f8ed89a80 Added "triv_forall_equality" to HOL_ss.
nipkow
parents: 2443
diff changeset
   322
                 if_True, if_False, if_cancel,
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   323
		 o_apply, imp_disjL, conj_assoc, disj_assoc,
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   324
                 de_Morgan_conj, de_Morgan_disj, not_all, not_ex, cases_simp]
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   325
        @ ex_simps @ all_simps @ simp_thms)
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   326
      addcongs [imp_cong];
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   327
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   328
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   329
qed_goal "if_distrib" HOL.thy
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   330
  "f(if c then x else y) = (if c then f x else f y)" 
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   331
  (fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]);
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   332
2097
076a8d2f972b bound o_apply theorem to thy
oheimb
parents: 2082
diff changeset
   333
qed_goalw "o_assoc" HOL.thy [o_def] "f o (g o h) = f o g o h"
2098
2bfc0675c92f corrected `correction` of o_assoc (of version 1.14),
oheimb
parents: 2097
diff changeset
   334
  (fn _ => [rtac ext 1, rtac refl 1]);
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   335
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   336
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   337
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   338
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   339
(*** Install simpsets and datatypes in theory structure ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   340
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   341
simpset := HOL_ss;
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   342
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   343
exception SS_DATA of simpset;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   344
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   345
let fun merge [] = SS_DATA empty_ss
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   346
      | merge ss = let val ss = map (fn SS_DATA x => x) ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   347
                   in SS_DATA (foldl merge_ss (hd ss, tl ss)) end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   348
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   349
    fun put (SS_DATA ss) = simpset := ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   350
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   351
    fun get () = SS_DATA (!simpset);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   352
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   353
     ("simpset", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   354
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   355
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   356
type dtype_info = {case_const:term, case_rewrites:thm list,
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   357
                   constructors:term list, nchotomy:thm, case_cong:thm};
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   358
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   359
exception DT_DATA of (string * dtype_info) list;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   360
val datatypes = ref [] : (string * dtype_info) list ref;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   361
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   362
let fun merge [] = DT_DATA []
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   363
      | merge ds =
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   364
          let val ds = map (fn DT_DATA x => x) ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   365
          in DT_DATA (foldl (gen_union eq_fst) (hd ds, tl ds)) end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   366
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   367
    fun put (DT_DATA ds) = datatypes := ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   368
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   369
    fun get () = DT_DATA (!datatypes);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   370
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   371
     ("datatypes", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   372
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   373
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   374
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   375
add_thy_reader_file "thy_data.ML";