src/Pure/drule.ML
author wenzelm
Sat Mar 27 15:20:31 2010 +0100 (2010-03-27)
changeset 35985 0bbf0d2348f9
parent 35897 8758895ea413
child 36330 0584e203960e
permissions -rw-r--r--
moved Drule.forall_intr_frees to Thm.forall_intr_frees (in more_thm.ML, which is loaded before pure_thy.ML);
discontinued old-style Theory.add_defs(_i) in favour of more basic Theory.add_def;
modernized PureThy.add_defs etc. -- refer to high-level Thm.add_def;
wenzelm@252
     1
(*  Title:      Pure/drule.ML
wenzelm@252
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     3
wenzelm@3766
     4
Derived rules and other operations on theorems.
clasohm@0
     5
*)
clasohm@0
     6
wenzelm@21578
     7
infix 0 RS RSN RL RLN MRS MRL OF COMP INCR_COMP COMP_INCR;
clasohm@0
     8
wenzelm@5903
     9
signature BASIC_DRULE =
wenzelm@3766
    10
sig
wenzelm@18179
    11
  val mk_implies: cterm * cterm -> cterm
wenzelm@18179
    12
  val list_implies: cterm list * cterm -> cterm
wenzelm@18179
    13
  val strip_imp_prems: cterm -> cterm list
wenzelm@18179
    14
  val strip_imp_concl: cterm -> cterm
wenzelm@18179
    15
  val cprems_of: thm -> cterm list
wenzelm@18179
    16
  val cterm_fun: (term -> term) -> (cterm -> cterm)
wenzelm@18179
    17
  val ctyp_fun: (typ -> typ) -> (ctyp -> ctyp)
wenzelm@18179
    18
  val forall_intr_list: cterm list -> thm -> thm
wenzelm@18179
    19
  val forall_intr_vars: thm -> thm
wenzelm@18179
    20
  val forall_elim_list: cterm list -> thm -> thm
wenzelm@18179
    21
  val gen_all: thm -> thm
wenzelm@18179
    22
  val lift_all: cterm -> thm -> thm
wenzelm@33832
    23
  val legacy_freeze_thaw: thm -> thm * (thm -> thm)
wenzelm@33832
    24
  val legacy_freeze_thaw_robust: thm -> thm * (int -> thm -> thm)
wenzelm@18179
    25
  val implies_elim_list: thm -> thm list -> thm
wenzelm@18179
    26
  val implies_intr_list: cterm list -> thm -> thm
wenzelm@18206
    27
  val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm
wenzelm@21603
    28
  val zero_var_indexes_list: thm list -> thm list
wenzelm@18179
    29
  val zero_var_indexes: thm -> thm
wenzelm@18179
    30
  val implies_intr_hyps: thm -> thm
wenzelm@18179
    31
  val rotate_prems: int -> thm -> thm
wenzelm@18179
    32
  val rearrange_prems: int list -> thm -> thm
wenzelm@18179
    33
  val RSN: thm * (int * thm) -> thm
wenzelm@18179
    34
  val RS: thm * thm -> thm
wenzelm@18179
    35
  val RLN: thm list * (int * thm list) -> thm list
wenzelm@18179
    36
  val RL: thm list * thm list -> thm list
wenzelm@18179
    37
  val MRS: thm list * thm -> thm
wenzelm@18179
    38
  val MRL: thm list list * thm list -> thm list
wenzelm@18179
    39
  val OF: thm * thm list -> thm
wenzelm@18179
    40
  val compose: thm * int * thm -> thm list
wenzelm@18179
    41
  val COMP: thm * thm -> thm
wenzelm@21578
    42
  val INCR_COMP: thm * thm -> thm
wenzelm@21578
    43
  val COMP_INCR: thm * thm -> thm
wenzelm@18179
    44
  val cterm_instantiate: (cterm*cterm)list -> thm -> thm
wenzelm@18179
    45
  val size_of_thm: thm -> int
wenzelm@18179
    46
  val reflexive_thm: thm
wenzelm@18179
    47
  val symmetric_thm: thm
wenzelm@18179
    48
  val transitive_thm: thm
wenzelm@18179
    49
  val symmetric_fun: thm -> thm
wenzelm@18179
    50
  val extensional: thm -> thm
wenzelm@18820
    51
  val equals_cong: thm
wenzelm@18179
    52
  val imp_cong: thm
wenzelm@18179
    53
  val swap_prems_eq: thm
wenzelm@18179
    54
  val asm_rl: thm
wenzelm@18179
    55
  val cut_rl: thm
wenzelm@18179
    56
  val revcut_rl: thm
wenzelm@18179
    57
  val thin_rl: thm
wenzelm@4285
    58
  val triv_forall_equality: thm
wenzelm@19051
    59
  val distinct_prems_rl: thm
wenzelm@18179
    60
  val swap_prems_rl: thm
wenzelm@18179
    61
  val equal_intr_rule: thm
wenzelm@18179
    62
  val equal_elim_rule1: thm
wenzelm@19421
    63
  val equal_elim_rule2: thm
wenzelm@18179
    64
  val instantiate': ctyp option list -> cterm option list -> thm -> thm
wenzelm@5903
    65
end;
wenzelm@5903
    66
wenzelm@5903
    67
signature DRULE =
wenzelm@5903
    68
sig
wenzelm@5903
    69
  include BASIC_DRULE
wenzelm@19999
    70
  val generalize: string list * string list -> thm -> thm
paulson@15949
    71
  val list_comb: cterm * cterm list -> cterm
berghofe@12908
    72
  val strip_comb: cterm -> cterm * cterm list
berghofe@15262
    73
  val strip_type: ctyp -> ctyp list * ctyp
paulson@15949
    74
  val beta_conv: cterm -> cterm -> cterm
wenzelm@27156
    75
  val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option)
berghofe@17713
    76
  val flexflex_unique: thm -> thm
wenzelm@35021
    77
  val export_without_context: thm -> thm
wenzelm@35021
    78
  val export_without_context_open: thm -> thm
wenzelm@33277
    79
  val store_thm: binding -> thm -> thm
wenzelm@33277
    80
  val store_standard_thm: binding -> thm -> thm
wenzelm@33277
    81
  val store_thm_open: binding -> thm -> thm
wenzelm@33277
    82
  val store_standard_thm_open: binding -> thm -> thm
wenzelm@11975
    83
  val compose_single: thm * int * thm -> thm
wenzelm@18468
    84
  val imp_cong_rule: thm -> thm -> thm
wenzelm@22939
    85
  val arg_cong_rule: cterm -> thm -> thm
wenzelm@23568
    86
  val binop_cong_rule: cterm -> thm -> thm -> thm
wenzelm@22939
    87
  val fun_cong_rule: thm -> cterm -> thm
skalberg@15001
    88
  val beta_eta_conversion: cterm -> thm
berghofe@15925
    89
  val eta_long_conversion: cterm -> thm
paulson@20861
    90
  val eta_contraction_rule: thm -> thm
wenzelm@11975
    91
  val norm_hhf_eq: thm
wenzelm@28618
    92
  val norm_hhf_eqs: thm list
wenzelm@12800
    93
  val is_norm_hhf: term -> bool
wenzelm@16425
    94
  val norm_hhf: theory -> term -> term
wenzelm@20298
    95
  val norm_hhf_cterm: cterm -> cterm
wenzelm@18025
    96
  val protect: cterm -> cterm
wenzelm@18025
    97
  val protectI: thm
wenzelm@18025
    98
  val protectD: thm
wenzelm@18179
    99
  val protect_cong: thm
wenzelm@18025
   100
  val implies_intr_protected: cterm list -> thm -> thm
wenzelm@19775
   101
  val termI: thm
wenzelm@19775
   102
  val mk_term: cterm -> thm
wenzelm@19775
   103
  val dest_term: thm -> cterm
wenzelm@21519
   104
  val cterm_rule: (thm -> thm) -> cterm -> cterm
wenzelm@20881
   105
  val term_rule: theory -> (thm -> thm) -> term -> term
wenzelm@24005
   106
  val dummy_thm: thm
wenzelm@28618
   107
  val sort_constraintI: thm
wenzelm@28618
   108
  val sort_constraint_eq: thm
wenzelm@19504
   109
  val unconstrainTs: thm -> thm
wenzelm@23423
   110
  val with_subgoal: int -> (thm -> thm) -> thm -> thm
wenzelm@29344
   111
  val comp_no_flatten: thm * int -> int -> thm -> thm
