src/FOL/simpdata.ML
author wenzelm
Wed, 17 Mar 1999 16:33:47 +0100
changeset 6391 0da748358eff
parent 6114 45958e54d72e
child 7355 4c43090659ca
permissions -rw-r--r--
Theory.sign_of;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
     1
(*  Title:      FOL/simpdata
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
     4
    Copyright   1994  University of Cambridge
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
Simplification data for FOL
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
5496
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
     9
(* Elimination of True from asumptions: *)
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    10
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    11
val True_implies_equals = prove_goal IFOL.thy
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    12
 "(True ==> PROP P) == PROP P"
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    13
(K [rtac equal_intr_rule 1, atac 2,
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    14
          METAHYPS (fn prems => resolve_tac prems 1) 1,
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    15
          rtac TrueI 1]);
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    16
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
    17
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    18
(*** Rewrite rules ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    19
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    20
fun int_prove_fun s = 
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    21
 (writeln s;  
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    22
  prove_goal IFOL.thy s
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    23
   (fn prems => [ (cut_facts_tac prems 1), 
2601
b301958c465d Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents: 2469
diff changeset
    24
                  (IntPr.fast_tac 1) ]));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    25
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    26
val conj_simps = map int_prove_fun
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    27
 ["P & True <-> P",      "True & P <-> P",
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    28
  "P & False <-> False", "False & P <-> False",
2801
56948cb1a1f9 Added P&P&Q <-> P&Q and P|P|Q <-> P|Q
nipkow
parents: 2727
diff changeset
    29
  "P & P <-> P", "P & P & Q <-> P & Q",
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    30
  "P & ~P <-> False",    "~P & P <-> False",
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    31
  "(P & Q) & R <-> P & (Q & R)"];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    32
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    33
val disj_simps = map int_prove_fun
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    34
 ["P | True <-> True",  "True | P <-> True",
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    35
  "P | False <-> P",    "False | P <-> P",
2801
56948cb1a1f9 Added P&P&Q <-> P&Q and P|P|Q <-> P|Q
nipkow
parents: 2727
diff changeset
    36
  "P | P <-> P", "P | P | Q <-> P | Q",
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    37
  "(P | Q) | R <-> P | (Q | R)"];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    38
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    39
val not_simps = map int_prove_fun
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    40
 ["~(P|Q)  <-> ~P & ~Q",
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    41
  "~ False <-> True",   "~ True <-> False"];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    42
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    43
val imp_simps = map int_prove_fun
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    44
 ["(P --> False) <-> ~P",       "(P --> True) <-> True",
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    45
  "(False --> P) <-> True",     "(True --> P) <-> P", 
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    46
  "(P --> P) <-> True",         "(P --> ~P) <-> ~P"];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    47
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    48
val iff_simps = map int_prove_fun
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    49
 ["(True <-> P) <-> P",         "(P <-> True) <-> P",
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
  "(P <-> P) <-> True",
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
    51
  "(False <-> P) <-> ~P",       "(P <-> False) <-> ~P"];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    53
(*The x=t versions are needed for the simplification procedures*)
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    54
val quant_simps = map int_prove_fun
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    55
 ["(ALL x. P) <-> P",   
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    56
  "(ALL x. x=t --> P(x)) <-> P(t)",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    57
  "(ALL x. t=x --> P(x)) <-> P(t)",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    58
  "(EX x. P) <-> P",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    59
  "(EX x. x=t & P(x)) <-> P(t)", 
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
    60
  "(EX x. t=x & P(x)) <-> P(t)"];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    61
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    62
(*These are NOT supplied by default!*)
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
    63
val distrib_simps  = map int_prove_fun
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    64
 ["P & (Q | R) <-> P&Q | P&R", 
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    65
  "(Q | R) & P <-> Q&P | R&P",
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    66
  "(P | Q --> R) <-> (P --> R) & (Q --> R)"];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    67
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    68
(** Conversion into rewrite rules **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    69
53
f8f37a9a31dc Added gen_all to simpdata.ML.
nipkow
parents: 3
diff changeset
    70
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th;
f8f37a9a31dc Added gen_all to simpdata.ML.
nipkow
parents: 3
diff changeset
    71
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    72
val P_iff_F = int_prove_fun "~P ==> (P <-> False)";
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    73
val iff_reflection_F = P_iff_F RS iff_reflection;
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    74
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    75
val P_iff_T = int_prove_fun "P ==> (P <-> True)";
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    76
val iff_reflection_T = P_iff_T RS iff_reflection;
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    77
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    78
(*Make meta-equalities.  The operator below is Trueprop*)
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    79
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    80
fun mk_meta_eq th = case concl_of th of
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    81
    _ $ (Const("op =",_)$_$_)   => th RS eq_reflection
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    82
  | _ $ (Const("op <->",_)$_$_) => th RS iff_reflection
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    83
  | _                           => 
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    84
  error("conclusion must be a =-equality or <->");;
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    85
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    86
fun mk_eq th = case concl_of th of
394
432bb9995893 Modified mk_meta_eq to leave meta-equlities on unchanged.
nipkow
parents: 371
diff changeset
    87
    Const("==",_)$_$_           => th
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    88
  | _ $ (Const("op =",_)$_$_)   => mk_meta_eq th
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
    89
  | _ $ (Const("op <->",_)$_$_) => mk_meta_eq th
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    90
  | _ $ (Const("Not",_)$_)      => th RS iff_reflection_F
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
    91
  | _                           => th RS iff_reflection_T;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    92
6114
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    93
(*Replace premises x=y, X<->Y by X==Y*)
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    94
val mk_meta_prems = 
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    95
    rule_by_tactic 
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    96
      (REPEAT_FIRST (resolve_tac [meta_eq_to_obj_eq, def_imp_iff]));
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    97
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    98
fun mk_meta_cong rl =
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
    99
  standard(mk_meta_eq (mk_meta_prems rl))
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
   100
  handle THM _ =>
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
   101
  error("Premises and conclusion of congruence rules must use =-equality or <->");
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   102
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   103
val mksimps_pairs =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   104
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   105
   ("All", [spec]), ("True", []), ("False", [])];
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   106
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   107
(* ###FIXME: move to Provers/simplifier.ML
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   108
val mk_atomize:      (string * thm list) list -> thm -> thm list
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   109
*)
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   110
(* ###FIXME: move to Provers/simplifier.ML *)
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   111
fun mk_atomize pairs =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   112
  let fun atoms th =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   113
        (case concl_of th of
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   114
           Const("Trueprop",_) $ p =>
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   115
             (case head_of p of
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   116
                Const(a,_) =>
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   117
                  (case assoc(pairs,a) of
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   118
                     Some(rls) => flat (map atoms ([th] RL rls))
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   119
                   | None => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   120
              | _ => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   121
         | _ => [th])
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   122
  in atoms end;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   123
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   124
fun mksimps pairs = (map mk_eq o mk_atomize pairs o gen_all);
981
864370666a24 Defined addss to perform simplification in a claset.
lcp
parents: 942
diff changeset
   125
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   126
(*** Classical laws ***)
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
   127
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   128
fun prove_fun s = 
282
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
   129
 (writeln s;  
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
   130
  prove_goal FOL.thy s
731b27c90d2f FOL/simpdata: tidied
lcp
parents: 215
diff changeset
   131
   (fn prems => [ (cut_facts_tac prems 1), 
1459
d12da312eff4 expanded tabs
clasohm
parents: 1088
diff changeset
   132
                  (Cla.fast_tac FOL_cs 1) ]));
745
45a789407806 added blank line
lcp
parents: 429
diff changeset
   133
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   134
(*Avoids duplication of subgoals after expand_if, when the true and false 
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   135
  cases boil down to the same thing.*) 
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   136
val cases_simp = prove_fun "(P --> Q) & (~P --> Q) <-> Q";
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   137
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   138
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   139
(*** Miniscoping: pushing quantifiers in
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   140
     We do NOT distribute of ALL over &, or dually that of EX over |
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   141
     Baaz and Leitsch, On Skolemization and Proof Complexity (1994) 
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   142
     show that this step can increase proof length!
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   143
***)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   144
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   145
(*existential miniscoping*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   146
val int_ex_simps = map int_prove_fun 
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   147
		     ["(EX x. P(x) & Q) <-> (EX x. P(x)) & Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   148
		      "(EX x. P & Q(x)) <-> P & (EX x. Q(x))",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   149
		      "(EX x. P(x) | Q) <-> (EX x. P(x)) | Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   150
		      "(EX x. P | Q(x)) <-> P | (EX x. Q(x))"];
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   151
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   152
(*classical rules*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   153
val cla_ex_simps = map prove_fun 
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   154
                     ["(EX x. P(x) --> Q) <-> (ALL x. P(x)) --> Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   155
		      "(EX x. P --> Q(x)) <-> P --> (EX x. Q(x))"];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   156
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   157
val ex_simps = int_ex_simps @ cla_ex_simps;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   158
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   159
(*universal miniscoping*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   160
val int_all_simps = map int_prove_fun
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   161
		      ["(ALL x. P(x) & Q) <-> (ALL x. P(x)) & Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   162
		       "(ALL x. P & Q(x)) <-> P & (ALL x. Q(x))",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   163
		       "(ALL x. P(x) --> Q) <-> (EX x. P(x)) --> Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   164
		       "(ALL x. P --> Q(x)) <-> P --> (ALL x. Q(x))"];
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   165
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   166
(*classical rules*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   167
val cla_all_simps = map prove_fun
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   168
                      ["(ALL x. P(x) | Q) <-> (ALL x. P(x)) | Q",
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   169
		       "(ALL x. P | Q(x)) <-> P | (ALL x. Q(x))"];
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   170
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   171
val all_simps = int_all_simps @ cla_all_simps;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   172
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   173
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   174
(*** Named rewrite rules proved for IFOL ***)
1953
832ccc1dba95 Introduction of miniscoping for FOL
paulson
parents: 1914
diff changeset
   175
1914
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   176
fun int_prove nm thm  = qed_goal nm IFOL.thy thm
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   177
    (fn prems => [ (cut_facts_tac prems 1), 
2601
b301958c465d Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents: 2469
diff changeset
   178
                   (IntPr.fast_tac 1) ]);
1914
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   179
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   180
fun prove nm thm  = qed_goal nm FOL.thy thm (fn _ => [Blast_tac 1]);
1914
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   181
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   182
int_prove "conj_commute" "P&Q <-> Q&P";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   183
int_prove "conj_left_commute" "P&(Q&R) <-> Q&(P&R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   184
val conj_comms = [conj_commute, conj_left_commute];
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   185
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   186
int_prove "disj_commute" "P|Q <-> Q|P";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   187
int_prove "disj_left_commute" "P|(Q|R) <-> Q|(P|R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   188
val disj_comms = [disj_commute, disj_left_commute];
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   189
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   190
int_prove "conj_disj_distribL" "P&(Q|R) <-> (P&Q | P&R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   191
int_prove "conj_disj_distribR" "(P|Q)&R <-> (P&R | Q&R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   192
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   193
int_prove "disj_conj_distribL" "P|(Q&R) <-> (P|Q) & (P|R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   194
int_prove "disj_conj_distribR" "(P&Q)|R <-> (P|R) & (Q|R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   195
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   196
int_prove "imp_conj_distrib" "(P --> (Q&R)) <-> (P-->Q) & (P-->R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   197
int_prove "imp_conj"         "((P&Q)-->R)   <-> (P --> (Q --> R))";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   198
int_prove "imp_disj"         "(P|Q --> R)   <-> (P-->R) & (Q-->R)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   199
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   200
prove "imp_disj1" "(P-->Q) | R <-> (P-->Q | R)";
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   201
prove "imp_disj2" "Q | (P-->R) <-> (P-->Q | R)";
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   202
1914
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   203
int_prove "de_Morgan_disj" "(~(P | Q)) <-> (~P & ~Q)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   204
prove     "de_Morgan_conj" "(~(P & Q)) <-> (~P | ~Q)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   205
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   206
prove     "not_iff" "~(P <-> Q) <-> (P <-> ~Q)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   207
3835
9a5a4e123859 fixed dots;
wenzelm
parents: 3610
diff changeset
   208
prove     "not_all" "(~ (ALL x. P(x))) <-> (EX x.~P(x))";
9a5a4e123859 fixed dots;
wenzelm
parents: 3610
diff changeset
   209
prove     "imp_all" "((ALL x. P(x)) --> Q) <-> (EX x. P(x) --> Q)";
9a5a4e123859 fixed dots;
wenzelm
parents: 3610
diff changeset
   210
int_prove "not_ex"  "(~ (EX x. P(x))) <-> (ALL x.~P(x))";
1914
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   211
int_prove "imp_ex" "((EX x. P(x)) --> Q) <-> (ALL x. P(x) --> Q)";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   212
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   213
int_prove "ex_disj_distrib"
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   214
    "(EX x. P(x) | Q(x)) <-> ((EX x. P(x)) | (EX x. Q(x)))";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   215
int_prove "all_conj_distrib"
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   216
    "(ALL x. P(x) & Q(x)) <-> ((ALL x. P(x)) & (ALL x. Q(x)))";
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   217
86b095835de9 Added a lot of basic laws, from HOL/simpdata
paulson
parents: 1722
diff changeset
   218
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   219
(** make simplification procedures for quantifier elimination **)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   220
structure Quantifier1 = Quantifier1Fun(
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   221
struct
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   222
  (*abstract syntax*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   223
  fun dest_eq((c as Const("op =",_)) $ s $ t) = Some(c,s,t)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   224
    | dest_eq _ = None;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   225
  fun dest_conj((c as Const("op &",_)) $ s $ t) = Some(c,s,t)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   226
    | dest_conj _ = None;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   227
  val conj = FOLogic.conj
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   228
  val imp  = FOLogic.imp
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   229
  (*rules*)
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   230
  val iff_reflection = iff_reflection
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   231
  val iffI = iffI
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   232
  val sym  = sym
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   233
  val conjI= conjI
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   234
  val conjE= conjE
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   235
  val impI = impI
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   236
  val impE = impE
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   237
  val mp   = mp
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   238
  val exI  = exI
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   239
  val exE  = exE
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   240
  val allI = allI
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   241
  val allE = allE
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   242
end);
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   243
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   244
local
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   245
val ex_pattern =
6391
0da748358eff Theory.sign_of;
wenzelm
parents: 6114
diff changeset
   246
  read_cterm (Theory.sign_of FOL.thy) ("EX x. P(x) & Q(x)", FOLogic.oT)
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   247
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   248
val all_pattern =
6391
0da748358eff Theory.sign_of;
wenzelm
parents: 6114
diff changeset
   249
  read_cterm (Theory.sign_of FOL.thy) ("ALL x. P(x) & P'(x) --> Q(x)", FOLogic.oT)
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   250
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   251
in
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   252
val defEX_regroup =
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   253
  mk_simproc "defined EX" [ex_pattern] Quantifier1.rearrange_ex;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   254
val defALL_regroup =
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   255
  mk_simproc "defined ALL" [all_pattern] Quantifier1.rearrange_all;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   256
end;
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   257
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   258
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   259
(*** Case splitting ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   260
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   261
val meta_eq_to_iff = prove_goal IFOL.thy "x==y ==> x<->y"
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   262
  (fn [prem] => [rewtac prem, rtac iffI 1, atac 1, atac 1]);
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1459
diff changeset
   263
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   264
structure SplitterData =
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   265
  struct
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   266
  structure Simplifier = Simplifier
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   267
  val mk_eq          = mk_eq
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   268
  val meta_eq_to_iff = meta_eq_to_iff
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   269
  val iffD           = iffD2
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   270
  val disjE          = disjE
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   271
  val conjE          = conjE
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   272
  val exE            = exE
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   273
  val contrapos      = contrapos
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   274
  val contrapos2     = contrapos2
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   275
  val notnotD        = notnotD
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   276
  end;
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1459
diff changeset
   277
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   278
structure Splitter = SplitterFun(SplitterData);
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1459
diff changeset
   279
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   280
val split_tac        = Splitter.split_tac;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   281
val split_inside_tac = Splitter.split_inside_tac;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   282
val split_asm_tac    = Splitter.split_asm_tac;
5307
6a699d5cdef4 minor adaption for SML/NJ
oheimb
parents: 5304
diff changeset
   283
val op addsplits     = Splitter.addsplits;
6a699d5cdef4 minor adaption for SML/NJ
oheimb
parents: 5304
diff changeset
   284
val op delsplits     = Splitter.delsplits;
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   285
val Addsplits        = Splitter.Addsplits;
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   286
val Delsplits        = Splitter.Delsplits;
4325
e72cba5af6c5 addsplits now in FOL, ZF too
paulson
parents: 4203
diff changeset
   287
e72cba5af6c5 addsplits now in FOL, ZF too
paulson
parents: 4203
diff changeset
   288
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   289
(*** Standard simpsets ***)
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   290
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   291
structure Induction = InductionFun(struct val spec=IFOL.spec end);
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   292
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   293
open Induction;
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   294
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   295
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   296
(* Add congruence rules for = or <-> (instead of ==) *)
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   297
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   298
(* ###FIXME: Move to simplifier, 
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   299
   taking mk_meta_cong as input, eliminating addeqcongs and deleqcongs *)
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   300
infix 4 addcongs delcongs;
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   301
fun ss addcongs congs = ss addeqcongs (map mk_meta_cong congs);
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   302
fun ss delcongs congs = ss deleqcongs (map mk_meta_cong congs);
4094
9e501199ec01 adapted to new implicit simpset;
wenzelm
parents: 3910
diff changeset
   303
fun Addcongs congs = (simpset_ref() := simpset() addcongs congs);
9e501199ec01 adapted to new implicit simpset;
wenzelm
parents: 3910
diff changeset
   304
fun Delcongs congs = (simpset_ref() := simpset() delcongs congs);
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   305
5115
caf39b7b7a12 HACKED declaration of addsplits
paulson
parents: 4930
diff changeset
   306
5496
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   307
val meta_simps =
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   308
   [triv_forall_equality,  (* prunes params *)
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   309
    True_implies_equals];  (* prune asms `True' *)
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   310
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   311
val IFOL_simps =
6114
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
   312
    [refl RS P_iff_T] @ conj_simps @ disj_simps @ not_simps @ 
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   313
    imp_simps @ iff_simps @ quant_simps;
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   314
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   315
val notFalseI = int_prove_fun "~False";
6114
45958e54d72e congruence rules finally use == instead of = and <->
paulson
parents: 5555
diff changeset
   316
val triv_rls = [TrueI,refl,reflexive_thm,iff_refl,notFalseI];
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   317
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   318
fun unsafe_solver prems = FIRST'[resolve_tac (triv_rls@prems),
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   319
				 atac, etac FalseE];
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   320
(*No premature instantiation of variables during simplification*)
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   321
fun   safe_solver prems = FIRST'[match_tac (triv_rls@prems),
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   322
				 eq_assume_tac, ematch_tac [FalseE]];
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   323
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   324
(*No simprules, but basic infastructure for simplification*)
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   325
val FOL_basic_ss = empty_ss setsubgoaler asm_simp_tac
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   326
                            addsimprocs [defALL_regroup,defEX_regroup]
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   327
			    setSSolver   safe_solver
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   328
			    setSolver  unsafe_solver
5304
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   329
			    setmksimps (mksimps mksimps_pairs);
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   330
c133f16febc7 the splitter is now defined as a functor
oheimb
parents: 5220
diff changeset
   331
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   332
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   333
(*intuitionistic simprules only*)
5496
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   334
val IFOL_ss = 
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   335
    FOL_basic_ss addsimps (meta_simps @ IFOL_simps @ 
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   336
			   int_ex_simps @ int_all_simps)
42d13691be86 Pruning of parameters and True assumptions
paulson
parents: 5307
diff changeset
   337
                 addcongs [imp_cong];
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   338
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   339
val cla_simps = 
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   340
    [de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2,
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   341
     not_all, not_ex, cases_simp] @
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   342
    map prove_fun
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   343
     ["~(P&Q)  <-> ~P | ~Q",
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   344
      "P | ~P",             "~P | P",
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   345
      "~ ~ P <-> P",        "(~P --> P) <-> P",
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   346
      "(~P <-> ~Q) <-> (P<->Q)"];
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   347
3910
1cc9b8ab161c New simprules imp_disj1,2 and some comments
paulson
parents: 3835
diff changeset
   348
(*classical simprules too*)
4349
50403e5a44c0 Instantiated the one-point-rule quantifier simpprocs for FOL
paulson
parents: 4325
diff changeset
   349
val FOL_ss = IFOL_ss addsimps (cla_simps @ cla_ex_simps @ cla_all_simps);
2074
30a65172e003 Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents: 2065
diff changeset
   350
4094
9e501199ec01 adapted to new implicit simpset;
wenzelm
parents: 3910
diff changeset
   351
simpset_ref() := FOL_ss;
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   352
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   353
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   354
5219
924359415f09 functorized Clasimp module;
wenzelm
parents: 5115
diff changeset
   355
(*** integration of simplifier with classical reasoner ***)
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   356
5219
924359415f09 functorized Clasimp module;
wenzelm
parents: 5115
diff changeset
   357
structure Clasimp = ClasimpFun
5555
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   358
 (structure Simplifier = Simplifier 
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   359
        and Classical  = Cla
4b9386224084 simplified CLASIMP_DATA
oheimb
parents: 5496
diff changeset
   360
        and Blast      = Blast);
4652
d24cca140eeb factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
oheimb
parents: 4649
diff changeset
   361
open Clasimp;
2633
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   362
37c0b5a7ee5d added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents: 2601
diff changeset
   363
val FOL_css = (FOL_cs, FOL_ss);