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