berghofe@14081
   112
  val rename_bvars: (string * string) list -> thm -> thm
berghofe@14081
   113
  val rename_bvars': string option list -> thm -> thm
paulson@24426
   114
  val incr_type_indexes: int -> thm -> thm
wenzelm@19124
   115
  val incr_indexes: thm -> thm -> thm
wenzelm@19124
   116
  val incr_indexes2: thm -> thm -> thm -> thm
wenzelm@12297
   117
  val remdups_rl: thm
wenzelm@18225
   118
  val multi_resolve: thm list -> thm -> thm Seq.seq
wenzelm@18225
   119
  val multi_resolves: thm list -> thm list -> thm Seq.seq
berghofe@13325
   120
  val abs_def: thm -> thm
wenzelm@3766
   121
end;
clasohm@0
   122
wenzelm@5903
   123
structure Drule: DRULE =
clasohm@0
   124
struct
clasohm@0
   125
wenzelm@3991
   126
wenzelm@16682
   127
(** some cterm->cterm operations: faster than calling cterm_of! **)
lcp@708
   128
lcp@708
   129
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
paulson@2004
   130
fun strip_imp_prems ct =
wenzelm@22906
   131
  let val (cA, cB) = Thm.dest_implies ct
wenzelm@20579
   132
  in cA :: strip_imp_prems cB end
wenzelm@20579
   133
  handle TERM _ => [];
lcp@708
   134
paulson@2004
   135
(* A1==>...An==>B  goes to B, where B is not an implication *)
paulson@2004
   136
fun strip_imp_concl ct =
wenzelm@20579
   137
  (case Thm.term_of ct of
wenzelm@20579
   138
    Const ("==>", _) $ _ $ _ => strip_imp_concl (Thm.dest_arg ct)
wenzelm@20579
   139
  | _ => ct);
paulson@2004
   140
lcp@708
   141
(*The premises of a theorem, as a cterm list*)
berghofe@13659
   142
val cprems_of = strip_imp_prems o cprop_of;
lcp@708
   143
wenzelm@26627
   144
fun cterm_fun f ct = Thm.cterm_of (Thm.theory_of_cterm ct) (f (Thm.term_of ct));
wenzelm@26627
   145
fun ctyp_fun f cT = Thm.ctyp_of (Thm.theory_of_ctyp cT) (f (Thm.typ_of cT));
berghofe@15797
   146
wenzelm@26487
   147
fun certify t = Thm.cterm_of (Context.the_theory (Context.the_thread_data ())) t;
paulson@9547
   148
wenzelm@27333
   149
val implies = certify Logic.implies;
wenzelm@19183
   150
fun mk_implies (A, B) = Thm.capply (Thm.capply implies A) B;
paulson@9547
   151
paulson@9547
   152
(*cterm version of list_implies: [A1,...,An], B  goes to [|A1;==>;An|]==>B *)
paulson@9547
   153
fun list_implies([], B) = B
paulson@9547
   154
  | list_implies(A::AS, B) = mk_implies (A, list_implies(AS,B));
paulson@9547
   155
paulson@15949
   156
(*cterm version of list_comb: maps  (f, [t1,...,tn])  to  f(t1,...,tn) *)
paulson@15949
   157
fun list_comb (f, []) = f
paulson@15949
   158
  | list_comb (f, t::ts) = list_comb (Thm.capply f t, ts);
paulson@15949
   159
berghofe@12908
   160
(*cterm version of strip_comb: maps  f(t1,...,tn)  to  (f, [t1,...,tn]) *)
wenzelm@18179
   161
fun strip_comb ct =
berghofe@12908
   162
  let
berghofe@12908
   163
    fun stripc (p as (ct, cts)) =
berghofe@12908
   164
      let val (ct1, ct2) = Thm.dest_comb ct
berghofe@12908
   165
      in stripc (ct1, ct2 :: cts) end handle CTERM _ => p
berghofe@12908
   166
  in stripc (ct, []) end;
berghofe@12908
   167
berghofe@15262
   168
(* cterm version of strip_type: maps  [T1,...,Tn]--->T  to   ([T1,T2,...,Tn], T) *)
berghofe@15262
   169
