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