src/Pure/drule.ML
author wenzelm
Tue Jul 04 19:49:50 2006 +0200 (2006-07-04)
changeset 19999 9592df0c3176
parent 19906 c23a0e65b285
child 20077 4fc9a4fef219
permissions -rw-r--r--
added generalize;
removed obsolete assume_ax, tvars_intr_list;
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
berghofe@13606
     9
infix 0 RS RSN RL RLN MRS MRL OF COMP;
clasohm@0
    10
wenzelm@5903
    11
signature BASIC_DRULE =
wenzelm@3766
    12
sig
wenzelm@18179
    13
  val mk_implies: cterm * cterm -> cterm
wenzelm@18179
    14
  val list_implies: cterm list * cterm -> cterm
wenzelm@18179
    15
  val dest_implies: cterm -> cterm * cterm
wenzelm@18179
    16
  val dest_equals: cterm -> cterm * cterm
wenzelm@18179
    17
  val strip_imp_prems: cterm -> cterm list
wenzelm@18179
    18
  val strip_imp_concl: cterm -> cterm
wenzelm@18179
    19
  val cprems_of: thm -> cterm list
wenzelm@18179
    20
  val cterm_fun: (term -> term) -> (cterm -> cterm)
wenzelm@18179
    21
  val ctyp_fun: (typ -> typ) -> (ctyp -> ctyp)
wenzelm@18206
    22
  val read_insts: theory -> (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@18206
    23
    (indexname -> typ option) * (indexname -> sort option) -> string list ->
wenzelm@18206
    24
    (indexname * string) list -> (ctyp * ctyp) list * (cterm * cterm) list
wenzelm@4285
    25
  val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option)
wenzelm@18179
    26
  val strip_shyps_warning: thm -> thm
wenzelm@18179
    27
  val forall_intr_list: cterm list -> thm -> thm
wenzelm@18179
    28
  val forall_intr_frees: thm -> thm
wenzelm@18179
    29
  val forall_intr_vars: thm -> thm
wenzelm@18179
    30
  val forall_elim_list: cterm list -> thm -> thm
wenzelm@18179
    31
  val forall_elim_var: int -> thm -> thm
wenzelm@18179
    32
  val forall_elim_vars: int -> thm -> thm
wenzelm@18179
    33
  val gen_all: thm -> thm
wenzelm@18179
    34
  val lift_all: cterm -> thm -> thm
wenzelm@18179
    35
  val freeze_thaw: thm -> thm * (thm -> thm)
paulson@15495
    36
  val freeze_thaw_robust: thm -> thm * (int -> thm -> thm)
wenzelm@18179
    37
  val implies_elim_list: thm -> thm list -> thm
wenzelm@18179
    38
  val implies_intr_list: cterm list -> thm -> thm
wenzelm@18206
    39
  val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm
wenzelm@18179
    40
  val zero_var_indexes: thm -> thm
wenzelm@18179
    41
  val implies_intr_hyps: thm -> thm
wenzelm@18179
    42
  val standard: thm -> thm
wenzelm@18179
    43
  val standard': thm -> thm
wenzelm@18179
    44
  val rotate_prems: int -> thm -> thm
wenzelm@18179
    45
  val rearrange_prems: int list -> thm -> thm
wenzelm@18179
    46
  val RSN: thm * (int * thm) -> thm
wenzelm@18179
    47
  val RS: thm * thm -> thm
wenzelm@18179
    48
  val RLN: thm list * (int * thm list) -> thm list
wenzelm@18179
    49
  val RL: thm list * thm list -> thm list
wenzelm@18179
    50
  val MRS: thm list * thm -> thm
wenzelm@18179
    51
  val MRL: thm list list * thm list -> thm list
wenzelm@18179
    52
  val OF: thm * thm list -> thm
wenzelm@18179
    53
  val compose: thm * int * thm -> thm list
wenzelm@18179
    54
  val COMP: thm * thm -> thm
wenzelm@16425
    55
  val read_instantiate_sg: theory -> (string*string)list -> thm -> thm
wenzelm@18179
    56
  val read_instantiate: (string*string)list -> thm -> thm
wenzelm@18179
    57
  val cterm_instantiate: (cterm*cterm)list -> thm -> thm
wenzelm@18179
    58
  val eq_thm_thy: thm * thm -> bool
wenzelm@18179
    59
  val eq_thm_prop: thm * thm -> bool
wenzelm@19878
    60
  val equiv_thm: thm * thm -> bool
wenzelm@18179
    61
  val size_of_thm: thm -> int
wenzelm@18179
    62
  val reflexive_thm: thm
wenzelm@18179
    63
  val symmetric_thm: thm
wenzelm@18179
    64
  val transitive_thm: thm
wenzelm@18179
    65
  val symmetric_fun: thm -> thm
wenzelm@18179
    66
  val extensional: thm -> thm
wenzelm@18820
    67
  val equals_cong: thm
wenzelm@18179
    68
  val imp_cong: thm
wenzelm@18179
    69
  val swap_prems_eq: thm
wenzelm@18179
    70
  val equal_abs_elim: cterm  -> thm -> thm
wenzelm@4285
    71
  val equal_abs_elim_list: cterm list -> thm -> thm
wenzelm@18179
    72
  val asm_rl: thm
wenzelm@18179
    73
  val cut_rl: thm
wenzelm@18179
    74
  val revcut_rl: thm
wenzelm@18179
    75
  val thin_rl: thm
wenzelm@4285
    76
  val triv_forall_equality: thm
wenzelm@19051
    77
  val distinct_prems_rl: thm
wenzelm@18179
    78
  val swap_prems_rl: thm
wenzelm@18179
    79
  val equal_intr_rule: thm
wenzelm@18179
    80
  val equal_elim_rule1: thm
wenzelm@19421
    81
  val equal_elim_rule2: thm
wenzelm@18179
    82
  val inst: string -> string -> thm -> thm
wenzelm@18179
    83
  val instantiate': ctyp option list -> cterm option list -> thm -> thm
wenzelm@5903
    84
end;
wenzelm@5903
    85
wenzelm@5903
    86
signature DRULE =
wenzelm@5903
    87
sig
wenzelm@5903
    88
  include BASIC_DRULE
wenzelm@19999
    89
  val generalize: string list * string list -> thm -> thm
wenzelm@19421
    90
  val dest_binop: cterm -> cterm * cterm
paulson@15949
    91
  val list_comb: cterm * cterm list -> cterm
berghofe@12908
    92
  val strip_comb: cterm -> cterm * cterm list
berghofe@15262
    93
  val strip_type: ctyp -> ctyp list * ctyp
paulson@15949
    94
  val beta_conv: cterm -> cterm -> cterm
wenzelm@15875
    95
  val plain_prop_of: thm -> term
wenzelm@15669
    96
  val add_used: thm -> string list -> string list
berghofe@17713
    97
  val flexflex_unique: thm -> thm
wenzelm@11975
    98
  val close_derivation: thm -> thm
wenzelm@12005
    99
  val local_standard: thm -> thm
wenzelm@19421
   100
  val store_thm: bstring -> thm -> thm
wenzelm@19421
   101
  val store_standard_thm: bstring -> thm -> thm
wenzelm@19421
   102
  val store_thm_open: bstring -> thm -> thm
wenzelm@19421
   103
  val store_standard_thm_open: bstring -> thm -> thm
wenzelm@11975
   104
  val compose_single: thm * int * thm -> thm
wenzelm@12373
   105
  val add_rule: thm -> thm list -> thm list
wenzelm@12373
   106
  val del_rule: thm -> thm list -> thm list
wenzelm@11975
   107
  val merge_rules: thm list * thm list -> thm list
wenzelm@18468
   108
  val imp_cong_rule: thm -> thm -> thm
skalberg@15001
   109
  val beta_eta_conversion: cterm -> thm
berghofe@15925
   110
  val eta_long_conversion: cterm -> thm
wenzelm@18468
   111
  val forall_conv: int -> (cterm -> thm) -> cterm -> thm
wenzelm@18468
   112
  val concl_conv: int -> (cterm -> thm) -> cterm -> thm
wenzelm@18468
   113
  val prems_conv: int -> (int -> cterm -> thm) -> cterm -> thm
wenzelm@18179
   114
  val goals_conv: (int -> bool) -> (cterm -> thm) -> cterm -> thm
wenzelm@18179
   115
  val fconv_rule: (cterm -> thm) -> thm -> thm
wenzelm@11975
   116
  val norm_hhf_eq: thm
wenzelm@12800
   117
  val is_norm_hhf: term -> bool
wenzelm@16425
   118
  val norm_hhf: theory -> term -> term
wenzelm@19878
   119
  val unvarify: thm -> thm
wenzelm@18025
   120
  val protect: cterm -> cterm
wenzelm@18025
   121
  val protectI: thm
wenzelm@18025
   122
  val protectD: thm
wenzelm@18179
   123
  val protect_cong: thm
wenzelm@18025
   124
  val implies_intr_protected: cterm list -> thm -> thm
wenzelm@19775
   125
  val termI: thm
wenzelm@19775
   126
  val mk_term: cterm -> thm
wenzelm@19775
   127
  val dest_term: thm -> cterm
wenzelm@11975
   128
  val freeze_all: thm -> thm
wenzelm@11975
   129
  val tvars_of_terms: term list -> (indexname * sort) list
wenzelm@11975
   130
  val vars_of_terms: term list -> (indexname * typ) list
wenzelm@11975
   131
  val tvars_of: thm -> (indexname * sort) list
wenzelm@11975
   132
  val vars_of: thm -> (indexname * typ) list
wenzelm@18129
   133
  val tfrees_of: thm -> (string * sort) list
wenzelm@18129
   134
  val frees_of: thm -> (string * typ) list
wenzelm@19523
   135
  val sort_triv: theory -> typ * sort -> thm list