fun strip_type cT = (case Thm.typ_of cT of
berghofe@15262
   170
    Type ("fun", _) =>
berghofe@15262
   171
      let
berghofe@15262
   172
        val [cT1, cT2] = Thm.dest_ctyp cT;
berghofe@15262
   173
        val (cTs, cT') = strip_type cT2
berghofe@15262
   174
      in (cT1 :: cTs, cT') end
berghofe@15262
   175
  | _ => ([], cT));
berghofe@15262
   176
paulson@15949
   177
(*Beta-conversion for cterms, where x is an abstraction. Simply returns the rhs
paulson@15949
   178
  of the meta-equality returned by the beta_conversion rule.*)
wenzelm@18179
   179
fun beta_conv x y =
wenzelm@20579
   180
  Thm.dest_arg (cprop_of (Thm.beta_conversion false (Thm.capply x y)));
paulson@15949
   181
wenzelm@15875
   182
lcp@708
   183
wenzelm@252
   184
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term
clasohm@0
   185
     Used for establishing default types (of variables) and sorts (of
clasohm@0
   186
     type variables) when reading another term.
clasohm@0
   187
     Index -1 indicates that a (T)Free rather than a (T)Var is wanted.
clasohm@0
   188
***)
clasohm@0
   189
clasohm@0
   190
fun types_sorts thm =
wenzelm@20329
   191
  let
wenzelm@22695
   192
    val vars = Thm.fold_terms Term.add_vars thm [];
wenzelm@22695
   193
    val frees = Thm.fold_terms Term.add_frees thm [];
wenzelm@22695
   194
    val tvars = Thm.fold_terms Term.add_tvars thm [];
wenzelm@22695
   195
    val tfrees = Thm.fold_terms Term.add_tfrees thm [];
wenzelm@20329
   196
    fun types (a, i) =
wenzelm@20329
   197
      if i < 0 then AList.lookup (op =) frees a else AList.lookup (op =) vars (a, i);
wenzelm@20329
   198
    fun sorts (a, i) =
wenzelm@20329
   199
      if i < 0 then AList.lookup (op =) tfrees a else AList.lookup (op =) tvars (a, i);
wenzelm@20329
   200
  in (types, sorts) end;
clasohm@0
   201
wenzelm@15669
   202
wenzelm@7636
   203
wenzelm@9455
   204
clasohm@0
   205
(** Standardization of rules **)
clasohm@0
   206
wenzelm@19523
   207
(* type classes and sorts *)
wenzelm@19523
   208
wenzelm@19504
   209
fun unconstrainTs th =
wenzelm@20298
   210
  fold (Thm.unconstrainT o Thm.ctyp_of (Thm.theory_of_thm th) o TVar)
wenzelm@22695
   211
    (Thm.fold_terms Term.add_tvars th []) th;
wenzelm@19504
   212
wenzelm@19730
   213
(*Generalization over a list of variables*)
wenzelm@19730
   214
val forall_intr_list = fold_rev forall_intr;
clasohm@0
   215
wenzelm@18535
   216
(*Generalization over Vars -- canonical order*)
wenzelm@18535
   217
fun forall_intr_vars th =
wenzelm@20298
   218
  fold forall_intr
wenzelm@22695
   219
    (map (Thm.cterm_of (Thm.theory_of_thm th) o Var) (Thm.fold_terms Term.add_vars th [])) th;
wenzelm@18535
   220
wenzelm@18025
   221
fun outer_params t =
wenzelm@20077
   222
  let val vs = Term.strip_all_vars t
wenzelm@20077
   223
  in Name.variant_list [] (map (Name.clean o #1) vs) ~~ map #2 vs end;
wenzelm@18025
   224
wenzelm@18025
   225
(*generalize outermost parameters*)
wenzelm@18025
   226
fun gen_all th =
wenzelm@12719
   227
  let
wenzelm@26627
   228
    val thy = Thm.theory_of_thm th;
wenzelm@26627
   229
    val {prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@18025
   230
    val cert = Thm.cterm_of thy;
wenzelm@18025
   231
    fun elim (x, T) = Thm.forall_elim (cert (Var ((x, maxidx + 1), T)));
wenzelm@18025
   232
  in fold elim (outer_params prop) th end;
wenzelm@18025
   233
wenzelm@18025
   234
(*lift vars wrt. outermost goal parameters
wenzelm@18118
   235
  -- reverses the effect of gen_all modulo higher-order unification*)
wenzelm@18025
   236
fun lift_all goal th =
wenzelm@18025
   237
  let
wenzelm@18025
   238
    val thy = Theory.merge (Thm.theory_of_cterm goal, Thm.theory_of_thm th);
wenzelm@18025
   239
    val cert = Thm.cterm_of thy;
wenzelm@19421
   240
    val maxidx = Thm.maxidx_of th;
wenzelm@18025
   241
    val ps = outer_params (Thm.term_of goal)
wenzelm@18025
   242
      |> map (fn (x, T) => Var ((x, maxidx + 1), Logic.incr_tvar (maxidx + 1) T));
wenzelm@18025
   243
    val Ts = map Term.fastype_of ps;
wenzelm@22695
   244
    val inst = Thm.fold_terms Term.add_vars th [] |> map (fn (xi, T) =>
wenzelm@18025
   245
      (cert (Var (xi, T)), cert (Term.list_comb (Var (xi, Ts ---> T), ps))));
wenzelm@18025
   246
  in
wenzelm@18025
   247
    th |> Thm.instantiate ([], inst)
wenzelm@18025
   248
    |> fold_rev (Thm.forall_intr o cert) ps
wenzelm@18025
   249
  end;
wenzelm@18025
   250
wenzelm@19999
   251
(*direct generalization*)
wenzelm@19999
   252
fun generalize names th = Thm.generalize names (Thm.maxidx_of th + 1) th;
wenzelm@9554
   253
wenzelm@16949
   254
(*specialization over a list of cterms*)
wenzelm@16949
   255
val forall_elim_list = fold forall_elim;
clasohm@0
   256
wenzelm@16949
   257
(*maps A1,...,An |- B  to  [| A1;...;An |] ==> B*)
wenzelm@16949
   258
val implies_intr_list = fold_rev implies_intr;
clasohm@0
   259
wenzelm@16949
   260
(*maps [| A1;...;An |] ==> B and [A1,...,An]  to  B*)
wenzelm@24978
   261
fun implies_elim_list impth ths = fold Thm.elim_implies ths impth;
clasohm@0
   262
clasohm@0
   263
(*Reset Var indexes to zero, renaming to preserve distinctness*)
wenzelm@21603
   264
fun zero_var_indexes_list [] = []
wenzelm@21603
   265
  | zero_var_indexes_list ths =
wenzelm@21603
   266
      let
wenzelm@21603
   267
        val thy = Theory.merge_list (map Thm.theory_of_thm ths);
wenzelm@21603
   268
        val certT = Thm.ctyp_of thy and cert = Thm.cterm_of thy;
wenzelm@31977
   269
        val (instT, inst) = Term_Subst.zero_var_indexes_inst (map Thm.full_prop_of ths);
wenzelm@21603
   270
        val cinstT = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@21603
   271
        val cinst = map (fn (v, t) => (cert (Var v), cert t)) inst;
wenzelm@21603
   272
      in map (Thm.adjust_maxidx_thm ~1 o Thm.instantiate (cinstT, cinst)) ths end;
wenzelm@21603
   273
wenzelm@21603
   274
val zero_var_indexes = singleton zero_var_indexes_list;
clasohm@0
   275
clasohm@0
   276
paulson@14394
   277
(** Standard form of object-rule: no hypotheses, flexflex constraints,
paulson@14394
   278
    Frees, or outer quantifiers; all generality expressed by Vars of index 0.**)
wenzelm@10515
   279
wenzelm@16595
   280
(*Discharge all hypotheses.*)
wenzelm@16595
   281
fun implies_intr_hyps th =
wenzelm@16595
   282
  fold Thm.implies_intr (#hyps (Thm.crep_thm th)) th;
wenzelm@16595
   283
paulson@14394
   284
(*Squash a theorem's flexflex constraints provided it can be done uniquely.
paulson@14394
   285
  This step can lose information.*)
paulson@14387
   286
fun flexflex_unique th =
berghofe@17713
   287
  if null (tpairs_of th) then th else
paulson@23439
   288
    case distinct Thm.eq_thm (Seq.list_of (flexflex_rule th)) of
paulson@23439
   289
      [th] => th
paulson@23439
   290
    | []   => raise THM("flexflex_unique: impossible constraints", 0, [th])
paulson@23439
   291
    |  _   => raise THM("flexflex_unique: multiple unifiers", 0, [th]);
paulson@14387
   292
wenzelm@21603
   293
wenzelm@35021
   294
(* old-style export without context *)
wenzelm@21603
   295
wenzelm@35021
   296
val export_without_context_open =
wenzelm@16949
   297
  implies_intr_hyps
wenzelm@35985
   298
  #> Thm.forall_intr_frees
wenzelm@19421
   299
  #> `Thm.maxidx_of
wenzelm@16949
   300
  #-> (fn maxidx =>
wenzelm@26653
   301
    Thm.forall_elim_vars (maxidx + 1)
wenzelm@20904
   302
    #> Thm.strip_shyps
wenzelm@16949
   303
    #> zero_var_indexes
wenzelm@35845
   304
    #> Thm.varifyT_global);
wenzelm@1218
   305
wenzelm@35021
   306
val export_without_context =
wenzelm@21600
   307
  flexflex_unique
wenzelm@35021
   308
  #> export_without_context_open
wenzelm@26627
   309
  #> Thm.close_derivation;
berghofe@11512
   310
clasohm@0
   311
wenzelm@8328
   312
(*Convert all Vars in a theorem to Frees.  Also return a function for
paulson@4610
   313
  reversing that operation.  DOES NOT WORK FOR TYPE VARIABLES.
paulson@4610
   314
  Similar code in type/freeze_thaw*)
paulson@15495
   315
wenzelm@33832
   316
fun legacy_freeze_thaw_robust th =
wenzelm@19878
   317
 let val fth = Thm.freezeT th
wenzelm@26627
   318
     val thy = Thm.theory_of_thm fth
wenzelm@26627
   319
     val {prop, tpairs, ...} = rep_thm fth
paulson@15495
   320
 in
wenzelm@29265
   321
   case List.foldr OldTerm.add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of
paulson@15495
   322
       [] => (fth, fn i => fn x => x)   (*No vars: nothing to do!*)
paulson@15495
   323
     | vars =>
paulson@19753
   324
         let fun newName (Var(ix,_)) = (ix, gensym (string_of_indexname ix))
paulson@19753
   325
             val alist = map newName vars
paulson@15495
   326
             fun mk_inst (Var(v,T)) =
wenzelm@16425
   327
                 (cterm_of thy (Var(v,T)),
haftmann@17325
   328
                  cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T)))
paulson@15495
   329
             val insts = map mk_inst vars
paulson@15495
   330
             fun thaw i th' = (*i is non-negative increment for Var indexes*)
paulson@15495
   331
                 th' |> forall_intr_list (map #2 insts)
wenzelm@22906
   332
                     |> forall_elim_list (map (Thm.incr_indexes_cterm i o #1) insts)
paulson@15495
   333
         in  (Thm.instantiate ([],insts) fth, thaw)  end
paulson@15495
   334
 end;
paulson@15495
   335
paulson@15495
   336
(*Basic version of the function above. No option to rename Vars apart in thaw.
wenzelm@33832
   337
  The Frees created from Vars have nice names.*)
wenzelm@33832
   338
fun legacy_freeze_thaw th =
wenzelm@19878
   339
 let val fth = Thm.freezeT th
wenzelm@26627
   340
     val thy = Thm.theory_of_thm fth
wenzelm@26627
   341
     val {prop, tpairs, ...} = rep_thm fth
paulson@7248
   342
 in
wenzelm@29265
   343
   case List.foldr OldTerm.add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of
paulson@7248
   344
       [] => (fth, fn x => x)
paulson@7248
   345
     | vars =>
wenzelm@8328
   346
         let fun newName (Var(ix,_), (pairs,used)) =
wenzelm@20077
   347
                   let val v = Name.variant used (string_of_indexname ix)
wenzelm@8328
   348
                   in  ((ix,v)::pairs, v::used)  end;
wenzelm@29270
   349
             val (alist, _) = List.foldr newName ([], Library.foldr OldTerm.add_term_names
skalberg@15574
   350
               (prop :: Thm.terms_of_tpairs tpairs, [])) vars
wenzelm@8328
   351
             fun mk_inst (Var(v,T)) =
wenzelm@16425
   352
                 (cterm_of thy (Var(v,T)),
haftmann@17325
   353
                  cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T)))
wenzelm@8328
   354
             val insts = map mk_inst vars
wenzelm@8328
   355
             fun thaw th' =
wenzelm@8328
   356
                 th' |> forall_intr_list (map #2 insts)
wenzelm@8328
   357
                     |> forall_elim_list (map #1 insts)
wenzelm@8328
   358
         in  (Thm.instantiate ([],insts) fth, thaw)  end
paulson@7248
   359
 end;
paulson@4610
   360
paulson@7248
   361
(*Rotates a rule's premises to the left by k*)
wenzelm@23537
   362
fun rotate_prems 0 = I
wenzelm@31945
   363
  | rotate_prems k = Thm.permute_prems 0 k;
wenzelm@23537
   364
wenzelm@23423
   365
fun with_subgoal i f = rotate_prems (i - 1) #> f #> rotate_prems (1 - i);
paulson@4610
   366
wenzelm@31945
   367
(*Permute prems, where the i-th position in the argument list (counting from 0)
wenzelm@31945
   368
  gives the position within the original thm to be transferred to position i.
wenzelm@31945
   369
  Any remaining trailing positions are left unchanged.*)
wenzelm@31945
   370
val rearrange_prems =
wenzelm@31945
   371
  let
wenzelm@31945
   372
    fun rearr new [] thm = thm
wenzelm@31945
   373
      | rearr new (p :: ps) thm =
wenzelm@31945
   374
          rearr (new + 1)
wenzelm@31945
   375
            (map (fn q => if new <= q andalso q < p then q + 1 else q) ps)
wenzelm@31945
   376
            (Thm.permute_prems (new + 1) (new - p) (Thm.permute_prems new (p - new) thm))
oheimb@11163
   377
  in rearr 0 end;
paulson@4610
   378
wenzelm@252
   379
(*Resolution: exactly one resolvent must be produced.*)
clasohm@0
   380
fun tha RSN (i,thb) =
wenzelm@31945
   381
  case Seq.chop 2 (Thm.biresolution false [(false,tha)] i thb) of
clasohm@0
   382
      ([th],_) => th
clasohm@0
   383
    | ([],_)   => raise THM("RSN: no unifiers", i, [tha,thb])
clasohm@0
   384
    |      _   => raise THM("RSN: multiple unifiers", i, [tha,thb]);
clasohm@0
   385
clasohm@0
   386
(*resolution: P==>Q, Q==>R gives P==>R. *)
clasohm@0
   387
fun tha RS thb = tha RSN (1,thb);
clasohm@0
   388
clasohm@0
   389
(*For joining lists of rules*)
wenzelm@252
   390
fun thas RLN (i,thbs) =
wenzelm@31945
   391
  let val resolve = Thm.biresolution false (map (pair false) thas) i
wenzelm@4270
   392
      fun resb thb = Seq.list_of (resolve thb) handle THM _ => []
wenzelm@19482
   393
  in maps resb thbs end;
clasohm@0
   394
clasohm@0
   395
fun thas RL thbs = thas RLN (1,thbs);
clasohm@0
   396
lcp@11
   397
(*Resolve a list of rules against bottom_rl from right to left;
lcp@11
   398
  makes proof trees*)
wenzelm@252
   399
fun rls MRS bottom_rl =
lcp@11
   400
  let fun rs_aux i [] = bottom_rl
wenzelm@252
   401
        | rs_aux i (rl::rls) = rl RSN (i, rs_aux (i+1) rls)
lcp@11
   402
  in  rs_aux 1 rls  end;
lcp@11
   403
lcp@11
   404
(*As above, but for rule lists*)
wenzelm@252
   405
fun rlss MRL bottom_rls =
lcp@11
   406
  let fun rs_aux i [] = bottom_rls
wenzelm@252
   407
        | rs_aux i (rls::rlss) = rls RLN (i, rs_aux (i+1) rlss)
lcp@11
   408
  in  rs_aux 1 rlss  end;
lcp@11
   409
wenzelm@9288
   410
(*A version of MRS with more appropriate argument order*)
wenzelm@9288
   411
fun bottom_rl OF rls = rls MRS bottom_rl;
wenzelm@9288
   412
wenzelm@252
   413
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R
clasohm@0
   414
  with no lifting or renaming!  Q may contain ==> or meta-quants
clasohm@0
   415
  ALWAYS deletes premise i *)
wenzelm@252
   416
fun compose(tha,i,thb) =
wenzelm@31945
   417
    distinct Thm.eq_thm (Seq.list_of (Thm.bicompose false (false,tha,0) i thb));
clasohm@0
   418
wenzelm@6946
   419
fun compose_single (tha,i,thb) =
paulson@24426
   420
  case compose (tha,i,thb) of
wenzelm@6946
   421
    [th] => th
paulson@24426
   422
  | _ => raise THM ("compose: unique result expected", i, [tha,thb]);
wenzelm@6946
   423
clasohm@0
   424
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*)
clasohm@0
   425
fun tha COMP thb =
paulson@24426
   426
    case compose(tha,1,thb) of
wenzelm@252
   427
        [th] => th
clasohm@0
   428
      | _ =>   raise THM("COMP", 1, [tha,thb]);
clasohm@0
   429
wenzelm@13105
   430
wenzelm@4016
   431
(** theorem equality **)
clasohm@0
   432
clasohm@0
   433
(*Useful "distance" function for BEST_FIRST*)
wenzelm@16720
   434
val size_of_thm = size_of_term o Thm.full_prop_of;
clasohm@0
   435
lcp@1194
   436
lcp@1194
   437
clasohm@0
   438
(*** Meta-Rewriting Rules ***)
clasohm@0
   439
wenzelm@33384
   440
val read_prop = certify o Simple_Syntax.read_prop;
wenzelm@26487
   441
wenzelm@26487
   442
fun store_thm name th =
wenzelm@33277
   443
  Context.>>> (Context.map_theory_result (PureThy.store_thm (name, th)));
paulson@4610
   444
wenzelm@26487
   445
fun store_thm_open name th =
wenzelm@33277
   446
  Context.>>> (Context.map_theory_result (PureThy.store_thm_open (name, th)));
wenzelm@26487
   447
wenzelm@35021
   448
fun store_standard_thm name th = store_thm name (export_without_context th);
wenzelm@35021
   449
fun store_standard_thm_open name thm = store_thm_open name (export_without_context_open thm);
wenzelm@4016
   450
clasohm@0
   451
val reflexive_thm =
wenzelm@26487
   452
  let val cx = certify (Var(("x",0),TVar(("'a",0),[])))
wenzelm@33277
   453
  in store_standard_thm_open (Binding.name "reflexive") (Thm.reflexive cx) end;
clasohm@0
   454
clasohm@0
   455
val symmetric_thm =
wenzelm@33277
   456
  let
wenzelm@33277
   457
    val xy = read_prop "x::'a == y::'a";
wenzelm@33277
   458
    val thm = Thm.implies_intr xy (Thm.symmetric (Thm.assume xy));
wenzelm@33277
   459
  in store_standard_thm_open (Binding.name "symmetric") thm end;
clasohm@0
   460
clasohm@0
   461
val transitive_thm =
wenzelm@33277
   462
  let
wenzelm@33277
   463
    val xy = read_prop "x::'a == y::'a";
wenzelm@33277
   464
    val yz = read_prop "y::'a == z::'a";
wenzelm@33277
   465
    val xythm = Thm.assume xy;
wenzelm@33277
   466
    val yzthm = Thm.assume yz;
wenzelm@33277
   467
    val thm = Thm.implies_intr yz (Thm.transitive xythm yzthm);
wenzelm@33277
   468
  in store_standard_thm_open (Binding.name "transitive") thm end;
clasohm@0
   469
nipkow@4679
   470
fun symmetric_fun thm = thm RS symmetric_thm;
nipkow@4679
   471
berghofe@11512
   472
fun extensional eq =
berghofe@11512
   473
  let val eq' =
wenzelm@22906
   474
    abstract_rule "x" (Thm.dest_arg (fst (Thm.dest_equals (cprop_of eq)))) eq
berghofe@11512
   475
  in equal_elim (eta_conversion (cprop_of eq')) eq' end;
berghofe@11512
   476
wenzelm@18820
   477
val equals_cong =
wenzelm@33277
   478
  store_standard_thm_open (Binding.name "equals_cong")
wenzelm@33277
   479
    (Thm.reflexive (read_prop "x::'a == y::'a"));
wenzelm@18820
   480
berghofe@10414
   481
val imp_cong =
berghofe@10414
   482
  let
wenzelm@24241
   483
    val ABC = read_prop "A ==> B::prop == C::prop"
wenzelm@24241
   484
    val AB = read_prop "A ==> B"
wenzelm@24241
   485
    val AC = read_prop "A ==> C"
wenzelm@24241
   486
    val A = read_prop "A"
berghofe@10414
   487
  in
wenzelm@33277
   488
    store_standard_thm_open (Binding.name "imp_cong") (implies_intr ABC (equal_intr
berghofe@10414
   489
      (implies_intr AB (implies_intr A
berghofe@10414
   490
        (equal_elim (implies_elim (assume ABC) (assume A))
berghofe@10414
   491
          (implies_elim (assume AB) (assume A)))))
berghofe@10414
   492
      (implies_intr AC (implies_intr A
berghofe@10414
   493
        (equal_elim (symmetric (implies_elim (assume ABC) (assume A)))
berghofe@10414
   494
          (implies_elim (assume AC) (assume A)))))))
berghofe@10414
   495
  end;
berghofe@10414
   496
berghofe@10414
   497
val swap_prems_eq =
berghofe@10414
   498
  let
wenzelm@24241
   499
    val ABC = read_prop "A ==> B ==> C"
wenzelm@24241
   500
    val BAC = read_prop "B ==> A ==> C"
wenzelm@24241
   501
    val A = read_prop "A"
wenzelm@24241
   502
    val B = read_prop "B"
berghofe@10414
   503
  in
wenzelm@33277
   504
    store_standard_thm_open (Binding.name "swap_prems_eq")
wenzelm@33277
   505
      (equal_intr
wenzelm@33277
   506
        (implies_intr ABC (implies_intr B (implies_intr A
wenzelm@33277
   507
          (implies_elim (implies_elim (assume ABC) (assume A)) (assume B)))))
wenzelm@33277
   508
        (implies_intr BAC (implies_intr A (implies_intr B
wenzelm@33277
   509
          (implies_elim (implies_elim (assume BAC) (assume B)) (assume A))))))
berghofe@10414
   510
  end;
lcp@229
   511
wenzelm@22938
   512
val imp_cong_rule = Thm.combination o Thm.combination (Thm.reflexive implies);
wenzelm@22938
   513
wenzelm@23537
   514
fun arg_cong_rule ct th = Thm.combination (Thm.reflexive ct) th;    (*AP_TERM in LCF/HOL*)
wenzelm@23537
   515
fun fun_cong_rule th ct = Thm.combination th (Thm.reflexive ct);    (*AP_THM in LCF/HOL*)
wenzelm@23568
   516
fun binop_cong_rule ct th1 th2 = Thm.combination (arg_cong_rule ct th1) th2;
clasohm@0
   517
skalberg@15001
   518
local
wenzelm@22906
   519
  val dest_eq = Thm.dest_equals o cprop_of
skalberg@15001
   520
  val rhs_of = snd o dest_eq
skalberg@15001
   521
in
skalberg@15001
   522
fun beta_eta_conversion t =
skalberg@15001
   523
  let val thm = beta_conversion true t
skalberg@15001
   524
  in transitive thm (eta_conversion (rhs_of thm)) end
skalberg@15001
   525
end;
skalberg@15001
   526
berghofe@15925
   527
fun eta_long_conversion ct = transitive (beta_eta_conversion ct)
berghofe@15925
   528
  (symmetric (beta_eta_conversion (cterm_fun (Pattern.eta_long []) ct)));
berghofe@15925
   529
paulson@20861
   530
(*Contract all eta-redexes in the theorem, lest they give rise to needless abstractions*)
paulson@20861
   531
fun eta_contraction_rule th =
paulson@20861
   532
  equal_elim (eta_conversion (cprop_of th)) th;
paulson@20861
   533
wenzelm@24947
   534
wenzelm@24947
   535
(* abs_def *)
wenzelm@24947
   536
wenzelm@24947
   537
(*
wenzelm@24947
   538
   f ?x1 ... ?xn == u
wenzelm@24947
   539
  --------------------
wenzelm@24947
   540
   f == %x1 ... xn. u
wenzelm@24947
   541
*)
wenzelm@24947
   542
wenzelm@24947
   543
local
wenzelm@24947
   544
wenzelm@24947
   545
fun contract_lhs th =
wenzelm@24947
   546
  Thm.transitive (Thm.symmetric (beta_eta_conversion
wenzelm@24947
   547
    (fst (Thm.dest_equals (cprop_of th))))) th;
wenzelm@24947
   548
wenzelm@24947
   549
fun var_args ct =
wenzelm@24947
   550
  (case try Thm.dest_comb ct of
wenzelm@24947
   551
    SOME (f, arg) =>
wenzelm@24947
   552
      (case Thm.term_of arg of
wenzelm@24947
   553
        Var ((x, _), _) => update (eq_snd (op aconvc)) (x, arg) (var_args f)
wenzelm@24947
   554
      | _ => [])
wenzelm@24947
   555
  | NONE => []);
wenzelm@24947
   556
wenzelm@24947
   557
in
wenzelm@24947
   558
wenzelm@24947
   559
fun abs_def th =
wenzelm@18337
   560
  let
wenzelm@24947
   561
    val th' = contract_lhs th;
wenzelm@24947
   562
    val args = var_args (Thm.lhs_of th');
wenzelm@24947
   563
  in contract_lhs (fold (uncurry Thm.abstract_rule) args th') end;
wenzelm@24947
   564
wenzelm@24947
   565
end;
wenzelm@24947
   566
wenzelm@18337
   567
wenzelm@18468
   568
wenzelm@15669
   569
(*** Some useful meta-theorems ***)
clasohm@0
   570
clasohm@0
   571
(*The rule V/V, obtains assumption solving for eresolve_tac*)
wenzelm@33277
   572
val asm_rl = store_standard_thm_open (Binding.name "asm_rl") (Thm.trivial (read_prop "?psi"));
wenzelm@33277
   573
val _ = store_thm_open (Binding.name "_") asm_rl;
clasohm@0
   574
clasohm@0
   575
(*Meta-level cut rule: [| V==>W; V |] ==> W *)
wenzelm@4016
   576
val cut_rl =
wenzelm@33277
   577
  store_standard_thm_open (Binding.name "cut_rl")
wenzelm@24241
   578
    (Thm.trivial (read_prop "?psi ==> ?theta"));
clasohm@0
   579
wenzelm@252
   580
(*Generalized elim rule for one conclusion; cut_rl with reversed premises:
clasohm@0
   581
     [| PROP V;  PROP V ==> PROP W |] ==> PROP W *)
clasohm@0
   582
val revcut_rl =
wenzelm@33277
   583
  let
wenzelm@33277
   584
    val V = read_prop "V";
wenzelm@33277
   585
    val VW = read_prop "V ==> W";
wenzelm@4016
   586
  in
wenzelm@33277
   587
    store_standard_thm_open (Binding.name "revcut_rl")
wenzelm@4016
   588
      (implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V))))
clasohm@0
   589
  end;
clasohm@0
   590
lcp@668
   591
(*for deleting an unwanted assumption*)
lcp@668
   592
val thin_rl =
wenzelm@33277
   593
  let
wenzelm@33277
   594
    val V = read_prop "V";
wenzelm@33277
   595
    val W = read_prop "W";
wenzelm@33277
   596
    val thm = implies_intr V (implies_intr W (assume W));
wenzelm@33277
   597
  in store_standard_thm_open (Binding.name "thin_rl") thm end;
lcp@668
   598
clasohm@0
   599
(* (!!x. PROP ?V) == PROP ?V       Allows removal of redundant parameters*)
clasohm@0
   600
val triv_forall_equality =
wenzelm@33277
   601
  let
wenzelm@33277
   602
    val V = read_prop "V";
wenzelm@33277
   603
    val QV = read_prop "!!x::'a. V";
wenzelm@33277
   604
    val x = certify (Free ("x", Term.aT []));
wenzelm@4016
   605
  in
wenzelm@33277
   606
    store_standard_thm_open (Binding.name "triv_forall_equality")
berghofe@11512
   607
      (equal_intr (implies_intr QV (forall_elim x (assume QV)))
berghofe@11512
   608
        (implies_intr V  (forall_intr x (assume V))))
clasohm@0
   609
  end;
clasohm@0
   610
wenzelm@19051
   611
(* (PROP ?Phi ==> PROP ?Phi ==> PROP ?Psi) ==>
wenzelm@19051
   612
   (PROP ?Phi ==> PROP ?Psi)
wenzelm@19051
   613
*)
wenzelm@19051
   614
val distinct_prems_rl =
wenzelm@19051
   615
  let
wenzelm@33277
   616
    val AAB = read_prop "Phi ==> Phi ==> Psi";
wenzelm@24241
   617
    val A = read_prop "Phi";
wenzelm@19051
   618
  in
wenzelm@33277
   619
    store_standard_thm_open (Binding.name "distinct_prems_rl")
wenzelm@19051
   620
      (implies_intr_list [AAB, A] (implies_elim_list (assume AAB) [assume A, assume A]))
wenzelm@19051
   621
  end;
wenzelm@19051
   622
nipkow@1756
   623
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==>
nipkow@1756
   624
   (PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi)
nipkow@1756
   625
   `thm COMP swap_prems_rl' swaps the first two premises of `thm'
nipkow@1756
   626
*)
nipkow@1756
   627
val swap_prems_rl =
wenzelm@33277
   628
  let
wenzelm@33277
   629
    val cmajor = read_prop "PhiA ==> PhiB ==> Psi";
wenzelm@33277
   630
    val major = assume cmajor;
wenzelm@33277
   631
    val cminor1 = read_prop "PhiA";
wenzelm@33277
   632
    val minor1 = assume cminor1;
wenzelm@33277
   633
    val cminor2 = read_prop "PhiB";
wenzelm@33277
   634
    val minor2 = assume cminor2;
wenzelm@33277
   635
  in
wenzelm@33277
   636
    store_standard_thm_open (Binding.name "swap_prems_rl")
wenzelm@33277
   637
      (implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1
wenzelm@33277
   638
        (implies_elim (implies_elim major minor1) minor2))))
nipkow@1756
   639
  end;
nipkow@1756
   640
nipkow@3653
   641
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |]
nipkow@3653
   642
   ==> PROP ?phi == PROP ?psi
