src/Pure/drule.ML
author wenzelm
Tue Sep 05 18:50:52 2000 +0200 (2000-09-05)
changeset 9862 96138f29545e
parent 9829 bf49c3796599
child 10403 2955ee2424ce
permissions -rw-r--r--
improved add_rules;
wenzelm@252
     1
(*  Title:      Pure/drule.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@252
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1993  University of Cambridge
clasohm@0
     5
wenzelm@3766
     6
Derived rules and other operations on theorems.
clasohm@0
     7
*)
clasohm@0
     8
wenzelm@9288
     9
infix 0 RS RSN RL RLN MRS MRL OF COMP;
clasohm@0
    10
wenzelm@5903
    11
signature BASIC_DRULE =
wenzelm@3766
    12
sig
paulson@9547
    13
  val mk_implies        : cterm * cterm -> cterm
paulson@9547
    14
  val list_implies      : cterm list * cterm -> cterm
wenzelm@4285
    15
  val dest_implies      : cterm -> cterm * cterm
wenzelm@8328
    16
  val skip_flexpairs    : cterm -> cterm
wenzelm@8328
    17
  val strip_imp_prems   : cterm -> cterm list
wenzelm@8328
    18
  val cprems_of         : thm -> cterm list
wenzelm@8328
    19
  val read_insts        :
wenzelm@4285
    20
          Sign.sg -> (indexname -> typ option) * (indexname -> sort option)
wenzelm@4285
    21
                  -> (indexname -> typ option) * (indexname -> sort option)
wenzelm@4285
    22
                  -> string list -> (string*string)list
wenzelm@4285
    23
                  -> (indexname*ctyp)list * (cterm*cterm)list
wenzelm@4285
    24
  val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option)
wenzelm@7636
    25
  val strip_shyps_warning : thm -> thm
wenzelm@8328
    26
  val forall_intr_list  : cterm list -> thm -> thm
wenzelm@8328
    27
  val forall_intr_frees : thm -> thm
wenzelm@8328
    28
  val forall_intr_vars  : thm -> thm
wenzelm@8328
    29
  val forall_elim_list  : cterm list -> thm -> thm
wenzelm@8328
    30
  val forall_elim_var   : int -> thm -> thm
wenzelm@8328
    31
  val forall_elim_vars  : int -> thm -> thm
wenzelm@9554
    32
  val forall_elim_vars_safe  : thm -> thm
wenzelm@8328
    33
  val freeze_thaw       : thm -> thm * (thm -> thm)
wenzelm@8328
    34
  val implies_elim_list : thm -> thm list -> thm
wenzelm@8328
    35
  val implies_intr_list : cterm list -> thm -> thm
paulson@8129
    36
  val instantiate       :
paulson@8129
    37
    (indexname * ctyp) list * (cterm * cterm) list -> thm -> thm
wenzelm@8328
    38
  val zero_var_indexes  : thm -> thm
wenzelm@8328
    39
  val standard          : thm -> thm
paulson@4610
    40
  val rotate_prems      : int -> thm -> thm
wenzelm@8328
    41
  val assume_ax         : theory -> string -> thm
wenzelm@8328
    42
  val RSN               : thm * (int * thm) -> thm
wenzelm@8328
    43
  val RS                : thm * thm -> thm
wenzelm@8328
    44
  val RLN               : thm list * (int * thm list) -> thm list
wenzelm@8328
    45
  val RL                : thm list * thm list -> thm list
wenzelm@8328
    46
  val MRS               : thm list * thm -> thm
wenzelm@8328
    47
  val MRL               : thm list list * thm list -> thm list
wenzelm@9288
    48
  val OF                : thm * thm list -> thm
wenzelm@8328
    49
  val compose           : thm * int * thm -> thm list
wenzelm@8328
    50
  val COMP              : thm * thm -> thm
clasohm@0
    51
  val read_instantiate_sg: Sign.sg -> (string*string)list -> thm -> thm
wenzelm@8328
    52
  val read_instantiate  : (string*string)list -> thm -> thm
wenzelm@8328
    53
  val cterm_instantiate : (cterm*cterm)list -> thm -> thm
wenzelm@8328
    54
  val weak_eq_thm       : thm * thm -> bool
wenzelm@8328
    55
  val eq_thm_sg         : thm * thm -> bool
wenzelm@8328
    56
  val size_of_thm       : thm -> int
wenzelm@8328
    57
  val reflexive_thm     : thm
wenzelm@8328
    58
  val symmetric_thm     : thm
wenzelm@8328
    59
  val transitive_thm    : thm
paulson@2004
    60
  val refl_implies      : thm
nipkow@4679
    61
  val symmetric_fun     : thm -> thm
