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