wenzelm@19504
   136
  val unconstrainTs: thm -> thm
wenzelm@18129
   137
  val fold_terms: (term -> 'a -> 'a) -> thm -> 'a -> 'a
berghofe@14081
   138
  val rename_bvars: (string * string) list -> thm -> thm
berghofe@14081
   139
  val rename_bvars': string option list -> thm -> thm
wenzelm@19124
   140
  val incr_indexes: thm -> thm -> thm
wenzelm@19124
   141
  val incr_indexes2: thm -> thm -> thm -> thm
wenzelm@12297
   142
  val remdups_rl: thm
wenzelm@18225
   143
  val multi_resolve: thm list -> thm -> thm Seq.seq
wenzelm@18225
   144
  val multi_resolves: thm list -> thm list -> thm Seq.seq
berghofe@13325
   145
  val abs_def: thm -> thm
wenzelm@16425
   146
  val read_instantiate_sg': theory -> (indexname * string) list -> thm -> thm
berghofe@15797
   147
  val read_instantiate': (indexname * string) list -> thm -> thm
wenzelm@3766
   148
end;
clasohm@0
   149
wenzelm@5903
   150
structure Drule: DRULE =
clasohm@0
   151
struct
clasohm@0
   152
wenzelm@3991
   153
wenzelm@16682
   154
(** some cterm->cterm operations: faster than calling cterm_of! **)
lcp@708
   155
wenzelm@19124
   156
fun dest_binop ct =
wenzelm@19124
   157
  let val (ct1, ct2) = Thm.dest_comb ct