wenzelm@8328
    62
  val rewrite_rule_aux  : (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm
wenzelm@8328
    63
  val rewrite_thm       : bool * bool * bool
nipkow@4713
    64
                          -> (meta_simpset -> thm -> thm option)
nipkow@4713
    65
                          -> meta_simpset -> thm -> thm
wenzelm@8328
    66
  val rewrite_cterm     : bool * bool * bool
wenzelm@5079
    67
                          -> (meta_simpset -> thm -> thm option)
wenzelm@5079
    68
                          -> meta_simpset -> cterm -> thm
wenzelm@4285
    69
  val rewrite_goals_rule_aux: (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm
wenzelm@8328
    70
  val rewrite_goal_rule : bool* bool * bool
nipkow@4713
    71
                          -> (meta_simpset -> thm -> thm option)
nipkow@4713
    72
                          -> meta_simpset -> int -> thm -> thm
wenzelm@8328
    73
  val equal_abs_elim    : cterm  -> thm -> thm
wenzelm@4285
    74
  val equal_abs_elim_list: cterm list -> thm -> thm
wenzelm@4285
    75
  val flexpair_abs_elim_list: cterm list -> thm -> thm
wenzelm@8328
    76
  val asm_rl            : thm
wenzelm@8328
    77
  val cut_rl            : thm
wenzelm@8328
    78
  val revcut_rl         : thm
wenzelm@8328
    79
  val thin_rl           : thm
wenzelm@4285
    80
  val triv_forall_equality: thm
nipkow@1756
    81
  val swap_prems_rl     : thm
wenzelm@4285
    82
  val equal_intr_rule   : thm
paulson@8550
    83
  val inst              : string -> string -> thm -> thm
wenzelm@8328
    84
  val instantiate'      : ctyp option list -> cterm option list -> thm -> thm
wenzelm@8328
    85
  val incr_indexes      : int -> thm -> thm
wenzelm@8328
    86
  val incr_indexes_wrt  : int list -> ctyp list -> cterm list -> thm list -> thm -> thm
wenzelm@5903
    87
end;
wenzelm@5903
    88
wenzelm@5903
    89
signature DRULE =
wenzelm@5903
    90
sig
wenzelm@5903
    91
  include BASIC_DRULE
wenzelm@9455
    92
  val rule_attribute    : ('a -> thm -> thm) -> 'a attribute
wenzelm@9455
    93
  val tag_rule          : tag -> thm -> thm
wenzelm@9455
    94
  val untag_rule        : string -> thm -> thm
wenzelm@9455
    95
  val tag               : tag -> 'a attribute
wenzelm@9455
    96
  val untag             : string -> 'a attribute
wenzelm@9455
    97
  val tag_lemma         : 'a attribute
wenzelm@9455
    98
  val tag_assumption    : 'a attribute
wenzelm@9455
    99
  val tag_internal      : 'a attribute
wenzelm@9455
   100
  val has_internal	: tag list -> bool
wenzelm@8328
   101
  val compose_single    : thm * int * thm -> thm
wenzelm@9829
   102
  val add_rules		: thm list -> thm list -> thm list
wenzelm@9829
   103
  val del_rules		: thm list -> thm list -> thm list
wenzelm@9418
   104
  val merge_rules	: thm list * thm list -> thm list
wenzelm@9554
   105
  val norm_hhf_eq	: thm
wenzelm@8328
   106
  val triv_goal         : thm
wenzelm@8328
   107
  val rev_triv_goal     : thm
wenzelm@8328
   108
  val freeze_all        : thm -> thm
paulson@5311
   109
  val mk_triv_goal      : cterm -> thm
wenzelm@8328
   110
  val mk_cgoal          : cterm -> cterm
wenzelm@8328
   111
  val assume_goal       : cterm -> thm
wenzelm@8328
   112
  val tvars_of_terms    : term list -> (indexname * sort) list
wenzelm@8328
   113
  val vars_of_terms     : term list -> (indexname * typ) list
wenzelm@8328
   114
  val tvars_of          : thm -> (indexname * sort) list
wenzelm@8328
   115
  val vars_of           : thm -> (indexname * typ) list
wenzelm@8328
   116
  val unvarifyT         : thm -> thm
wenzelm@8328
   117
  val unvarify          : thm -> thm
wenzelm@8605
   118
  val tvars_intr_list	: string list -> thm -> thm
wenzelm@3766
   119
end;
clasohm@0
   120
wenzelm@5903
   121
structure Drule: DRULE =
clasohm@0
   122
struct
clasohm@0
   123
wenzelm@3991
   124
lcp@708
   125
(** some cterm->cterm operations: much faster than calling cterm_of! **)
lcp@708
   126
paulson@2004
   127
(** SAME NAMES as in structure Logic: use compound identifiers! **)
paulson@2004
   128
clasohm@1703
   129
(*dest_implies for cterms. Note T=prop below*)
paulson@2004
   130
fun dest_implies ct =
wenzelm@8328
   131
    case term_of ct of
wenzelm@8328
   132
        (Const("==>", _) $ _ $ _) =>
wenzelm@8328
   133
            let val (ct1,ct2) = dest_comb ct
wenzelm@8328
   134
            in  (#2 (dest_comb ct1), ct2)  end
paulson@2004
   135
      | _ => raise TERM ("dest_implies", [term_of ct]) ;
clasohm@1703
   136
clasohm@1703
   137
lcp@708
   138
(*Discard flexflex pairs; return a cterm*)
paulson@2004
   139
fun skip_flexpairs ct =
lcp@708
   140
    case term_of ct of
wenzelm@8328
   141
        (Const("==>", _) $ (Const("=?=",_)$_$_) $ _) =>
wenzelm@8328
   142
            skip_flexpairs (#2 (dest_implies ct))
lcp@708
   143
      | _ => ct;
lcp@708
   144
lcp@708
   145
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
paulson@2004
   146
fun strip_imp_prems ct =
paulson@2004
   147
    let val (cA,cB) = dest_implies ct
paulson@2004
   148
    in  cA :: strip_imp_prems cB  end
lcp@708
   149
    handle TERM _ => [];
lcp@708
   150
paulson@2004
   151
(* A1==>...An==>B  goes to B, where B is not an implication *)
paulson@2004
   152
fun strip_imp_concl ct =
wenzelm@8328
   153
    case term_of ct of (Const("==>", _) $ _ $ _) =>
wenzelm@8328
   154
        strip_imp_concl (#2 (dest_comb ct))
paulson@2004
   155
  | _ => ct;
paulson@2004
   156
lcp@708
   157
(*The premises of a theorem, as a cterm list*)
paulson@2004
   158
val cprems_of = strip_imp_prems o skip_flexpairs o cprop_of;
lcp@708
   159
paulson@9547
   160
val proto_sign = Theory.sign_of ProtoPure.thy;
paulson@9547
   161
paulson@9547
   162
val implies = cterm_of proto_sign Term.implies;
paulson@9547
   163
paulson@9547
   164
(*cterm version of mk_implies*)
paulson@9547
   165
fun mk_implies(A,B) = capply (capply implies A) B;
paulson@9547
   166
paulson@9547
   167
(*cterm version of list_implies: [A1,...,An], B  goes to [|A1;==>;An|]==>B *)
paulson@9547
   168
fun list_implies([], B) = B
paulson@9547
   169
  | list_implies(A::AS, B) = mk_implies (A, list_implies(AS,B));
paulson@9547
   170
lcp@708
   171
lcp@229
   172
(** reading of instantiations **)
lcp@229
   173
lcp@229
   174
fun absent ixn =
lcp@229
   175
  error("No such variable in term: " ^ Syntax.string_of_vname ixn);
lcp@229
   176
lcp@229
   177
fun inst_failure ixn =
lcp@229
   178
  error("Instantiation of " ^ Syntax.string_of_vname ixn ^ " fails");
lcp@229
   179
nipkow@4281
   180
fun read_insts sign (rtypes,rsorts) (types,sorts) used insts =
nipkow@4281
   181
let val {tsig,...} = Sign.rep_sg sign
nipkow@4281
   182
    fun split([],tvs,vs) = (tvs,vs)
wenzelm@4691
   183
      | split((sv,st)::l,tvs,vs) = (case Symbol.explode sv of
wenzelm@4691
   184
                  "'"::cs => split(l,(Syntax.indexname cs,st)::tvs,vs)
wenzelm@4691
   185
                | cs => split(l,tvs,(Syntax.indexname cs,st)::vs));
nipkow@4281
   186
    val (tvs,vs) = split(insts,[],[]);
nipkow@4281
   187
    fun readT((a,i),st) =
nipkow@4281
   188
        let val ixn = ("'" ^ a,i);
nipkow@4281
   189
            val S = case rsorts ixn of Some S => S | None => absent ixn;
nipkow@4281
   190
            val T = Sign.read_typ (sign,sorts) st;
nipkow@4281
   191
        in if Type.typ_instance(tsig,T,TVar(ixn,S)) then (ixn,T)
nipkow@4281
   192
           else inst_failure ixn
nipkow@4281
   193
        end
nipkow@4281
   194
    val tye = map readT tvs;
nipkow@4281
   195
    fun mkty(ixn,st) = (case rtypes ixn of
nipkow@4281
   196
                          Some T => (ixn,(st,typ_subst_TVars tye T))
nipkow@4281
   197
                        | None => absent ixn);
nipkow@4281
   198
    val ixnsTs = map mkty vs;
nipkow@4281
   199
    val ixns = map fst ixnsTs
nipkow@4281
   200
    and sTs  = map snd ixnsTs
nipkow@4281
   201
    val (cts,tye2) = read_def_cterms(sign,types,sorts) used false sTs;
nipkow@4281
   202
    fun mkcVar(ixn,T) =
nipkow@4281
   203
        let val U = typ_subst_TVars tye2 T
nipkow@4281
   204
        in cterm_of sign (Var(ixn,U)) end
nipkow@4281
   205
    val ixnTs = ListPair.zip(ixns, map snd sTs)
nipkow@4281
   206
in (map (fn (ixn,T) => (ixn,ctyp_of sign T)) (tye2 @ tye),
nipkow@4281
   207
    ListPair.zip(map mkcVar ixnTs,cts))
nipkow@4281
   208
end;
lcp@229
   209
lcp@229
   210
wenzelm@252
   211
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term
clasohm@0
   212
     Used for establishing default types (of variables) and sorts (of
clasohm@0
   213
     type variables) when reading another term.
clasohm@0
   214
     Index -1 indicates that a (T)Free rather than a (T)Var is wanted.
clasohm@0
   215
***)
clasohm@0
   216
clasohm@0
   217
fun types_sorts thm =
clasohm@0
   218
    let val {prop,hyps,...} = rep_thm thm;
wenzelm@252
   219
        val big = list_comb(prop,hyps); (* bogus term! *)
wenzelm@252
   220
        val vars = map dest_Var (term_vars big);
wenzelm@252
   221
        val frees = map dest_Free (term_frees big);
wenzelm@252
   222
        val tvars = term_tvars big;
wenzelm@252
   223
        val tfrees = term_tfrees big;
wenzelm@252
   224
        fun typ(a,i) = if i<0 then assoc(frees,a) else assoc(vars,(a,i));
wenzelm@252
   225
        fun sort(a,i) = if i<0 then assoc(tfrees,a) else assoc(tvars,(a,i));
clasohm@0
   226
    in (typ,sort) end;
clasohm@0
   227
wenzelm@7636
   228
wenzelm@9455
   229
wenzelm@9455
   230
(** basic attributes **)
wenzelm@9455
   231
wenzelm@9455
   232
(* dependent rules *)
wenzelm@9455
   233
wenzelm@9455
   234
fun rule_attribute f (x, thm) = (x, (f x thm));
wenzelm@9455
   235
wenzelm@9455
   236
wenzelm@9455
   237
(* add / delete tags *)
wenzelm@9455
   238
wenzelm@9455
   239
fun map_tags f thm =
wenzelm@9455
   240
  Thm.put_name_tags (Thm.name_of_thm thm, f (#2 (Thm.get_name_tags thm))) thm;
wenzelm@9455
   241
wenzelm@9455
   242
fun tag_rule tg = map_tags (fn tgs => if tg mem tgs then tgs else tgs @ [tg]);
wenzelm@9455
   243
fun untag_rule s = map_tags (filter_out (equal s o #1));
wenzelm@9455
   244
wenzelm@9455
   245
fun tag tg x = rule_attribute (K (tag_rule tg)) x;
wenzelm@9455
   246
fun untag s x = rule_attribute (K (untag_rule s)) x;
wenzelm@9455
   247
wenzelm@9455
   248
fun simple_tag name x = tag (name, []) x;
wenzelm@9455
   249
wenzelm@9455
   250
fun tag_lemma x = simple_tag "lemma" x;
wenzelm@9455
   251
fun tag_assumption x = simple_tag "assumption" x;
wenzelm@9455
   252
wenzelm@9455
   253
val internal_tag = ("internal", []);
wenzelm@9455
   254
fun tag_internal x = tag internal_tag x;
wenzelm@9455
   255
fun has_internal tags = exists (equal internal_tag) tags;
wenzelm@9455
   256
wenzelm@9455
   257
wenzelm@9455
   258
clasohm@0
   259
(** Standardization of rules **)
clasohm@0
   260
wenzelm@7636
   261
(*Strip extraneous shyps as far as possible*)
wenzelm@7636
   262
fun strip_shyps_warning thm =
wenzelm@7636
   263
  let
wenzelm@7636
   264
    val str_of_sort = Sign.str_of_sort (Thm.sign_of_thm thm);
wenzelm@7636
   265
    val thm' = Thm.strip_shyps thm;
wenzelm@7636
   266
    val xshyps = Thm.extra_shyps thm';
wenzelm@7636
   267
  in
wenzelm@7636
   268
    if null xshyps then ()
wenzelm@7636
   269
    else warning ("Pending sort hypotheses: " ^ commas (map str_of_sort xshyps));
wenzelm@7636
   270
    thm'
wenzelm@7636
   271
  end;
wenzelm@7636
   272
clasohm@0
   273
(*Generalization over a list of variables, IGNORING bad ones*)
clasohm@0
   274
fun forall_intr_list [] th = th
clasohm@0
   275
  | forall_intr_list (y::ys) th =
wenzelm@252
   276
        let val gth = forall_intr_list ys th
wenzelm@252
   277
        in  forall_intr y gth   handle THM _ =>  gth  end;
clasohm@0
   278
clasohm@0
   279
(*Generalization over all suitable Free variables*)
clasohm@0
   280
fun forall_intr_frees th =
clasohm@0
   281
    let val {prop,sign,...} = rep_thm th
clasohm@0
   282
    in  forall_intr_list
wenzelm@4440
   283
         (map (cterm_of sign) (sort (make_ord atless) (term_frees prop)))
clasohm@0
   284
         th
clasohm@0
   285
    end;
clasohm@0
   286
wenzelm@7898
   287
val forall_elim_var = PureThy.forall_elim_var;
wenzelm@7898
   288
val forall_elim_vars = PureThy.forall_elim_vars;
clasohm@0
   289
wenzelm@9554
   290
fun forall_elim_vars_safe th =
wenzelm@9554
   291
  forall_elim_vars_safe (forall_elim_var (#maxidx (Thm.rep_thm th) + 1) th)
wenzelm@9554
   292
    handle THM _ => th;
wenzelm@9554
   293
wenzelm@9554
   294
clasohm@0
   295
(*Specialization over a list of cterms*)
clasohm@0
   296
fun forall_elim_list cts th = foldr (uncurry forall_elim) (rev cts, th);
clasohm@0
   297
clasohm@0
   298
(* maps [A1,...,An], B   to   [| A1;...;An |] ==> B  *)
clasohm@0
   299
fun implies_intr_list cAs th = foldr (uncurry implies_intr) (cAs,th);
clasohm@0
   300
clasohm@0
   301
(* maps [| A1;...;An |] ==> B and [A1,...,An]   to   B *)
clasohm@0
   302
fun implies_elim_list impth ths = foldl (uncurry implies_elim) (impth,ths);
clasohm@0
   303
clasohm@0
   304
(*Reset Var indexes to zero, renaming to preserve distinctness*)
wenzelm@252
   305
fun zero_var_indexes th =
clasohm@0
   306
    let val {prop,sign,...} = rep_thm th;
clasohm@0
   307
        val vars = term_vars prop
clasohm@0
   308
        val bs = foldl add_new_id ([], map (fn Var((a,_),_)=>a) vars)
wenzelm@252
   309
        val inrs = add_term_tvars(prop,[]);
wenzelm@252
   310
        val nms' = rev(foldl add_new_id ([], map (#1 o #1) inrs));
paulson@2266
   311
        val tye = ListPair.map (fn ((v,rs),a) => (v, TVar((a,0),rs)))
wenzelm@8328
   312
                     (inrs, nms')
wenzelm@252
   313
        val ctye = map (fn (v,T) => (v,ctyp_of sign T)) tye;
wenzelm@252
   314
        fun varpairs([],[]) = []
wenzelm@252
   315
          | varpairs((var as Var(v,T)) :: vars, b::bs) =
wenzelm@252
   316
                let val T' = typ_subst_TVars tye T
wenzelm@252
   317
                in (cterm_of sign (Var(v,T')),
wenzelm@252
   318
                    cterm_of sign (Var((b,0),T'))) :: varpairs(vars,bs)
wenzelm@252
   319
                end
wenzelm@252
   320
          | varpairs _ = raise TERM("varpairs", []);
paulson@8129
   321
    in Thm.instantiate (ctye, varpairs(vars,rev bs)) th end;
clasohm@0
   322
clasohm@0
   323
clasohm@0
   324
(*Standard form of object-rule: no hypotheses, Frees, or outer quantifiers;
clasohm@0
   325
    all generality expressed by Vars having index 0.*)
clasohm@0
   326
fun standard th =
wenzelm@1218
   327
  let val {maxidx,...} = rep_thm th
wenzelm@1237
   328
  in
wenzelm@1218
   329
    th |> implies_intr_hyps
paulson@1412
   330
       |> forall_intr_frees |> forall_elim_vars (maxidx + 1)
wenzelm@7636
   331
       |> strip_shyps_warning
paulson@1412
   332
       |> zero_var_indexes |> Thm.varifyT |> Thm.compress
wenzelm@1218
   333
  end;
wenzelm@1218
   334
clasohm@0
   335
wenzelm@8328
   336
(*Convert all Vars in a theorem to Frees.  Also return a function for
paulson@4610
   337
  reversing that operation.  DOES NOT WORK FOR TYPE VARIABLES.
paulson@4610
   338
  Similar code in type/freeze_thaw*)
paulson@4610
   339
fun freeze_thaw th =
paulson@7248
   340
 let val fth = freezeT th
paulson@7248
   341
     val {prop,sign,...} = rep_thm fth
paulson@7248
   342
 in
paulson@7248
   343
   case term_vars prop of
paulson@7248
   344
       [] => (fth, fn x => x)
paulson@7248
   345
     | vars =>
wenzelm@8328
   346
         let fun newName (Var(ix,_), (pairs,used)) =
wenzelm@8328
   347
                   let val v = variant used (string_of_indexname ix)
wenzelm@8328
   348
                   in  ((ix,v)::pairs, v::used)  end;
wenzelm@8328
   349
             val (alist, _) = foldr newName
wenzelm@8328
   350
                                (vars, ([], add_term_names (prop, [])))
wenzelm@8328
   351
             fun mk_inst (Var(v,T)) =
wenzelm@8328
   352
                 (cterm_of sign (Var(v,T)),
wenzelm@8328
   353
                  cterm_of sign (Free(the (assoc(alist,v)), T)))
wenzelm@8328
   354
             val insts = map mk_inst vars
wenzelm@8328
   355
             fun thaw th' =
wenzelm@8328
   356
                 th' |> forall_intr_list (map #2 insts)
wenzelm@8328
   357
                     |> forall_elim_list (map #1 insts)
wenzelm@8328
   358
         in  (Thm.instantiate ([],insts) fth, thaw)  end
paulson@7248
   359
 end;
paulson@4610
   360
paulson@4610
   361
paulson@7248
   362
(*Rotates a rule's premises to the left by k*)
paulson@7248
   363
val rotate_prems = permute_prems 0;
paulson@4610
   364
paulson@4610
   365
wenzelm@252
   366
(*Assume a new formula, read following the same conventions as axioms.
clasohm@0
   367
  Generalizes over Free variables,
clasohm@0
   368
  creates the assumption, and then strips quantifiers.
clasohm@0
   369
  Example is [| ALL x:?A. ?P(x) |] ==> [| ?P(?a) |]
wenzelm@252
   370
             [ !(A,P,a)[| ALL x:A. P(x) |] ==> [| P(a) |] ]    *)
clasohm@0
   371
fun assume_ax thy sP =
wenzelm@6390
   372
    let val sign = Theory.sign_of thy
paulson@4610
   373
        val prop = Logic.close_form (term_of (read_cterm sign (sP, propT)))
lcp@229
   374
    in forall_elim_vars 0 (assume (cterm_of sign prop))  end;
clasohm@0
   375
wenzelm@252
   376
(*Resolution: exactly one resolvent must be produced.*)
clasohm@0
   377
fun tha RSN (i,thb) =
wenzelm@4270
   378
  case Seq.chop (2, biresolution false [(false,tha)] i thb) of
clasohm@0
   379
      ([th],_) => th
clasohm@0
   380
    | ([],_)   => raise THM("RSN: no unifiers", i, [tha,thb])
clasohm@0
   381
    |      _   => raise THM("RSN: multiple unifiers", i, [tha,thb]);
clasohm@0
   382
clasohm@0
   383
(*resolution: P==>Q, Q==>R gives P==>R. *)
clasohm@0
   384
fun tha RS thb = tha RSN (1,thb);
clasohm@0
   385
clasohm@0
   386
(*For joining lists of rules*)
wenzelm@252
   387
fun thas RLN (i,thbs) =
clasohm@0
   388
  let val resolve = biresolution false (map (pair false) thas) i
wenzelm@4270
   389
      fun resb thb = Seq.list_of (resolve thb) handle THM _ => []
paulson@2672
   390
  in  List.concat (map resb thbs)  end;
clasohm@0
   391
clasohm@0
   392
fun thas RL thbs = thas RLN (1,thbs);
clasohm@0
   393
lcp@11
   394
(*Resolve a list of rules against bottom_rl from right to left;
lcp@11
   395
  makes proof trees*)
wenzelm@252
   396
fun rls MRS bottom_rl =
lcp@11
   397
  let fun rs_aux i [] = bottom_rl
wenzelm@252
   398
        | rs_aux i (rl::rls) = rl RSN (i, rs_aux (i+1) rls)
lcp@11
   399
  in  rs_aux 1 rls  end;
lcp@11
   400
lcp@11
   401
(*As above, but for rule lists*)
wenzelm@252
   402
fun rlss MRL bottom_rls =
lcp@11
   403
  let fun rs_aux i [] = bottom_rls
wenzelm@252
   404
        | rs_aux i (rls::rlss) = rls RLN (i, rs_aux (i+1) rlss)
lcp@11
   405
  in  rs_aux 1 rlss  end;
lcp@11
   406
wenzelm@9288
   407
(*A version of MRS with more appropriate argument order*)
wenzelm@9288
   408
fun bottom_rl OF rls = rls MRS bottom_rl;
wenzelm@9288
   409
wenzelm@252
   410
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R
clasohm@0
   411
  with no lifting or renaming!  Q may contain ==> or meta-quants
clasohm@0
   412
  ALWAYS deletes premise i *)
wenzelm@252
   413
fun compose(tha,i,thb) =
wenzelm@4270
   414
    Seq.list_of (bicompose false (false,tha,0) i thb);
clasohm@0
   415
wenzelm@6946
   416
fun compose_single (tha,i,thb) =
wenzelm@6946
   417
  (case compose (tha,i,thb) of
wenzelm@6946
   418
    [th] => th
wenzelm@6946
   419
  | _ => raise THM ("compose: unique result expected", i, [tha,thb]));
wenzelm@6946
   420
clasohm@0
   421
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*)
clasohm@0
   422
fun tha COMP thb =
clasohm@0
   423
    case compose(tha,1,thb) of
wenzelm@252
   424
        [th] => th
clasohm@0
   425
      | _ =>   raise THM("COMP", 1, [tha,thb]);
clasohm@0
   426
wenzelm@4016
   427
(** theorem equality **)
clasohm@0
   428
clasohm@0
   429
(*Do the two theorems have the same signature?*)
wenzelm@252
   430
fun eq_thm_sg (th1,th2) = Sign.eq_sg(#sign(rep_thm th1), #sign(rep_thm th2));
clasohm@0
   431
clasohm@0
   432
(*Useful "distance" function for BEST_FIRST*)
clasohm@0
   433
val size_of_thm = size_of_term o #prop o rep_thm;
clasohm@0
   434
wenzelm@9829
   435
(*maintain lists of theorems --- preserving canonical order*)
wenzelm@9829
   436
fun del_rules rs rules = Library.gen_rems Thm.eq_thm (rules, rs);
wenzelm@9862
   437
fun add_rules rs rules = rs @ del_rules rs rules;
wenzelm@9829
   438
fun merge_rules (rules1, rules2) = Library.generic_merge Thm.eq_thm I I rules1 rules2;
wenzelm@9829
   439
clasohm@0
   440
lcp@1194
   441
(** Mark Staples's weaker version of eq_thm: ignores variable renaming and
lcp@1194
   442
    (some) type variable renaming **)
lcp@1194
   443
lcp@1194
   444
 (* Can't use term_vars, because it sorts the resulting list of variable names.
lcp@1194
   445
    We instead need the unique list noramlised by the order of appearance
lcp@1194
   446
    in the term. *)
lcp@1194
   447
fun term_vars' (t as Var(v,T)) = [t]
lcp@1194
   448
  | term_vars' (Abs(_,_,b)) = term_vars' b
lcp@1194
   449
  | term_vars' (f$a) = (term_vars' f) @ (term_vars' a)
lcp@1194
   450
  | term_vars' _ = [];
lcp@1194
   451
lcp@1194
   452
fun forall_intr_vars th =
lcp@1194
   453
  let val {prop,sign,...} = rep_thm th;
lcp@1194
   454
      val vars = distinct (term_vars' prop);
lcp@1194
   455
  in forall_intr_list (map (cterm_of sign) vars) th end;
lcp@1194
   456
wenzelm@1237
   457
fun weak_eq_thm (tha,thb) =
lcp@1194
   458
    eq_thm(forall_intr_vars (freezeT tha), forall_intr_vars (freezeT thb));
lcp@1194
   459
lcp@1194
   460
lcp@1194
   461
clasohm@0
   462
(*** Meta-Rewriting Rules ***)
clasohm@0
   463
paulson@4610
   464
fun read_prop s = read_cterm proto_sign (s, propT);
paulson@4610
   465
wenzelm@9455
   466
fun store_thm name thm = hd (PureThy.smart_store_thms (name, [thm]));
wenzelm@9455
   467
fun store_standard_thm name thm = store_thm name (standard thm);
wenzelm@4016
   468
clasohm@0
   469
val reflexive_thm =
paulson@4610
   470
  let val cx = cterm_of proto_sign (Var(("x",0),TVar(("'a",0),logicS)))
wenzelm@9455
   471
  in store_standard_thm "reflexive" (Thm.reflexive cx) end;
clasohm@0
   472
clasohm@0
   473
val symmetric_thm =
paulson@4610
   474
  let val xy = read_prop "x::'a::logic == y"
wenzelm@9455
   475
  in store_standard_thm "symmetric" (Thm.implies_intr_hyps (Thm.symmetric (Thm.assume xy))) end;
clasohm@0
   476
clasohm@0
   477
val transitive_thm =
paulson@4610
   478
  let val xy = read_prop "x::'a::logic == y"
paulson@4610
   479
      val yz = read_prop "y::'a::logic == z"
clasohm@0
   480
      val xythm = Thm.assume xy and yzthm = Thm.assume yz
wenzelm@9455
   481
  in store_standard_thm "transitive" (Thm.implies_intr yz (Thm.transitive xythm yzthm)) end;
clasohm@0
   482
nipkow@4679
   483
fun symmetric_fun thm = thm RS symmetric_thm;
nipkow@4679
   484
lcp@229
   485
(** Below, a "conversion" has type cterm -> thm **)
lcp@229
   486
paulson@9547
   487
val refl_implies = reflexive implies;
clasohm@0
   488
clasohm@0
   489
(*In [A1,...,An]==>B, rewrite the selected A's only -- for rewrite_goals_tac*)
nipkow@214
   490
(*Do not rewrite flex-flex pairs*)
wenzelm@252
   491
fun goals_conv pred cv =
lcp@229
   492
  let fun gconv i ct =
paulson@2004
   493
        let val (A,B) = dest_implies ct
lcp@229
   494
            val (thA,j) = case term_of A of
lcp@229
   495
                  Const("=?=",_)$_$_ => (reflexive A, i)
lcp@229
   496
                | _ => (if pred i then cv A else reflexive A, i+1)
paulson@2004
   497
        in  combination (combination refl_implies thA) (gconv j B) end
lcp@229
   498
        handle TERM _ => reflexive ct
clasohm@0
   499
  in gconv 1 end;
clasohm@0
   500
clasohm@0
   501
(*Use a conversion to transform a theorem*)
lcp@229
   502
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th;
clasohm@0
   503
clasohm@0
   504
(*rewriting conversion*)
lcp@229
   505
fun rew_conv mode prover mss = rewrite_cterm mode mss prover;
clasohm@0
   506
clasohm@0
   507
(*Rewrite a theorem*)
wenzelm@9554
   508
fun rewrite_rule_aux _ [] = (fn th => th)
wenzelm@9554
   509
  | rewrite_rule_aux prover thms =
wenzelm@9554
   510
      fconv_rule (rew_conv (true,false,false) prover (Thm.mss_of thms));
clasohm@0
   511
wenzelm@3555
   512
fun rewrite_thm mode prover mss = fconv_rule (rew_conv mode prover mss);
wenzelm@5079
   513
fun rewrite_cterm mode prover mss = Thm.rewrite_cterm mode mss prover;
wenzelm@3555
   514
clasohm@0
   515
(*Rewrite the subgoals of a proof state (represented by a theorem) *)
wenzelm@3575
   516
fun rewrite_goals_rule_aux _ []   th = th
wenzelm@3575
   517
  | rewrite_goals_rule_aux prover thms th =
nipkow@4713
   518
      fconv_rule (goals_conv (K true) (rew_conv (true, true, false) prover
wenzelm@3575
   519
        (Thm.mss_of thms))) th;
clasohm@0
   520
clasohm@0
   521
(*Rewrite the subgoal of a proof state (represented by a theorem) *)
nipkow@214
   522
fun rewrite_goal_rule mode prover mss i thm =
nipkow@214
   523
  if 0 < i  andalso  i <= nprems_of thm
nipkow@214
   524
  then fconv_rule (goals_conv (fn j => j=i) (rew_conv mode prover mss)) thm
nipkow@214
   525
  else raise THM("rewrite_goal_rule",i,[thm]);
clasohm@0
   526
clasohm@0
   527
clasohm@0
   528
(*** Some useful meta-theorems ***)
clasohm@0
   529
clasohm@0
   530
(*The rule V/V, obtains assumption solving for eresolve_tac*)
wenzelm@9455
   531
val asm_rl = store_standard_thm "asm_rl" (Thm.trivial (read_prop "PROP ?psi"));
wenzelm@7380
   532
val _ = store_thm "_" asm_rl;
clasohm@0
   533
clasohm@0
   534
(*Meta-level cut rule: [| V==>W; V |] ==> W *)
wenzelm@4016
   535
val cut_rl =
wenzelm@9455
   536
  store_standard_thm "cut_rl"
wenzelm@9455
   537
    (Thm.trivial (read_prop "PROP ?psi ==> PROP ?theta"));
clasohm@0
   538
wenzelm@252
   539
(*Generalized elim rule for one conclusion; cut_rl with reversed premises:
clasohm@0
   540
     [| PROP V;  PROP V ==> PROP W |] ==> PROP W *)
clasohm@0
   541
val revcut_rl =
paulson@4610
   542
  let val V = read_prop "PROP V"
paulson@4610
   543
      and VW = read_prop "PROP V ==> PROP W";
wenzelm@4016
   544
  in
wenzelm@9455
   545
    store_standard_thm "revcut_rl"
wenzelm@4016
   546
      (implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V))))
clasohm@0
   547
  end;
clasohm@0
   548
lcp@668
   549
(*for deleting an unwanted assumption*)
lcp@668
   550
val thin_rl =
paulson@4610
   551
  let val V = read_prop "PROP V"
paulson@4610
   552
      and W = read_prop "PROP W";
wenzelm@9455
   553
  in  store_standard_thm "thin_rl" (implies_intr V (implies_intr W (assume W)))
lcp@668
   554
  end;
lcp@668
   555
clasohm@0
   556
(* (!!x. PROP ?V) == PROP ?V       Allows removal of redundant parameters*)
clasohm@0
   557
val triv_forall_equality =
paulson@4610
   558
  let val V  = read_prop "PROP V"
paulson@4610
   559
      and QV = read_prop "!!x::'a. PROP V"
wenzelm@8086
   560
      and x  = read_cterm proto_sign ("x", TypeInfer.logicT);
wenzelm@4016
   561
  in
wenzelm@9455
   562
    store_standard_thm "triv_forall_equality"
wenzelm@9455
   563
      (standard (equal_intr (implies_intr QV (forall_elim x (assume QV)))
wenzelm@9455
   564
        (implies_intr V  (forall_intr x (assume V)))))
clasohm@0
   565
  end;
clasohm@0
   566
nipkow@1756
   567
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==>
nipkow@1756
   568
   (PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi)
nipkow@1756
   569
   `thm COMP swap_prems_rl' swaps the first two premises of `thm'
nipkow@1756
   570
*)
nipkow@1756
   571
val swap_prems_rl =
paulson@4610
   572
  let val cmajor = read_prop "PROP PhiA ==> PROP PhiB ==> PROP Psi";
nipkow@1756
   573
      val major = assume cmajor;
paulson@4610
   574
      val cminor1 = read_prop "PROP PhiA";
nipkow@1756
   575
      val minor1 = assume cminor1;
paulson@4610
   576
      val cminor2 = read_prop "PROP PhiB";
nipkow@1756
   577
      val minor2 = assume cminor2;
wenzelm@9455
   578
  in store_standard_thm "swap_prems_rl"
nipkow@1756
   579
       (implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1
nipkow@1756
   580
         (implies_elim (implies_elim major minor1) minor2))))
nipkow@1756
   581
  end;
nipkow@1756
   582
nipkow@3653
   583
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |]
nipkow@3653
   584
   ==> PROP ?phi == PROP ?psi
wenzelm@8328
   585
   Introduction rule for == as a meta-theorem.
nipkow@3653
   586
*)
nipkow@3653
   587
val equal_intr_rule =
paulson@4610
   588
  let val PQ = read_prop "PROP phi ==> PROP psi"
paulson@4610
   589
      and QP = read_prop "PROP psi ==> PROP phi"
wenzelm@4016
   590
  in
wenzelm@9455
   591
    store_standard_thm "equal_intr_rule"
wenzelm@4016
   592
      (implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP))))
nipkow@3653
   593
  end;
nipkow@3653
   594
wenzelm@4285
   595
wenzelm@9554
   596
(*(PROP ?phi ==> (!!x. PROP ?psi(x))) == (!!x. PROP ?phi ==> PROP ?psi(x))
wenzelm@9554
   597
  Rewrite rule for HHF normalization.
wenzelm@9554
   598
wenzelm@9554
   599
  Note: the syntax of ProtoPure is insufficient to handle this
wenzelm@9554
   600
  statement; storing it would be asking for trouble, e.g. when someone
wenzelm@9554
   601
  tries to print the theory later.
wenzelm@9554
   602
*)
wenzelm@9554
   603
wenzelm@9554
   604
val norm_hhf_eq =
wenzelm@9554
   605
  let
wenzelm@9554
   606
    val cert = Thm.cterm_of proto_sign;
wenzelm@9554
   607
    val aT = TFree ("'a", Term.logicS);
wenzelm@9554
   608
    val all = Term.all aT;
wenzelm@9554
   609
    val x = Free ("x", aT);
wenzelm@9554
   610
    val phi = Free ("phi", propT);
wenzelm@9554
   611
    val psi = Free ("psi", aT --> propT);
wenzelm@9554
   612
wenzelm@9554
   613
    val cx = cert x;
wenzelm@9554
   614
    val cphi = cert phi;
wenzelm@9554
   615
    val lhs = cert (Logic.mk_implies (phi, all $ Abs ("x", aT, psi $ Bound 0)));
wenzelm@9554
   616
    val rhs = cert (all $ Abs ("x", aT, Logic.mk_implies (phi, psi $ Bound 0)));
wenzelm@9554
   617
  in
wenzelm@9554
   618
    Thm.equal_intr
wenzelm@9554
   619
      (Thm.implies_elim (Thm.assume lhs) (Thm.assume cphi)
wenzelm@9554
   620
        |> Thm.forall_elim cx
wenzelm@9554
   621
        |> Thm.implies_intr cphi
wenzelm@9554
   622
        |> Thm.forall_intr cx
wenzelm@9554
   623
        |> Thm.implies_intr lhs)
wenzelm@9554
   624
      (Thm.implies_elim
wenzelm@9554
   625
          (Thm.assume rhs |> Thm.forall_elim cx) (Thm.assume cphi)
wenzelm@9554
   626
        |> Thm.forall_intr cx
wenzelm@9554
   627
        |> Thm.implies_intr cphi
wenzelm@9554
   628
        |> Thm.implies_intr rhs)
wenzelm@9554
   629
    |> standard |> curry Thm.name_thm "ProtoPure.norm_hhf_eq"
wenzelm@9554
   630
  end;
wenzelm@9554
   631
wenzelm@9554
   632
paulson@8129
   633
(*** Instantiate theorem th, reading instantiations under signature sg ****)
paulson@8129
   634
paulson@8129
   635
(*Version that normalizes the result: Thm.instantiate no longer does that*)
paulson@8129
   636
fun instantiate instpair th = Thm.instantiate instpair th  COMP   asm_rl;
paulson@8129
   637
paulson@8129
   638
fun read_instantiate_sg sg sinsts th =
paulson@8129
   639
    let val ts = types_sorts th;
paulson@8129
   640
        val used = add_term_tvarnames(#prop(rep_thm th),[]);
paulson@8129
   641
    in  instantiate (read_insts sg ts ts used sinsts) th  end;
paulson@8129
   642
paulson@8129
   643
(*Instantiate theorem th, reading instantiations under theory of th*)
paulson@8129
   644
fun read_instantiate sinsts th =
paulson@8129
   645
    read_instantiate_sg (#sign (rep_thm th)) sinsts th;
paulson@8129
   646
paulson@8129
   647
paulson@8129
   648
(*Left-to-right replacements: tpairs = [...,(vi,ti),...].
paulson@8129
   649
  Instantiates distinct Vars by terms, inferring type instantiations. *)
paulson@8129
   650
local
paulson@8129
   651
  fun add_types ((ct,cu), (sign,tye,maxidx)) =
paulson@8129
   652
    let val {sign=signt, t=t, T= T, maxidx=maxt,...} = rep_cterm ct
paulson@8129
   653
        and {sign=signu, t=u, T= U, maxidx=maxu,...} = rep_cterm cu;
paulson@8129
   654
        val maxi = Int.max(maxidx, Int.max(maxt, maxu));
paulson@8129
   655
        val sign' = Sign.merge(sign, Sign.merge(signt, signu))
paulson@8129
   656
        val (tye',maxi') = Type.unify (#tsig(Sign.rep_sg sign')) maxi tye (T,U)
paulson@8129
   657
          handle Type.TUNIFY => raise TYPE("add_types", [T,U], [t,u])
paulson@8129
   658
    in  (sign', tye', maxi')  end;
paulson@8129
   659
in
paulson@8129
   660
fun cterm_instantiate ctpairs0 th =
berghofe@8406
   661
  let val (sign,tye,_) = foldr add_types (ctpairs0, (#sign(rep_thm th), Vartab.empty, 0))
paulson@8129
   662
      val tsig = #tsig(Sign.rep_sg sign);
berghofe@8406
   663
      fun instT(ct,cu) = let val inst = subst_TVars_Vartab tye
paulson@8129
   664
                         in (cterm_fun inst ct, cterm_fun inst cu) end
paulson@8129
   665
      fun ctyp2 (ix,T) = (ix, ctyp_of sign T)
berghofe@8406
   666
  in  instantiate (map ctyp2 (Vartab.dest tye), map instT ctpairs0) th  end
paulson@8129
   667
  handle TERM _ =>
paulson@8129
   668
           raise THM("cterm_instantiate: incompatible signatures",0,[th])
paulson@8129
   669
       | TYPE (msg, _, _) => raise THM(msg, 0, [th])
paulson@8129
   670
end;
paulson@8129
   671
paulson@8129
   672
paulson@8129
   673
(** Derived rules mainly for METAHYPS **)
paulson@8129
   674
paulson@8129
   675
(*Given the term "a", takes (%x.t)==(%x.u) to t[a/x]==u[a/x]*)
paulson@8129
   676
fun equal_abs_elim ca eqth =
paulson@8129
   677
  let val {sign=signa, t=a, ...} = rep_cterm ca
paulson@8129
   678
      and combth = combination eqth (reflexive ca)
paulson@8129
   679
      val {sign,prop,...} = rep_thm eqth
paulson@8129
   680
      val (abst,absu) = Logic.dest_equals prop
paulson@8129
   681
      val cterm = cterm_of (Sign.merge (sign,signa))
paulson@8129
   682
  in  transitive (symmetric (beta_conversion (cterm (abst$a))))
paulson@8129
   683
           (transitive combth (beta_conversion (cterm (absu$a))))
paulson@8129
   684
  end
paulson@8129
   685
  handle THM _ => raise THM("equal_abs_elim", 0, [eqth]);
paulson@8129
   686
paulson@8129
   687
(*Calling equal_abs_elim with multiple terms*)
paulson@8129
   688
fun equal_abs_elim_list cts th = foldr (uncurry equal_abs_elim) (rev cts, th);
paulson@8129
   689
paulson@8129
   690
local
paulson@8129
   691
  val alpha = TVar(("'a",0), [])     (*  type ?'a::{}  *)
paulson@8129
   692
  fun err th = raise THM("flexpair_inst: ", 0, [th])
paulson@8129
   693
  fun flexpair_inst def th =
paulson@8129
   694
    let val {prop = Const _ $ t $ u,  sign,...} = rep_thm th
paulson@8129
   695
        val cterm = cterm_of sign
paulson@8129
   696
        fun cvar a = cterm(Var((a,0),alpha))
paulson@8129
   697
        val def' = cterm_instantiate [(cvar"t", cterm t), (cvar"u", cterm u)]
paulson@8129
   698
                   def
paulson@8129
   699
    in  equal_elim def' th
paulson@8129
   700
    end
paulson@8129
   701
    handle THM _ => err th | Bind => err th
paulson@8129
   702
in
paulson@8129
   703
val flexpair_intr = flexpair_inst (symmetric ProtoPure.flexpair_def)
paulson@8129
   704
and flexpair_elim = flexpair_inst ProtoPure.flexpair_def
paulson@8129
   705
end;
paulson@8129
   706
paulson@8129
   707
(*Version for flexflex pairs -- this supports lifting.*)
paulson@8129
   708
fun flexpair_abs_elim_list cts =
paulson@8129
   709
    flexpair_intr o equal_abs_elim_list cts o flexpair_elim;
paulson@8129
   710
paulson@8129
   711
paulson@8129
   712
(*** GOAL (PROP A) <==> PROP A ***)
wenzelm@4789
   713
wenzelm@4789
   714
local
wenzelm@4789
   715
  val A = read_prop "PROP A";
wenzelm@4789
   716
  val G = read_prop "GOAL (PROP A)";
wenzelm@4789
   717
  val (G_def, _) = freeze_thaw ProtoPure.Goal_def;
wenzelm@4789
   718
in
wenzelm@9455
   719
  val triv_goal = store_thm "triv_goal"
wenzelm@9455
   720
    (tag_rule internal_tag (standard (Thm.equal_elim (Thm.symmetric G_def) (Thm.assume A))));
wenzelm@9455
   721
  val rev_triv_goal = store_thm "rev_triv_goal"
wenzelm@9455
   722
    (tag_rule internal_tag (standard (Thm.equal_elim G_def (Thm.assume G))));
wenzelm@4789
   723
end;
wenzelm@4789
   724
wenzelm@9460
   725
val mk_cgoal = Thm.capply (Thm.cterm_of proto_sign Logic.goal_const);
wenzelm@6995
   726
fun assume_goal ct = Thm.assume (mk_cgoal ct) RS rev_triv_goal;
wenzelm@6995
   727
wenzelm@4789
   728
wenzelm@4285
   729
wenzelm@5688
   730
(** variations on instantiate **)
wenzelm@4285
   731
paulson@8550
   732
(*shorthand for instantiating just one variable in the current theory*)
paulson@8550
   733
fun inst x t = read_instantiate_sg (sign_of (the_context())) [(x,t)];
paulson@8550
   734
paulson@8550
   735
wenzelm@4285
   736
(* collect vars *)
wenzelm@4285
   737
wenzelm@4285
   738
val add_tvarsT = foldl_atyps (fn (vs, TVar v) => v ins vs | (vs, _) => vs);
wenzelm@4285
   739
val add_tvars = foldl_types add_tvarsT;
wenzelm@4285
   740
val add_vars = foldl_aterms (fn (vs, Var v) => v ins vs | (vs, _) => vs);
wenzelm@4285
   741
wenzelm@5903
   742
fun tvars_of_terms ts = rev (foldl add_tvars ([], ts));
wenzelm@5903
   743
fun vars_of_terms ts = rev (foldl add_vars ([], ts));
wenzelm@5903
   744
wenzelm@5903
   745
fun tvars_of thm = tvars_of_terms [#prop (Thm.rep_thm thm)];
wenzelm@5903
   746
fun vars_of thm = vars_of_terms [#prop (Thm.rep_thm thm)];
wenzelm@4285
   747
wenzelm@4285
   748
wenzelm@4285
   749
(* instantiate by left-to-right occurrence of variables *)
wenzelm@4285
   750
wenzelm@4285
   751
fun instantiate' cTs cts thm =
wenzelm@4285
   752
  let
wenzelm@4285
   753
    fun err msg =
wenzelm@4285
   754
      raise TYPE ("instantiate': " ^ msg,
wenzelm@4285
   755
        mapfilter (apsome Thm.typ_of) cTs,
wenzelm@4285
   756
        mapfilter (apsome Thm.term_of) cts);
wenzelm@4285
   757
wenzelm@4285
   758
    fun inst_of (v, ct) =
wenzelm@4285
   759
      (Thm.cterm_of (#sign (Thm.rep_cterm ct)) (Var v), ct)
wenzelm@4285
   760
        handle TYPE (msg, _, _) => err msg;
wenzelm@4285
   761
wenzelm@4285
   762
    fun zip_vars _ [] = []
wenzelm@4285
   763
      | zip_vars (_ :: vs) (None :: opt_ts) = zip_vars vs opt_ts
wenzelm@4285
   764
      | zip_vars (v :: vs) (Some t :: opt_ts) = (v, t) :: zip_vars vs opt_ts
wenzelm@4285
   765
      | zip_vars [] _ = err "more instantiations than variables in thm";
wenzelm@4285
   766
wenzelm@4285
   767
    (*instantiate types first!*)
wenzelm@4285
   768
    val thm' =
wenzelm@4285
   769
      if forall is_none cTs then thm
wenzelm@4285
   770
      else Thm.instantiate (zip_vars (map fst (tvars_of thm)) cTs, []) thm;
wenzelm@4285
   771
    in
wenzelm@4285
   772
      if forall is_none cts then thm'
wenzelm@4285
   773
      else Thm.instantiate ([], map inst_of (zip_vars (vars_of thm') cts)) thm'
wenzelm@4285
   774
    end;
wenzelm@4285
   775
wenzelm@4285
   776
wenzelm@5688
   777
(* unvarify(T) *)
wenzelm@5688
   778
wenzelm@5688
   779
(*assume thm in standard form, i.e. no frees, 0 var indexes*)
wenzelm@5688
   780
wenzelm@5688
   781
fun unvarifyT thm =
wenzelm@5688
   782
  let
wenzelm@5688
   783
    val cT = Thm.ctyp_of (Thm.sign_of_thm thm);
wenzelm@5688
   784
    val tfrees = map (fn ((x, _), S) => Some (cT (TFree (x, S)))) (tvars_of thm);
wenzelm@5688
   785
  in instantiate' tfrees [] thm end;
wenzelm@5688
   786
wenzelm@5688
   787
fun unvarify raw_thm =
wenzelm@5688
   788
  let
wenzelm@5688
   789
    val thm = unvarifyT raw_thm;
wenzelm@5688
   790
    val ct = Thm.cterm_of (Thm.sign_of_thm thm);
wenzelm@5688
   791
    val frees = map (fn ((x, _), T) => Some (ct (Free (x, T)))) (vars_of thm);
wenzelm@5688
   792
  in instantiate' [] frees thm end;
wenzelm@5688
   793
wenzelm@5688
   794
wenzelm@8605
   795
(* tvars_intr_list *)
wenzelm@8605
   796
wenzelm@8605
   797
fun tfrees_of thm =
wenzelm@8605
   798
  let val {hyps, prop, ...} = Thm.rep_thm thm
wenzelm@8605
   799
  in foldr Term.add_term_tfree_names (prop :: hyps, []) end;
wenzelm@8605
   800
wenzelm@8605
   801
fun tvars_intr_list tfrees thm =
wenzelm@8605
   802
  Thm.varifyT' (tfrees_of thm \\ tfrees) thm;
wenzelm@8605
   803
wenzelm@8605
   804
wenzelm@6435
   805
(* increment var indexes *)
wenzelm@6435
   806
wenzelm@6435
   807
fun incr_indexes 0 thm = thm
wenzelm@6435
   808
  | incr_indexes inc thm =
wenzelm@6435
   809
      let
wenzelm@6435
   810
        val sign = Thm.sign_of_thm thm;
wenzelm@6435
   811
wenzelm@6435
   812
        fun inc_tvar ((x, i), S) = Some (Thm.ctyp_of sign (TVar ((x, i + inc), S)));
wenzelm@6435
   813
        fun inc_var ((x, i), T) = Some (Thm.cterm_of sign (Var ((x, i + inc), T)));
wenzelm@6930
   814
        val thm' = instantiate' (map inc_tvar (tvars_of thm)) [] thm;
wenzelm@6930
   815
        val thm'' = instantiate' [] (map inc_var (vars_of thm')) thm';
wenzelm@6930
   816
      in thm'' end;
wenzelm@6435
   817
wenzelm@6435
   818
fun incr_indexes_wrt is cTs cts thms =
wenzelm@6435
   819
  let
wenzelm@6435
   820
    val maxidx =
wenzelm@6435
   821
      foldl Int.max (~1, is @
wenzelm@6435
   822
        map (maxidx_of_typ o #T o Thm.rep_ctyp) cTs @
wenzelm@6435
   823
        map (#maxidx o Thm.rep_cterm) cts @
wenzelm@6435
   824
        map (#maxidx o Thm.rep_thm) thms);
wenzelm@6435
   825
  in incr_indexes (maxidx + 1) end;
wenzelm@6435
   826
wenzelm@6435
   827
wenzelm@8328
   828
(* freeze_all *)
wenzelm@8328
   829
wenzelm@8328
   830
(*freeze all (T)Vars; assumes thm in standard form*)
wenzelm@8328
   831
wenzelm@8328
   832
fun freeze_all_TVars thm =
wenzelm@8328
   833
  (case tvars_of thm of
wenzelm@8328
   834
    [] => thm
wenzelm@8328
   835
  | tvars =>
wenzelm@8328
   836
      let val cert = Thm.ctyp_of (Thm.sign_of_thm thm)
wenzelm@8328
   837
      in instantiate' (map (fn ((x, _), S) => Some (cert (TFree (x, S)))) tvars) [] thm end);
wenzelm@8328
   838
wenzelm@8328
   839
fun freeze_all_Vars thm =
wenzelm@8328
   840
  (case vars_of thm of
wenzelm@8328
   841
    [] => thm
wenzelm@8328
   842
  | vars =>
wenzelm@8328
   843
      let val cert = Thm.cterm_of (Thm.sign_of_thm thm)
wenzelm@8328
   844
      in instantiate' [] (map (fn ((x, _), T) => Some (cert (Free (x, T)))) vars) thm end);
wenzelm@8328
   845
wenzelm@8328
   846
val freeze_all = freeze_all_Vars o freeze_all_TVars;
wenzelm@8328
   847
wenzelm@8328
   848
wenzelm@5688
   849
(* mk_triv_goal *)
wenzelm@5688
   850
wenzelm@5688
   851
(*make an initial proof state, "PROP A ==> (PROP A)" *)
paulson@5311
   852
fun mk_triv_goal ct = instantiate' [] [Some ct] triv_goal;
paulson@5311
   853
wenzelm@5688
   854
clasohm@0
   855
end;
wenzelm@252
   856
wenzelm@5903
   857
wenzelm@5903
   858
structure BasicDrule: BASIC_DRULE = Drule;
wenzelm@5903
   859
open BasicDrule;