src/HOL/simpdata.ML
author nipkow
Thu, 30 Oct 1997 09:45:03 +0100
changeset 4032 4b1c69d8b767
parent 3919 c036caebfc75
child 4086 958806f7e840
permissions -rw-r--r--
For each datatype `t' there is now a theorem `split_t_case' of the form P(t_case f1 ... fn x) = ((!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1))& ... (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))) The simplifier now reduces !x. (..x.. & x = t & ..x..) --> P x to (..t.. & ..t..) --> P t (and similarly for t=x).
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
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    13
(*** Addition of rules to simpsets and clasets simultaneously ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    14
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    15
(*Takes UNCONDITIONAL theorems of the form A<->B to 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    16
        the Safe Intr     rule B==>A and 
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    17
        the Safe Destruct rule A==>B.
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    18
  Also ~A goes to the Safe Elim rule A ==> ?R
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    19
  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
    20
local
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    21
  val iff_const = HOLogic.eq_const HOLogic.boolT;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    22
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    23
  fun addIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    24
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
2718
460fd0f8d478 Renamed constant "not" to "Not"
paulson
parents: 2636
diff changeset
    25
                (Const("Not",_) $ A) =>
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    26
                    AddSEs [zero_var_indexes (th RS notE)]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    27
              | (con $ _ $ _) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    28
                    if con=iff_const
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    29
                    then (AddSIs [zero_var_indexes (th RS iffD2)];  
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    30
                          AddSDs [zero_var_indexes (th RS iffD1)])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    31
                    else  AddSIs [th]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    32
              | _ => AddSIs [th];
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    33
       Addsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    34
      handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    35
                         string_of_thm th)
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    36
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    37
  fun delIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    38
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
2718
460fd0f8d478 Renamed constant "not" to "Not"
paulson
parents: 2636
diff changeset
    39
                (Const("Not",_) $ A) =>
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    40
                    Delrules [zero_var_indexes (th RS notE)]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    41
              | (con $ _ $ _) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    42
                    if con=iff_const
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    43
                    then Delrules [zero_var_indexes (th RS iffD2),
3518
6e11c7bfb9c7 Fixed delIffs to deal correctly with the D-rule
paulson
parents: 3448
diff changeset
    44
                                   make_elim (zero_var_indexes (th RS iffD1))]
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    45
                    else Delrules [th]
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    46
              | _ => Delrules [th];
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    47
       Delsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    48
      handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    49
                          string_of_thm th)
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    50
in
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    51
val AddIffs = seq addIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    52
val DelIffs = seq delIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    53
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    54
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    55
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    56
local
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    57
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
    58
  fun prover s = prove_goal HOL.thy s (fn _ => [blast_tac HOL_cs 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    59
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    60
  val P_imp_P_iff_True = prover "P --> (P = True)" RS mp;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    61
  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
    62
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    63
  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
    64
  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
    65
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    66
  fun atomize pairs =
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    67
    let fun atoms th =
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    68
          (case concl_of th of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    69
             Const("Trueprop",_) $ p =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    70
               (case head_of p of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    71
                  Const(a,_) =>
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    72
                    (case assoc(pairs,a) of
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    73
                       Some(rls) => flat (map atoms ([th] RL rls))
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    74
                     | None => [th])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    75
                | _ => [th])
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    76
           | _ => [th])
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    77
    in atoms end;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    78
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
    79
  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
    80
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
    81
in
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
    82
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    83
  fun mk_meta_eq r = r RS eq_reflection;
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    84
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    85
  fun mk_meta_eq_simp r = case concl_of r of
2031
03a843f0f447 Ran expandshort
paulson
parents: 2022
diff changeset
    86
          Const("==",_)$_$_ => r
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    87
      |   _$(Const("op =",_)$lhs$rhs) =>
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    88
             (case fst(Logic.loops (#sign(rep_thm r)) (prems_of r) lhs rhs) of
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    89
                None => mk_meta_eq r
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    90
              | Some _ => r RS P_imp_P_eq_True)
2718
460fd0f8d478 Renamed constant "not" to "Not"
paulson
parents: 2636
diff changeset
    91
      |   _$(Const("Not",_)$_) => r RS not_P_imp_P_eq_False
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    92
      |   _ => r RS P_imp_P_eq_True;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    93
  (* 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
    94
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
    95
val simp_thms = map prover
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
    96
 [ "(x=x) = True",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
    97
   "(~True) = False", "(~False) = True", "(~ ~ P) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
    98
   "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
    99
   "(True=P) = P", "(P=True) = P",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   100
   "(True --> P) = P", "(False --> P) = True", 
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   101
   "(P --> True) = True", "(P --> P) = True",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   102
   "(P --> False) = (~P)", "(P --> ~P) = (~P)",
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   103
   "(P & True) = P", "(True & P) = P", 
2800
9741c4c6b62b Added P&P&Q = P&Q and P|P|Q = P|Q.
nipkow
parents: 2748
diff changeset
   104
   "(P & False) = False", "(False & P) = False",
9741c4c6b62b Added P&P&Q = P&Q and P|P|Q = P|Q.
nipkow
parents: 2748
diff changeset
   105
   "(P & P) = P", "(P & (P & Q)) = (P & Q)",
3913
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   106
   "(P & ~P) = False",    "(~P & P) = False",
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   107
   "(P | True) = True", "(True | P) = True", 
2800
9741c4c6b62b Added P&P&Q = P&Q and P|P|Q = P|Q.
nipkow
parents: 2748
diff changeset
   108
   "(P | False) = P", "(False | P) = P",
9741c4c6b62b Added P&P&Q = P&Q and P|P|Q = P|Q.
nipkow
parents: 2748
diff changeset
   109
   "(P | P) = P", "(P | (P | Q)) = (P | Q)",
3913
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   110
   "(P | ~P) = True",    "(~P | P) = True",
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   111
   "((~P) = (~Q)) = (P=Q)",
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   112
   "(!x. P) = P", "(? x. P) = P", "? x. x=t", "? x. t=x", 
3573
7544c866315c Deleted comment.
nipkow
parents: 3571
diff changeset
   113
   "(? x. x=t & P(x)) = P(t)",
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   114
   "(! x. t=x --> P(x)) = P(t)" ];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   115
988
8317adb1c444 Defined addss to perform simplification in a claset.
lcp
parents: 965
diff changeset
   116
(*Add congruence rules for = (instead of ==) *)
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   117
infix 4 addcongs delcongs;
3559
7a176613e5d5 tuned congs: standard;
wenzelm
parents: 3538
diff changeset
   118
fun ss addcongs congs = ss addeqcongs (map standard (congs RL [eq_reflection]));
7a176613e5d5 tuned congs: standard;
wenzelm
parents: 3538
diff changeset
   119
fun ss delcongs congs = ss deleqcongs (map standard (congs RL [eq_reflection]));
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   120
1264
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   121
fun Addcongs congs = (simpset := !simpset addcongs congs);
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   122
fun Delcongs congs = (simpset := !simpset delcongs congs);
1264
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   123
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
   124
fun mksimps pairs = map mk_meta_eq_simp o atomize pairs o gen_all;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   125
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   126
val imp_cong = impI RSN
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   127
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   128
        (fn _=> [blast_tac HOL_cs 1]) RS mp RS mp);
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   129
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   130
(*Miniscoping: pushing in existential quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   131
val ex_simps = map prover 
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   132
                ["(EX x. P x & Q)   = ((EX x. P x) & Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   133
                 "(EX x. P & Q x)   = (P & (EX x. Q x))",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   134
                 "(EX x. P x | Q)   = ((EX x. P x) | Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   135
                 "(EX x. P | Q x)   = (P | (EX x. Q x))",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   136
                 "(EX x. P x --> Q) = ((ALL x. P x) --> Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   137
                 "(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
   138
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   139
(*Miniscoping: pushing in universal quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   140
val all_simps = map prover
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   141
                ["(ALL x. P x & Q)   = ((ALL x. P x) & Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   142
                 "(ALL x. P & Q x)   = (P & (ALL x. Q x))",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   143
                 "(ALL x. P x | Q)   = ((ALL x. P x) | Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   144
                 "(ALL x. P | Q x)   = (P | (ALL x. Q x))",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   145
                 "(ALL x. P x --> Q) = ((EX x. P x) --> Q)",
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   146
                 "(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
   147
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   148
(*** Simplification procedures for turning
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   149
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   150
            ? x. ... & x = t & ...
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   151
     into   ? x. x = t & ... & ...
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   152
     where the `? x. x = t &' in the latter formula is eliminated
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   153
           by ordinary simplification. 
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   154
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   155
     and   ! x. (... & x = t & ...) --> P x
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   156
     into  ! x. x = t --> (... & ...) --> P x
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   157
     where the `!x. x=t -->' in the latter formula is eliminated
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   158
           by ordinary simplification.
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   159
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   160
NB Simproc is only triggered by "!x. P(x) & P'(x) --> Q(x)"
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   161
   "!x. x=t --> P(x)" and "!x. t=x --> P(x)"
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   162
   must be taken care of by ordinary rewrite rules.
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   163
***)
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   164
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   165
local
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   166
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   167
fun def(eq as (c as Const("op =",_)) $ s $ t) =
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   168
      if s = Bound 0 andalso not(loose_bvar1(t,0)) then Some eq else
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   169
      if t = Bound 0 andalso not(loose_bvar1(s,0)) then Some(c$t$s)
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   170
      else None
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   171
  | def _ = None;
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   172
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   173
fun extract(Const("op &",_) $ P $ Q) =
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   174
      (case def P of
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   175
         Some eq => Some(eq,Q)
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   176
       | None => (case def Q of
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   177
                   Some eq => Some(eq,P)
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   178
                 | None =>
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   179
       (case extract P of
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   180
         Some(eq,P') => Some(eq, HOLogic.conj $ P' $ Q)
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   181
       | None => (case extract Q of
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   182
                   Some(eq,Q') => Some(eq,HOLogic.conj $ P $ Q')
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   183
                 | None => None))))
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   184
  | extract _ = None;
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   185
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   186
fun prove_ex_eq(ceqt) =
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   187
  let val tac = rtac eq_reflection 1 THEN rtac iffI 1 THEN
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   188
                ALLGOALS(EVERY'[etac exE, REPEAT o (etac conjE),
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   189
                 rtac exI, REPEAT o (ares_tac [conjI] ORELSE' etac sym)])
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   190
  in rule_by_tactic tac (trivial ceqt) end;
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   191
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   192
fun rearrange_ex sg _ (F as ex $ Abs(x,T,P)) =
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   193
     (case extract P of
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   194
        None => None
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   195
      | Some(eq,Q) =>
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   196
          let val ceqt = cterm_of sg
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   197
                       (Logic.mk_equals(F,ex $ Abs(x,T,HOLogic.conj$eq$Q)))
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   198
          in Some(prove_ex_eq ceqt) end)
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   199
  | rearrange_ex _ _ _ = None;
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   200
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   201
val ex_pattern =
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   202
  read_cterm (sign_of HOL.thy) ("? x. P(x) & Q(x)",HOLogic.boolT)
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   203
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   204
fun prove_all_eq(ceqt) =
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   205
  let fun tac _ = [EVERY1[rtac eq_reflection, rtac iffI,
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   206
                       rtac allI, etac allE, rtac impI, rtac impI, etac mp,
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   207
                          REPEAT o (etac conjE),
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   208
                          REPEAT o (ares_tac [conjI] ORELSE' etac sym),
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   209
                       rtac allI, etac allE, rtac impI, REPEAT o (etac conjE),
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   210
                          etac impE, atac ORELSE' etac sym, etac mp,
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   211
                          REPEAT o (ares_tac [conjI])]]
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   212
  in prove_goalw_cterm [] ceqt tac end;
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   213
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   214
fun rearrange_all sg _ (F as all $ Abs(x,T,Const("op -->",_)$P$Q)) =
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   215
     (case extract P of
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   216
        None => None
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   217
      | Some(eq,P') =>
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   218
          let val R = HOLogic.imp $ eq $ (HOLogic.imp $ P' $ Q)
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   219
              val ceqt = cterm_of sg (Logic.mk_equals(F,all$Abs(x,T,R)))
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   220
          in Some(prove_all_eq ceqt) end)
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   221
  | rearrange_all _ _ _ = None;
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   222
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   223
val all_pattern =
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   224
  read_cterm (sign_of HOL.thy) ("! x. P(x) & P'(x) --> Q(x)",HOLogic.boolT)
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   225
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   226
in
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   227
val defEX_regroup = mk_simproc "defined EX" [ex_pattern] rearrange_ex;
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   228
val defALL_regroup = mk_simproc "defined ALL" [all_pattern] rearrange_all;
3568
36ff1ab12021 Prod.ML: Added split_paired_EX and lots of comments about failed attempts to
nipkow
parents: 3559
diff changeset
   229
end;
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   230
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   231
2022
9d47e2962edd Fixed spelling error in comment
paulson
parents: 1984
diff changeset
   232
(* elimination of existential quantifiers in assumptions *)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   233
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   234
val ex_all_equiv =
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   235
  let val lemma1 = prove_goal HOL.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   236
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   237
        (fn prems => [resolve_tac prems 1, etac exI 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   238
      val lemma2 = prove_goalw HOL.thy [Ex_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   239
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   240
        (fn prems => [REPEAT(resolve_tac prems 1)])
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   241
  in equal_intr lemma1 lemma2 end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   242
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   243
end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   244
3654
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   245
(* Elimination of True from asumptions: *)
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   246
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   247
val True_implies_equals = prove_goal HOL.thy
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   248
 "(True ==> PROP P) == PROP P"
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   249
(fn _ => [rtac equal_intr_rule 1, atac 2,
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   250
          METAHYPS (fn prems => resolve_tac prems 1) 1,
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   251
          rtac TrueI 1]);
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   252
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   253
fun prove nm thm  = qed_goal nm HOL.thy thm (fn _ => [blast_tac HOL_cs 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   254
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   255
prove "conj_commute" "(P&Q) = (Q&P)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   256
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   257
val conj_comms = [conj_commute, conj_left_commute];
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   258
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   259
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   260
prove "disj_commute" "(P|Q) = (Q|P)";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   261
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   262
val disj_comms = [disj_commute, disj_left_commute];
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   263
prove "disj_assoc" "((P|Q)|R) = (P|(Q|R))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   264
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   265
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   266
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
   267
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   268
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   269
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   270
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   271
prove "imp_conjR" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   272
prove "imp_conjL" "((P&Q) -->R)  = (P --> (Q --> R))";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   273
prove "imp_disjL" "((P|Q) --> R) = ((P-->R)&(Q-->R))";
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   274
3448
8a79e27ac53b Two new rewrite rules--NOT included by default\!
paulson
parents: 3446
diff changeset
   275
(*These two are specialized, but imp_disj_not1 is useful in Auth/Yahalom.ML*)
8a79e27ac53b Two new rewrite rules--NOT included by default\!
paulson
parents: 3446
diff changeset
   276
prove "imp_disj_not1" "((P --> Q | R)) = (~Q --> P --> R)";
8a79e27ac53b Two new rewrite rules--NOT included by default\!
paulson
parents: 3446
diff changeset
   277
prove "imp_disj_not2" "((P --> Q | R)) = (~R --> P --> Q)";
8a79e27ac53b Two new rewrite rules--NOT included by default\!
paulson
parents: 3446
diff changeset
   278
3904
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
   279
prove "imp_disj1" "((P-->Q)|R) = (P--> Q|R)";
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
   280
prove "imp_disj2" "(Q|(P-->R)) = (P--> Q|R)";
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
   281
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   282
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
   283
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   284
prove "not_imp" "(~(P --> Q)) = (P & ~Q)";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   285
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
   286
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   287
(*Avoids duplication of subgoals after expand_if, when the true and false 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   288
  cases boil down to the same thing.*) 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   289
prove "cases_simp" "((P --> Q) & (~P --> Q)) = Q";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   290
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   291
prove "not_all" "(~ (! x. P(x))) = (? x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   292
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3654
diff changeset
   293
prove "not_ex"  "(~ (? x. P(x))) = (! x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   294
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   295
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   296
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
   297
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
   298
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   299
(* '&' congruence rule: not included by default!
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   300
   May slow rewrite proofs down by as much as 50% *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   301
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   302
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   303
                "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   304
                (fn _=> [blast_tac HOL_cs 1])
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   305
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
   306
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   307
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   308
                "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   309
                (fn _=> [blast_tac HOL_cs 1])
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   310
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
   311
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   312
(* '|' congruence rule: not included by default! *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   313
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   314
let val th = prove_goal HOL.thy 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   315
                "(P=P')--> (~P'--> (Q=Q'))--> ((P|Q) = (P'|Q'))"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   316
                (fn _=> [blast_tac HOL_cs 1])
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   317
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
   318
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   319
prove "eq_sym_conv" "(x=y) = (y=x)";
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   320
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   321
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
   322
 (fn _ => [rtac refl 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   323
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   324
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
   325
  (fn [prem] => [rewtac prem, rtac refl 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   326
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   327
qed_goalw "if_True" HOL.thy [if_def] "(if True then x else y) = x"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   328
 (fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]);
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   329
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   330
qed_goalw "if_False" HOL.thy [if_def] "(if False then x else y) = y"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   331
 (fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]);
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   332
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   333
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
   334
 (fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   335
(*
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   336
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
   337
 (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
   338
*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   339
qed_goalw "if_not_P" HOL.thy [if_def] "!!P. ~P ==> (if P then x else y) = y"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   340
 (fn _ => [blast_tac (HOL_cs addIs [select_equality]) 1]);
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   341
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   342
qed_goal "expand_if" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   343
    "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
   344
 (fn _=> [ (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   345
         stac if_P 2,
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   346
         stac if_not_P 1,
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   347
         REPEAT(blast_tac HOL_cs 1) ]);
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   348
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   349
qed_goal "if_bool_eq" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   350
                   "(if P then Q else R) = ((P-->Q) & (~P-->R))"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   351
                   (fn _ => [rtac expand_if 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   352
3913
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   353
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   354
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   355
(** Case splitting **)
96e28b16861c New trivial rewrites
paulson
parents: 3904
diff changeset
   356
2263
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   357
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   358
in
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   359
fun split_tac splits = mktac (map mk_meta_eq splits)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   360
end;
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   361
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   362
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   363
in
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   364
fun split_inside_tac splits = mktac (map mk_meta_eq splits)
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   365
end;
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   366
3919
c036caebfc75 setloop split_tac -> addsplits
nipkow
parents: 3913
diff changeset
   367
infix 4 addsplits;
c036caebfc75 setloop split_tac -> addsplits
nipkow
parents: 3913
diff changeset
   368
fun ss addsplits splits = ss addloop (split_tac splits);
c036caebfc75 setloop split_tac -> addsplits
nipkow
parents: 3913
diff changeset
   369
2263
c741309167bf moved split_tac
oheimb
parents: 2251
diff changeset
   370
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   371
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x"
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   372
  (fn _ => [split_tac [expand_if] 1, blast_tac HOL_cs 1]);
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   373
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   374
(** 'if' congruence rules: neither included by default! *)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   375
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   376
(*Simplifies x assuming c and y assuming ~c*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   377
qed_goal "if_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   378
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==>\
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   379
\  (if b then x else y) = (if c then u else v)"
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   380
  (fn rew::prems =>
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   381
   [stac rew 1, stac expand_if 1, stac expand_if 1,
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2805
diff changeset
   382
    blast_tac (HOL_cs addDs prems) 1]);
2134
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   383
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   384
(*Prevents simplification of x and y: much faster*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   385
qed_goal "if_weak_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   386
  "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
   387
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   388
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   389
(*Prevents simplification of t: much faster*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   390
qed_goal "let_weak_cong" HOL.thy
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   391
  "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
   392
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   393
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   394
(*In general it seems wrong to add distributive laws by default: they
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   395
  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
   396
  and cannot be removed without affecting existing proofs.  Moreover, 
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   397
  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
   398
  grounds that it allows simplification of R in the two cases.*)
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   399
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   400
val mksimps_pairs =
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   401
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   402
   ("All", [spec]), ("True", []), ("False", []),
04a71407089d Renamed and shuffled a few thms.
nipkow
parents: 2129
diff changeset
   403
   ("If", [if_bool_eq RS iffD1])];
1758
60613b065e9b Added ex_imp
nipkow
parents: 1722
diff changeset
   404
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   405
fun unsafe_solver prems = FIRST'[resolve_tac (TrueI::refl::prems),
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   406
				 atac, etac FalseE];
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   407
(*No premature instantiation of variables during simplification*)
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   408
fun   safe_solver prems = FIRST'[match_tac (TrueI::refl::prems),
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   409
				 eq_assume_tac, ematch_tac [FalseE]];
2443
a81d4c219c3c factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents: 2263
diff changeset
   410
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   411
val HOL_basic_ss = empty_ss setsubgoaler asm_simp_tac
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   412
			    setSSolver   safe_solver
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   413
			    setSolver  unsafe_solver
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   414
			    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
   415
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   416
val HOL_ss = 
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   417
    HOL_basic_ss addsimps 
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   418
     ([triv_forall_equality, (* prunes params *)
3654
ebad042c0bba Added True_implies_equals
nipkow
parents: 3615
diff changeset
   419
       True_implies_equals, (* prune asms `True' *)
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   420
       if_True, if_False, if_cancel,
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   421
       o_apply, imp_disjL, conj_assoc, disj_assoc,
3904
c0d56e4c823e New simprules imp_disj1, imp_disj2
paulson
parents: 3896
diff changeset
   422
       de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, not_imp,
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   423
       not_all, not_ex, cases_simp]
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   424
     @ ex_simps @ all_simps @ simp_thms)
4032
4b1c69d8b767 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow
parents: 3919
diff changeset
   425
     addsimprocs [defALL_regroup,defEX_regroup]
3446
a14e5451f613 Addition of not_imp (which pushes negation into implication) as a default
paulson
parents: 3282
diff changeset
   426
     addcongs [imp_cong];
2082
8659e3063a30 Addition of de Morgan laws
paulson
parents: 2054
diff changeset
   427
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   428
qed_goal "if_distrib" HOL.thy
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   429
  "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
   430
  (fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]);
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   431
2097
076a8d2f972b bound o_apply theorem to thy
oheimb
parents: 2082
diff changeset
   432
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
   433
  (fn _ => [rtac ext 1, rtac refl 1]);
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   434
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   435
2948
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   436
val prems = goal HOL.thy "[| P ==> Q(True); ~P ==> Q(False) |] ==> Q(P)";
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   437
by (case_tac "P" 1);
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   438
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems)));
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   439
val expand_case = result();
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   440
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   441
fun expand_case_tac P i =
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   442
    res_inst_tac [("P",P)] expand_case i THEN
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   443
    Simp_tac (i+1) THEN 
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   444
    Simp_tac i;
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   445
f18035b1d531 Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents: 2935
diff changeset
   446
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   447
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   448
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   449
(*** Install simpsets and datatypes in theory structure ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   450
2251
e0e3836f333d moved if_cancel to the right place
oheimb
parents: 2250
diff changeset
   451
simpset := HOL_ss;
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   452
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   453
exception SS_DATA of simpset;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   454
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   455
let fun merge [] = SS_DATA empty_ss
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   456
      | 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
   457
                   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
   458
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   459
    fun put (SS_DATA ss) = simpset := ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   460
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   461
    fun get () = SS_DATA (!simpset);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   462
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   463
     ("simpset", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   464
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   465
3615
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   466
fun simpset_of tname =
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   467
  case get_thydata tname "simpset" of
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   468
      None => empty_ss
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   469
    | Some (SS_DATA ss) => ss;
e5322197cfea Moved some functions which used to be part of thy_data.ML
berghofe
parents: 3577
diff changeset
   470
3040
7d48671753da Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents: 2948
diff changeset
   471
type dtype_info = {case_const:term,
7d48671753da Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents: 2948
diff changeset
   472
                   case_rewrites:thm list,
7d48671753da Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents: 2948
diff changeset
   473
                   constructors:term list,
7d48671753da Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents: 2948
diff changeset
   474
                   induct_tac: string -> int -> tactic,
3282
c31e6239d4c9 Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents: 3206
diff changeset
   475
                   nchotomy: thm,
c31e6239d4c9 Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents: 3206
diff changeset
   476
                   exhaustion: thm,
c31e6239d4c9 Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents: 3206
diff changeset
   477
                   exhaust_tac: string -> int -> tactic,
3040
7d48671753da Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents: 2948
diff changeset
   478
                   case_cong:thm};
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   479
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   480
exception DT_DATA of (string * dtype_info) list;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   481
val datatypes = ref [] : (string * dtype_info) list ref;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   482
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   483
let fun merge [] = DT_DATA []
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   484
      | merge ds =
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   485
          let val ds = map (fn DT_DATA x => x) ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   486
          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
   487
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   488
    fun put (DT_DATA ds) = datatypes := ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   489
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   490
    fun get () = DT_DATA (!datatypes);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   491
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   492
     ("datatypes", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   493
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   494
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   495
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   496
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   497
(*** Integration of simplifier with classical reasoner ***)
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   498
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   499
(* rot_eq_tac rotates the first equality premise of subgoal i to the front,
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   500
   fails if there is no equaliy or if an equality is already at the front *)
3538
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   501
local
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   502
  fun is_eq (Const ("Trueprop", _) $ (Const("op ="  ,_) $ _ $ _)) = true
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   503
    | is_eq _ = false;
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   504
  fun find_eq n [] = None
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   505
    | find_eq n (t :: ts) = if (is_eq t) then Some n 
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   506
			    else find_eq (n + 1) ts;
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   507
in
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   508
val rot_eq_tac = 
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   509
     SUBGOAL (fn (Bi,i) => 
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   510
	      case find_eq 0 (Logic.strip_assums_hyp Bi) of
2805
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   511
		  None   => no_tac
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   512
		| Some 0 => no_tac
3538
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   513
		| Some n => rotate_tac n i)
ed9de44032e0 Removal of the tactical STATE
paulson
parents: 3518
diff changeset
   514
end;
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   515
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   516
(*an unsatisfactory fix for the incomplete asm_full_simp_tac!
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   517
  better: asm_really_full_simp_tac, a yet to be implemented version of
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   518
			asm_full_simp_tac that applies all equalities in the
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   519
			premises to all the premises *)
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   520
fun safe_asm_more_full_simp_tac ss = TRY o rot_eq_tac THEN' 
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   521
				     safe_asm_full_simp_tac ss;
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   522
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   523
(*Add a simpset to a classical set!*)
3206
a3de7f32728c renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents: 3040
diff changeset
   524
infix 4 addSss addss;
a3de7f32728c renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents: 3040
diff changeset
   525
fun cs addSss ss = cs addSaltern (CHANGED o (safe_asm_more_full_simp_tac ss));
a3de7f32728c renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents: 3040
diff changeset
   526
fun cs addss  ss = cs addbefore                        asm_full_simp_tac ss;
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   527
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   528
fun Addss ss = (claset := !claset addss ss);
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   529
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   530
(*Designed to be idempotent, except if best_tac instantiates variables
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   531
  in some of the subgoals*)
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   532
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   533
type clasimpset = (claset * simpset);
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   534
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   535
val HOL_css = (HOL_cs, HOL_ss);
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   536
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   537
fun pair_upd1 f ((a,b),x) = (f(a,x), b);
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   538
fun pair_upd2 f ((a,b),x) = (a, f(b,x));
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   539
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   540
infix 4 addSIs2 addSEs2 addSDs2 addIs2 addEs2 addDs2
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   541
	addsimps2 delsimps2 addcongs2 delcongs2;
2748
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   542
fun op addSIs2   arg = pair_upd1 (op addSIs) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   543
fun op addSEs2   arg = pair_upd1 (op addSEs) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   544
fun op addSDs2   arg = pair_upd1 (op addSDs) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   545
fun op addIs2    arg = pair_upd1 (op addIs ) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   546
fun op addEs2    arg = pair_upd1 (op addEs ) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   547
fun op addDs2    arg = pair_upd1 (op addDs ) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   548
fun op addsimps2 arg = pair_upd2 (op addsimps) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   549
fun op delsimps2 arg = pair_upd2 (op delsimps) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   550
fun op addcongs2 arg = pair_upd2 (op addcongs) arg;
3ae9ccdd701e Eta-expanded some declarations for compatibility with value polymorphism
paulson
parents: 2718
diff changeset
   551
fun op delcongs2 arg = pair_upd2 (op delcongs) arg;
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   552
2805
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   553
fun auto_tac (cs,ss) = 
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   554
    let val cs' = cs addss ss 
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   555
    in  EVERY [TRY (safe_tac cs'),
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   556
	       REPEAT (FIRSTGOAL (fast_tac cs')),
3206
a3de7f32728c renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents: 3040
diff changeset
   557
               TRY (safe_tac (cs addSss ss)),
2805
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   558
	       prune_params_tac] 
6e5b2d6503eb Made the indentation rational
paulson
parents: 2800
diff changeset
   559
    end;
2636
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   560
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   561
fun Auto_tac () = auto_tac (!claset, !simpset);
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   562
4b30dbe4a020 added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents: 2595
diff changeset
   563
fun auto () = by (Auto_tac ());