wenzelm@19124
   158
  in (#2 (Thm.dest_comb ct1), ct2) end;
wenzelm@19124
   159
paulson@2004
   160
fun dest_implies ct =
wenzelm@16682
   161
  (case Thm.term_of ct of
wenzelm@19124
   162
    (Const ("==>", _) $ _ $ _) => dest_binop ct
wenzelm@16682
   163
  | _ => raise TERM ("dest_implies", [term_of ct]));
clasohm@1703
   164
berghofe@10414
   165
fun dest_equals ct =
wenzelm@16682
   166
  (case Thm.term_of ct of
wenzelm@19124
   167
    (Const ("==", _) $ _ $ _) => dest_binop ct
wenzelm@16682
   168
    | _ => raise TERM ("dest_equals", [term_of ct]));
berghofe@10414
   169
lcp@708
   170
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
paulson@2004
   171
fun strip_imp_prems ct =
paulson@2004
   172
    let val (cA,cB) = dest_implies ct
paulson@2004
   173
    in  cA :: strip_imp_prems cB  end
lcp@708
   174
    handle TERM _ => [];
lcp@708
   175
paulson@2004
   176
(* A1==>...An==>B  goes to B, where B is not an implication *)
paulson@2004
   177
fun strip_imp_concl ct =
wenzelm@8328
   178
    case term_of ct of (Const("==>", _) $ _ $ _) =>
wenzelm@10767
   179
        strip_imp_concl (#2 (Thm.dest_comb ct))
paulson@2004
   180
  | _ => ct;
paulson@2004
   181
lcp@708
   182
(*The premises of a theorem, as a cterm list*)
berghofe@13659
   183
val cprems_of = strip_imp_prems o cprop_of;
lcp@708
   184
berghofe@15797
   185
fun cterm_fun f ct =
wenzelm@16425
   186
  let val {t, thy, ...} = Thm.rep_cterm ct
wenzelm@16425
   187
  in Thm.cterm_of thy (f t) end;
berghofe@15797
   188
berghofe@15797
   189
fun ctyp_fun f cT =
wenzelm@16425
   190
  let val {T, thy, ...} = Thm.rep_ctyp cT
wenzelm@16425
   191
  in Thm.ctyp_of thy (f T) end;
berghofe@15797
   192
wenzelm@19421
   193
val cert = cterm_of ProtoPure.thy;
paulson@9547
   194
wenzelm@19421
   195
val implies = cert Term.implies;
wenzelm@19183
   196
fun mk_implies (A, B) = Thm.capply (Thm.capply implies A) B;
paulson@9547
   197
paulson@9547
   198
(*cterm version of list_implies: [A1,...,An], B  goes to [|A1;==>;An|]==>B *)
paulson@9547
   199
fun list_implies([], B) = B
paulson@9547
   200
  | list_implies(A::AS, B) = mk_implies (A, list_implies(AS,B));
paulson@9547
   201
paulson@15949
   202
(*cterm version of list_comb: maps  (f, [t1,...,tn])  to  f(t1,...,tn) *)
paulson@15949
   203
fun list_comb (f, []) = f
paulson@15949
   204
  | list_comb (f, t::ts) = list_comb (Thm.capply f t, ts);
paulson@15949
   205
berghofe@12908
   206
(*cterm version of strip_comb: maps  f(t1,...,tn)  to  (f, [t1,...,tn]) *)
wenzelm@18179
   207
fun strip_comb ct =
berghofe@12908
   208
  let
berghofe@12908
   209
    fun stripc (p as (ct, cts)) =
berghofe@12908
   210
      let val (ct1, ct2) = Thm.dest_comb ct
berghofe@12908
   211
      in stripc (ct1, ct2 :: cts) end handle CTERM _ => p
berghofe@12908
   212
  in stripc (ct, []) end;
berghofe@12908
   213
berghofe@15262
   214
(* cterm version of strip_type: maps  [T1,...,Tn]--->T  to   ([T1,T2,...,Tn], T) *)
berghofe@15262
   215
fun strip_type cT = (case Thm.typ_of cT of
berghofe@15262
   216
    Type ("fun", _) =>
berghofe@15262
   217
      let
berghofe@15262
   218
        val [cT1, cT2] = Thm.dest_ctyp cT;
berghofe@15262
   219
        val (cTs, cT') = strip_type cT2
berghofe@15262
   220
      in (cT1 :: cTs, cT') end
berghofe@15262
   221
  | _ => ([], cT));
berghofe@15262
   222
paulson@15949
   223
(*Beta-conversion for cterms, where x is an abstraction. Simply returns the rhs
paulson@15949
   224
  of the meta-equality returned by the beta_conversion rule.*)
wenzelm@18179
   225
fun beta_conv x y =
paulson@15949
   226
    #2 (Thm.dest_comb (cprop_of (Thm.beta_conversion false (Thm.capply x y))));
paulson@15949
   227
wenzelm@15875
   228
fun plain_prop_of raw_thm =
wenzelm@15875
   229
  let
wenzelm@15875
   230
    val thm = Thm.strip_shyps raw_thm;
wenzelm@15875
   231
    fun err msg = raise THM ("plain_prop_of: " ^ msg, 0, [thm]);
wenzelm@15875
   232
    val {hyps, prop, tpairs, ...} = Thm.rep_thm thm;
wenzelm@15875
   233
  in
wenzelm@15875
   234
    if not (null hyps) then
wenzelm@15875
   235
      err "theorem may not contain hypotheses"
wenzelm@15875
   236
    else if not (null (Thm.extra_shyps thm)) then
wenzelm@15875
   237
      err "theorem may not contain sort hypotheses"
wenzelm@15875
   238
    else if not (null tpairs) then
wenzelm@15875
   239
      err "theorem may not contain flex-flex pairs"
wenzelm@15875
   240
    else prop
wenzelm@15875
   241
  end;
wenzelm@15875
   242
wenzelm@15875
   243
lcp@708
   244
lcp@229
   245
(** reading of instantiations **)
lcp@229
   246
lcp@229
   247
fun absent ixn =
lcp@229
   248
  error("No such variable in term: " ^ Syntax.string_of_vname ixn);
lcp@229
   249
lcp@229
   250
fun inst_failure ixn =
lcp@229
   251
  error("Instantiation of " ^ Syntax.string_of_vname ixn ^ " fails");
lcp@229
   252
wenzelm@16425
   253
fun read_insts thy (rtypes,rsorts) (types,sorts) used insts =
wenzelm@10403
   254
let
berghofe@15442
   255
    fun is_tv ((a, _), _) =
berghofe@15442
   256
      (case Symbol.explode a of "'" :: _ => true | _ => false);
skalberg@15570
   257
    val (tvs, vs) = List.partition is_tv insts;
berghofe@15797
   258
    fun sort_of ixn = case rsorts ixn of SOME S => S | NONE => absent ixn;
berghofe@15442
   259
    fun readT (ixn, st) =
berghofe@15797
   260
        let val S = sort_of ixn;
wenzelm@16425
   261
            val T = Sign.read_typ (thy,sorts) st;
wenzelm@16425
   262
        in if Sign.typ_instance thy (T, TVar(ixn,S)) then (ixn,T)
nipkow@4281
   263
           else inst_failure ixn
nipkow@4281
   264
        end
nipkow@4281
   265
    val tye = map readT tvs;
nipkow@4281
   266
    fun mkty(ixn,st) = (case rtypes ixn of
skalberg@15531
   267
                          SOME T => (ixn,(st,typ_subst_TVars tye T))
skalberg@15531
   268
                        | NONE => absent ixn);
nipkow@4281
   269
    val ixnsTs = map mkty vs;
nipkow@4281
   270
    val ixns = map fst ixnsTs
nipkow@4281
   271
    and sTs  = map snd ixnsTs
wenzelm@16425
   272
    val (cts,tye2) = read_def_cterms(thy,types,sorts) used false sTs;
nipkow@4281
   273
    fun mkcVar(ixn,T) =
nipkow@4281
   274
        let val U = typ_subst_TVars tye2 T
wenzelm@16425
   275
        in cterm_of thy (Var(ixn,U)) end
nipkow@4281
   276
    val ixnTs = ListPair.zip(ixns, map snd sTs)
wenzelm@16425
   277
in (map (fn (ixn, T) => (ctyp_of thy (TVar (ixn, sort_of ixn)),
wenzelm@16425
   278
      ctyp_of thy T)) (tye2 @ tye),
nipkow@4281
   279
    ListPair.zip(map mkcVar ixnTs,cts))
nipkow@4281
   280
end;
lcp@229
   281
lcp@229
   282
wenzelm@252
   283
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term
clasohm@0
   284
     Used for establishing default types (of variables) and sorts (of
clasohm@0
   285
     type variables) when reading another term.
clasohm@0
   286
     Index -1 indicates that a (T)Free rather than a (T)Var is wanted.
clasohm@0
   287
***)
clasohm@0
   288
clasohm@0
   289
fun types_sorts thm =
wenzelm@15669
   290
    let val {prop, hyps, tpairs, ...} = Thm.rep_thm thm;
wenzelm@15669
   291
        (* bogus term! *)
wenzelm@18179
   292
        val big = Term.list_comb
paulson@15949
   293
                    (Term.list_comb (prop, hyps), Thm.terms_of_tpairs tpairs);
wenzelm@252
   294
        val vars = map dest_Var (term_vars big);
wenzelm@252
   295
        val frees = map dest_Free (term_frees big);
wenzelm@252
   296
        val tvars = term_tvars big;
wenzelm@252
   297
        val tfrees = term_tfrees big;
haftmann@17325
   298
        fun typ(a,i) = if i<0 then AList.lookup (op =) frees a else AList.lookup (op =) vars (a,i);
haftmann@17325
   299
        fun sort(a,i) = if i<0 then AList.lookup (op =) tfrees a else AList.lookup (op =) tvars (a,i);
clasohm@0
   300
    in (typ,sort) end;
clasohm@0
   301
wenzelm@15669
   302
fun add_used thm used =
wenzelm@15669
   303
  let val {prop, hyps, tpairs, ...} = Thm.rep_thm thm in
wenzelm@15669
   304
    add_term_tvarnames (prop, used)
wenzelm@15669
   305
    |> fold (curry add_term_tvarnames) hyps
wenzelm@15669
   306
    |> fold (curry add_term_tvarnames) (Thm.terms_of_tpairs tpairs)
wenzelm@15669
   307
  end;
wenzelm@15669
   308
wenzelm@7636
   309
wenzelm@9455
   310
clasohm@0
   311
(** Standardization of rules **)
clasohm@0
   312
wenzelm@18025
   313
(*vars in left-to-right order*)
wenzelm@18025
   314
fun tvars_of_terms ts = rev (fold Term.add_tvars ts []);
wenzelm@18025
   315
fun vars_of_terms ts = rev (fold Term.add_vars ts []);
wenzelm@18025
   316
fun tvars_of thm = tvars_of_terms [Thm.full_prop_of thm];
wenzelm@18025
   317
fun vars_of thm = vars_of_terms [Thm.full_prop_of thm];
wenzelm@18025
   318
wenzelm@18129
   319
fun fold_terms f th =
wenzelm@18129
   320
  let val {hyps, tpairs, prop, ...} = Thm.rep_thm th
wenzelm@18129
   321
  in f prop #> fold (fn (t, u) => f t #> f u) tpairs #> fold f hyps end;
wenzelm@18129
   322
wenzelm@18129
   323
fun tfrees_of th = rev (fold_terms Term.add_tfrees th []);
wenzelm@18129
   324
fun frees_of th = rev (fold_terms Term.add_frees th []);
wenzelm@18129
   325
wenzelm@19523
   326
wenzelm@19523
   327
(* type classes and sorts *)
wenzelm@19523
   328
wenzelm@19523
   329
fun sort_triv thy (T, S) =
wenzelm@19523
   330
  let
wenzelm@19523
   331
    val certT = Thm.ctyp_of thy;
wenzelm@19523
   332
    val cT = certT T;
wenzelm@19523
   333
    fun class_triv c =
wenzelm@19523
   334
      Thm.class_triv thy c
wenzelm@19523
   335
      |> Thm.instantiate ([(certT (TVar (("'a", 0), [c])), cT)], []);
wenzelm@19523
   336
  in map class_triv S end;
wenzelm@19523
   337
wenzelm@19504
   338
fun unconstrainTs th =
wenzelm@19504
   339
  fold_rev (Thm.unconstrainT o Thm.ctyp_of (Thm.theory_of_thm th) o TVar) (tvars_of th) th;
wenzelm@19504
   340
wenzelm@7636
   341
fun strip_shyps_warning thm =
wenzelm@7636
   342
  let
wenzelm@16425
   343
    val str_of_sort = Pretty.str_of o Sign.pretty_sort (Thm.theory_of_thm thm);
wenzelm@7636
   344
    val thm' = Thm.strip_shyps thm;
wenzelm@7636
   345
    val xshyps = Thm.extra_shyps thm';
wenzelm@7636
   346
  in
wenzelm@7636
   347
    if null xshyps then ()
wenzelm@7636
   348
    else warning ("Pending sort hypotheses: " ^ commas (map str_of_sort xshyps));
wenzelm@7636
   349
    thm'
wenzelm@7636
   350
  end;
wenzelm@7636
   351
wenzelm@19730
   352
(*Generalization over a list of variables*)
wenzelm@19730
   353
val forall_intr_list = fold_rev forall_intr;
clasohm@0
   354
clasohm@0
   355
(*Generalization over all suitable Free variables*)
clasohm@0
   356
fun forall_intr_frees th =
wenzelm@19730
   357
    let
wenzelm@19730
   358
      val {prop, hyps, tpairs, thy,...} = rep_thm th;
wenzelm@19730
   359
      val fixed = fold Term.add_frees (Thm.terms_of_tpairs tpairs @ hyps) [];
wenzelm@19730
   360
      val frees = Term.fold_aterms (fn Free v =>
wenzelm@19730
   361
        if member (op =) fixed v then I else insert (op =) v | _ => I) prop [];
wenzelm@19730
   362
    in fold (forall_intr o cterm_of thy o Free) frees th end;
clasohm@0
   363
wenzelm@18535
   364
(*Generalization over Vars -- canonical order*)
wenzelm@18535
   365
fun forall_intr_vars th =
wenzelm@18535
   366
  let val cert = Thm.cterm_of (Thm.theory_of_thm th)
wenzelm@18535
   367
  in forall_intr_list (map (cert o Var) (vars_of th)) th end;
wenzelm@18535
   368
wenzelm@7898
   369
val forall_elim_var = PureThy.forall_elim_var;
wenzelm@7898
   370
val forall_elim_vars = PureThy.forall_elim_vars;
clasohm@0
   371
wenzelm@18025
   372
fun outer_params t =
wenzelm@18025
   373
  let
wenzelm@18025
   374
    val vs = Term.strip_all_vars t;
wenzelm@19906
   375
    val clean_name = perhaps (try Term.dest_skolem) #> perhaps (try Term.dest_internal);
wenzelm@19842
   376
  in Term.variantlist (map (clean_name o #1) vs, []) ~~ map #2 vs end;
wenzelm@18025
   377
wenzelm@18025
   378
(*generalize outermost parameters*)
wenzelm@18025
   379
fun gen_all th =
wenzelm@12719
   380
  let
wenzelm@18025
   381
    val {thy, prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@18025
   382
    val cert = Thm.cterm_of thy;
wenzelm@18025
   383
    fun elim (x, T) = Thm.forall_elim (cert (Var ((x, maxidx + 1), T)));
wenzelm@18025
   384
  in fold elim (outer_params prop) th end;
wenzelm@18025
   385
wenzelm@18025
   386
(*lift vars wrt. outermost goal parameters
wenzelm@18118
   387
  -- reverses the effect of gen_all modulo higher-order unification*)
wenzelm@18025
   388
fun lift_all goal th =
wenzelm@18025
   389
  let
wenzelm@18025
   390
    val thy = Theory.merge (Thm.theory_of_cterm goal, Thm.theory_of_thm th);
wenzelm@18025
   391
    val cert = Thm.cterm_of thy;
wenzelm@19421
   392
    val maxidx = Thm.maxidx_of th;
wenzelm@18025
   393
    val ps = outer_params (Thm.term_of goal)
wenzelm@18025
   394
      |> map (fn (x, T) => Var ((x, maxidx + 1), Logic.incr_tvar (maxidx + 1) T));
wenzelm@18025
   395
    val Ts = map Term.fastype_of ps;
wenzelm@18025
   396
    val inst = vars_of th |> map (fn (xi, T) =>
wenzelm@18025
   397
      (cert (Var (xi, T)), cert (Term.list_comb (Var (xi, Ts ---> T), ps))));
wenzelm@18025
   398
  in
wenzelm@18025
   399
    th |> Thm.instantiate ([], inst)
wenzelm@18025
   400
    |> fold_rev (Thm.forall_intr o cert) ps
wenzelm@18025
   401
  end;
wenzelm@18025
   402
wenzelm@19999
   403
(*direct generalization*)
wenzelm@19999
   404
fun generalize names th = Thm.generalize names (Thm.maxidx_of th + 1) th;
wenzelm@9554
   405
wenzelm@16949
   406
(*specialization over a list of cterms*)
wenzelm@16949
   407
val forall_elim_list = fold forall_elim;
clasohm@0
   408
wenzelm@16949
   409
(*maps A1,...,An |- B  to  [| A1;...;An |] ==> B*)
wenzelm@16949
   410
val implies_intr_list = fold_rev implies_intr;
clasohm@0
   411
wenzelm@16949
   412
(*maps [| A1;...;An |] ==> B and [A1,...,An]  to  B*)
skalberg@15570
   413
fun implies_elim_list impth ths = Library.foldl (uncurry implies_elim) (impth,ths);
clasohm@0
   414
clasohm@0
   415
(*Reset Var indexes to zero, renaming to preserve distinctness*)
wenzelm@252
   416
fun zero_var_indexes th =
wenzelm@16949
   417
  let
wenzelm@16949
   418
    val thy = Thm.theory_of_thm th;
wenzelm@16949
   419
    val certT = Thm.ctyp_of thy and cert = Thm.cterm_of thy;
wenzelm@16949
   420
    val (instT, inst) = Term.zero_var_indexes_inst (Thm.full_prop_of th);
wenzelm@16949
   421
    val cinstT = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@16949
   422
    val cinst = map (fn (v, t) => (cert (Var v), cert t)) inst;
wenzelm@16949
   423
  in Thm.adjust_maxidx_thm (Thm.instantiate (cinstT, cinst) th) end;
clasohm@0
   424
clasohm@0
   425
paulson@14394
   426
(** Standard form of object-rule: no hypotheses, flexflex constraints,
paulson@14394
   427
    Frees, or outer quantifiers; all generality expressed by Vars of index 0.**)
wenzelm@10515
   428
wenzelm@16595
   429
(*Discharge all hypotheses.*)
wenzelm@16595
   430
fun implies_intr_hyps th =
wenzelm@16595
   431
  fold Thm.implies_intr (#hyps (Thm.crep_thm th)) th;
wenzelm@16595
   432
paulson@14394
   433
(*Squash a theorem's flexflex constraints provided it can be done uniquely.
paulson@14394
   434
  This step can lose information.*)
paulson@14387
   435
fun flexflex_unique th =
berghofe@17713
   436
  if null (tpairs_of th) then th else
wenzelm@19861
   437
    case Seq.chop 2 (flexflex_rule th) of
paulson@14387
   438
      ([th],_) => th
paulson@14387
   439
    | ([],_)   => raise THM("flexflex_unique: impossible constraints", 0, [th])
paulson@14387
   440
    |      _   => raise THM("flexflex_unique: multiple unifiers", 0, [th]);
paulson@14387
   441
wenzelm@10515
   442
fun close_derivation thm =
wenzelm@10515
   443
  if Thm.get_name_tags thm = ("", []) then Thm.name_thm ("", thm)
wenzelm@10515
   444
  else thm;
wenzelm@10515
   445
wenzelm@16949
   446
val standard' =
wenzelm@16949
   447
  implies_intr_hyps
wenzelm@16949
   448
  #> forall_intr_frees
wenzelm@19421
   449
  #> `Thm.maxidx_of
wenzelm@16949
   450
  #-> (fn maxidx =>
wenzelm@16949
   451
    forall_elim_vars (maxidx + 1)
wenzelm@16949
   452
    #> strip_shyps_warning
wenzelm@16949
   453
    #> zero_var_indexes
wenzelm@16949
   454
    #> Thm.varifyT
wenzelm@16949
   455
    #> Thm.compress);
wenzelm@1218
   456
wenzelm@16949
   457
val standard =
wenzelm@16949
   458
  flexflex_unique
wenzelm@16949
   459
  #> standard'
wenzelm@16949
   460
  #> close_derivation;
berghofe@11512
   461
wenzelm@16949
   462
val local_standard =
wenzelm@16949
   463
  strip_shyps
wenzelm@16949
   464
  #> zero_var_indexes
wenzelm@16949
   465
  #> Thm.compress
wenzelm@16949
   466
  #> close_derivation;
wenzelm@12005
   467
clasohm@0
   468
wenzelm@8328
   469
(*Convert all Vars in a theorem to Frees.  Also return a function for
paulson@4610
   470
  reversing that operation.  DOES NOT WORK FOR TYPE VARIABLES.
paulson@4610
   471
  Similar code in type/freeze_thaw*)
paulson@15495
   472
paulson@15495
   473
fun freeze_thaw_robust th =
wenzelm@19878
   474
 let val fth = Thm.freezeT th
wenzelm@16425
   475
     val {prop, tpairs, thy, ...} = rep_thm fth
paulson@15495
   476
 in
skalberg@15574
   477
   case foldr add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of
paulson@15495
   478
       [] => (fth, fn i => fn x => x)   (*No vars: nothing to do!*)
paulson@15495
   479
     | vars =>
paulson@19753
   480
         let fun newName (Var(ix,_)) = (ix, gensym (string_of_indexname ix))
paulson@19753
   481
             val alist = map newName vars
paulson@15495
   482
             fun mk_inst (Var(v,T)) =
wenzelm@16425
   483
                 (cterm_of thy (Var(v,T)),
haftmann@17325
   484
                  cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T)))
paulson@15495
   485
             val insts = map mk_inst vars
paulson@15495
   486
             fun thaw i th' = (*i is non-negative increment for Var indexes*)
paulson@15495
   487
                 th' |> forall_intr_list (map #2 insts)
paulson@15495
   488
                     |> forall_elim_list (map (Thm.cterm_incr_indexes i o #1) insts)
paulson@15495
   489
         in  (Thm.instantiate ([],insts) fth, thaw)  end
paulson@15495
   490
 end;
paulson@15495
   491
paulson@15495
   492
(*Basic version of the function above. No option to rename Vars apart in thaw.
wenzelm@19999
   493
  The Frees created from Vars have nice names. FIXME: does not check for
paulson@19753
   494
  clashes with variables in the assumptions, so delete and use freeze_thaw_robust instead?*)
paulson@4610
   495
fun freeze_thaw th =
wenzelm@19878
   496
 let val fth = Thm.freezeT th
wenzelm@16425
   497
     val {prop, tpairs, thy, ...} = rep_thm fth
paulson@7248
   498
 in
skalberg@15574
   499
   case foldr add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of
paulson@7248
   500
       [] => (fth, fn x => x)
paulson@7248
   501
     | vars =>
wenzelm@8328
   502
         let fun newName (Var(ix,_), (pairs,used)) =
wenzelm@8328
   503
                   let val v = variant used (string_of_indexname ix)
wenzelm@8328
   504
                   in  ((ix,v)::pairs, v::used)  end;
skalberg@15574
   505
             val (alist, _) = foldr newName ([], Library.foldr add_term_names
skalberg@15574
   506
               (prop :: Thm.terms_of_tpairs tpairs, [])) vars
wenzelm@8328
   507
             fun mk_inst (Var(v,T)) =
wenzelm@16425
   508
                 (cterm_of thy (Var(v,T)),
haftmann@17325
   509
                  cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T)))
wenzelm@8328
   510
             val insts = map mk_inst vars
wenzelm@8328
   511
             fun thaw th' =
wenzelm@8328
   512
                 th' |> forall_intr_list (map #2 insts)
wenzelm@8328
   513
                     |> forall_elim_list (map #1 insts)
wenzelm@8328
   514
         in  (Thm.instantiate ([],insts) fth, thaw)  end
paulson@7248
   515
 end;
paulson@4610
   516
paulson@7248
   517
(*Rotates a rule's premises to the left by k*)
paulson@7248
   518
val rotate_prems = permute_prems 0;
paulson@4610
   519
oheimb@11163
   520
(* permute prems, where the i-th position in the argument list (counting from 0)
oheimb@11163
   521
   gives the position within the original thm to be transferred to position i.
oheimb@11163
   522
   Any remaining trailing positions are left unchanged. *)
oheimb@11163
   523
val rearrange_prems = let
oheimb@11163
   524
  fun rearr new []      thm = thm
wenzelm@11815
   525
  |   rearr new (p::ps) thm = rearr (new+1)
oheimb@11163
   526
     (map (fn q => if new<=q andalso q<p then q+1 else q) ps)
oheimb@11163
   527
     (permute_prems (new+1) (new-p) (permute_prems new (p-new) thm))
oheimb@11163
   528
  in rearr 0 end;
paulson@4610
   529
wenzelm@252
   530
(*Resolution: exactly one resolvent must be produced.*)
clasohm@0
   531
fun tha RSN (i,thb) =
wenzelm@19861
   532
  case Seq.chop 2 (biresolution false [(false,tha)] i thb) of
clasohm@0
   533
      ([th],_) => th
clasohm@0
   534
    | ([],_)   => raise THM("RSN: no unifiers", i, [tha,thb])
clasohm@0
   535
    |      _   => raise THM("RSN: multiple unifiers", i, [tha,thb]);
clasohm@0
   536
clasohm@0
   537
(*resolution: P==>Q, Q==>R gives P==>R. *)
clasohm@0
   538
fun tha RS thb = tha RSN (1,thb);
clasohm@0
   539
clasohm@0
   540
(*For joining lists of rules*)
wenzelm@252
   541
fun thas RLN (i,thbs) =
clasohm@0
   542
  let val resolve = biresolution false (map (pair false) thas) i
wenzelm@4270
   543
      fun resb thb = Seq.list_of (resolve thb) handle THM _ => []
wenzelm@19482
   544
  in maps resb thbs end;
clasohm@0
   545
clasohm@0
   546
fun thas RL thbs = thas RLN (1,thbs);
clasohm@0
   547
lcp@11
   548
(*Resolve a list of rules against bottom_rl from right to left;
lcp@11
   549
  makes proof trees*)
wenzelm@252
   550
fun rls MRS bottom_rl =
lcp@11
   551
  let fun rs_aux i [] = bottom_rl
wenzelm@252
   552
        | rs_aux i (rl::rls) = rl RSN (i, rs_aux (i+1) rls)
lcp@11
   553
  in  rs_aux 1 rls  end;
lcp@11
   554
lcp@11
   555
(*As above, but for rule lists*)
wenzelm@252
   556
fun rlss MRL bottom_rls =
lcp@11
   557
  let fun rs_aux i [] = bottom_rls
wenzelm@252
   558
        | rs_aux i (rls::rlss) = rls RLN (i, rs_aux (i+1) rlss)
lcp@11
   559
  in  rs_aux 1 rlss  end;
lcp@11
   560
wenzelm@9288
   561
(*A version of MRS with more appropriate argument order*)
wenzelm@9288
   562
fun bottom_rl OF rls = rls MRS bottom_rl;
wenzelm@9288
   563
wenzelm@252
   564
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R
clasohm@0
   565
  with no lifting or renaming!  Q may contain ==> or meta-quants
clasohm@0
   566
  ALWAYS deletes premise i *)
wenzelm@252
   567
fun compose(tha,i,thb) =
wenzelm@4270
   568
    Seq.list_of (bicompose false (false,tha,0) i thb);
clasohm@0
   569
wenzelm@6946
   570
fun compose_single (tha,i,thb) =
wenzelm@6946
   571
  (case compose (tha,i,thb) of
wenzelm@6946
   572
    [th] => th
wenzelm@6946
   573
  | _ => raise THM ("compose: unique result expected", i, [tha,thb]));
wenzelm@6946
   574
clasohm@0
   575
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*)
clasohm@0
   576
fun tha COMP thb =
clasohm@0
   577
    case compose(tha,1,thb) of
wenzelm@252
   578
        [th] => th
clasohm@0
   579
      | _ =>   raise THM("COMP", 1, [tha,thb]);
clasohm@0
   580
wenzelm@13105
   581
wenzelm@4016
   582
(** theorem equality **)
clasohm@0
   583
wenzelm@16425
   584
(*True if the two theorems have the same theory.*)
wenzelm@16425
   585
val eq_thm_thy = eq_thy o pairself Thm.theory_of_thm;
paulson@13650
   586
paulson@13650
   587
(*True if the two theorems have the same prop field, ignoring hyps, der, etc.*)
wenzelm@16720
   588
val eq_thm_prop = op aconv o pairself Thm.full_prop_of;
clasohm@0
   589
clasohm@0
   590
(*Useful "distance" function for BEST_FIRST*)
wenzelm@16720
   591
val size_of_thm = size_of_term o Thm.full_prop_of;
clasohm@0
   592
wenzelm@9829
   593
(*maintain lists of theorems --- preserving canonical order*)
wenzelm@18922
   594
val del_rule = remove eq_thm_prop;
wenzelm@18922
   595
fun add_rule th = cons th o del_rule th;
wenzelm@18922
   596
val merge_rules = Library.merge eq_thm_prop;
wenzelm@9829
   597
wenzelm@19878
   598
(*pattern equivalence*)
wenzelm@19878
   599
fun equiv_thm ths =
wenzelm@19878
   600
  Pattern.equiv (Theory.merge (pairself Thm.theory_of_thm ths)) (pairself Thm.full_prop_of ths);
lcp@1194
   601
lcp@1194
   602
clasohm@0
   603
(*** Meta-Rewriting Rules ***)
clasohm@0
   604
wenzelm@16425
   605
fun read_prop s = read_cterm ProtoPure.thy (s, propT);
paulson@4610
   606
wenzelm@9455
   607
fun store_thm name thm = hd (PureThy.smart_store_thms (name, [thm]));
wenzelm@9455
   608
fun store_standard_thm name thm = store_thm name (standard thm);
wenzelm@12135
   609
fun store_thm_open name thm = hd (PureThy.smart_store_thms_open (name, [thm]));
wenzelm@12135
   610
fun store_standard_thm_open name thm = store_thm_open name (standard' thm);
wenzelm@4016
   611
clasohm@0
   612
val reflexive_thm =
wenzelm@19421
   613
  let val cx = cert (Var(("x",0),TVar(("'a",0),[])))
wenzelm@12135
   614
  in store_standard_thm_open "reflexive" (Thm.reflexive cx) end;
clasohm@0
   615
clasohm@0
   616
val symmetric_thm =
wenzelm@14854
   617
  let val xy = read_prop "x == y"
wenzelm@16595
   618
  in store_standard_thm_open "symmetric" (Thm.implies_intr xy (Thm.symmetric (Thm.assume xy))) end;
clasohm@0
   619
clasohm@0
   620
val transitive_thm =
wenzelm@14854
   621
  let val xy = read_prop "x == y"
wenzelm@14854
   622
      val yz = read_prop "y == z"
clasohm@0
   623
      val xythm = Thm.assume xy and yzthm = Thm.assume yz
wenzelm@12135
   624
  in store_standard_thm_open "transitive" (Thm.implies_intr yz (Thm.transitive xythm yzthm)) end;
clasohm@0
   625
nipkow@4679
   626
fun symmetric_fun thm = thm RS symmetric_thm;
nipkow@4679
   627
berghofe@11512
   628
fun extensional eq =
berghofe@11512
   629
  let val eq' =
berghofe@11512
   630
    abstract_rule "x" (snd (Thm.dest_comb (fst (dest_equals (cprop_of eq))))) eq
berghofe@11512
   631
  in equal_elim (eta_conversion (cprop_of eq')) eq' end;
berghofe@11512
   632
wenzelm@18820
   633
val equals_cong =
wenzelm@18820
   634
  store_standard_thm_open "equals_cong" (Thm.reflexive (read_prop "x == y"));
wenzelm@18820
   635
berghofe@10414
   636
val imp_cong =
berghofe@10414
   637
  let
berghofe@10414
   638
    val ABC = read_prop "PROP A ==> PROP B == PROP C"
berghofe@10414
   639
    val AB = read_prop "PROP A ==> PROP B"
berghofe@10414
   640
    val AC = read_prop "PROP A ==> PROP C"
berghofe@10414
   641
    val A = read_prop "PROP A"
berghofe@10414
   642
  in
wenzelm@12135
   643
    store_standard_thm_open "imp_cong" (implies_intr ABC (equal_intr
berghofe@10414
   644
      (implies_intr AB (implies_intr A
berghofe@10414
   645
        (equal_elim (implies_elim (assume ABC) (assume A))
berghofe@10414
   646
          (implies_elim (assume AB) (assume A)))))
berghofe@10414
   647
      (implies_intr AC (implies_intr A
berghofe@10414
   648
        (equal_elim (symmetric (implies_elim (assume ABC) (assume A)))
berghofe@10414
   649
          (implies_elim (assume AC) (assume A)))))))
berghofe@10414
   650
  end;
berghofe@10414
   651
berghofe@10414
   652
val swap_prems_eq =
berghofe@10414
   653
  let
berghofe@10414
   654
    val ABC = read_prop "PROP A ==> PROP B ==> PROP C"
berghofe@10414
   655
    val BAC = read_prop "PROP B ==> PROP A ==> PROP C"
berghofe@10414
   656
    val A = read_prop "PROP A"
berghofe@10414
   657
    val B = read_prop "PROP B"
berghofe@10414
   658
  in
wenzelm@12135
   659
    store_standard_thm_open "swap_prems_eq" (equal_intr
berghofe@10414
   660
      (implies_intr ABC (implies_intr B (implies_intr A
berghofe@10414
   661
        (implies_elim (implies_elim (assume ABC) (assume A)) (assume B)))))
berghofe@10414
   662
      (implies_intr BAC (implies_intr A (implies_intr B
berghofe@10414
   663
        (implies_elim (implies_elim (assume BAC) (assume B)) (assume A))))))
berghofe@10414
   664
  end;
lcp@229
   665
wenzelm@18468
   666
val imp_cong_rule = combination o combination (reflexive implies);
clasohm@0
   667
skalberg@15001
   668
local
skalberg@15001
   669
  val dest_eq = dest_equals o cprop_of
skalberg@15001
   670
  val rhs_of = snd o dest_eq
skalberg@15001
   671
in
skalberg@15001
   672
fun beta_eta_conversion t =
skalberg@15001
   673
  let val thm = beta_conversion true t
skalberg@15001
   674
  in transitive thm (eta_conversion (rhs_of thm)) end
skalberg@15001
   675
end;
skalberg@15001
   676
berghofe@15925
   677
fun eta_long_conversion ct = transitive (beta_eta_conversion ct)
berghofe@15925
   678
  (symmetric (beta_eta_conversion (cterm_fun (Pattern.eta_long []) ct)));
berghofe@15925
   679
wenzelm@18337
   680
val abs_def =
wenzelm@18337
   681
  let
wenzelm@18337
   682
    fun contract_lhs th =
wenzelm@18337
   683
      Thm.transitive (Thm.symmetric (beta_eta_conversion (fst (dest_equals (cprop_of th))))) th;
wenzelm@18777
   684
    fun abstract cx th = Thm.abstract_rule
wenzelm@18777
   685
        (case Thm.term_of cx of Var ((x, _), _) => x | Free (x, _) => x | _ => "x") cx th
wenzelm@18777
   686
      handle THM _ => raise THM ("Malformed definitional equation", 0, [th]);
wenzelm@18337
   687
  in
wenzelm@18337
   688
    contract_lhs
wenzelm@18337
   689
    #> `(snd o strip_comb o fst o dest_equals o cprop_of)
wenzelm@18337
   690
    #-> fold_rev abstract
wenzelm@18337
   691
    #> contract_lhs
wenzelm@18337
   692
  end;
wenzelm@18337
   693
wenzelm@18468
   694
(*rewrite B in !!x1 ... xn. B*)
wenzelm@18251
   695
fun forall_conv 0 cv ct = cv ct
wenzelm@18251
   696
  | forall_conv n cv ct =
wenzelm@18468
   697
      (case try Thm.dest_comb ct of
wenzelm@18468
   698
        NONE => cv ct
wenzelm@18468
   699
      | SOME (A, B) =>
wenzelm@18468
   700
          (case (term_of A, term_of B) of
wenzelm@18468
   701
            (Const ("all", _), Abs (x, _, _)) =>
wenzelm@18468
   702
              let val (v, B') = Thm.dest_abs (SOME (gensym "all_")) B in
wenzelm@18468
   703
                Thm.combination (Thm.reflexive A)
wenzelm@18468
   704
                  (Thm.abstract_rule x v (forall_conv (n - 1) cv B'))
wenzelm@18468
   705
              end
wenzelm@18468
   706
          | _ => cv ct));
wenzelm@18468
   707
wenzelm@18468
   708
(*rewrite B in A1 ==> ... ==> An ==> B*)
wenzelm@18468
   709
fun concl_conv 0 cv ct = cv ct
wenzelm@18468
   710
  | concl_conv n cv ct =
wenzelm@18468
   711
      (case try dest_implies ct of
wenzelm@18468
   712
        NONE => cv ct
wenzelm@18468
   713
      | SOME (A, B) => imp_cong_rule (reflexive A) (concl_conv (n - 1) cv B));
skalberg@15001
   714
wenzelm@18468
   715
(*rewrite the A's in A1 ==> ... ==> An ==> B*)
wenzelm@18468
   716
fun prems_conv 0 _ = reflexive
wenzelm@18468
   717
  | prems_conv n cv =
wenzelm@18468
   718
      let
wenzelm@18468
   719
        fun conv i ct =
wenzelm@18468
   720
          if i = n + 1 then reflexive ct
wenzelm@18468
   721
          else
wenzelm@18468
   722
            (case try dest_implies ct of
wenzelm@18468
   723
              NONE => reflexive ct
wenzelm@18468
   724
            | SOME (A, B) => imp_cong_rule (cv i A) (conv (i + 1) B));
wenzelm@18468
   725
  in conv 1 end;
wenzelm@18468
   726
wenzelm@18468
   727
fun goals_conv pred cv = prems_conv ~1 (fn i => if pred i then cv else reflexive);
skalberg@15001
   728
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th;
skalberg@15001
   729
wenzelm@18468
   730
wenzelm@15669
   731
(*** Some useful meta-theorems ***)
clasohm@0
   732
clasohm@0
   733
(*The rule V/V, obtains assumption solving for eresolve_tac*)
wenzelm@12135
   734
val asm_rl = store_standard_thm_open "asm_rl" (Thm.trivial (read_prop "PROP ?psi"));
wenzelm@7380
   735
val _ = store_thm "_" asm_rl;
clasohm@0
   736
clasohm@0
   737
(*Meta-level cut rule: [| V==>W; V |] ==> W *)
wenzelm@4016
   738
val cut_rl =
wenzelm@12135
   739
  store_standard_thm_open "cut_rl"
wenzelm@9455
   740
    (Thm.trivial (read_prop "PROP ?psi ==> PROP ?theta"));
clasohm@0
   741
wenzelm@252
   742
(*Generalized elim rule for one conclusion; cut_rl with reversed premises:
clasohm@0
   743
     [| PROP V;  PROP V ==> PROP W |] ==> PROP W *)
clasohm@0
   744
val revcut_rl =
paulson@4610
   745
  let val V = read_prop "PROP V"
paulson@4610
   746
      and VW = read_prop "PROP V ==> PROP W";
wenzelm@4016
   747
  in
wenzelm@12135
   748
    store_standard_thm_open "revcut_rl"
wenzelm@4016
   749
      (implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V))))
clasohm@0
   750
  end;
clasohm@0
   751
lcp@668
   752
(*for deleting an unwanted assumption*)
lcp@668
   753
val thin_rl =
paulson@4610
   754
  let val V = read_prop "PROP V"
paulson@4610
   755
      and W = read_prop "PROP W";
wenzelm@12135
   756
  in store_standard_thm_open "thin_rl" (implies_intr V (implies_intr W (assume W))) end;
lcp@668
   757
clasohm@0
   758
(* (!!x. PROP ?V) == PROP ?V       Allows removal of redundant parameters*)
clasohm@0
   759
val triv_forall_equality =
paulson@4610
   760
  let val V  = read_prop "PROP V"
paulson@4610
   761
      and QV = read_prop "!!x::'a. PROP V"
wenzelm@19421
   762
      and x  = cert (Free ("x", Term.aT []));
wenzelm@4016
   763
  in
wenzelm@12135
   764
    store_standard_thm_open "triv_forall_equality"
berghofe@11512
   765
      (equal_intr (implies_intr QV (forall_elim x (assume QV)))
berghofe@11512
   766
        (implies_intr V  (forall_intr x (assume V))))
clasohm@0
   767
  end;
clasohm@0
   768
wenzelm@19051
   769
(* (PROP ?Phi ==> PROP ?Phi ==> PROP ?Psi) ==>
wenzelm@19051
   770
   (PROP ?Phi ==> PROP ?Psi)
wenzelm@19051
   771
*)
wenzelm@19051
   772
val distinct_prems_rl =
wenzelm@19051
   773
  let
wenzelm@19051
   774
    val AAB = read_prop "PROP Phi ==> PROP Phi ==> PROP Psi"
wenzelm@19051
   775
    val A = read_prop "PROP Phi";
wenzelm@19051
   776
  in
wenzelm@19051
   777
    store_standard_thm_open "distinct_prems_rl"
wenzelm@19051
   778
      (implies_intr_list [AAB, A] (implies_elim_list (assume AAB) [assume A, assume A]))
wenzelm@19051
   779
  end;
wenzelm@19051
   780
nipkow@1756
   781
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==>
nipkow@1756
   782
   (PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi)
nipkow@1756
   783
   `thm COMP swap_prems_rl' swaps the first two premises of `thm'
nipkow@1756
   784
*)
nipkow@1756
   785
val swap_prems_rl =
paulson@4610
   786
  let val cmajor = read_prop "PROP PhiA ==> PROP PhiB ==> PROP Psi";
nipkow@1756
   787
      val major = assume cmajor;
paulson@4610
   788
      val cminor1 = read_prop "PROP PhiA";
nipkow@1756
   789
      val minor1 = assume cminor1;
paulson@4610
   790
      val cminor2 = read_prop "PROP PhiB";
nipkow@1756
   791
      val minor2 = assume cminor2;
wenzelm@12135
   792
  in store_standard_thm_open "swap_prems_rl"
nipkow@1756
   793
       (implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1
nipkow@1756
   794
         (implies_elim (implies_elim major minor1) minor2))))
nipkow@1756
   795
  end;
nipkow@1756
   796
nipkow@3653
   797
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |]
nipkow@3653
   798
   ==> PROP ?phi == PROP ?psi
wenzelm@8328
   799
   Introduction rule for == as a meta-theorem.
nipkow@3653
   800
*)
nipkow@3653
   801
val equal_intr_rule =
paulson@4610
   802
  let val PQ = read_prop "PROP phi ==> PROP psi"
paulson@4610
   803
      and QP = read_prop "PROP psi ==> PROP phi"
wenzelm@4016
   804
  in
wenzelm@12135
   805
    store_standard_thm_open "equal_intr_rule"
wenzelm@4016
   806
      (implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP))))
nipkow@3653
   807
  end;
nipkow@3653
   808
wenzelm@19421
   809
(* PROP ?phi == PROP ?psi ==> PROP ?phi ==> PROP ?psi *)
wenzelm@13368
   810
val equal_elim_rule1 =
wenzelm@13368
   811
  let val eq = read_prop "PROP phi == PROP psi"
wenzelm@13368
   812
      and P = read_prop "PROP phi"
wenzelm@13368
   813
  in store_standard_thm_open "equal_elim_rule1"
wenzelm@13368
   814
    (Thm.equal_elim (assume eq) (assume P) |> implies_intr_list [eq, P])
wenzelm@13368
   815
  end;
wenzelm@4285
   816
wenzelm@19421
   817
(* PROP ?psi == PROP ?phi ==> PROP ?phi ==> PROP ?psi *)
wenzelm@19421
   818
val equal_elim_rule2 =
wenzelm@19421
   819
  store_standard_thm_open "equal_elim_rule2" (symmetric_thm RS equal_elim_rule1);
wenzelm@19421
   820
wenzelm@12297
   821
(* "[| PROP ?phi; PROP ?phi; PROP ?psi |] ==> PROP ?psi" *)
wenzelm@12297
   822
val remdups_rl =
wenzelm@12297
   823
  let val P = read_prop "PROP phi" and Q = read_prop "PROP psi";
wenzelm@12297
   824
  in store_standard_thm_open "remdups_rl" (implies_intr_list [P, P, Q] (Thm.assume Q)) end;
wenzelm@12297
   825
wenzelm@12297
   826
wenzelm@9554
   827
(*(PROP ?phi ==> (!!x. PROP ?psi(x))) == (!!x. PROP ?phi ==> PROP ?psi(x))
wenzelm@12297
   828
  Rewrite rule for HHF normalization.*)
wenzelm@9554
   829
wenzelm@9554
   830
val norm_hhf_eq =
wenzelm@9554
   831
  let
wenzelm@14854
   832
    val aT = TFree ("'a", []);
wenzelm@9554
   833
    val all = Term.all aT;
wenzelm@9554
   834
    val x = Free ("x", aT);
wenzelm@9554
   835
    val phi = Free ("phi", propT);
wenzelm@9554
   836
    val psi = Free ("psi", aT --> propT);
wenzelm@9554
   837
wenzelm@9554
   838
    val cx = cert x;
wenzelm@9554
   839
    val cphi = cert phi;
wenzelm@9554
   840
    val lhs = cert (Logic.mk_implies (phi, all $ Abs ("x", aT, psi $ Bound 0)));
wenzelm@9554
   841
    val rhs = cert (all $ Abs ("x", aT, Logic.mk_implies (phi, psi $ Bound 0)));
wenzelm@9554
   842
  in
wenzelm@9554
   843
    Thm.equal_intr
wenzelm@9554
   844
      (Thm.implies_elim (Thm.assume lhs) (Thm.assume cphi)
wenzelm@9554
   845
        |> Thm.forall_elim cx
wenzelm@9554
   846
        |> Thm.implies_intr cphi
wenzelm@9554
   847
        |> Thm.forall_intr cx
wenzelm@9554
   848
        |> Thm.implies_intr lhs)
wenzelm@9554
   849
      (Thm.implies_elim
wenzelm@9554
   850
          (Thm.assume rhs |> Thm.forall_elim cx) (Thm.assume cphi)
wenzelm@9554
   851
        |> Thm.forall_intr cx
wenzelm@9554
   852
        |> Thm.implies_intr cphi
wenzelm@9554
   853
        |> Thm.implies_intr rhs)
wenzelm@12135
   854
    |> store_standard_thm_open "norm_hhf_eq"
wenzelm@9554
   855
  end;
wenzelm@9554
   856
wenzelm@18179
   857
val norm_hhf_prop = Logic.dest_equals (Thm.prop_of norm_hhf_eq);
wenzelm@18179
   858
wenzelm@12800
   859
fun is_norm_hhf tm =
wenzelm@12800
   860
  let
wenzelm@12800
   861
    fun is_norm (Const ("==>", _) $ _ $ (Const ("all", _) $ _)) = false
wenzelm@12800
   862
      | is_norm (t $ u) = is_norm t andalso is_norm u
wenzelm@12800
   863
      | is_norm (Abs (_, _, t)) = is_norm t
wenzelm@12800
   864
      | is_norm _ = true;
wenzelm@18929
   865
  in is_norm (Envir.beta_eta_contract tm) end;
wenzelm@12800
   866
wenzelm@16425
   867
fun norm_hhf thy t =
wenzelm@12800
   868
  if is_norm_hhf t then t
wenzelm@18179
   869
  else Pattern.rewrite_term thy [norm_hhf_prop] [] t;
wenzelm@18179
   870
wenzelm@12800
   871
wenzelm@9554
   872
wenzelm@16425
   873
(*** Instantiate theorem th, reading instantiations in theory thy ****)
paulson@8129
   874
paulson@8129
   875
(*Version that normalizes the result: Thm.instantiate no longer does that*)
paulson@8129
   876
fun instantiate instpair th = Thm.instantiate instpair th  COMP   asm_rl;
paulson@8129
   877
wenzelm@16425
   878
fun read_instantiate_sg' thy sinsts th =
paulson@8129
   879
    let val ts = types_sorts th;
wenzelm@15669
   880
        val used = add_used th [];
wenzelm@16425
   881
    in  instantiate (read_insts thy ts ts used sinsts) th  end;
berghofe@15797
   882
wenzelm@16425
   883
fun read_instantiate_sg thy sinsts th =
wenzelm@16425
   884
  read_instantiate_sg' thy (map (apfst Syntax.indexname) sinsts) th;
paulson@8129
   885
paulson@8129
   886
(*Instantiate theorem th, reading instantiations under theory of th*)
paulson@8129
   887
fun read_instantiate sinsts th =
wenzelm@16425
   888
    read_instantiate_sg (Thm.theory_of_thm th) sinsts th;
paulson@8129
   889
berghofe@15797
   890
fun read_instantiate' sinsts th =
wenzelm@16425
   891
    read_instantiate_sg' (Thm.theory_of_thm th) sinsts th;
berghofe@15797
   892
paulson@8129
   893
paulson@8129
   894
(*Left-to-right replacements: tpairs = [...,(vi,ti),...].
paulson@8129
   895
  Instantiates distinct Vars by terms, inferring type instantiations. *)
paulson@8129
   896
local
wenzelm@16425
   897
  fun add_types ((ct,cu), (thy,tye,maxidx)) =
wenzelm@16425
   898
    let val {thy=thyt, t=t, T= T, maxidx=maxt,...} = rep_cterm ct
wenzelm@16425
   899
        and {thy=thyu, t=u, T= U, maxidx=maxu,...} = rep_cterm cu;
paulson@8129
   900
        val maxi = Int.max(maxidx, Int.max(maxt, maxu));
wenzelm@16425
   901
        val thy' = Theory.merge(thy, Theory.merge(thyt, thyu))
wenzelm@16949
   902
        val (tye',maxi') = Sign.typ_unify thy' (T, U) (tye, maxi)
wenzelm@10403
   903
          handle Type.TUNIFY => raise TYPE("Ill-typed instantiation", [T,U], [t,u])
wenzelm@16425
   904
    in  (thy', tye', maxi')  end;
paulson@8129
   905
in
paulson@8129
   906
fun cterm_instantiate ctpairs0 th =
wenzelm@16425
   907
  let val (thy,tye,_) = foldr add_types (Thm.theory_of_thm th, Vartab.empty, 0) ctpairs0
wenzelm@18179
   908
      fun instT(ct,cu) =
wenzelm@16425
   909
        let val inst = cterm_of thy o Envir.subst_TVars tye o term_of
paulson@14340
   910
        in (inst ct, inst cu) end
wenzelm@16425
   911
      fun ctyp2 (ixn, (S, T)) = (ctyp_of thy (TVar (ixn, S)), ctyp_of thy T)
berghofe@8406
   912
  in  instantiate (map ctyp2 (Vartab.dest tye), map instT ctpairs0) th  end
paulson@8129
   913
  handle TERM _ =>
wenzelm@16425
   914
           raise THM("cterm_instantiate: incompatible theories",0,[th])
paulson@8129
   915
       | TYPE (msg, _, _) => raise THM(msg, 0, [th])
paulson@8129
   916
end;
paulson@8129
   917
paulson@8129
   918
paulson@8129
   919
(** Derived rules mainly for METAHYPS **)
paulson@8129
   920
paulson@8129
   921
(*Given the term "a", takes (%x.t)==(%x.u) to t[a/x]==u[a/x]*)
paulson@8129
   922
fun equal_abs_elim ca eqth =
wenzelm@16425
   923
  let val {thy=thya, t=a, ...} = rep_cterm ca
paulson@8129
   924
      and combth = combination eqth (reflexive ca)
wenzelm@16425
   925
      val {thy,prop,...} = rep_thm eqth
paulson@8129
   926
      val (abst,absu) = Logic.dest_equals prop
wenzelm@19421
   927
      val cert = cterm_of (Theory.merge (thy,thya))
wenzelm@19421
   928
  in  transitive (symmetric (beta_conversion false (cert (abst$a))))
wenzelm@19421
   929
           (transitive combth (beta_conversion false (cert (absu$a))))
paulson@8129
   930
  end
paulson@8129
   931
  handle THM _ => raise THM("equal_abs_elim", 0, [eqth]);
paulson@8129
   932
paulson@8129
   933
(*Calling equal_abs_elim with multiple terms*)
skalberg@15574
   934
fun equal_abs_elim_list cts th = foldr (uncurry equal_abs_elim) th (rev cts);
paulson@8129
   935
paulson@8129
   936
wenzelm@19878
   937
(* global schematic variables *)
wenzelm@19878
   938
wenzelm@19878
   939
fun unvarify th =
wenzelm@19878
   940
  let
wenzelm@19878
   941
    val thy = Thm.theory_of_thm th;
wenzelm@19878
   942
    val cert = Thm.cterm_of thy;
wenzelm@19878
   943
    val certT = Thm.ctyp_of thy;
wenzelm@19878
   944
wenzelm@19878
   945
    val prop = Thm.full_prop_of th;
wenzelm@19878
   946
    val _ = map Logic.unvarify (prop :: Thm.hyps_of th)
wenzelm@19878
   947
      handle TERM (msg, _) => raise THM (msg, 0, [th]);
wenzelm@19878
   948
wenzelm@19878
   949
    val instT0 = rev (Term.add_tvars prop []) |> map (fn v as ((a, _), S) => (v, TFree (a, S)));
wenzelm@19878
   950
    val instT = map (fn (v, T) => (certT (TVar v), certT T)) instT0;
wenzelm@19878
   951
    val inst = rev (Term.add_vars prop []) |> map (fn ((a, i), T) =>
wenzelm@19878
   952
      let val T' = Term.instantiateT instT0 T
wenzelm@19878
   953
      in (cert (Var ((a, i), T')), cert (Free ((a, T')))) end);
wenzelm@19878
   954
  in Thm.instantiate (instT, inst) th end;
wenzelm@19878
   955
wenzelm@19878
   956
wenzelm@19775
   957
(** protected propositions and embedded terms **)
wenzelm@4789
   958
wenzelm@4789
   959
local
wenzelm@18025
   960
  val A = cert (Free ("A", propT));
wenzelm@19878
   961
  val prop_def = unvarify ProtoPure.prop_def;
wenzelm@19878
   962
  val term_def = unvarify ProtoPure.term_def;
wenzelm@4789
   963
in
wenzelm@18025
   964
  val protect = Thm.capply (cert Logic.protectC);
wenzelm@18799
   965
  val protectI = store_thm "protectI" (PureThy.kind_rule PureThy.internalK (standard
wenzelm@18025
   966
      (Thm.equal_elim (Thm.symmetric prop_def) (Thm.assume A))));
wenzelm@18799
   967
  val protectD = store_thm "protectD" (PureThy.kind_rule PureThy.internalK (standard
wenzelm@18025
   968
      (Thm.equal_elim prop_def (Thm.assume (protect A)))));
wenzelm@18179
   969
  val protect_cong = store_standard_thm_open "protect_cong" (Thm.reflexive (protect A));
wenzelm@19775
   970
wenzelm@19775
   971
  val termI = store_thm "termI" (PureThy.kind_rule PureThy.internalK (standard
wenzelm@19775
   972
      (Thm.equal_elim (Thm.symmetric term_def) (Thm.forall_intr A (Thm.trivial A)))));
wenzelm@4789
   973
end;
wenzelm@4789
   974
wenzelm@18025
   975
fun implies_intr_protected asms th =
wenzelm@18118
   976
  let val asms' = map protect asms in
wenzelm@18118
   977
    implies_elim_list
wenzelm@18118
   978
      (implies_intr_list asms th)
wenzelm@18118
   979
      (map (fn asm' => Thm.assume asm' RS protectD) asms')
wenzelm@18118
   980
    |> implies_intr_list asms'
wenzelm@18118
   981
  end;
wenzelm@11815
   982
wenzelm@19775
   983
fun mk_term ct =
wenzelm@19775
   984
  let
wenzelm@19775
   985
    val {thy, T, ...} = Thm.rep_cterm ct;
wenzelm@19775
   986
    val cert = Thm.cterm_of thy;
wenzelm@19775
   987
    val certT = Thm.ctyp_of thy;
wenzelm@19775
   988
    val a = certT (TVar (("'a", 0), []));
wenzelm@19775
   989
    val x = cert (Var (("x", 0), T));
wenzelm@19775
   990
  in Thm.instantiate ([(a, certT T)], [(x, ct)]) termI end;
wenzelm@19775
   991
wenzelm@19775
   992
fun dest_term th =
wenzelm@19775
   993
  let val cprop = Thm.cprop_of th in
wenzelm@19775
   994
    if can Logic.dest_term (Thm.term_of cprop) then
wenzelm@19775
   995
      #2 (Thm.dest_comb cprop)
wenzelm@19775
   996
    else raise THM ("dest_term", 0, [th])
wenzelm@19775
   997
  end;
wenzelm@19775
   998
wenzelm@19775
   999
wenzelm@4789
  1000
wenzelm@5688
  1001
(** variations on instantiate **)
wenzelm@4285
  1002
paulson@8550
  1003
(*shorthand for instantiating just one variable in the current theory*)
wenzelm@16425
  1004
fun inst x t = read_instantiate_sg (the_context()) [(x,t)];
paulson@8550
  1005
paulson@8550
  1006
wenzelm@4285
  1007
(* instantiate by left-to-right occurrence of variables *)
wenzelm@4285
  1008
wenzelm@4285
  1009
fun instantiate' cTs cts thm =
wenzelm@4285
  1010
  let
wenzelm@4285
  1011
    fun err msg =
wenzelm@4285
  1012
      raise TYPE ("instantiate': " ^ msg,
wenzelm@19482
  1013
        map_filter (Option.map Thm.typ_of) cTs,
wenzelm@19482
  1014
        map_filter (Option.map Thm.term_of) cts);
wenzelm@4285
  1015
wenzelm@4285
  1016
    fun inst_of (v, ct) =
wenzelm@16425
  1017
      (Thm.cterm_of (Thm.theory_of_cterm ct) (Var v), ct)
wenzelm@4285
  1018
        handle TYPE (msg, _, _) => err msg;
wenzelm@4285
  1019
berghofe@15797
  1020
    fun tyinst_of (v, cT) =
wenzelm@16425
  1021
      (Thm.ctyp_of (Thm.theory_of_ctyp cT) (TVar v), cT)
berghofe@15797
  1022
        handle TYPE (msg, _, _) => err msg;
berghofe@15797
  1023
wenzelm@4285
  1024
    fun zip_vars _ [] = []
skalberg@15531
  1025
      | zip_vars (_ :: vs) (NONE :: opt_ts) = zip_vars vs opt_ts
skalberg@15531
  1026
      | zip_vars (v :: vs) (SOME t :: opt_ts) = (v, t) :: zip_vars vs opt_ts
wenzelm@4285
  1027
      | zip_vars [] _ = err "more instantiations than variables in thm";
wenzelm@4285
  1028
wenzelm@4285
  1029
    (*instantiate types first!*)
wenzelm@4285
  1030
    val thm' =
wenzelm@4285
  1031
      if forall is_none cTs then thm
berghofe@15797
  1032
      else Thm.instantiate (map tyinst_of (zip_vars (tvars_of thm) cTs), []) thm;
wenzelm@4285
  1033
    in
wenzelm@4285
  1034
      if forall is_none cts then thm'
wenzelm@4285
  1035
      else Thm.instantiate ([], map inst_of (zip_vars (vars_of thm') cts)) thm'
wenzelm@4285
  1036
    end;
wenzelm@4285
  1037
wenzelm@4285
  1038
berghofe@14081
  1039
berghofe@14081
  1040
(** renaming of bound variables **)
berghofe@14081
  1041
berghofe@14081
  1042
(* replace bound variables x_i in thm by y_i *)
berghofe@14081
  1043
(* where vs = [(x_1, y_1), ..., (x_n, y_n)]  *)
berghofe@14081
  1044
berghofe@14081
  1045
fun rename_bvars [] thm = thm
berghofe@14081
  1046
  | rename_bvars vs thm =
berghofe@14081
  1047
    let
wenzelm@16425
  1048
      val {thy, prop, ...} = rep_thm thm;
haftmann@17325
  1049
      fun ren (Abs (x, T, t)) = Abs (AList.lookup (op =) vs x |> the_default x, T, ren t)
berghofe@14081
  1050
        | ren (t $ u) = ren t $ ren u
berghofe@14081
  1051
        | ren t = t;
wenzelm@16425
  1052
    in equal_elim (reflexive (cterm_of thy (ren prop))) thm end;
berghofe@14081
  1053
berghofe@14081
  1054
berghofe@14081
  1055
(* renaming in left-to-right order *)
berghofe@14081
  1056
berghofe@14081
  1057
fun rename_bvars' xs thm =
berghofe@14081
  1058
  let
wenzelm@16425
  1059
    val {thy, prop, ...} = rep_thm thm;
berghofe@14081
  1060
    fun rename [] t = ([], t)
berghofe@14081
  1061
      | rename (x' :: xs) (Abs (x, T, t)) =
berghofe@14081
  1062
          let val (xs', t') = rename xs t
wenzelm@18929
  1063
          in (xs', Abs (the_default x x', T, t')) end
berghofe@14081
  1064
      | rename xs (t $ u) =
berghofe@14081
  1065
          let
berghofe@14081
  1066
            val (xs', t') = rename xs t;
berghofe@14081
  1067
            val (xs'', u') = rename xs' u
berghofe@14081
  1068
          in (xs'', t' $ u') end
berghofe@14081
  1069
      | rename xs t = (xs, t);
berghofe@14081
  1070
  in case rename xs prop of
wenzelm@16425
  1071
      ([], prop') => equal_elim (reflexive (cterm_of thy prop')) thm
berghofe@14081
  1072
    | _ => error "More names than abstractions in theorem"
berghofe@14081
  1073
  end;
berghofe@14081
  1074
berghofe@14081
  1075
wenzelm@19906
  1076
(* var indexes *)
wenzelm@6435
  1077
wenzelm@19421
  1078
fun incr_indexes th = Thm.incr_indexes (Thm.maxidx_of th + 1);
wenzelm@18025
  1079
wenzelm@19124
  1080
fun incr_indexes2 th1 th2 =
wenzelm@19421
  1081
  Thm.incr_indexes (Int.max (Thm.maxidx_of th1, Thm.maxidx_of th2) + 1);
wenzelm@6435
  1082
wenzelm@6435
  1083
wenzelm@8328
  1084
(* freeze_all *)
wenzelm@8328
  1085
wenzelm@8328
  1086
(*freeze all (T)Vars; assumes thm in standard form*)
wenzelm@8328
  1087
wenzelm@8328
  1088
fun freeze_all_TVars thm =
wenzelm@8328
  1089
  (case tvars_of thm of
wenzelm@8328
  1090
    [] => thm
wenzelm@8328
  1091
  | tvars =>
wenzelm@16425
  1092
      let val cert = Thm.ctyp_of (Thm.theory_of_thm thm)
skalberg@15531
  1093
      in instantiate' (map (fn ((x, _), S) => SOME (cert (TFree (x, S)))) tvars) [] thm end);
wenzelm@8328
  1094
wenzelm@8328
  1095
fun freeze_all_Vars thm =
wenzelm@8328
  1096
  (case vars_of thm of
wenzelm@8328
  1097
    [] => thm
wenzelm@8328
  1098
  | vars =>
wenzelm@16425
  1099
      let val cert = Thm.cterm_of (Thm.theory_of_thm thm)
skalberg@15531
  1100
      in instantiate' [] (map (fn ((x, _), T) => SOME (cert (Free (x, T)))) vars) thm end);
wenzelm@8328
  1101
wenzelm@8328
  1102
val freeze_all = freeze_all_Vars o freeze_all_TVars;
wenzelm@8328
  1103
wenzelm@8328
  1104
wenzelm@11975
  1105
wenzelm@18225
  1106
(** multi_resolve **)
wenzelm@18225
  1107
wenzelm@18225
  1108
local
wenzelm@18225
  1109
wenzelm@18225
  1110
fun res th i rule =
wenzelm@18225
  1111
  Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
wenzelm@18225
  1112
wenzelm@18225
  1113
fun multi_res _ [] rule = Seq.single rule
wenzelm@18225
  1114
  | multi_res i (th :: ths) rule = Seq.maps (res th i) (multi_res (i + 1) ths rule);
wenzelm@18225
  1115
wenzelm@18225
  1116
in
wenzelm@18225
  1117
wenzelm@18225
  1118
val multi_resolve = multi_res 1;
wenzelm@18225
  1119
fun multi_resolves facts rules = Seq.maps (multi_resolve facts) (Seq.of_list rules);
wenzelm@18225
  1120
wenzelm@18225
  1121
end;
wenzelm@18225
  1122
wenzelm@11975
  1123
end;
wenzelm@5903
  1124
wenzelm@5903
  1125
structure BasicDrule: BASIC_DRULE = Drule;
wenzelm@5903
  1126
open BasicDrule;