src/Pure/Isar/element.ML
author wenzelm
Wed Aug 02 22:26:58 2006 +0200 (2006-08-02)
changeset 20304 500a3373c93c
parent 20264 f09a4003e12d
child 20548 8ef25fe585a8
permissions -rw-r--r--
removed obsolete Drule.frees/vars_of etc.;
tuned;
wenzelm@18140
     1
(*  Title:      Pure/Isar/element.ML
wenzelm@18140
     2
    ID:         $Id$
wenzelm@18140
     3
    Author:     Makarius
wenzelm@18140
     4
wenzelm@19777
     5
Explicit data structures for some Isar language elements, with derived
wenzelm@19777
     6
logical operations.
wenzelm@18140
     7
*)
wenzelm@18140
     8
wenzelm@18140
     9
signature ELEMENT =
wenzelm@18140
    10
sig
wenzelm@19259
    11
  datatype ('typ, 'term) stmt =
wenzelm@19585
    12
    Shows of ((string * Attrib.src list) * ('term * 'term list) list) list |
wenzelm@19259
    13
    Obtains of (string * ((string * 'typ option) list * 'term list)) list
wenzelm@19259
    14
  type statement  (*= (string, string) stmt*)
wenzelm@19259
    15
  type statement_i  (*= (typ, term) stmt*)
wenzelm@18140
    16
  datatype ('typ, 'term, 'fact) ctxt =
wenzelm@18669
    17
    Fixes of (string * 'typ option * mixfix) list |
wenzelm@18140
    18
    Constrains of (string * 'typ) list |
wenzelm@19585
    19
    Assumes of ((string * Attrib.src list) * ('term * 'term list) list) list |
wenzelm@18140
    20
    Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@18140
    21
    Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list
wenzelm@18140
    22
  type context (*= (string, string, thmref) ctxt*)
wenzelm@18140
    23
  type context_i (*= (typ, term, thm list) ctxt*)
wenzelm@18140
    24
  val map_ctxt: {name: string -> string,
wenzelm@18669
    25
    var: string * mixfix -> string * mixfix,
wenzelm@18140
    26
    typ: 'typ -> 'a, term: 'term -> 'b, fact: 'fact -> 'c,
wenzelm@18140
    27
    attrib: Attrib.src -> Attrib.src} -> ('typ, 'term, 'fact) ctxt -> ('a, 'b, 'c) ctxt
wenzelm@18140
    28
  val map_ctxt_values: (typ -> typ) -> (term -> term) -> (thm -> thm) -> context_i -> context_i
wenzelm@19808
    29
  val params_of: context_i -> (string * typ) list
wenzelm@19808
    30
  val prems_of: context_i -> term list
wenzelm@19808
    31
  val facts_of: theory -> context_i ->
wenzelm@19808
    32
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list
wenzelm@19777
    33
  val pretty_stmt: Proof.context -> statement_i -> Pretty.T list
wenzelm@19777
    34
  val pretty_ctxt: Proof.context -> context_i -> Pretty.T list
wenzelm@19777
    35
  val pretty_statement: Proof.context -> string -> thm -> Pretty.T
wenzelm@19777
    36
  type witness
wenzelm@19777
    37
  val map_witness: (term * thm -> term * thm) -> witness -> witness
wenzelm@19777
    38
  val witness_prop: witness -> term
wenzelm@19777
    39
  val witness_hyps: witness -> term list
wenzelm@19777
    40
  val assume_witness: theory -> term -> witness
wenzelm@20058
    41
  val prove_witness: Proof.context -> term -> tactic -> witness
wenzelm@19777
    42
  val conclude_witness: witness -> thm
wenzelm@19777
    43
  val mark_witness: term -> term
wenzelm@19777
    44
  val make_witness: term -> thm -> witness
ballarin@19931
    45
  val dest_witness: witness -> term * thm
ballarin@20068
    46
  val transfer_witness: theory -> witness -> witness
wenzelm@19808
    47
  val refine_witness: Proof.state -> Proof.state Seq.seq
wenzelm@18140
    48
  val rename: (string * (string * mixfix option)) list -> string -> string
wenzelm@18669
    49
  val rename_var: (string * (string * mixfix option)) list -> string * mixfix -> string * mixfix
wenzelm@18140
    50
  val rename_term: (string * (string * mixfix option)) list -> term -> term
wenzelm@18140
    51
  val rename_thm: (string * (string * mixfix option)) list -> thm -> thm
wenzelm@19777
    52
  val rename_witness: (string * (string * mixfix option)) list -> witness -> witness
wenzelm@18140
    53
  val rename_ctxt: (string * (string * mixfix option)) list -> context_i -> context_i
wenzelm@18140
    54
  val instT_type: typ Symtab.table -> typ -> typ
wenzelm@18140
    55
  val instT_term: typ Symtab.table -> term -> term
wenzelm@18140
    56
  val instT_thm: theory -> typ Symtab.table -> thm -> thm
wenzelm@19777
    57
  val instT_witness: theory -> typ Symtab.table -> witness -> witness
wenzelm@18140
    58
  val instT_ctxt: theory -> typ Symtab.table -> context_i -> context_i
wenzelm@18140
    59
  val inst_term: typ Symtab.table * term Symtab.table -> term -> term
wenzelm@18140
    60
  val inst_thm: theory -> typ Symtab.table * term Symtab.table -> thm -> thm
wenzelm@19777
    61
  val inst_witness: theory -> typ Symtab.table * term Symtab.table -> witness -> witness
wenzelm@18140
    62
  val inst_ctxt: theory -> typ Symtab.table * term Symtab.table -> context_i -> context_i
wenzelm@19777
    63
  val satisfy_thm: witness list -> thm -> thm
wenzelm@19777
    64
  val satisfy_witness: witness list -> witness -> witness
wenzelm@19843
    65
  val satisfy_ctxt: witness list -> context_i -> context_i
wenzelm@20264
    66
  val satisfy_facts: witness list ->
wenzelm@20264
    67
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@20264
    68
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list
wenzelm@20264
    69
  val generalize_facts: Proof.context -> Proof.context ->
wenzelm@20264
    70
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@20264
    71
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list
wenzelm@18140
    72
end;
wenzelm@18140
    73
wenzelm@18140
    74
structure Element: ELEMENT =
wenzelm@18140
    75
struct
wenzelm@18140
    76
wenzelm@19259
    77
wenzelm@19777
    78
(** language elements **)
wenzelm@19777
    79
wenzelm@19777
    80
(* statement *)
wenzelm@19259
    81
wenzelm@19259
    82
datatype ('typ, 'term) stmt =
wenzelm@19585
    83
  Shows of ((string * Attrib.src list) * ('term * 'term list) list) list |
wenzelm@19259
    84
  Obtains of (string * ((string * 'typ option) list * 'term list)) list;
wenzelm@19259
    85
wenzelm@19259
    86
type statement = (string, string) stmt;
wenzelm@19259
    87
type statement_i = (typ, term) stmt;
wenzelm@19259
    88
wenzelm@19259
    89
wenzelm@19777
    90
(* context *)
wenzelm@18140
    91
wenzelm@18140
    92
datatype ('typ, 'term, 'fact) ctxt =
wenzelm@18669
    93
  Fixes of (string * 'typ option * mixfix) list |
wenzelm@18140
    94
  Constrains of (string * 'typ) list |
wenzelm@19585
    95
  Assumes of ((string * Attrib.src list) * ('term * 'term list) list) list |
wenzelm@18140
    96
  Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@18140
    97
  Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list;
wenzelm@18140
    98
wenzelm@18140
    99
type context = (string, string, thmref) ctxt;
wenzelm@18140
   100
type context_i = (typ, term, thm list) ctxt;
wenzelm@18140
   101
wenzelm@18140
   102
fun map_ctxt {name, var, typ, term, fact, attrib} =
wenzelm@18140
   103
  fn Fixes fixes => Fixes (fixes |> map (fn (x, T, mx) =>
wenzelm@18140
   104
       let val (x', mx') = var (x, mx) in (x', Option.map typ T, mx') end))
wenzelm@18669
   105
   | Constrains xs => Constrains (xs |> map (fn (x, T) => (#1 (var (x, NoSyn)), typ T)))
wenzelm@18140
   106
   | Assumes asms => Assumes (asms |> map (fn ((a, atts), propps) =>
wenzelm@19585
   107
      ((name a, map attrib atts), propps |> map (fn (t, ps) => (term t, map term ps)))))
wenzelm@18140
   108
   | Defines defs => Defines (defs |> map (fn ((a, atts), (t, ps)) =>
wenzelm@18140
   109
      ((name a, map attrib atts), (term t, map term ps))))
wenzelm@18140
   110
   | Notes facts => Notes (facts |> map (fn ((a, atts), bs) =>
wenzelm@18140
   111
      ((name a, map attrib atts), bs |> map (fn (ths, btts) => (fact ths, map attrib btts)))));
wenzelm@18140
   112
wenzelm@18140
   113
fun map_ctxt_values typ term thm = map_ctxt
wenzelm@18140
   114
  {name = I, var = I, typ = typ, term = term, fact = map thm,
wenzelm@18140
   115
    attrib = Args.map_values I typ term thm};
wenzelm@18140
   116
wenzelm@19808
   117
wenzelm@19808
   118
(* logical content *)
wenzelm@19808
   119
wenzelm@19777
   120
fun params_of (Fixes fixes) = fixes |> map
wenzelm@19777
   121
    (fn (x, SOME T, _) => (x, T)
wenzelm@19777
   122
      | (x, _, _) => raise TERM ("Untyped context element parameter " ^ quote x, []))
wenzelm@19777
   123
  | params_of _ = [];
wenzelm@18140
   124
wenzelm@19777
   125
fun prems_of (Assumes asms) = maps (map fst o snd) asms
wenzelm@19777
   126
  | prems_of (Defines defs) = map (fst o snd) defs
wenzelm@19777
   127
  | prems_of _ = [];
wenzelm@18140
   128
wenzelm@20233
   129
fun assume thy t = Assumption.assume (Thm.cterm_of thy t);
wenzelm@19808
   130
wenzelm@19808
   131
fun facts_of thy (Assumes asms) = map (apsnd (map (fn (t, _) => ([assume thy t], [])))) asms
wenzelm@19808
   132
  | facts_of thy (Defines defs) = map (apsnd (fn (t, _) => [([assume thy t], [])])) defs
wenzelm@19808
   133
  | facts_of _ (Notes facts) = facts
wenzelm@19808
   134
  | facts_of _ _ = [];
wenzelm@19808
   135
wenzelm@18894
   136
wenzelm@18894
   137
wenzelm@19259
   138
(** pretty printing **)
wenzelm@19259
   139
wenzelm@19267
   140
fun pretty_items _ _ [] = []
wenzelm@19267
   141
  | pretty_items keyword sep (x :: ys) =
wenzelm@19267
   142
      Pretty.block [Pretty.keyword keyword, Pretty.brk 1, x] ::
wenzelm@19267
   143
        map (fn y => Pretty.block [Pretty.str "  ", Pretty.keyword sep, Pretty.brk 1, y]) ys;
wenzelm@19259
   144
wenzelm@19259
   145
fun pretty_name_atts ctxt (name, atts) sep =
wenzelm@19259
   146
  if name = "" andalso null atts then []
wenzelm@19731
   147
  else [Pretty.block
wenzelm@19731
   148
    (Pretty.breaks (Pretty.str name :: Args.pretty_attribs ctxt atts @ [Pretty.str sep]))];
wenzelm@19259
   149
wenzelm@19259
   150
wenzelm@19259
   151
(* pretty_stmt *)
wenzelm@19259
   152
wenzelm@19259
   153
fun pretty_stmt ctxt =
wenzelm@19259
   154
  let
wenzelm@19259
   155
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@19259
   156
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@19267
   157
    val prt_terms = separate (Pretty.keyword "and") o map prt_term;
wenzelm@19259
   158
    val prt_name_atts = pretty_name_atts ctxt;
wenzelm@19259
   159
wenzelm@19259
   160
    fun prt_show (a, ts) =
wenzelm@19267
   161
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ prt_terms (map fst ts)));
wenzelm@19259
   162
wenzelm@19259
   163
    fun prt_var (x, SOME T) = Pretty.block [Pretty.str (x ^ " ::"), Pretty.brk 1, prt_typ T]
wenzelm@19259
   164
      | prt_var (x, NONE) = Pretty.str x;
wenzelm@19585
   165
    val prt_vars =  separate (Pretty.keyword "and") o map prt_var;
wenzelm@19259
   166
wenzelm@19267
   167
    fun prt_obtain (_, ([], ts)) = Pretty.block (Pretty.breaks (prt_terms ts))
wenzelm@19259
   168
      | prt_obtain (_, (xs, ts)) = Pretty.block (Pretty.breaks
wenzelm@19585
   169
          (prt_vars xs @ [Pretty.keyword "where"] @ prt_terms ts));
wenzelm@19259
   170
  in
wenzelm@19267
   171
    fn Shows shows => pretty_items "shows" "and" (map prt_show shows)
wenzelm@19267
   172
     | Obtains obtains => pretty_items "obtains" "|" (map prt_obtain obtains)
wenzelm@19259
   173
  end;
wenzelm@19259
   174
wenzelm@18894
   175
wenzelm@19259
   176
(* pretty_ctxt *)
wenzelm@19259
   177
wenzelm@19259
   178
fun pretty_ctxt ctxt =
wenzelm@19259
   179
  let
wenzelm@19259
   180
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@19259
   181
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@19259
   182
    val prt_thm = Pretty.backquote o ProofContext.pretty_thm ctxt;
wenzelm@19259
   183
    val prt_name_atts = pretty_name_atts ctxt;
wenzelm@19259
   184
wenzelm@19267
   185
    fun prt_mixfix NoSyn = []
wenzelm@19267
   186
      | prt_mixfix mx = [Pretty.brk 2, Syntax.pretty_mixfix mx];
wenzelm@19267
   187
wenzelm@19259
   188
    fun prt_fix (x, SOME T, mx) = Pretty.block (Pretty.str (x ^ " ::") :: Pretty.brk 1 ::
wenzelm@19259
   189
          prt_typ T :: Pretty.brk 1 :: prt_mixfix mx)
wenzelm@19259
   190
      | prt_fix (x, NONE, mx) = Pretty.block (Pretty.str x :: Pretty.brk 1 :: prt_mixfix mx);
wenzelm@19259
   191
    fun prt_constrain (x, T) = prt_fix (x, SOME T, NoSyn);
wenzelm@18894
   192
wenzelm@19259
   193
    fun prt_asm (a, ts) =
wenzelm@19259
   194
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ map (prt_term o fst) ts));
wenzelm@19259
   195
    fun prt_def (a, (t, _)) =
wenzelm@19259
   196
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ [prt_term t]));
wenzelm@19259
   197
wenzelm@19259
   198
    fun prt_fact (ths, []) = map prt_thm ths
wenzelm@19259
   199
      | prt_fact (ths, atts) = Pretty.enclose "(" ")"
wenzelm@19259
   200
          (Pretty.breaks (map prt_thm ths)) :: Args.pretty_attribs ctxt atts;
wenzelm@19259
   201
    fun prt_note (a, ths) =
wenzelm@19482
   202
      Pretty.block (Pretty.breaks (flat (prt_name_atts a "=" :: map prt_fact ths)));
wenzelm@19259
   203
  in
wenzelm@19267
   204
    fn Fixes fixes => pretty_items "fixes" "and" (map prt_fix fixes)
wenzelm@19267
   205
     | Constrains xs => pretty_items "constrains" "and" (map prt_constrain xs)
wenzelm@19267
   206
     | Assumes asms => pretty_items "assumes" "and" (map prt_asm asms)
wenzelm@19267
   207
     | Defines defs => pretty_items "defines" "and" (map prt_def defs)
wenzelm@19267
   208
     | Notes facts => pretty_items "notes" "and" (map prt_note facts)
wenzelm@19259
   209
  end;
wenzelm@18894
   210
wenzelm@19267
   211
wenzelm@19267
   212
(* pretty_statement *)
wenzelm@19267
   213
wenzelm@19267
   214
local
wenzelm@19267
   215
wenzelm@19267
   216
fun thm_name kind th prts =
wenzelm@19267
   217
  let val head =
wenzelm@19267
   218
    (case #1 (Thm.get_name_tags th) of
wenzelm@19267
   219
      "" => Pretty.command kind
wenzelm@19267
   220
    | a => Pretty.block [Pretty.command kind, Pretty.brk 1, Pretty.str (Sign.base_name a ^ ":")])
wenzelm@19267
   221
  in Pretty.block (Pretty.fbreaks (head :: prts)) end;
wenzelm@19267
   222
wenzelm@19267
   223
fun obtain prop ctxt =
wenzelm@19267
   224
  let
wenzelm@20150
   225
    val ((xs, prop'), ctxt') = Variable.focus prop ctxt;
wenzelm@20150
   226
    val As = Logic.strip_imp_prems (Thm.term_of prop');
wenzelm@20150
   227
    fun var (x, T) = (ProofContext.revert_skolem ctxt' x, SOME T);
wenzelm@20218
   228
  in (("", (map (var o Term.dest_Free o Thm.term_of) xs, As)), ctxt') end;
wenzelm@19267
   229
wenzelm@19267
   230
in
wenzelm@19267
   231
wenzelm@19267
   232
fun pretty_statement ctxt kind raw_th =
wenzelm@19267
   233
  let
wenzelm@19267
   234
    val thy = ProofContext.theory_of ctxt;
wenzelm@20150
   235
    val cert = Thm.cterm_of thy;
wenzelm@20150
   236
wenzelm@20233
   237
    val th = norm_hhf raw_th;
wenzelm@20150
   238
    val is_elim = ObjectLogic.is_elim th;
wenzelm@19267
   239
wenzelm@20218
   240
    val ((_, [th']), ctxt') = Variable.import true [th] ctxt;
wenzelm@20150
   241
    val prop = Thm.prop_of th';
wenzelm@20150
   242
    val (prems, concl) = Logic.strip_horn prop;
wenzelm@20150
   243
    val concl_term = ObjectLogic.drop_judgment thy concl;
wenzelm@19267
   244
wenzelm@20150
   245
    val fixes = fold_aterms (fn v as Free (x, T) =>
wenzelm@20150
   246
        if Variable.newly_fixed ctxt' ctxt x andalso not (v aconv concl_term)
wenzelm@20150
   247
        then insert (op =) (x, T) else I | _ => I) prop []
wenzelm@20150
   248
      |> rev |> map (apfst (ProofContext.revert_skolem ctxt'));
wenzelm@20150
   249
    val (assumes, cases) = take_suffix (fn prem =>
wenzelm@20150
   250
      is_elim andalso concl aconv Logic.strip_assums_concl prem) prems;
wenzelm@19267
   251
  in
wenzelm@20150
   252
    pretty_ctxt ctxt' (Fixes (map (fn (x, T) => (x, SOME T, NoSyn)) fixes)) @
wenzelm@20150
   253
    pretty_ctxt ctxt' (Assumes (map (fn t => (("", []), [(t, [])])) assumes)) @
wenzelm@20150
   254
    pretty_stmt ctxt'
wenzelm@19585
   255
     (if null cases then Shows [(("", []), [(concl, [])])]
wenzelm@20150
   256
      else Obtains (#1 (fold_map (obtain o cert) cases ctxt')))
wenzelm@19267
   257
  end |> thm_name kind raw_th;
wenzelm@19267
   258
wenzelm@18140
   259
end;
wenzelm@19267
   260
wenzelm@19777
   261
wenzelm@19777
   262
wenzelm@19777
   263
(** logical operations **)
wenzelm@19777
   264
wenzelm@19777
   265
(* witnesses -- hypotheses as protected facts *)
wenzelm@19777
   266
wenzelm@19777
   267
datatype witness = Witness of term * thm;
wenzelm@19777
   268
wenzelm@19777
   269
fun map_witness f (Witness witn) = Witness (f witn);
wenzelm@19777
   270
wenzelm@19777
   271
fun witness_prop (Witness (t, _)) = t;
wenzelm@19777
   272
fun witness_hyps (Witness (_, th)) = #hyps (Thm.rep_thm th);
wenzelm@19777
   273
wenzelm@19777
   274
fun assume_witness thy t =
wenzelm@19777
   275
  Witness (t, Goal.protect (Thm.assume (Thm.cterm_of thy t)));
wenzelm@19777
   276
wenzelm@20058
   277
fun prove_witness ctxt t tac =
wenzelm@20058
   278
  Witness (t, Goal.prove ctxt [] [] (Logic.protect t) (fn _ =>
wenzelm@19777
   279
    Tactic.rtac Drule.protectI 1 THEN tac));
wenzelm@19777
   280
wenzelm@20233
   281
fun conclude_witness (Witness (_, th)) = norm_hhf (Goal.conclude th);
wenzelm@19777
   282
wenzelm@19777
   283
val mark_witness = Logic.protect;
wenzelm@19777
   284
wenzelm@19777
   285
fun make_witness t th = Witness (t, th);
ballarin@19931
   286
fun dest_witness (Witness w) = w;
ballarin@19931
   287
ballarin@20068
   288
fun transfer_witness thy (Witness (t, th)) = Witness (t, Thm.transfer thy th);
ballarin@20068
   289
wenzelm@19777
   290
val refine_witness =
wenzelm@19777
   291
  Proof.refine (Method.Basic (K (Method.RAW_METHOD
wenzelm@19777
   292
    (K (ALLGOALS
wenzelm@19777
   293
      (PRECISE_CONJUNCTS ~1 (ALLGOALS
wenzelm@19808
   294
        (PRECISE_CONJUNCTS ~1 (TRYALL (Tactic.rtac Drule.protectI))))))))));
wenzelm@19777
   295
wenzelm@19777
   296
wenzelm@19777
   297
(* derived rules *)
wenzelm@19777
   298
wenzelm@20007
   299
fun instantiate_tfrees thy subst th =
wenzelm@19777
   300
  let
wenzelm@19777
   301
    val certT = Thm.ctyp_of thy;
wenzelm@20007
   302
    val idx = Thm.maxidx_of th + 1;
wenzelm@20007
   303
    fun cert_inst (a, (S, T)) = (certT (TVar ((a, idx), S)), certT T);
wenzelm@20007
   304
wenzelm@20007
   305
    fun add_inst (a, S) insts =
wenzelm@20007
   306
      if AList.defined (op =) insts a then insts
wenzelm@20007
   307
      else (case AList.lookup (op =) subst a of NONE => insts | SOME T => (a, (S, T)) :: insts);
wenzelm@20007
   308
    val insts =
wenzelm@20007
   309
      Term.fold_types (Term.fold_atyps (fn TFree v => add_inst v | _ => I))
wenzelm@20007
   310
        (Thm.full_prop_of th) [];
wenzelm@19777
   311
  in
wenzelm@20007
   312
    th
wenzelm@20007
   313
    |> Thm.generalize (map fst insts, []) idx
wenzelm@20007
   314
    |> Thm.instantiate (map cert_inst insts, [])
wenzelm@19777
   315
  end;
wenzelm@19777
   316
wenzelm@19777
   317
fun instantiate_frees thy subst =
wenzelm@19777
   318
  let val cert = Thm.cterm_of thy in
wenzelm@19777
   319
    Drule.forall_intr_list (map (cert o Free o fst) subst) #>
wenzelm@19777
   320
    Drule.forall_elim_list (map (cert o snd) subst)
wenzelm@19777
   321
  end;
wenzelm@19777
   322
wenzelm@19777
   323
fun hyps_rule rule th =
wenzelm@19777
   324
  let
wenzelm@19866
   325
    val cterm_rule = Drule.mk_term #> rule #> Drule.dest_term;
wenzelm@19777
   326
    val {hyps, ...} = Thm.crep_thm th;
wenzelm@19777
   327
  in
wenzelm@19777
   328
    Drule.implies_elim_list
wenzelm@19777
   329
      (rule (Drule.implies_intr_list hyps th))
wenzelm@19777
   330
      (map (Thm.assume o cterm_rule) hyps)
wenzelm@19777
   331
  end;
wenzelm@19777
   332
wenzelm@19777
   333
wenzelm@19777
   334
(* rename *)
wenzelm@19777
   335
wenzelm@19777
   336
fun rename ren x =
wenzelm@19777
   337
  (case AList.lookup (op =) ren (x: string) of
wenzelm@19777
   338
    NONE => x
wenzelm@19777
   339
  | SOME (x', _) => x');
wenzelm@19777
   340
wenzelm@19777
   341
fun rename_var ren (x, mx) =
wenzelm@19777
   342
  (case (AList.lookup (op =) ren (x: string), mx) of
wenzelm@19777
   343
    (NONE, _) => (x, mx)
wenzelm@19777
   344
  | (SOME (x', NONE), Structure) => (x', mx)
wenzelm@19777
   345
  | (SOME (x', SOME _), Structure) =>
wenzelm@19777
   346
      error ("Attempt to change syntax of structure parameter " ^ quote x)
wenzelm@19777
   347
  | (SOME (x', NONE), _) => (x', NoSyn)
wenzelm@19777
   348
  | (SOME (x', SOME mx'), _) => (x', mx'));
wenzelm@19777
   349
wenzelm@19777
   350
fun rename_term ren (Free (x, T)) = Free (rename ren x, T)
wenzelm@19777
   351
  | rename_term ren (t $ u) = rename_term ren t $ rename_term ren u
wenzelm@19777
   352
  | rename_term ren (Abs (x, T, t)) = Abs (x, T, rename_term ren t)
wenzelm@19777
   353
  | rename_term _ a = a;
wenzelm@19777
   354
wenzelm@19777
   355
fun rename_thm ren th =
wenzelm@19777
   356
  let
wenzelm@20304
   357
    val thy = Thm.theory_of_thm th;
wenzelm@20304
   358
    val subst = (Drule.fold_terms o Term.fold_aterms)
wenzelm@20304
   359
      (fn Free (x, T) =>
wenzelm@19777
   360
        let val x' = rename ren x
wenzelm@20304
   361
        in if x = x' then I else insert (eq_fst (op =)) ((x, T), Free (x', T)) end
wenzelm@20304
   362
      | _ => I) th [];
wenzelm@19777
   363
  in
wenzelm@19777
   364
    if null subst then th
wenzelm@20304
   365
    else th |> hyps_rule (instantiate_frees thy subst)
wenzelm@19777
   366
  end;
wenzelm@19777
   367
wenzelm@19777
   368
fun rename_witness ren =
wenzelm@19777
   369
  map_witness (fn (t, th) => (rename_term ren t, rename_thm ren th));
wenzelm@19777
   370
wenzelm@19777
   371
fun rename_ctxt ren =
wenzelm@19777
   372
  map_ctxt_values I (rename_term ren) (rename_thm ren)
wenzelm@19777
   373
  #> map_ctxt {name = I, typ = I, term = I, fact = I, attrib = I, var = rename_var ren};
wenzelm@19777
   374
wenzelm@19777
   375
wenzelm@19777
   376
(* instantiate types *)
wenzelm@19777
   377
wenzelm@19777
   378
fun instT_type env =
wenzelm@19777
   379
  if Symtab.is_empty env then I
wenzelm@19777
   380
  else Term.map_type_tfree (fn (x, S) => the_default (TFree (x, S)) (Symtab.lookup env x));
wenzelm@19777
   381
wenzelm@19777
   382
fun instT_term env =
wenzelm@19777
   383
  if Symtab.is_empty env then I
wenzelm@19777
   384
  else Term.map_term_types (instT_type env);
wenzelm@19777
   385
wenzelm@20304
   386
fun instT_subst env th = (Drule.fold_terms o Term.fold_types o Term.fold_atyps)
wenzelm@20304
   387
  (fn T as TFree (a, _) =>
wenzelm@20304
   388
    let val T' = the_default T (Symtab.lookup env a)
wenzelm@20304
   389
    in if T = T' then I else insert (op =) (a, T') end
wenzelm@20304
   390
  | _ => I) th [];
wenzelm@19777
   391
wenzelm@19777
   392
fun instT_thm thy env th =
wenzelm@19777
   393
  if Symtab.is_empty env then th
wenzelm@19777
   394
  else
wenzelm@19777
   395
    let val subst = instT_subst env th
wenzelm@19777
   396
    in if null subst then th else th |> hyps_rule (instantiate_tfrees thy subst) end;
wenzelm@19777
   397
wenzelm@19777
   398
fun instT_witness thy env =
wenzelm@19777
   399
  map_witness (fn (t, th) => (instT_term env t, instT_thm thy env th));
wenzelm@19777
   400
wenzelm@19777
   401
fun instT_ctxt thy env =
wenzelm@19777
   402
  map_ctxt_values (instT_type env) (instT_term env) (instT_thm thy env);
wenzelm@19777
   403
wenzelm@19777
   404
wenzelm@19777
   405
(* instantiate types and terms *)
wenzelm@19777
   406
wenzelm@19777
   407
fun inst_term (envT, env) =
wenzelm@19777
   408
  if Symtab.is_empty env then instT_term envT
wenzelm@19777
   409
  else
wenzelm@19777
   410
    let
wenzelm@19777
   411
      val instT = instT_type envT;
wenzelm@19777
   412
      fun inst (Const (x, T)) = Const (x, instT T)
wenzelm@19777
   413
        | inst (Free (x, T)) =
wenzelm@19777
   414
            (case Symtab.lookup env x of
wenzelm@19777
   415
              NONE => Free (x, instT T)
wenzelm@19777
   416
            | SOME t => t)
wenzelm@19777
   417
        | inst (Var (xi, T)) = Var (xi, instT T)
wenzelm@19777
   418
        | inst (b as Bound _) = b
wenzelm@19777
   419
        | inst (Abs (x, T, t)) = Abs (x, instT T, inst t)
wenzelm@19777
   420
        | inst (t $ u) = inst t $ inst u;
wenzelm@19777
   421
    in Envir.beta_norm o inst end;
wenzelm@19777
   422
wenzelm@19777
   423
fun inst_thm thy (envT, env) th =
wenzelm@19777
   424
  if Symtab.is_empty env then instT_thm thy envT th
wenzelm@19777
   425
  else
wenzelm@19777
   426
    let
wenzelm@19777
   427
      val substT = instT_subst envT th;
wenzelm@20304
   428
      val subst = (Drule.fold_terms o Term.fold_aterms)
wenzelm@20304
   429
       (fn Free (x, T) =>
wenzelm@19777
   430
          let
wenzelm@19777
   431
            val T' = instT_type envT T;
wenzelm@19777
   432
            val t = Free (x, T');
wenzelm@19777
   433
            val t' = the_default t (Symtab.lookup env x);
wenzelm@20304
   434
          in if t aconv t' then I else insert (eq_fst (op =)) ((x, T'), t') end
wenzelm@20304
   435
       | _ => I) th [];
wenzelm@19777
   436
    in
wenzelm@19777
   437
      if null substT andalso null subst then th
wenzelm@19777
   438
      else th |> hyps_rule
wenzelm@19777
   439
       (instantiate_tfrees thy substT #>
wenzelm@19777
   440
        instantiate_frees thy subst #>
wenzelm@19777
   441
        Drule.fconv_rule (Thm.beta_conversion true))
wenzelm@19777
   442
    end;
wenzelm@19777
   443
wenzelm@19777
   444
fun inst_witness thy envs =
wenzelm@19777
   445
  map_witness (fn (t, th) => (inst_term envs t, inst_thm thy envs th));
wenzelm@19777
   446
wenzelm@19777
   447
fun inst_ctxt thy envs =
wenzelm@19777
   448
  map_ctxt_values (instT_type (#1 envs)) (inst_term envs) (inst_thm thy envs);
wenzelm@19777
   449
wenzelm@19777
   450
wenzelm@19777
   451
(* satisfy hypotheses *)
wenzelm@19777
   452
wenzelm@19777
   453
fun satisfy_thm witns thm = thm |> fold (fn hyp =>
wenzelm@19777
   454
    (case find_first (fn Witness (t, _) => Thm.term_of hyp aconv t) witns of
wenzelm@19777
   455
      NONE => I
wenzelm@19777
   456
    | SOME (Witness (_, th)) => Drule.implies_intr_protected [hyp] #> Goal.comp_hhf th))
wenzelm@19777
   457
  (#hyps (Thm.crep_thm thm));
wenzelm@19777
   458
wenzelm@19777
   459
fun satisfy_witness witns = map_witness (apsnd (satisfy_thm witns));
wenzelm@19777
   460
wenzelm@19843
   461
fun satisfy_ctxt witns = map_ctxt_values I I (satisfy_thm witns);
wenzelm@19843
   462
wenzelm@20264
   463
fun satisfy_facts witns facts =
wenzelm@20264
   464
  satisfy_ctxt witns (Notes facts) |> (fn Notes facts' => facts');
wenzelm@20264
   465
wenzelm@20264
   466
wenzelm@20264
   467
(* generalize type/term parameters *)
wenzelm@20264
   468
wenzelm@20264
   469
val maxidx_atts = fold Args.maxidx_values;
wenzelm@20264
   470
wenzelm@20264
   471
fun generalize_facts inner outer facts =
wenzelm@20264
   472
  let
wenzelm@20264
   473
    val thy = ProofContext.theory_of inner;
wenzelm@20264
   474
    val maxidx =
wenzelm@20264
   475
      fold (fn ((_, atts), bs) => maxidx_atts atts #> fold (maxidx_atts o #2) bs) facts ~1;
wenzelm@20264
   476
    val gen_thm = Thm.adjust_maxidx_thm maxidx #> singleton (Variable.export inner outer);
wenzelm@20264
   477
    val gen_term = Thm.cterm_of thy #> Drule.mk_term #> gen_thm #> Drule.dest_term #> Thm.term_of;
wenzelm@20264
   478
    val gen_typ = Logic.mk_type #> gen_term #> Logic.dest_type;
wenzelm@20264
   479
    val Notes facts' = map_ctxt_values gen_typ gen_term gen_thm (Notes facts);
wenzelm@20264
   480
  in facts' end;
wenzelm@20264
   481
wenzelm@19267
   482
end;