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