wenzelm@8328
   643
   Introduction rule for == as a meta-theorem.
nipkow@3653
   644
*)
nipkow@3653
   645
val equal_intr_rule =
wenzelm@33277
   646
  let
wenzelm@33277
   647
    val PQ = read_prop "phi ==> psi";
wenzelm@33277
   648
    val QP = read_prop "psi ==> phi";
wenzelm@4016
   649
  in
wenzelm@33277
   650
    store_standard_thm_open (Binding.name "equal_intr_rule")
wenzelm@4016
   651
      (implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP))))
nipkow@3653
   652
  end;
nipkow@3653
   653
wenzelm@19421
   654
(* PROP ?phi == PROP ?psi ==> PROP ?phi ==> PROP ?psi *)
wenzelm@13368
   655
val equal_elim_rule1 =
wenzelm@33277
   656
  let
wenzelm@33277
   657
    val eq = read_prop "phi::prop == psi::prop";
wenzelm@33277
   658
    val P = read_prop "phi";
wenzelm@33277
   659
  in
wenzelm@33277
   660
    store_standard_thm_open (Binding.name "equal_elim_rule1")
wenzelm@33277
   661
      (Thm.equal_elim (assume eq) (assume P) |> implies_intr_list [eq, P])
wenzelm@13368
   662
  end;
