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