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