wenzelm@4285
   663
wenzelm@19421
   664
(* PROP ?psi == PROP ?phi ==> PROP ?phi ==> PROP ?psi *)
wenzelm@19421
   665
val equal_elim_rule2 =
wenzelm@33277
   666
  store_standard_thm_open (Binding.name "equal_elim_rule2")
wenzelm@33277
   667
    (symmetric_thm RS equal_elim_rule1);
wenzelm@19421
   668
wenzelm@28618
   669
(* PROP ?phi ==> PROP ?phi ==> PROP ?psi ==> PROP ?psi *)
wenzelm@12297
   670
val remdups_rl =
wenzelm@33277
   671
  let
wenzelm@33277
   672
    val P = read_prop "phi";
wenzelm@33277
   673
    val Q = read_prop "psi";
wenzelm@33277
   674
    val thm = implies_intr_list [P, P, Q] (Thm.assume Q);
wenzelm@33277
   675
  in store_standard_thm_open (Binding.name "remdups_rl") thm end;
wenzelm@12297
   676
wenzelm@12297
   677
wenzelm@28618
   678
wenzelm@28618
   679
(** embedded terms and types **)
wenzelm@28618
   680
wenzelm@28618
   681
local
wenzelm@28618
   682
  val A = certify (Free ("A", propT));
wenzelm@35845
   683
  val axiom = Thm.unvarify_global o Thm.axiom (Context.the_theory (Context.the_thread_data ()));
wenzelm@28674
   684
  val prop_def = axiom "Pure.prop_def";
wenzelm@28674
   685
  val term_def = axiom "Pure.term_def";
wenzelm@28674
   686
  val sort_constraint_def = axiom "Pure.sort_constraint_def";
wenzelm@28618
   687
  val C = Thm.lhs_of sort_constraint_def;
wenzelm@28618
   688
  val T = Thm.dest_arg C;
wenzelm@28618
   689
  val CA = mk_implies (C, A);
wenzelm@28618
   690
in
wenzelm@28618
   691
wenzelm@28618
   692
(* protect *)
wenzelm@28618
   693
wenzelm@28618
   694
val protect = Thm.capply (certify Logic.protectC);
wenzelm@28618
   695
wenzelm@33277
   696
val protectI =
wenzelm@35021
   697
  store_standard_thm (Binding.conceal (Binding.name "protectI"))
wenzelm@35021
   698
    (Thm.equal_elim (Thm.symmetric prop_def) (Thm.assume A));
wenzelm@28618
   699
wenzelm@33277
   700
val protectD =
wenzelm@35021
   701
  store_standard_thm (Binding.conceal (Binding.name "protectD"))
wenzelm@35021
   702
    (Thm.equal_elim prop_def (Thm.assume (protect A)));
wenzelm@28618
   703
wenzelm@33277
   704
val protect_cong =
wenzelm@33277
   705
  store_standard_thm_open (Binding.name "protect_cong") (Thm.reflexive (protect A));
wenzelm@28618
   706
wenzelm@28618
   707
fun implies_intr_protected asms th =
wenzelm@28618
   708
  let val asms' = map protect asms in
wenzelm@28618
   709
    implies_elim_list
wenzelm@28618
   710
      (implies_intr_list asms th)
wenzelm@28618
   711
      (map (fn asm' => Thm.assume asm' RS protectD) asms')
wenzelm@28618
   712
    |> implies_intr_list asms'
wenzelm@28618
   713
  end;
wenzelm@28618
   714
wenzelm@28618
   715
wenzelm@28618
   716
(* term *)
wenzelm@28618
   717
wenzelm@33277
   718
val termI =
wenzelm@35021
   719
  store_standard_thm (Binding.conceal (Binding.name "termI"))
wenzelm@35021
   720
    (Thm.equal_elim (Thm.symmetric term_def) (Thm.forall_intr A (Thm.trivial A)));
wenzelm@9554
   721
wenzelm@28618
   722
fun mk_term ct =
wenzelm@28618
   723
  let
wenzelm@28618
   724
    val thy = Thm.theory_of_cterm ct;
wenzelm@28618
   725
    val cert = Thm.cterm_of thy;
wenzelm@28618
   726
    val certT = Thm.ctyp_of thy;
wenzelm@28618
   727
    val T = Thm.typ_of (Thm.ctyp_of_term ct);
wenzelm@28618
   728
    val a = certT (TVar (("'a", 0), []));
wenzelm@28618
   729
    val x = cert (Var (("x", 0), T));
wenzelm@28618
   730
  in Thm.instantiate ([(a, certT T)], [(x, ct)]) termI end;
wenzelm@28618
   731
wenzelm@28618
   732
fun dest_term th =
wenzelm@28618
   733
  let val cprop = strip_imp_concl (Thm.cprop_of th) in
wenzelm@28618
   734
    if can Logic.dest_term (Thm.term_of cprop) then
wenzelm@28618
   735
      Thm.dest_arg cprop
wenzelm@28618
   736
    else raise THM ("dest_term", 0, [th])
wenzelm@28618
   737
  end;
wenzelm@28618
   738
wenzelm@28618
   739
fun cterm_rule f = dest_term o f o mk_term;
wenzelm@28618
   740
fun term_rule thy f t = Thm.term_of (cterm_rule f (Thm.cterm_of thy t));
wenzelm@28618
   741
wenzelm@28618
   742
val dummy_thm = mk_term (certify (Term.dummy_pattern propT));
wenzelm@28618
   743
wenzelm@28618
   744
wenzelm@28618
   745
(* sort_constraint *)
wenzelm@28618
   746
wenzelm@33277
   747
val sort_constraintI =
wenzelm@35021
   748
  store_standard_thm (Binding.conceal (Binding.name "sort_constraintI"))
wenzelm@35021
   749
    (Thm.equal_elim (Thm.symmetric sort_constraint_def) (mk_term T));
wenzelm@28618
   750
wenzelm@33277
   751
val sort_constraint_eq =
wenzelm@35021
   752
  store_standard_thm (Binding.conceal (Binding.name "sort_constraint_eq"))
wenzelm@35021
   753
    (Thm.equal_intr
wenzelm@35845
   754
      (Thm.implies_intr CA (Thm.implies_elim (Thm.assume CA)
wenzelm@35845
   755
        (Thm.unvarify_global sort_constraintI)))
wenzelm@35021
   756
      (implies_intr_list [A, C] (Thm.assume A)));
wenzelm@28618
   757
wenzelm@28618
   758
end;
wenzelm@28618
   759
wenzelm@28618
   760
wenzelm@28618
   761
(* HHF normalization *)
wenzelm@28618
   762
wenzelm@28618
   763
(* (PROP ?phi ==> (!!x. PROP ?psi(x))) == (!!x. PROP ?phi ==> PROP ?psi(x)) *)
wenzelm@9554
   764
val norm_hhf_eq =
wenzelm@9554
   765
  let
wenzelm@14854
   766
    val aT = TFree ("'a", []);
wenzelm@9554
   767
    val all = Term.all aT;
wenzelm@9554
   768
    val x = Free ("x", aT);
wenzelm@9554
   769
    val phi = Free ("phi", propT);
wenzelm@9554
   770
    val psi = Free ("psi", aT --> propT);
wenzelm@9554
   771
wenzelm@26487
   772
    val cx = certify x;
wenzelm@26487
   773
    val cphi = certify phi;
wenzelm@26487
   774
    val lhs = certify (Logic.mk_implies (phi, all $ Abs ("x", aT, psi $ Bound 0)));
wenzelm@26487
   775
    val rhs = certify (all $ Abs ("x", aT, Logic.mk_implies (phi, psi $ Bound 0)));
wenzelm@9554
   776
  in
wenzelm@9554
   777
    Thm.equal_intr
wenzelm@9554
   778
      (Thm.implies_elim (Thm.assume lhs) (Thm.assume cphi)
wenzelm@9554
   779
        |> Thm.forall_elim cx
wenzelm@9554
   780
        |> Thm.implies_intr cphi
wenzelm@9554
   781
        |> Thm.forall_intr cx
wenzelm@9554
   782
        |> Thm.implies_intr lhs)
wenzelm@9554
   783
      (Thm.implies_elim
wenzelm@9554
   784
          (Thm.assume rhs |> Thm.forall_elim cx) (Thm.assume cphi)
wenzelm@9554
   785
        |> Thm.forall_intr cx
wenzelm@9554
   786
        |> Thm.implies_intr cphi
wenzelm@9554
   787
        |> Thm.implies_intr rhs)
wenzelm@33277
   788
    |> store_standard_thm_open (Binding.name "norm_hhf_eq")
wenzelm@9554
   789
  end;
wenzelm@9554
   790
wenzelm@18179
   791
val norm_hhf_prop = Logic.dest_equals (Thm.prop_of norm_hhf_eq);
wenzelm@28618
   792
val norm_hhf_eqs = [norm_hhf_eq, sort_constraint_eq];
wenzelm@18179
   793
wenzelm@30553
   794
fun is_norm_hhf (Const ("Pure.sort_constraint", _)) = false
wenzelm@30553
   795
  | is_norm_hhf (Const ("==>", _) $ _ $ (Const ("all", _) $ _)) = false
wenzelm@30553
   796
  | is_norm_hhf (Abs _ $ _) = false
wenzelm@30553
   797
  | is_norm_hhf (t $ u) = is_norm_hhf t andalso is_norm_hhf u
wenzelm@30553
   798
  | is_norm_hhf (Abs (_, _, t)) = is_norm_hhf t
wenzelm@30553
   799
  | is_norm_hhf _ = true;
wenzelm@12800
   800
wenzelm@16425
   801
fun norm_hhf thy t =
wenzelm@12800
   802
  if is_norm_hhf t then t
wenzelm@18179
   803
  else Pattern.rewrite_term thy [norm_hhf_prop] [] t;
wenzelm@18179
   804
wenzelm@20298
   805
fun norm_hhf_cterm ct =
wenzelm@20298
   806
  if is_norm_hhf (Thm.term_of ct) then ct
wenzelm@20298
   807
  else cterm_fun (Pattern.rewrite_term (Thm.theory_of_cterm ct) [norm_hhf_prop] []) ct;
wenzelm@20298
   808
wenzelm@12800
   809
wenzelm@21603
   810
(* var indexes *)
wenzelm@21603
   811
paulson@24426
   812
(*Increment the indexes of only the type variables*)
paulson@24426
   813
fun incr_type_indexes inc th =
wenzelm@29270
   814
  let val tvs = OldTerm.term_tvars (prop_of th)
wenzelm@29270
   815
      and thy = Thm.theory_of_thm th
paulson@24426
   816
      fun inc_tvar ((a,i),s) = pairself (ctyp_of thy) (TVar ((a,i),s), TVar ((a,i+inc),s))
paulson@24426
   817
  in Thm.instantiate (map inc_tvar tvs, []) th end;
paulson@24426
   818
wenzelm@21603
   819
fun incr_indexes th = Thm.incr_indexes (Thm.maxidx_of th + 1);
wenzelm@21603
   820
wenzelm@21603
   821
fun incr_indexes2 th1 th2 =
wenzelm@21603
   822
  Thm.incr_indexes (Int.max (Thm.maxidx_of th1, Thm.maxidx_of th2) + 1);
wenzelm@21603
   823
wenzelm@21603
   824
fun th1 INCR_COMP th2 = incr_indexes th2 th1 COMP th2;
wenzelm@21603
   825
fun th1 COMP_INCR th2 = th1 COMP incr_indexes th1 th2;
wenzelm@21603
   826
wenzelm@29344
   827
fun comp_no_flatten (th, n) i rule =
wenzelm@29344
   828
  (case distinct Thm.eq_thm (Seq.list_of
wenzelm@29344
   829
      (Thm.compose_no_flatten false (th, n) i (incr_indexes th rule))) of
wenzelm@29344
   830
    [th'] => th'
wenzelm@29344
   831
  | [] => raise THM ("comp_no_flatten", i, [th, rule])
wenzelm@29344
   832
  | _ => raise THM ("comp_no_flatten: unique result expected", i, [th, rule]));
wenzelm@29344
   833
wenzelm@29344
   834
wenzelm@9554
   835
wenzelm@16425
   836
(*** Instantiate theorem th, reading instantiations in theory thy ****)
paulson@8129
   837
paulson@8129
   838
(*Version that normalizes the result: Thm.instantiate no longer does that*)
wenzelm@21603
   839
fun instantiate instpair th =
wenzelm@21603
   840
  Thm.adjust_maxidx_thm ~1 (Thm.instantiate instpair th COMP_INCR asm_rl);
paulson@8129
   841
paulson@8129
   842
(*Left-to-right replacements: tpairs = [...,(vi,ti),...].
paulson@8129
   843
  Instantiates distinct Vars by terms, inferring type instantiations. *)
paulson@8129
   844
local
wenzelm@16425
   845
  fun add_types ((ct,cu), (thy,tye,maxidx)) =
wenzelm@26627
   846
    let
wenzelm@26627
   847
        val thyt = Thm.theory_of_cterm ct;
wenzelm@26627
   848
        val thyu = Thm.theory_of_cterm cu;
wenzelm@26627
   849
        val {t, T, maxidx = maxt, ...} = Thm.rep_cterm ct;
wenzelm@26627
   850
        val {t = u, T = U, maxidx = maxu, ...} = Thm.rep_cterm cu;
paulson@8129
   851
        val maxi = Int.max(maxidx, Int.max(maxt, maxu));
wenzelm@16425
   852
        val thy' = Theory.merge(thy, Theory.merge(thyt, thyu))
wenzelm@16949
   853
        val (tye',maxi') = Sign.typ_unify thy' (T, U) (tye, maxi)
berghofe@25470
   854
          handle Type.TUNIFY => raise TYPE ("Ill-typed instantiation:\nType\n" ^
wenzelm@26939
   855
            Syntax.string_of_typ_global thy' (Envir.norm_type tye T) ^
berghofe@25470
   856
            "\nof variable " ^
wenzelm@26939
   857
            Syntax.string_of_term_global thy' (Term.map_types (Envir.norm_type tye) t) ^
berghofe@25470
   858
            "\ncannot be unified with type\n" ^
wenzelm@26939
   859
            Syntax.string_of_typ_global thy' (Envir.norm_type tye U) ^ "\nof term " ^
wenzelm@26939
   860
            Syntax.string_of_term_global thy' (Term.map_types (Envir.norm_type tye) u),
berghofe@25470
   861
            [T, U], [t, u])
wenzelm@16425
   862
    in  (thy', tye', maxi')  end;
paulson@8129
   863
in
paulson@22561
   864
fun cterm_instantiate [] th = th
paulson@22561
   865
  | cterm_instantiate ctpairs0 th =
wenzelm@23178
   866
  let val (thy,tye,_) = List.foldr add_types (Thm.theory_of_thm th, Vartab.empty, 0) ctpairs0
wenzelm@18179
   867
      fun instT(ct,cu) =
paulson@22287
   868
        let val inst = cterm_of thy o Term.map_types (Envir.norm_type tye) o term_of
paulson@14340
   869
        in (inst ct, inst cu) end
paulson@22307
   870
      fun ctyp2 (ixn, (S, T)) = (ctyp_of thy (TVar (ixn, S)), ctyp_of thy (Envir.norm_type tye T))
berghofe@8406
   871
  in  instantiate (map ctyp2 (Vartab.dest tye), map instT ctpairs0) th  end
paulson@8129
   872
  handle TERM _ =>
wenzelm@16425
   873
           raise THM("cterm_instantiate: incompatible theories",0,[th])
paulson@8129
   874
       | TYPE (msg, _, _) => raise THM(msg, 0, [th])
paulson@8129
   875
end;
paulson@8129
   876
paulson@8129
   877
wenzelm@4789
   878
wenzelm@5688
   879
(** variations on instantiate **)
wenzelm@4285
   880
wenzelm@4285
   881
(* instantiate by left-to-right occurrence of variables *)
wenzelm@4285
   882
wenzelm@4285
   883
fun instantiate' cTs cts thm =
wenzelm@4285
   884
  let
wenzelm@4285
   885
    fun err msg =
wenzelm@4285
   886
      raise TYPE ("instantiate': " ^ msg,
wenzelm@19482
   887
        map_filter (Option.map Thm.typ_of) cTs,
wenzelm@19482
   888
        map_filter (Option.map Thm.term_of) cts);
wenzelm@4285
   889
wenzelm@4285
   890
    fun inst_of (v, ct) =
wenzelm@16425
   891
      (Thm.cterm_of (Thm.theory_of_cterm ct) (Var v), ct)
wenzelm@4285
   892
        handle TYPE (msg, _, _) => err msg;
wenzelm@4285
   893
berghofe@15797
   894
    fun tyinst_of (v, cT) =
wenzelm@16425
   895
      (Thm.ctyp_of (Thm.theory_of_ctyp cT) (TVar v), cT)
berghofe@15797
   896
        handle TYPE (msg, _, _) => err msg;
berghofe@15797
   897
wenzelm@20298
   898
    fun zip_vars xs ys =
wenzelm@20298
   899
      zip_options xs ys handle Library.UnequalLengths =>
wenzelm@20298
   900
        err "more instantiations than variables in thm";
wenzelm@4285
   901
wenzelm@4285
   902
    (*instantiate types first!*)
wenzelm@4285
   903
    val thm' =
wenzelm@4285
   904
      if forall is_none cTs then thm
wenzelm@20298
   905
      else Thm.instantiate
wenzelm@22695
   906
        (map tyinst_of (zip_vars (rev (Thm.fold_terms Term.add_tvars thm [])) cTs), []) thm;
wenzelm@20579
   907
    val thm'' =
wenzelm@4285
   908
      if forall is_none cts then thm'
wenzelm@20298
   909
      else Thm.instantiate
wenzelm@22695
   910
        ([], map inst_of (zip_vars (rev (Thm.fold_terms Term.add_vars thm' [])) cts)) thm';
wenzelm@20298
   911
    in thm'' end;
wenzelm@4285
   912
wenzelm@4285
   913
berghofe@14081
   914
berghofe@14081
   915
(** renaming of bound variables **)
berghofe@14081
   916
berghofe@14081
   917
(* replace bound variables x_i in thm by y_i *)
berghofe@14081
   918
(* where vs = [(x_1, y_1), ..., (x_n, y_n)]  *)
berghofe@14081
   919
berghofe@14081
   920
fun rename_bvars [] thm = thm
berghofe@14081
   921
  | rename_bvars vs thm =
wenzelm@26627
   922
      let
wenzelm@26627
   923
        val cert = Thm.cterm_of (Thm.theory_of_thm thm);
wenzelm@26627
   924
        fun ren (Abs (x, T, t)) = Abs (AList.lookup (op =) vs x |> the_default x, T, ren t)
wenzelm@26627
   925
          | ren (t $ u) = ren t $ ren u
wenzelm@26627
   926
          | ren t = t;
wenzelm@26627
   927
      in equal_elim (reflexive (cert (ren (Thm.prop_of thm)))) thm end;
berghofe@14081
   928
berghofe@14081
   929
berghofe@14081
   930
(* renaming in left-to-right order *)
berghofe@14081
   931
berghofe@14081
   932
fun rename_bvars' xs thm =
berghofe@14081
   933
  let
wenzelm@26627
   934
    val cert = Thm.cterm_of (Thm.theory_of_thm thm);
wenzelm@26627
   935
    val prop = Thm.prop_of thm;
berghofe@14081
   936
    fun rename [] t = ([], t)
berghofe@14081
   937
      | rename (x' :: xs) (Abs (x, T, t)) =
berghofe@14081
   938
          let val (xs', t') = rename xs t
wenzelm@18929
   939
          in (xs', Abs (the_default x x', T, t')) end
berghofe@14081
   940
      | rename xs (t $ u) =
berghofe@14081
   941
          let
berghofe@14081
   942
            val (xs', t') = rename xs t;
berghofe@14081
   943
            val (xs'', u') = rename xs' u
berghofe@14081
   944
          in (xs'', t' $ u') end
berghofe@14081
   945
      | rename xs t = (xs, t);
berghofe@14081
   946
  in case rename xs prop of
wenzelm@26627
   947
      ([], prop') => equal_elim (reflexive (cert prop')) thm
berghofe@14081
   948
    | _ => error "More names than abstractions in theorem"
berghofe@14081
   949
  end;
berghofe@14081
   950
berghofe@14081
   951
wenzelm@11975
   952
wenzelm@18225
   953
(** multi_resolve **)
wenzelm@18225
   954
wenzelm@18225
   955
local
wenzelm@18225
   956
wenzelm@18225
   957
fun res th i rule =
wenzelm@18225
   958
  Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
wenzelm@18225
   959
wenzelm@18225
   960
fun multi_res _ [] rule = Seq.single rule
wenzelm@18225
   961
  | multi_res i (th :: ths) rule = Seq.maps (res th i) (multi_res (i + 1) ths rule);
wenzelm@18225
   962
wenzelm@18225
   963
in
wenzelm@18225
   964
wenzelm@18225
   965
val multi_resolve = multi_res 1;
wenzelm@18225
   966
fun multi_resolves facts rules = Seq.maps (multi_resolve facts) (Seq.of_list rules);
wenzelm@18225
   967
wenzelm@18225
   968
end;
wenzelm@18225
   969
wenzelm@11975
   970
end;
wenzelm@5903
   971
wenzelm@35021
   972
structure Basic_Drule: BASIC_DRULE = Drule;
wenzelm@35021
   973
open Basic_Drule;