src/Pure/thm.ML
author wenzelm
Wed Apr 04 00:11:16 2007 +0200 (2007-04-04)
changeset 22584 d0f0f37ec346
parent 22573 2ac646ab2f6c
child 22596 d0d2af4db18f
permissions -rw-r--r--
improved exception CTERM;
added instantiate_cterm;
removed obsolete sign_of_thm;
wenzelm@250
     1
(*  Title:      Pure/thm.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@250
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
lcp@229
     4
    Copyright   1994  University of Cambridge
lcp@229
     5
wenzelm@16425
     6
The very core of Isabelle's Meta Logic: certified types and terms,
wenzelm@16425
     7
meta theorems, meta rules (including lifting and resolution).
clasohm@0
     8
*)
clasohm@0
     9
wenzelm@6089
    10
signature BASIC_THM =
paulson@1503
    11
  sig
wenzelm@1160
    12
  (*certified types*)
wenzelm@387
    13
  type ctyp
wenzelm@16656
    14
  val rep_ctyp: ctyp ->
wenzelm@16656
    15
   {thy: theory,
wenzelm@16656
    16
    sign: theory,       (*obsolete*)
wenzelm@16656
    17
    T: typ,
wenzelm@20512
    18
    maxidx: int,
wenzelm@16656
    19
    sorts: sort list}
wenzelm@16425
    20
  val theory_of_ctyp: ctyp -> theory
wenzelm@16425
    21
  val typ_of: ctyp -> typ
wenzelm@16425
    22
  val ctyp_of: theory -> typ -> ctyp
wenzelm@16425
    23
  val read_ctyp: theory -> string -> ctyp
wenzelm@1160
    24
wenzelm@1160
    25
  (*certified terms*)
wenzelm@1160
    26
  type cterm
wenzelm@22584
    27
  exception CTERM of string * cterm list
wenzelm@16601
    28
  val rep_cterm: cterm ->
wenzelm@16656
    29
   {thy: theory,
wenzelm@16656
    30
    sign: theory,       (*obsolete*)
wenzelm@16656
    31
    t: term,
wenzelm@16656
    32
    T: typ,
wenzelm@16656
    33
    maxidx: int,
wenzelm@16656
    34
    sorts: sort list}
wenzelm@16601
    35
  val crep_cterm: cterm ->
wenzelm@16601
    36
    {thy: theory, sign: theory, t: term, T: ctyp, maxidx: int, sorts: sort list}
wenzelm@16425
    37
  val theory_of_cterm: cterm -> theory
wenzelm@16425
    38
  val term_of: cterm -> term
wenzelm@16425
    39
  val cterm_of: theory -> term -> cterm
wenzelm@16425
    40
  val ctyp_of_term: cterm -> ctyp
wenzelm@16425
    41
  val read_cterm: theory -> string * typ -> cterm
wenzelm@16425
    42
  val read_def_cterm:
wenzelm@16425
    43
    theory * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@1160
    44
    string list -> bool -> string * typ -> cterm * (indexname * typ) list
wenzelm@16425
    45
  val read_def_cterms:
wenzelm@16425
    46
    theory * (indexname -> typ option) * (indexname -> sort option) ->
nipkow@4281
    47
    string list -> bool -> (string * typ)list
nipkow@4281
    48
    -> cterm list * (indexname * typ)list
wenzelm@1160
    49
wenzelm@16425
    50
  type tag              (* = string * string list *)
paulson@1529
    51
wenzelm@1160
    52
  (*meta theorems*)
wenzelm@1160
    53
  type thm
wenzelm@22365
    54
  type attribute     (* = Context.generic * thm -> Context.generic * thm *)
wenzelm@16425
    55
  val rep_thm: thm ->
wenzelm@16656
    56
   {thy: theory,
wenzelm@16656
    57
    sign: theory,       (*obsolete*)
wenzelm@16425
    58
    der: bool * Proofterm.proof,
wenzelm@21646
    59
    tags: tag list,
wenzelm@16425
    60
    maxidx: int,
wenzelm@16425
    61
    shyps: sort list,
wenzelm@16425
    62
    hyps: term list,
wenzelm@16425
    63
    tpairs: (term * term) list,
wenzelm@16425
    64
    prop: term}
wenzelm@16425
    65
  val crep_thm: thm ->
wenzelm@16656
    66
   {thy: theory,
wenzelm@16656
    67
    sign: theory,       (*obsolete*)
wenzelm@16425
    68
    der: bool * Proofterm.proof,
wenzelm@21646
    69
    tags: tag list,
wenzelm@16425
    70
    maxidx: int,
wenzelm@16425
    71
    shyps: sort list,
wenzelm@16425
    72
    hyps: cterm list,
wenzelm@16425
    73
    tpairs: (cterm * cterm) list,
wenzelm@16425
    74
    prop: cterm}
wenzelm@6089
    75
  exception THM of string * int * thm list
wenzelm@16425
    76
  val theory_of_thm: thm -> theory
wenzelm@16425
    77
  val prop_of: thm -> term
wenzelm@16425
    78
  val proof_of: thm -> Proofterm.proof
wenzelm@16425
    79
  val tpairs_of: thm -> (term * term) list
wenzelm@16656
    80
  val concl_of: thm -> term
wenzelm@16425
    81
  val prems_of: thm -> term list
wenzelm@16425
    82
  val nprems_of: thm -> int
wenzelm@16425
    83
  val cprop_of: thm -> cterm
wenzelm@18145
    84
  val cprem_of: thm -> int -> cterm
wenzelm@16656
    85
  val transfer: theory -> thm -> thm
wenzelm@16945
    86
  val weaken: cterm -> thm -> thm
wenzelm@16425
    87
  val extra_shyps: thm -> sort list
wenzelm@16425
    88
  val strip_shyps: thm -> thm
wenzelm@16425
    89
  val get_axiom_i: theory -> string -> thm
wenzelm@16425
    90
  val get_axiom: theory -> xstring -> thm
wenzelm@16425
    91
  val def_name: string -> string
wenzelm@20884
    92
  val def_name_optional: string -> string -> string
wenzelm@16425
    93
  val get_def: theory -> xstring -> thm
wenzelm@16425
    94
  val axioms_of: theory -> (string * thm) list
wenzelm@1160
    95
wenzelm@1160
    96
  (*meta rules*)
wenzelm@16425
    97
  val assume: cterm -> thm
wenzelm@16425
    98
  val implies_intr: cterm -> thm -> thm
wenzelm@16425
    99
  val implies_elim: thm -> thm -> thm
wenzelm@16425
   100
  val forall_intr: cterm -> thm -> thm
wenzelm@16425
   101
  val forall_elim: cterm -> thm -> thm
wenzelm@16425
   102
  val reflexive: cterm -> thm
wenzelm@16425
   103
  val symmetric: thm -> thm
wenzelm@16425
   104
  val transitive: thm -> thm -> thm
wenzelm@16425
   105
  val beta_conversion: bool -> cterm -> thm
wenzelm@16425
   106
  val eta_conversion: cterm -> thm
wenzelm@16425
   107
  val abstract_rule: string -> cterm -> thm -> thm
wenzelm@16425
   108
  val combination: thm -> thm -> thm
wenzelm@16425
   109
  val equal_intr: thm -> thm -> thm
wenzelm@16425
   110
  val equal_elim: thm -> thm -> thm
wenzelm@16425
   111
  val flexflex_rule: thm -> thm Seq.seq
wenzelm@19910
   112
  val generalize: string list * string list -> int -> thm -> thm
wenzelm@16425
   113
  val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm
wenzelm@22584
   114
  val instantiate_cterm: (ctyp * ctyp) list * (cterm * cterm) list -> cterm -> cterm
wenzelm@16425
   115
  val trivial: cterm -> thm
wenzelm@16425
   116
  val class_triv: theory -> class -> thm
wenzelm@19505
   117
  val unconstrainT: ctyp -> thm -> thm
wenzelm@16425
   118
  val dest_state: thm * int -> (term * term) list * term list * term * term
wenzelm@18035
   119
  val lift_rule: cterm -> thm -> thm
wenzelm@16425
   120
  val incr_indexes: int -> thm -> thm
wenzelm@16425
   121
  val assumption: int -> thm -> thm Seq.seq
wenzelm@16425
   122
  val eq_assumption: int -> thm -> thm
wenzelm@16425
   123
  val rotate_rule: int -> int -> thm -> thm
wenzelm@16425
   124
  val permute_prems: int -> int -> thm -> thm
wenzelm@1160
   125
  val rename_params_rule: string list * int -> thm -> thm
wenzelm@18501
   126
  val compose_no_flatten: bool -> thm * int -> int -> thm -> thm Seq.seq
wenzelm@16425
   127
  val bicompose: bool -> bool * thm * int -> int -> thm -> thm Seq.seq
wenzelm@16425
   128
  val biresolution: bool -> (bool * thm) list -> int -> thm -> thm Seq.seq
wenzelm@16425
   129
  val invoke_oracle: theory -> xstring -> theory * Object.T -> thm
wenzelm@16425
   130
  val invoke_oracle_i: theory -> string -> theory * Object.T -> thm
wenzelm@250
   131
end;
clasohm@0
   132
wenzelm@6089
   133
signature THM =
wenzelm@6089
   134
sig
wenzelm@6089
   135
  include BASIC_THM
wenzelm@16425
   136
  val dest_ctyp: ctyp -> ctyp list
wenzelm@16425
   137
  val dest_comb: cterm -> cterm * cterm
wenzelm@20580
   138
  val dest_arg: cterm -> cterm
wenzelm@20673
   139
  val dest_binop: cterm -> cterm * cterm
wenzelm@16425
   140
  val dest_abs: string option -> cterm -> cterm * cterm
wenzelm@20261
   141
  val adjust_maxidx_cterm: int -> cterm -> cterm
wenzelm@16425
   142
  val capply: cterm -> cterm -> cterm
wenzelm@16425
   143
  val cabs: cterm -> cterm -> cterm
wenzelm@16425
   144
  val major_prem_of: thm -> term
wenzelm@16425
   145
  val no_prems: thm -> bool
wenzelm@16945
   146
  val terms_of_tpairs: (term * term) list -> term list
wenzelm@19881
   147
  val maxidx_of: thm -> int
wenzelm@19910
   148
  val maxidx_thm: thm -> int -> int
wenzelm@19881
   149
  val hyps_of: thm -> term list
wenzelm@16945
   150
  val full_prop_of: thm -> term
wenzelm@21646
   151
  val get_name: thm -> string
wenzelm@21646
   152
  val put_name: string -> thm -> thm
wenzelm@21646
   153
  val get_tags: thm -> tag list
wenzelm@21646
   154
  val map_tags: (tag list -> tag list) -> thm -> thm
wenzelm@16945
   155
  val compress: thm -> thm
wenzelm@20261
   156
  val adjust_maxidx_thm: int -> thm -> thm
wenzelm@16425
   157
  val rename_boundvars: term -> term -> thm -> thm
wenzelm@16425
   158
  val cterm_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
wenzelm@16425
   159
  val cterm_first_order_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
wenzelm@16425
   160
  val cterm_incr_indexes: int -> cterm -> cterm
wenzelm@20002
   161
  val varifyT: thm -> thm
wenzelm@20002
   162
  val varifyT': (string * sort) list -> thm -> ((string * sort) * indexname) list * thm
wenzelm@19881
   163
  val freezeT: thm -> thm
wenzelm@6089
   164
end;
wenzelm@6089
   165
wenzelm@3550
   166
structure Thm: THM =
clasohm@0
   167
struct
wenzelm@250
   168
wenzelm@22237
   169
structure Pt = Proofterm;
wenzelm@22237
   170
wenzelm@16656
   171
wenzelm@387
   172
(*** Certified terms and types ***)
wenzelm@387
   173
wenzelm@16656
   174
(** collect occurrences of sorts -- unless all sorts non-empty **)
wenzelm@16656
   175
wenzelm@16679
   176
fun may_insert_typ_sorts thy T = if Sign.all_sorts_nonempty thy then I else Sorts.insert_typ T;
wenzelm@16679
   177
fun may_insert_term_sorts thy t = if Sign.all_sorts_nonempty thy then I else Sorts.insert_term t;
wenzelm@16656
   178
wenzelm@16656
   179
(*NB: type unification may invent new sorts*)
wenzelm@16656
   180
fun may_insert_env_sorts thy (env as Envir.Envir {iTs, ...}) =
wenzelm@16656
   181
  if Sign.all_sorts_nonempty thy then I
wenzelm@16656
   182
  else Vartab.fold (fn (_, (_, T)) => Sorts.insert_typ T) iTs;
wenzelm@16656
   183
wenzelm@16656
   184
wenzelm@16656
   185
wenzelm@250
   186
(** certified types **)
wenzelm@250
   187
wenzelm@22237
   188
abstype ctyp = Ctyp of
wenzelm@20512
   189
 {thy_ref: theory_ref,
wenzelm@20512
   190
  T: typ,
wenzelm@20512
   191
  maxidx: int,
wenzelm@22237
   192
  sorts: sort list}
wenzelm@22237
   193
with
wenzelm@250
   194
wenzelm@20512
   195
fun rep_ctyp (Ctyp {thy_ref, T, maxidx, sorts}) =
wenzelm@16425
   196
  let val thy = Theory.deref thy_ref
wenzelm@20512
   197
  in {thy = thy, sign = thy, T = T, maxidx = maxidx, sorts = sorts} end;
wenzelm@250
   198
wenzelm@16656
   199
fun theory_of_ctyp (Ctyp {thy_ref, ...}) = Theory.deref thy_ref;
wenzelm@16425
   200
wenzelm@250
   201
fun typ_of (Ctyp {T, ...}) = T;
wenzelm@250
   202
wenzelm@16656
   203
fun ctyp_of thy raw_T =
wenzelm@20512
   204
  let val T = Sign.certify_typ thy raw_T in
wenzelm@20512
   205
    Ctyp {thy_ref = Theory.self_ref thy, T = T,
wenzelm@20512
   206
      maxidx = Term.maxidx_of_typ T, sorts = may_insert_typ_sorts thy T []}
wenzelm@20512
   207
  end;
wenzelm@250
   208
wenzelm@16425
   209
fun read_ctyp thy s =
wenzelm@20512
   210
  let val T = Sign.read_typ (thy, K NONE) s in
wenzelm@20512
   211
    Ctyp {thy_ref = Theory.self_ref thy, T = T,
wenzelm@20512
   212
      maxidx = Term.maxidx_of_typ T, sorts = may_insert_typ_sorts thy T []}
wenzelm@20512
   213
  end;
lcp@229
   214
wenzelm@20512
   215
fun dest_ctyp (Ctyp {thy_ref, T = Type (s, Ts), maxidx, sorts}) =
wenzelm@20512
   216
      map (fn T => Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts}) Ts
wenzelm@16679
   217
  | dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []);
berghofe@15087
   218
lcp@229
   219
lcp@229
   220
wenzelm@250
   221
(** certified terms **)
lcp@229
   222
wenzelm@16601
   223
(*certified terms with checked typ, maxidx, and sorts*)
wenzelm@22237
   224
abstype cterm = Cterm of
wenzelm@16601
   225
 {thy_ref: theory_ref,
wenzelm@16601
   226
  t: term,
wenzelm@16601
   227
  T: typ,
wenzelm@16601
   228
  maxidx: int,
wenzelm@22237
   229
  sorts: sort list}
wenzelm@22237
   230
with
wenzelm@16425
   231
wenzelm@22584
   232
exception CTERM of string * cterm list;
wenzelm@16679
   233
wenzelm@16601
   234
fun rep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@16425
   235
  let val thy =  Theory.deref thy_ref
wenzelm@16601
   236
  in {thy = thy, sign = thy, t = t, T = T, maxidx = maxidx, sorts = sorts} end;
lcp@229
   237
wenzelm@16601
   238
fun crep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@16425
   239
  let val thy = Theory.deref thy_ref in
wenzelm@20512
   240
   {thy = thy, sign = thy, t = t,
wenzelm@20512
   241
      T = Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts},
wenzelm@16601
   242
    maxidx = maxidx, sorts = sorts}
wenzelm@16425
   243
  end;
wenzelm@3967
   244
wenzelm@16425
   245
fun theory_of_cterm (Cterm {thy_ref, ...}) = Theory.deref thy_ref;
wenzelm@250
   246
fun term_of (Cterm {t, ...}) = t;
lcp@229
   247
wenzelm@20512
   248
fun ctyp_of_term (Cterm {thy_ref, T, maxidx, sorts, ...}) =
wenzelm@20512
   249
  Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts};
paulson@2671
   250
wenzelm@16425
   251
fun cterm_of thy tm =
wenzelm@16601
   252
  let
wenzelm@18969
   253
    val (t, T, maxidx) = Sign.certify_term thy tm;
wenzelm@16656
   254
    val sorts = may_insert_term_sorts thy t [];
wenzelm@16601
   255
  in Cterm {thy_ref = Theory.self_ref thy, t = t, T = T, maxidx = maxidx, sorts = sorts} end;
lcp@229
   256
wenzelm@20057
   257
fun merge_thys0 (Cterm {thy_ref = r1, t = t1, ...}) (Cterm {thy_ref = r2, t = t2, ...}) =
wenzelm@20057
   258
  Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise TERM (msg, [t1, t2]);
wenzelm@16656
   259
wenzelm@20580
   260
wenzelm@22584
   261
fun dest_comb (ct as Cterm {t = t $ u, T, thy_ref, maxidx, sorts}) =
wenzelm@16679
   262
      let val A = Term.argument_type_of t in
wenzelm@16679
   263
        (Cterm {t = t, T = A --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
wenzelm@16679
   264
         Cterm {t = u, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts})
clasohm@1493
   265
      end
wenzelm@22584
   266
  | dest_comb ct = raise CTERM ("dest_comb", [ct]);
clasohm@1493
   267
wenzelm@22584
   268
fun dest_arg (ct as Cterm {t = t $ u, T, thy_ref, maxidx, sorts}) =
wenzelm@20580
   269
      let val A = Term.argument_type_of t in
wenzelm@20580
   270
         Cterm {t = u, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}
wenzelm@20580
   271
      end
wenzelm@22584
   272
  | dest_arg ct = raise CTERM ("dest_arg", [ct]);
wenzelm@20580
   273
wenzelm@22584
   274
fun dest_binop (ct as Cterm {t = tm, T = _, thy_ref, maxidx, sorts}) =
wenzelm@20673
   275
  let fun cterm t T = Cterm {t = t, T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts} in
wenzelm@20673
   276
    (case tm of
wenzelm@20673
   277
      Const (_, Type ("fun", [A, Type ("fun", [B, _])])) $ a $ b => (cterm a A, cterm b B)
wenzelm@20673
   278
    |  Free (_, Type ("fun", [A, Type ("fun", [B, _])])) $ a $ b => (cterm a A, cterm b B)
wenzelm@20673
   279
    |   Var (_, Type ("fun", [A, Type ("fun", [B, _])])) $ a $ b => (cterm a A, cterm b B)
wenzelm@22584
   280
    | _ => raise CTERM ("dest_binop", [ct]))
wenzelm@20673
   281
  end;
wenzelm@20673
   282
wenzelm@22584
   283
fun dest_abs a (ct as
wenzelm@22584
   284
        Cterm {t = Abs (x, T, t), T = Type ("fun", [_, U]), thy_ref, maxidx, sorts}) =
wenzelm@18944
   285
      let val (y', t') = Term.dest_abs (the_default x a, T, t) in
wenzelm@16679
   286
        (Cterm {t = Free (y', T), T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
wenzelm@16679
   287
          Cterm {t = t', T = U, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts})
clasohm@1493
   288
      end
wenzelm@22584
   289
  | dest_abs _ ct = raise CTERM ("dest_abs", [ct]);
clasohm@1493
   290
wenzelm@16601
   291
fun capply
wenzelm@16656
   292
  (cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...})
wenzelm@16656
   293
  (cx as Cterm {t = x, T, maxidx = maxidx2, sorts = sorts2, ...}) =
wenzelm@16601
   294
    if T = dty then
wenzelm@16656
   295
      Cterm {thy_ref = merge_thys0 cf cx,
wenzelm@16656
   296
        t = f $ x,
wenzelm@16656
   297
        T = rty,
wenzelm@16656
   298
        maxidx = Int.max (maxidx1, maxidx2),
wenzelm@16601
   299
        sorts = Sorts.union sorts1 sorts2}
wenzelm@22584
   300
      else raise CTERM ("capply: types don't agree", [cf, cx])
wenzelm@22584
   301
  | capply cf cx = raise CTERM ("capply: first arg is not a function", [cf, cx]);
wenzelm@250
   302
wenzelm@16601
   303
fun cabs
wenzelm@16656
   304
  (ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...})
wenzelm@16656
   305
  (ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) =
wenzelm@21975
   306
    let val t = Term.lambda t1 t2 in
wenzelm@16656
   307
      Cterm {thy_ref = merge_thys0 ct1 ct2,
wenzelm@16656
   308
        t = t, T = T1 --> T2,
wenzelm@16656
   309
        maxidx = Int.max (maxidx1, maxidx2),
wenzelm@16656
   310
        sorts = Sorts.union sorts1 sorts2}
wenzelm@16601
   311
    end;
lcp@229
   312
wenzelm@20580
   313
wenzelm@20580
   314
fun adjust_maxidx_cterm i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@20580
   315
  if maxidx = i then ct
wenzelm@20580
   316
  else if maxidx < i then
wenzelm@20580
   317
    Cterm {maxidx = i, thy_ref = thy_ref, t = t, T = T, sorts = sorts}
wenzelm@20580
   318
  else
wenzelm@20580
   319
    Cterm {maxidx = Int.max (maxidx_of_term t, i), thy_ref = thy_ref, t = t, T = T, sorts = sorts};
wenzelm@20580
   320
berghofe@10416
   321
(*Matching of cterms*)
wenzelm@16656
   322
fun gen_cterm_match match
wenzelm@20512
   323
    (ct1 as Cterm {t = t1, sorts = sorts1, ...},
wenzelm@20815
   324
     ct2 as Cterm {t = t2, sorts = sorts2, maxidx = maxidx2, ...}) =
berghofe@10416
   325
  let
wenzelm@16656
   326
    val thy_ref = merge_thys0 ct1 ct2;
wenzelm@18184
   327
    val (Tinsts, tinsts) = match (Theory.deref thy_ref) (t1, t2) (Vartab.empty, Vartab.empty);
wenzelm@16601
   328
    val sorts = Sorts.union sorts1 sorts2;
wenzelm@20512
   329
    fun mk_cTinst ((a, i), (S, T)) =
wenzelm@20512
   330
      (Ctyp {T = TVar ((a, i), S), thy_ref = thy_ref, maxidx = i, sorts = sorts},
wenzelm@20815
   331
       Ctyp {T = T, thy_ref = thy_ref, maxidx = maxidx2, sorts = sorts});
wenzelm@20512
   332
    fun mk_ctinst ((x, i), (T, t)) =
wenzelm@16601
   333
      let val T = Envir.typ_subst_TVars Tinsts T in
wenzelm@20512
   334
        (Cterm {t = Var ((x, i), T), T = T, thy_ref = thy_ref, maxidx = i, sorts = sorts},
wenzelm@20815
   335
         Cterm {t = t, T = T, thy_ref = thy_ref, maxidx = maxidx2, sorts = sorts})
berghofe@10416
   336
      end;
wenzelm@16656
   337
  in (Vartab.fold (cons o mk_cTinst) Tinsts [], Vartab.fold (cons o mk_ctinst) tinsts []) end;
berghofe@10416
   338
berghofe@10416
   339
val cterm_match = gen_cterm_match Pattern.match;
berghofe@10416
   340
val cterm_first_order_match = gen_cterm_match Pattern.first_order_match;
berghofe@10416
   341
berghofe@10416
   342
(*Incrementing indexes*)
wenzelm@16601
   343
fun cterm_incr_indexes i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@22584
   344
  if i < 0 then raise CTERM ("negative increment", [ct])
wenzelm@16601
   345
  else if i = 0 then ct
wenzelm@16601
   346
  else Cterm {thy_ref = thy_ref, t = Logic.incr_indexes ([], i) t,
wenzelm@16884
   347
    T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts};
berghofe@10416
   348
wenzelm@2509
   349
wenzelm@2509
   350
wenzelm@574
   351
(** read cterms **)   (*exception ERROR*)
wenzelm@250
   352
nipkow@4281
   353
(*read terms, infer types, certify terms*)
wenzelm@16425
   354
fun read_def_cterms (thy, types, sorts) used freeze sTs =
wenzelm@250
   355
  let
wenzelm@16425
   356
    val (ts', tye) = Sign.read_def_terms (thy, types, sorts) used freeze sTs;
wenzelm@16425
   357
    val cts = map (cterm_of thy) ts'
wenzelm@2979
   358
      handle TYPE (msg, _, _) => error msg
wenzelm@2386
   359
           | TERM (msg, _) => error msg;
nipkow@4281
   360
  in (cts, tye) end;
nipkow@4281
   361
nipkow@4281
   362
(*read term, infer types, certify term*)
nipkow@4281
   363
fun read_def_cterm args used freeze aT =
nipkow@4281
   364
  let val ([ct],tye) = read_def_cterms args used freeze [aT]
nipkow@4281
   365
  in (ct,tye) end;
lcp@229
   366
wenzelm@16425
   367
fun read_cterm thy = #1 o read_def_cterm (thy, K NONE, K NONE) [] true;
lcp@229
   368
wenzelm@250
   369
wenzelm@2509
   370
wenzelm@387
   371
(*** Meta theorems ***)
lcp@229
   372
wenzelm@21646
   373
type tag = string * string list;
wenzelm@21646
   374
wenzelm@22237
   375
abstype thm = Thm of
wenzelm@16425
   376
 {thy_ref: theory_ref,         (*dynamic reference to theory*)
berghofe@11518
   377
  der: bool * Pt.proof,        (*derivation*)
wenzelm@21646
   378
  tags: tag list,              (*additional annotations/comments*)
wenzelm@3967
   379
  maxidx: int,                 (*maximum index of any Var or TVar*)
wenzelm@16601
   380
  shyps: sort list,            (*sort hypotheses as ordered list*)
wenzelm@16601
   381
  hyps: term list,             (*hypotheses as ordered list*)
berghofe@13658
   382
  tpairs: (term * term) list,  (*flex-flex pairs*)
wenzelm@22237
   383
  prop: term}                  (*conclusion*)
wenzelm@22237
   384
with
clasohm@0
   385
wenzelm@22365
   386
(*attributes subsume any kind of rules or context modifiers*)
wenzelm@22365
   387
type attribute = Context.generic * thm -> Context.generic * thm;
wenzelm@22365
   388
wenzelm@16725
   389
(*errors involving theorems*)
wenzelm@16725
   390
exception THM of string * int * thm list;
berghofe@13658
   391
wenzelm@21646
   392
fun rep_thm (Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@16425
   393
  let val thy = Theory.deref thy_ref in
wenzelm@21646
   394
   {thy = thy, sign = thy, der = der, tags = tags, maxidx = maxidx,
wenzelm@16425
   395
    shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}
wenzelm@16425
   396
  end;
clasohm@0
   397
wenzelm@16425
   398
(*version of rep_thm returning cterms instead of terms*)
wenzelm@21646
   399
fun crep_thm (Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@16425
   400
  let
wenzelm@16425
   401
    val thy = Theory.deref thy_ref;
wenzelm@16601
   402
    fun cterm max t = Cterm {thy_ref = thy_ref, t = t, T = propT, maxidx = max, sorts = shyps};
wenzelm@16425
   403
  in
wenzelm@21646
   404
   {thy = thy, sign = thy, der = der, tags = tags, maxidx = maxidx, shyps = shyps,
wenzelm@16425
   405
    hyps = map (cterm ~1) hyps,
wenzelm@16425
   406
    tpairs = map (pairself (cterm maxidx)) tpairs,
wenzelm@16425
   407
    prop = cterm maxidx prop}
clasohm@1517
   408
  end;
clasohm@1517
   409
wenzelm@16725
   410
fun terms_of_tpairs tpairs = fold_rev (fn (t, u) => cons t o cons u) tpairs [];
wenzelm@16725
   411
wenzelm@16725
   412
fun eq_tpairs ((t, u), (t', u')) = t aconv t' andalso u aconv u';
wenzelm@18944
   413
fun union_tpairs ts us = Library.merge eq_tpairs (ts, us);
wenzelm@16884
   414
val maxidx_tpairs = fold (fn (t, u) => Term.maxidx_term t #> Term.maxidx_term u);
wenzelm@16725
   415
wenzelm@16725
   416
fun attach_tpairs tpairs prop =
wenzelm@16725
   417
  Logic.list_implies (map Logic.mk_equals tpairs, prop);
wenzelm@16725
   418
wenzelm@16725
   419
fun full_prop_of (Thm {tpairs, prop, ...}) = attach_tpairs tpairs prop;
wenzelm@16945
   420
wenzelm@22365
   421
val union_hyps = OrdList.union Term.fast_term_ord;
wenzelm@22365
   422
wenzelm@16945
   423
wenzelm@16945
   424
(* merge theories of cterms/thms; raise exception if incompatible *)
wenzelm@16945
   425
wenzelm@16945
   426
fun merge_thys1 (Cterm {thy_ref = r1, ...}) (th as Thm {thy_ref = r2, ...}) =
wenzelm@16945
   427
  Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th]);
wenzelm@16945
   428
wenzelm@16945
   429
fun merge_thys2 (th1 as Thm {thy_ref = r1, ...}) (th2 as Thm {thy_ref = r2, ...}) =
wenzelm@16945
   430
  Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]);
wenzelm@16945
   431
clasohm@0
   432
wenzelm@22365
   433
(* basic components *)
wenzelm@16135
   434
wenzelm@16425
   435
fun theory_of_thm (Thm {thy_ref, ...}) = Theory.deref thy_ref;
wenzelm@19429
   436
fun maxidx_of (Thm {maxidx, ...}) = maxidx;
wenzelm@19910
   437
fun maxidx_thm th i = Int.max (maxidx_of th, i);
wenzelm@19881
   438
fun hyps_of (Thm {hyps, ...}) = hyps;
wenzelm@12803
   439
fun prop_of (Thm {prop, ...}) = prop;
wenzelm@13528
   440
fun proof_of (Thm {der = (_, proof), ...}) = proof;
wenzelm@16601
   441
fun tpairs_of (Thm {tpairs, ...}) = tpairs;
clasohm@0
   442
wenzelm@16601
   443
val concl_of = Logic.strip_imp_concl o prop_of;
wenzelm@16601
   444
val prems_of = Logic.strip_imp_prems o prop_of;
wenzelm@21576
   445
val nprems_of = Logic.count_prems o prop_of;
wenzelm@19305
   446
fun no_prems th = nprems_of th = 0;
wenzelm@16601
   447
wenzelm@16601
   448
fun major_prem_of th =
wenzelm@16601
   449
  (case prems_of th of
wenzelm@16601
   450
    prem :: _ => Logic.strip_assums_concl prem
wenzelm@16601
   451
  | [] => raise THM ("major_prem_of: rule with no premises", 0, [th]));
wenzelm@16601
   452
wenzelm@16601
   453
(*the statement of any thm is a cterm*)
wenzelm@16601
   454
fun cprop_of (Thm {thy_ref, maxidx, shyps, prop, ...}) =
wenzelm@16601
   455
  Cterm {thy_ref = thy_ref, maxidx = maxidx, T = propT, t = prop, sorts = shyps};
wenzelm@16601
   456
wenzelm@18145
   457
fun cprem_of (th as Thm {thy_ref, maxidx, shyps, prop, ...}) i =
wenzelm@18035
   458
  Cterm {thy_ref = thy_ref, maxidx = maxidx, T = propT, sorts = shyps,
wenzelm@18145
   459
    t = Logic.nth_prem (i, prop) handle TERM _ => raise THM ("cprem_of", i, [th])};
wenzelm@18035
   460
wenzelm@16656
   461
(*explicit transfer to a super theory*)
wenzelm@16425
   462
fun transfer thy' thm =
wenzelm@3895
   463
  let
wenzelm@21646
   464
    val Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop} = thm;
wenzelm@16425
   465
    val thy = Theory.deref thy_ref;
wenzelm@3895
   466
  in
wenzelm@16945
   467
    if not (subthy (thy, thy')) then
wenzelm@16945
   468
      raise THM ("transfer: not a super theory", 0, [thm])
wenzelm@16945
   469
    else if eq_thy (thy, thy') then thm
wenzelm@16945
   470
    else
wenzelm@16945
   471
      Thm {thy_ref = Theory.self_ref thy',
wenzelm@16945
   472
        der = der,
wenzelm@21646
   473
        tags = tags,
wenzelm@16945
   474
        maxidx = maxidx,
wenzelm@16945
   475
        shyps = shyps,
wenzelm@16945
   476
        hyps = hyps,
wenzelm@16945
   477
        tpairs = tpairs,
wenzelm@16945
   478
        prop = prop}
wenzelm@3895
   479
  end;
wenzelm@387
   480
wenzelm@16945
   481
(*explicit weakening: maps |- B to A |- B*)
wenzelm@16945
   482
fun weaken raw_ct th =
wenzelm@16945
   483
  let
wenzelm@20261
   484
    val ct as Cterm {t = A, T, sorts, maxidx = maxidxA, ...} = adjust_maxidx_cterm ~1 raw_ct;
wenzelm@21646
   485
    val Thm {der, tags, maxidx, shyps, hyps, tpairs, prop, ...} = th;
wenzelm@16945
   486
  in
wenzelm@16945
   487
    if T <> propT then
wenzelm@16945
   488
      raise THM ("weaken: assumptions must have type prop", 0, [])
wenzelm@16945
   489
    else if maxidxA <> ~1 then
wenzelm@16945
   490
      raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, [])
wenzelm@16945
   491
    else
wenzelm@16945
   492
      Thm {thy_ref = merge_thys1 ct th,
wenzelm@16945
   493
        der = der,
wenzelm@21646
   494
        tags = tags,
wenzelm@16945
   495
        maxidx = maxidx,
wenzelm@16945
   496
        shyps = Sorts.union sorts shyps,
wenzelm@22365
   497
        hyps = OrdList.insert Term.fast_term_ord A hyps,
wenzelm@16945
   498
        tpairs = tpairs,
wenzelm@16945
   499
        prop = prop}
wenzelm@16945
   500
  end;
wenzelm@16656
   501
wenzelm@16656
   502
clasohm@0
   503
wenzelm@1238
   504
(** sort contexts of theorems **)
wenzelm@1238
   505
wenzelm@16656
   506
fun present_sorts (Thm {hyps, tpairs, prop, ...}) =
wenzelm@16656
   507
  fold (fn (t, u) => Sorts.insert_term t o Sorts.insert_term u) tpairs
wenzelm@16656
   508
    (Sorts.insert_terms hyps (Sorts.insert_term prop []));
wenzelm@1238
   509
wenzelm@7642
   510
(*remove extra sorts that are non-empty by virtue of type signature information*)
wenzelm@7642
   511
fun strip_shyps (thm as Thm {shyps = [], ...}) = thm
wenzelm@21646
   512
  | strip_shyps (thm as Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@7642
   513
      let
wenzelm@16425
   514
        val thy = Theory.deref thy_ref;
wenzelm@16656
   515
        val shyps' =
wenzelm@16656
   516
          if Sign.all_sorts_nonempty thy then []
wenzelm@16656
   517
          else
wenzelm@16656
   518
            let
wenzelm@16656
   519
              val present = present_sorts thm;
wenzelm@16656
   520
              val extra = Sorts.subtract present shyps;
wenzelm@16656
   521
              val witnessed = map #2 (Sign.witness_sorts thy present extra);
wenzelm@16656
   522
            in Sorts.subtract witnessed shyps end;
wenzelm@7642
   523
      in
wenzelm@21646
   524
        Thm {thy_ref = thy_ref, der = der, tags = tags, maxidx = maxidx,
wenzelm@16656
   525
          shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop}
wenzelm@7642
   526
      end;
wenzelm@1238
   527
wenzelm@16656
   528
(*dangling sort constraints of a thm*)
wenzelm@16656
   529
fun extra_shyps (th as Thm {shyps, ...}) = Sorts.subtract (present_sorts th) shyps;
wenzelm@16656
   530
wenzelm@1238
   531
wenzelm@1238
   532
paulson@1529
   533
(** Axioms **)
wenzelm@387
   534
wenzelm@16425
   535
(*look up the named axiom in the theory or its ancestors*)
wenzelm@15672
   536
fun get_axiom_i theory name =
wenzelm@387
   537
  let
wenzelm@16425
   538
    fun get_ax thy =
wenzelm@17412
   539
      Symtab.lookup (#2 (#axioms (Theory.rep_theory thy))) name
wenzelm@16601
   540
      |> Option.map (fn prop =>
wenzelm@16601
   541
          Thm {thy_ref = Theory.self_ref thy,
wenzelm@16601
   542
            der = Pt.infer_derivs' I (false, Pt.axm_proof name prop),
wenzelm@21646
   543
            tags = [],
wenzelm@16601
   544
            maxidx = maxidx_of_term prop,
wenzelm@16656
   545
            shyps = may_insert_term_sorts thy prop [],
wenzelm@16601
   546
            hyps = [],
wenzelm@16601
   547
            tpairs = [],
wenzelm@16601
   548
            prop = prop});
wenzelm@387
   549
  in
wenzelm@16425
   550
    (case get_first get_ax (theory :: Theory.ancestors_of theory) of
skalberg@15531
   551
      SOME thm => thm
skalberg@15531
   552
    | NONE => raise THEORY ("No axiom " ^ quote name, [theory]))
wenzelm@387
   553
  end;
wenzelm@387
   554
wenzelm@16352
   555
fun get_axiom thy =
wenzelm@16425
   556
  get_axiom_i thy o NameSpace.intern (Theory.axiom_space thy);
wenzelm@15672
   557
wenzelm@20884
   558
fun def_name c = c ^ "_def";
wenzelm@20884
   559
wenzelm@20884
   560
fun def_name_optional c "" = def_name c
wenzelm@20884
   561
  | def_name_optional _ name = name;
wenzelm@20884
   562
wenzelm@6368
   563
fun get_def thy = get_axiom thy o def_name;
wenzelm@4847
   564
paulson@1529
   565
wenzelm@776
   566
(*return additional axioms of this theory node*)
wenzelm@776
   567
fun axioms_of thy =
wenzelm@776
   568
  map (fn (s, _) => (s, get_axiom thy s))
wenzelm@16352
   569
    (Symtab.dest (#2 (#axioms (Theory.rep_theory thy))));
wenzelm@776
   570
wenzelm@6089
   571
wenzelm@21646
   572
(* official name and additional tags *)
wenzelm@6089
   573
wenzelm@21646
   574
fun get_name (Thm {hyps, prop, der = (_, prf), ...}) =
wenzelm@21646
   575
  Pt.get_name hyps prop prf;
wenzelm@4018
   576
wenzelm@21646
   577
fun put_name name (Thm {thy_ref, der = (ora, prf), tags, maxidx, shyps, hyps, tpairs = [], prop}) =
wenzelm@21646
   578
      Thm {thy_ref = thy_ref,
wenzelm@21646
   579
        der = (ora, Pt.thm_proof (Theory.deref thy_ref) name hyps prop prf),
wenzelm@21646
   580
        tags = tags, maxidx = maxidx, shyps = shyps, hyps = hyps, tpairs = [], prop = prop}
wenzelm@21646
   581
  | put_name _ thm = raise THM ("name_thm: unsolved flex-flex constraints", 0, [thm]);
wenzelm@6089
   582
wenzelm@21646
   583
val get_tags = #tags o rep_thm;
wenzelm@6089
   584
wenzelm@21646
   585
fun map_tags f (Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@21646
   586
  Thm {thy_ref = thy_ref, der = der, tags = f tags, maxidx = maxidx,
wenzelm@21646
   587
    shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop};
clasohm@0
   588
clasohm@0
   589
paulson@1529
   590
(*Compression of theorems -- a separate rule, not integrated with the others,
paulson@1529
   591
  as it could be slow.*)
wenzelm@21646
   592
fun compress (Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@16991
   593
  let val thy = Theory.deref thy_ref in
wenzelm@16991
   594
    Thm {thy_ref = thy_ref,
wenzelm@16991
   595
      der = der,
wenzelm@21646
   596
      tags = tags,
wenzelm@16991
   597
      maxidx = maxidx,
wenzelm@16991
   598
      shyps = shyps,
wenzelm@16991
   599
      hyps = map (Compress.term thy) hyps,
wenzelm@16991
   600
      tpairs = map (pairself (Compress.term thy)) tpairs,
wenzelm@16991
   601
      prop = Compress.term thy prop}
wenzelm@16991
   602
  end;
wenzelm@16945
   603
wenzelm@21646
   604
fun adjust_maxidx_thm i (th as Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@20261
   605
  if maxidx = i then th
wenzelm@20261
   606
  else if maxidx < i then
wenzelm@21646
   607
    Thm {maxidx = i, thy_ref = thy_ref, der = der, tags = tags, shyps = shyps,
wenzelm@20261
   608
      hyps = hyps, tpairs = tpairs, prop = prop}
wenzelm@20261
   609
  else
wenzelm@21646
   610
    Thm {maxidx = Int.max (maxidx_tpairs tpairs (maxidx_of_term prop), i), thy_ref = thy_ref,
wenzelm@21646
   611
      der = der, tags = tags, shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop};
wenzelm@564
   612
wenzelm@387
   613
wenzelm@2509
   614
paulson@1529
   615
(*** Meta rules ***)
clasohm@0
   616
wenzelm@16601
   617
(** primitive rules **)
clasohm@0
   618
wenzelm@16656
   619
(*The assumption rule A |- A*)
wenzelm@16601
   620
fun assume raw_ct =
wenzelm@20261
   621
  let val Cterm {thy_ref, t = prop, T, maxidx, sorts} = adjust_maxidx_cterm ~1 raw_ct in
wenzelm@16601
   622
    if T <> propT then
mengj@19230
   623
      raise THM ("assume: prop", 0, [])
wenzelm@16601
   624
    else if maxidx <> ~1 then
mengj@19230
   625
      raise THM ("assume: variables", maxidx, [])
wenzelm@16601
   626
    else Thm {thy_ref = thy_ref,
wenzelm@16601
   627
      der = Pt.infer_derivs' I (false, Pt.Hyp prop),
wenzelm@21646
   628
      tags = [],
wenzelm@16601
   629
      maxidx = ~1,
wenzelm@16601
   630
      shyps = sorts,
wenzelm@16601
   631
      hyps = [prop],
wenzelm@16601
   632
      tpairs = [],
wenzelm@16601
   633
      prop = prop}
clasohm@0
   634
  end;
clasohm@0
   635
wenzelm@1220
   636
(*Implication introduction
wenzelm@3529
   637
    [A]
wenzelm@3529
   638
     :
wenzelm@3529
   639
     B
wenzelm@1220
   640
  -------
wenzelm@1220
   641
  A ==> B
wenzelm@1220
   642
*)
wenzelm@16601
   643
fun implies_intr
wenzelm@16679
   644
    (ct as Cterm {t = A, T, maxidx = maxidxA, sorts, ...})
wenzelm@16679
   645
    (th as Thm {der, maxidx, hyps, shyps, tpairs, prop, ...}) =
wenzelm@16601
   646
  if T <> propT then
wenzelm@16601
   647
    raise THM ("implies_intr: assumptions must have type prop", 0, [th])
wenzelm@16601
   648
  else
wenzelm@16601
   649
    Thm {thy_ref = merge_thys1 ct th,
wenzelm@16601
   650
      der = Pt.infer_derivs' (Pt.implies_intr_proof A) der,
wenzelm@21646
   651
      tags = [],
wenzelm@16601
   652
      maxidx = Int.max (maxidxA, maxidx),
wenzelm@16601
   653
      shyps = Sorts.union sorts shyps,
wenzelm@22365
   654
      hyps = OrdList.remove Term.fast_term_ord A hyps,
wenzelm@16601
   655
      tpairs = tpairs,
wenzelm@16601
   656
      prop = implies $ A $ prop};
clasohm@0
   657
paulson@1529
   658
wenzelm@1220
   659
(*Implication elimination
wenzelm@1220
   660
  A ==> B    A
wenzelm@1220
   661
  ------------
wenzelm@1220
   662
        B
wenzelm@1220
   663
*)
wenzelm@16601
   664
fun implies_elim thAB thA =
wenzelm@16601
   665
  let
wenzelm@16601
   666
    val Thm {maxidx = maxA, der = derA, hyps = hypsA, shyps = shypsA, tpairs = tpairsA,
wenzelm@16601
   667
      prop = propA, ...} = thA
wenzelm@16601
   668
    and Thm {der, maxidx, hyps, shyps, tpairs, prop, ...} = thAB;
wenzelm@16601
   669
    fun err () = raise THM ("implies_elim: major premise", 0, [thAB, thA]);
wenzelm@16601
   670
  in
wenzelm@16601
   671
    case prop of
wenzelm@20512
   672
      Const ("==>", _) $ A $ B =>
wenzelm@20512
   673
        if A aconv propA then
wenzelm@16656
   674
          Thm {thy_ref = merge_thys2 thAB thA,
wenzelm@16601
   675
            der = Pt.infer_derivs (curry Pt.%%) der derA,
wenzelm@21646
   676
            tags = [],
wenzelm@16601
   677
            maxidx = Int.max (maxA, maxidx),
wenzelm@16601
   678
            shyps = Sorts.union shypsA shyps,
wenzelm@16601
   679
            hyps = union_hyps hypsA hyps,
wenzelm@16601
   680
            tpairs = union_tpairs tpairsA tpairs,
wenzelm@16601
   681
            prop = B}
wenzelm@16601
   682
        else err ()
wenzelm@16601
   683
    | _ => err ()
wenzelm@16601
   684
  end;
wenzelm@250
   685
wenzelm@1220
   686
(*Forall introduction.  The Free or Var x must not be free in the hypotheses.
wenzelm@16656
   687
    [x]
wenzelm@16656
   688
     :
wenzelm@16656
   689
     A
wenzelm@16656
   690
  ------
wenzelm@16656
   691
  !!x. A
wenzelm@1220
   692
*)
wenzelm@16601
   693
fun forall_intr
wenzelm@16601
   694
    (ct as Cterm {t = x, T, sorts, ...})
wenzelm@16679
   695
    (th as Thm {der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@16601
   696
  let
wenzelm@16601
   697
    fun result a =
wenzelm@16601
   698
      Thm {thy_ref = merge_thys1 ct th,
wenzelm@16601
   699
        der = Pt.infer_derivs' (Pt.forall_intr_proof x a) der,
wenzelm@21646
   700
        tags = [],
wenzelm@16601
   701
        maxidx = maxidx,
wenzelm@16601
   702
        shyps = Sorts.union sorts shyps,
wenzelm@16601
   703
        hyps = hyps,
wenzelm@16601
   704
        tpairs = tpairs,
wenzelm@16601
   705
        prop = all T $ Abs (a, T, abstract_over (x, prop))};
wenzelm@21798
   706
    fun check_occs a x ts =
wenzelm@16847
   707
      if exists (fn t => Logic.occs (x, t)) ts then
wenzelm@21798
   708
        raise THM ("forall_intr: variable " ^ quote a ^ " free in assumptions", 0, [th])
wenzelm@16601
   709
      else ();
wenzelm@16601
   710
  in
wenzelm@16601
   711
    case x of
wenzelm@21798
   712
      Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result a)
wenzelm@21798
   713
    | Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result a)
wenzelm@16601
   714
    | _ => raise THM ("forall_intr: not a variable", 0, [th])
clasohm@0
   715
  end;
clasohm@0
   716
wenzelm@1220
   717
(*Forall elimination
wenzelm@16656
   718
  !!x. A
wenzelm@1220
   719
  ------
wenzelm@1220
   720
  A[t/x]
wenzelm@1220
   721
*)
wenzelm@16601
   722
fun forall_elim
wenzelm@16601
   723
    (ct as Cterm {t, T, maxidx = maxt, sorts, ...})
wenzelm@16601
   724
    (th as Thm {der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@16601
   725
  (case prop of
wenzelm@16601
   726
    Const ("all", Type ("fun", [Type ("fun", [qary, _]), _])) $ A =>
wenzelm@16601
   727
      if T <> qary then
wenzelm@16601
   728
        raise THM ("forall_elim: type mismatch", 0, [th])
wenzelm@16601
   729
      else
wenzelm@16601
   730
        Thm {thy_ref = merge_thys1 ct th,
wenzelm@16601
   731
          der = Pt.infer_derivs' (Pt.% o rpair (SOME t)) der,
wenzelm@21646
   732
          tags = [],
wenzelm@16601
   733
          maxidx = Int.max (maxidx, maxt),
wenzelm@16601
   734
          shyps = Sorts.union sorts shyps,
wenzelm@16601
   735
          hyps = hyps,
wenzelm@16601
   736
          tpairs = tpairs,
wenzelm@16601
   737
          prop = Term.betapply (A, t)}
wenzelm@16601
   738
  | _ => raise THM ("forall_elim: not quantified", 0, [th]));
clasohm@0
   739
clasohm@0
   740
wenzelm@1220
   741
(* Equality *)
clasohm@0
   742
wenzelm@16601
   743
(*Reflexivity
wenzelm@16601
   744
  t == t
wenzelm@16601
   745
*)
wenzelm@16601
   746
fun reflexive (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@16656
   747
  Thm {thy_ref = thy_ref,
wenzelm@16601
   748
    der = Pt.infer_derivs' I (false, Pt.reflexive),
wenzelm@21646
   749
    tags = [],
wenzelm@16601
   750
    maxidx = maxidx,
wenzelm@16601
   751
    shyps = sorts,
wenzelm@16601
   752
    hyps = [],
wenzelm@16601
   753
    tpairs = [],
wenzelm@16601
   754
    prop = Logic.mk_equals (t, t)};
clasohm@0
   755
wenzelm@16601
   756
(*Symmetry
wenzelm@16601
   757
  t == u
wenzelm@16601
   758
  ------
wenzelm@16601
   759
  u == t
wenzelm@1220
   760
*)
wenzelm@21646
   761
fun symmetric (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@16601
   762
  (case prop of
wenzelm@16601
   763
    (eq as Const ("==", Type (_, [T, _]))) $ t $ u =>
wenzelm@16601
   764
      Thm {thy_ref = thy_ref,
wenzelm@16601
   765
        der = Pt.infer_derivs' Pt.symmetric der,
wenzelm@21646
   766
        tags = [],
wenzelm@16601
   767
        maxidx = maxidx,
wenzelm@16601
   768
        shyps = shyps,
wenzelm@16601
   769
        hyps = hyps,
wenzelm@16601
   770
        tpairs = tpairs,
wenzelm@16601
   771
        prop = eq $ u $ t}
wenzelm@16601
   772
    | _ => raise THM ("symmetric", 0, [th]));
clasohm@0
   773
wenzelm@16601
   774
(*Transitivity
wenzelm@16601
   775
  t1 == u    u == t2
wenzelm@16601
   776
  ------------------
wenzelm@16601
   777
       t1 == t2
wenzelm@1220
   778
*)
clasohm@0
   779
fun transitive th1 th2 =
wenzelm@16601
   780
  let
wenzelm@16601
   781
    val Thm {der = der1, maxidx = max1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1,
wenzelm@16601
   782
      prop = prop1, ...} = th1
wenzelm@16601
   783
    and Thm {der = der2, maxidx = max2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2,
wenzelm@16601
   784
      prop = prop2, ...} = th2;
wenzelm@16601
   785
    fun err msg = raise THM ("transitive: " ^ msg, 0, [th1, th2]);
wenzelm@16601
   786
  in
wenzelm@16601
   787
    case (prop1, prop2) of
wenzelm@16601
   788
      ((eq as Const ("==", Type (_, [T, _]))) $ t1 $ u, Const ("==", _) $ u' $ t2) =>
wenzelm@16601
   789
        if not (u aconv u') then err "middle term"
wenzelm@16601
   790
        else
wenzelm@16656
   791
          Thm {thy_ref = merge_thys2 th1 th2,
wenzelm@16601
   792
            der = Pt.infer_derivs (Pt.transitive u T) der1 der2,
wenzelm@21646
   793
            tags = [],
wenzelm@16601
   794
            maxidx = Int.max (max1, max2),
wenzelm@16601
   795
            shyps = Sorts.union shyps1 shyps2,
wenzelm@16601
   796
            hyps = union_hyps hyps1 hyps2,
wenzelm@16601
   797
            tpairs = union_tpairs tpairs1 tpairs2,
wenzelm@16601
   798
            prop = eq $ t1 $ t2}
wenzelm@16601
   799
     | _ =>  err "premises"
clasohm@0
   800
  end;
clasohm@0
   801
wenzelm@16601
   802
(*Beta-conversion
wenzelm@16656
   803
  (%x. t)(u) == t[u/x]
wenzelm@16601
   804
  fully beta-reduces the term if full = true
berghofe@10416
   805
*)
wenzelm@16601
   806
fun beta_conversion full (Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@16601
   807
  let val t' =
wenzelm@16601
   808
    if full then Envir.beta_norm t
wenzelm@16601
   809
    else
wenzelm@16601
   810
      (case t of Abs (_, _, bodt) $ u => subst_bound (u, bodt)
wenzelm@16601
   811
      | _ => raise THM ("beta_conversion: not a redex", 0, []));
wenzelm@16601
   812
  in
wenzelm@16601
   813
    Thm {thy_ref = thy_ref,
wenzelm@16601
   814
      der = Pt.infer_derivs' I (false, Pt.reflexive),
wenzelm@21646
   815
      tags = [],
wenzelm@16601
   816
      maxidx = maxidx,
wenzelm@16601
   817
      shyps = sorts,
wenzelm@16601
   818
      hyps = [],
wenzelm@16601
   819
      tpairs = [],
wenzelm@16601
   820
      prop = Logic.mk_equals (t, t')}
berghofe@10416
   821
  end;
berghofe@10416
   822
wenzelm@16601
   823
fun eta_conversion (Cterm {thy_ref, t, T, maxidx, sorts}) =
wenzelm@16601
   824
  Thm {thy_ref = thy_ref,
wenzelm@16601
   825
    der = Pt.infer_derivs' I (false, Pt.reflexive),
wenzelm@21646
   826
    tags = [],
wenzelm@16601
   827
    maxidx = maxidx,
wenzelm@16601
   828
    shyps = sorts,
wenzelm@16601
   829
    hyps = [],
wenzelm@16601
   830
    tpairs = [],
wenzelm@18944
   831
    prop = Logic.mk_equals (t, Envir.eta_contract t)};
clasohm@0
   832
clasohm@0
   833
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
clasohm@0
   834
  The bound variable will be named "a" (since x will be something like x320)
wenzelm@16601
   835
      t == u
wenzelm@16601
   836
  --------------
wenzelm@16601
   837
  %x. t == %x. u
wenzelm@1220
   838
*)
wenzelm@16601
   839
fun abstract_rule a
wenzelm@16601
   840
    (Cterm {t = x, T, sorts, ...})
wenzelm@21646
   841
    (th as Thm {thy_ref, der, maxidx, hyps, shyps, tpairs, prop, ...}) =
wenzelm@16601
   842
  let
wenzelm@16601
   843
    val (t, u) = Logic.dest_equals prop
wenzelm@16601
   844
      handle TERM _ => raise THM ("abstract_rule: premise not an equality", 0, [th]);
wenzelm@16601
   845
    val result =
wenzelm@16601
   846
      Thm {thy_ref = thy_ref,
wenzelm@16601
   847
        der = Pt.infer_derivs' (Pt.abstract_rule x a) der,
wenzelm@21646
   848
        tags = [],
wenzelm@16601
   849
        maxidx = maxidx,
wenzelm@16601
   850
        shyps = Sorts.union sorts shyps,
wenzelm@16601
   851
        hyps = hyps,
wenzelm@16601
   852
        tpairs = tpairs,
wenzelm@16601
   853
        prop = Logic.mk_equals
wenzelm@16601
   854
          (Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))};
wenzelm@21798
   855
    fun check_occs a x ts =
wenzelm@16847
   856
      if exists (fn t => Logic.occs (x, t)) ts then
wenzelm@21798
   857
        raise THM ("abstract_rule: variable " ^ quote a ^ " free in assumptions", 0, [th])
wenzelm@16601
   858
      else ();
wenzelm@16601
   859
  in
wenzelm@16601
   860
    case x of
wenzelm@21798
   861
      Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result)
wenzelm@21798
   862
    | Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result)
wenzelm@21798
   863
    | _ => raise THM ("abstract_rule: not a variable", 0, [th])
clasohm@0
   864
  end;
clasohm@0
   865
clasohm@0
   866
(*The combination rule
wenzelm@3529
   867
  f == g  t == u
wenzelm@3529
   868
  --------------
wenzelm@16601
   869
    f t == g u
wenzelm@1220
   870
*)
clasohm@0
   871
fun combination th1 th2 =
wenzelm@16601
   872
  let
wenzelm@16601
   873
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
wenzelm@16601
   874
      prop = prop1, ...} = th1
wenzelm@16601
   875
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
wenzelm@16601
   876
      prop = prop2, ...} = th2;
wenzelm@16601
   877
    fun chktypes fT tT =
wenzelm@16601
   878
      (case fT of
wenzelm@16601
   879
        Type ("fun", [T1, T2]) =>
wenzelm@16601
   880
          if T1 <> tT then
wenzelm@16601
   881
            raise THM ("combination: types", 0, [th1, th2])
wenzelm@16601
   882
          else ()
wenzelm@16601
   883
      | _ => raise THM ("combination: not function type", 0, [th1, th2]));
wenzelm@16601
   884
  in
wenzelm@16601
   885
    case (prop1, prop2) of
wenzelm@16601
   886
      (Const ("==", Type ("fun", [fT, _])) $ f $ g,
wenzelm@16601
   887
       Const ("==", Type ("fun", [tT, _])) $ t $ u) =>
wenzelm@16601
   888
        (chktypes fT tT;
wenzelm@16601
   889
          Thm {thy_ref = merge_thys2 th1 th2,
wenzelm@16601
   890
            der = Pt.infer_derivs (Pt.combination f g t u fT) der1 der2,
wenzelm@21646
   891
            tags = [],
wenzelm@16601
   892
            maxidx = Int.max (max1, max2),
wenzelm@16601
   893
            shyps = Sorts.union shyps1 shyps2,
wenzelm@16601
   894
            hyps = union_hyps hyps1 hyps2,
wenzelm@16601
   895
            tpairs = union_tpairs tpairs1 tpairs2,
wenzelm@16601
   896
            prop = Logic.mk_equals (f $ t, g $ u)})
wenzelm@16601
   897
     | _ => raise THM ("combination: premises", 0, [th1, th2])
clasohm@0
   898
  end;
clasohm@0
   899
wenzelm@16601
   900
(*Equality introduction
wenzelm@3529
   901
  A ==> B  B ==> A
wenzelm@3529
   902
  ----------------
wenzelm@3529
   903
       A == B
wenzelm@1220
   904
*)
clasohm@0
   905
fun equal_intr th1 th2 =
wenzelm@16601
   906
  let
wenzelm@16601
   907
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
wenzelm@16601
   908
      prop = prop1, ...} = th1
wenzelm@16601
   909
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
wenzelm@16601
   910
      prop = prop2, ...} = th2;
wenzelm@16601
   911
    fun err msg = raise THM ("equal_intr: " ^ msg, 0, [th1, th2]);
wenzelm@16601
   912
  in
wenzelm@16601
   913
    case (prop1, prop2) of
wenzelm@16601
   914
      (Const("==>", _) $ A $ B, Const("==>", _) $ B' $ A') =>
wenzelm@16601
   915
        if A aconv A' andalso B aconv B' then
wenzelm@16601
   916
          Thm {thy_ref = merge_thys2 th1 th2,
wenzelm@16601
   917
            der = Pt.infer_derivs (Pt.equal_intr A B) der1 der2,
wenzelm@21646
   918
            tags = [],
wenzelm@16601
   919
            maxidx = Int.max (max1, max2),
wenzelm@16601
   920
            shyps = Sorts.union shyps1 shyps2,
wenzelm@16601
   921
            hyps = union_hyps hyps1 hyps2,
wenzelm@16601
   922
            tpairs = union_tpairs tpairs1 tpairs2,
wenzelm@16601
   923
            prop = Logic.mk_equals (A, B)}
wenzelm@16601
   924
        else err "not equal"
wenzelm@16601
   925
    | _ =>  err "premises"
paulson@1529
   926
  end;
paulson@1529
   927
paulson@1529
   928
(*The equal propositions rule
wenzelm@3529
   929
  A == B  A
paulson@1529
   930
  ---------
paulson@1529
   931
      B
paulson@1529
   932
*)
paulson@1529
   933
fun equal_elim th1 th2 =
wenzelm@16601
   934
  let
wenzelm@16601
   935
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1,
wenzelm@16601
   936
      tpairs = tpairs1, prop = prop1, ...} = th1
wenzelm@16601
   937
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2,
wenzelm@16601
   938
      tpairs = tpairs2, prop = prop2, ...} = th2;
wenzelm@16601
   939
    fun err msg = raise THM ("equal_elim: " ^ msg, 0, [th1, th2]);
wenzelm@16601
   940
  in
wenzelm@16601
   941
    case prop1 of
wenzelm@16601
   942
      Const ("==", _) $ A $ B =>
wenzelm@16601
   943
        if prop2 aconv A then
wenzelm@16601
   944
          Thm {thy_ref = merge_thys2 th1 th2,
wenzelm@16601
   945
            der = Pt.infer_derivs (Pt.equal_elim A B) der1 der2,
wenzelm@21646
   946
            tags = [],
wenzelm@16601
   947
            maxidx = Int.max (max1, max2),
wenzelm@16601
   948
            shyps = Sorts.union shyps1 shyps2,
wenzelm@16601
   949
            hyps = union_hyps hyps1 hyps2,
wenzelm@16601
   950
            tpairs = union_tpairs tpairs1 tpairs2,
wenzelm@16601
   951
            prop = B}
wenzelm@16601
   952
        else err "not equal"
paulson@1529
   953
     | _ =>  err"major premise"
paulson@1529
   954
  end;
clasohm@0
   955
wenzelm@1220
   956
wenzelm@1220
   957
clasohm@0
   958
(**** Derived rules ****)
clasohm@0
   959
wenzelm@16601
   960
(*Smash unifies the list of term pairs leaving no flex-flex pairs.
wenzelm@250
   961
  Instantiates the theorem and deletes trivial tpairs.
clasohm@0
   962
  Resulting sequence may contain multiple elements if the tpairs are
clasohm@0
   963
    not all flex-flex. *)
wenzelm@21646
   964
fun flexflex_rule (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@19861
   965
  Unify.smash_unifiers (Theory.deref thy_ref) tpairs (Envir.empty maxidx)
wenzelm@16601
   966
  |> Seq.map (fn env =>
wenzelm@16601
   967
      if Envir.is_empty env then th
wenzelm@16601
   968
      else
wenzelm@16601
   969
        let
wenzelm@16601
   970
          val tpairs' = tpairs |> map (pairself (Envir.norm_term env))
wenzelm@16601
   971
            (*remove trivial tpairs, of the form t==t*)
wenzelm@16884
   972
            |> filter_out (op aconv);
wenzelm@16601
   973
          val prop' = Envir.norm_term env prop;
wenzelm@16601
   974
        in
wenzelm@16601
   975
          Thm {thy_ref = thy_ref,
wenzelm@16601
   976
            der = Pt.infer_derivs' (Pt.norm_proof' env) der,
wenzelm@21646
   977
            tags = [],
wenzelm@16711
   978
            maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'),
wenzelm@16656
   979
            shyps = may_insert_env_sorts (Theory.deref thy_ref) env shyps,
wenzelm@16601
   980
            hyps = hyps,
wenzelm@16601
   981
            tpairs = tpairs',
wenzelm@16601
   982
            prop = prop'}
wenzelm@16601
   983
        end);
wenzelm@16601
   984
clasohm@0
   985
wenzelm@19910
   986
(*Generalization of fixed variables
wenzelm@19910
   987
           A
wenzelm@19910
   988
  --------------------
wenzelm@19910
   989
  A[?'a/'a, ?x/x, ...]
wenzelm@19910
   990
*)
wenzelm@19910
   991
wenzelm@19910
   992
fun generalize ([], []) _ th = th
wenzelm@19910
   993
  | generalize (tfrees, frees) idx th =
wenzelm@19910
   994
      let
wenzelm@21646
   995
        val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...} = th;
wenzelm@19910
   996
        val _ = idx <= maxidx andalso raise THM ("generalize: bad index", idx, [th]);
wenzelm@19910
   997
wenzelm@19910
   998
        val bad_type = if null tfrees then K false else
wenzelm@19910
   999
          Term.exists_subtype (fn TFree (a, _) => member (op =) tfrees a | _ => false);
wenzelm@19910
  1000
        fun bad_term (Free (x, T)) = bad_type T orelse member (op =) frees x
wenzelm@19910
  1001
          | bad_term (Var (_, T)) = bad_type T
wenzelm@19910
  1002
          | bad_term (Const (_, T)) = bad_type T
wenzelm@19910
  1003
          | bad_term (Abs (_, T, t)) = bad_type T orelse bad_term t
wenzelm@19910
  1004
          | bad_term (t $ u) = bad_term t orelse bad_term u
wenzelm@19910
  1005
          | bad_term (Bound _) = false;
wenzelm@19910
  1006
        val _ = exists bad_term hyps andalso
wenzelm@19910
  1007
          raise THM ("generalize: variable free in assumptions", 0, [th]);
wenzelm@19910
  1008
wenzelm@20512
  1009
        val gen = TermSubst.generalize (tfrees, frees) idx;
wenzelm@19910
  1010
        val prop' = gen prop;
wenzelm@19910
  1011
        val tpairs' = map (pairself gen) tpairs;
wenzelm@19910
  1012
        val maxidx' = maxidx_tpairs tpairs' (maxidx_of_term prop');
wenzelm@19910
  1013
      in
wenzelm@19910
  1014
        Thm {
wenzelm@19910
  1015
          thy_ref = thy_ref,
wenzelm@19910
  1016
          der = Pt.infer_derivs' (Pt.generalize (tfrees, frees) idx) der,
wenzelm@21646
  1017
          tags = [],
wenzelm@19910
  1018
          maxidx = maxidx',
wenzelm@19910
  1019
          shyps = shyps,
wenzelm@19910
  1020
          hyps = hyps,
wenzelm@19910
  1021
          tpairs = tpairs',
wenzelm@19910
  1022
          prop = prop'}
wenzelm@19910
  1023
      end;
wenzelm@19910
  1024
wenzelm@19910
  1025
wenzelm@22584
  1026
(*Instantiation of schematic variables
wenzelm@16656
  1027
           A
wenzelm@16656
  1028
  --------------------
wenzelm@16656
  1029
  A[t1/v1, ..., tn/vn]
wenzelm@1220
  1030
*)
clasohm@0
  1031
wenzelm@6928
  1032
local
wenzelm@6928
  1033
wenzelm@16425
  1034
fun pretty_typing thy t T =
wenzelm@16425
  1035
  Pretty.block [Sign.pretty_term thy t, Pretty.str " ::", Pretty.brk 1, Sign.pretty_typ thy T];
berghofe@15797
  1036
wenzelm@16884
  1037
fun add_inst (ct, cu) (thy_ref, sorts) =
wenzelm@6928
  1038
  let
wenzelm@16884
  1039
    val Cterm {t = t, T = T, ...} = ct
wenzelm@20512
  1040
    and Cterm {t = u, T = U, sorts = sorts_u, maxidx = maxidx_u, ...} = cu;
wenzelm@16884
  1041
    val thy_ref' = Theory.merge_refs (thy_ref, merge_thys0 ct cu);
wenzelm@16884
  1042
    val sorts' = Sorts.union sorts_u sorts;
wenzelm@3967
  1043
  in
wenzelm@16884
  1044
    (case t of Var v =>
wenzelm@20512
  1045
      if T = U then ((v, (u, maxidx_u)), (thy_ref', sorts'))
wenzelm@16884
  1046
      else raise TYPE (Pretty.string_of (Pretty.block
wenzelm@16884
  1047
       [Pretty.str "instantiate: type conflict",
wenzelm@16884
  1048
        Pretty.fbrk, pretty_typing (Theory.deref thy_ref') t T,
wenzelm@16884
  1049
        Pretty.fbrk, pretty_typing (Theory.deref thy_ref') u U]), [T, U], [t, u])
wenzelm@16884
  1050
    | _ => raise TYPE (Pretty.string_of (Pretty.block
wenzelm@16884
  1051
       [Pretty.str "instantiate: not a variable",
wenzelm@16884
  1052
        Pretty.fbrk, Sign.pretty_term (Theory.deref thy_ref') t]), [], [t]))
clasohm@0
  1053
  end;
clasohm@0
  1054
wenzelm@16884
  1055
fun add_instT (cT, cU) (thy_ref, sorts) =
wenzelm@16656
  1056
  let
wenzelm@16884
  1057
    val Ctyp {T, thy_ref = thy_ref1, ...} = cT
wenzelm@20512
  1058
    and Ctyp {T = U, thy_ref = thy_ref2, sorts = sorts_U, maxidx = maxidx_U, ...} = cU;
wenzelm@16884
  1059
    val thy_ref' = Theory.merge_refs (thy_ref, Theory.merge_refs (thy_ref1, thy_ref2));
wenzelm@16884
  1060
    val thy' = Theory.deref thy_ref';
wenzelm@16884
  1061
    val sorts' = Sorts.union sorts_U sorts;
wenzelm@16656
  1062
  in
wenzelm@16884
  1063
    (case T of TVar (v as (_, S)) =>
wenzelm@20512
  1064
      if Sign.of_sort thy' (U, S) then ((v, (U, maxidx_U)), (thy_ref', sorts'))
wenzelm@16656
  1065
      else raise TYPE ("Type not of sort " ^ Sign.string_of_sort thy' S, [U], [])
wenzelm@16656
  1066
    | _ => raise TYPE (Pretty.string_of (Pretty.block
berghofe@15797
  1067
        [Pretty.str "instantiate: not a type variable",
wenzelm@16656
  1068
         Pretty.fbrk, Sign.pretty_typ thy' T]), [T], []))
wenzelm@16656
  1069
  end;
clasohm@0
  1070
wenzelm@6928
  1071
in
wenzelm@6928
  1072
wenzelm@16601
  1073
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...].
clasohm@0
  1074
  Instantiates distinct Vars by terms of same type.
wenzelm@16601
  1075
  Does NOT normalize the resulting theorem!*)
paulson@1529
  1076
fun instantiate ([], []) th = th
wenzelm@16884
  1077
  | instantiate (instT, inst) th =
wenzelm@16656
  1078
      let
wenzelm@16884
  1079
        val Thm {thy_ref, der, hyps, shyps, tpairs, prop, ...} = th;
wenzelm@16884
  1080
        val (inst', (instT', (thy_ref', shyps'))) =
wenzelm@16884
  1081
          (thy_ref, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT;
wenzelm@20512
  1082
        val subst = TermSubst.instantiate_maxidx (instT', inst');
wenzelm@20512
  1083
        val (prop', maxidx1) = subst prop ~1;
wenzelm@20512
  1084
        val (tpairs', maxidx') =
wenzelm@20512
  1085
          fold_map (fn (t, u) => fn i => subst t i ||>> subst u) tpairs maxidx1;
wenzelm@16656
  1086
      in
wenzelm@20545
  1087
        Thm {thy_ref = thy_ref',
wenzelm@20545
  1088
          der = Pt.infer_derivs' (fn d =>
wenzelm@20545
  1089
            Pt.instantiate (map (apsnd #1) instT', map (apsnd #1) inst') d) der,
wenzelm@21646
  1090
          tags = [],
wenzelm@20545
  1091
          maxidx = maxidx',
wenzelm@20545
  1092
          shyps = shyps',
wenzelm@20545
  1093
          hyps = hyps,
wenzelm@20545
  1094
          tpairs = tpairs',
wenzelm@20545
  1095
          prop = prop'}
wenzelm@16656
  1096
      end
wenzelm@16656
  1097
      handle TYPE (msg, _, _) => raise THM (msg, 0, [th]);
wenzelm@6928
  1098
wenzelm@22584
  1099
fun instantiate_cterm ([], []) ct = ct
wenzelm@22584
  1100
  | instantiate_cterm (instT, inst) ct =
wenzelm@22584
  1101
      let
wenzelm@22584
  1102
        val Cterm {thy_ref, t, T, sorts, ...} = ct;
wenzelm@22584
  1103
        val (inst', (instT', (thy_ref', sorts'))) =
wenzelm@22584
  1104
          (thy_ref, sorts) |> fold_map add_inst inst ||> fold_map add_instT instT;
wenzelm@22584
  1105
        val subst = TermSubst.instantiate_maxidx (instT', inst');
wenzelm@22584
  1106
        val substT = TermSubst.instantiateT_maxidx instT';
wenzelm@22584
  1107
        val (t', maxidx1) = subst t ~1;
wenzelm@22584
  1108
        val (T', maxidx') = substT T maxidx1;
wenzelm@22584
  1109
      in Cterm {thy_ref = thy_ref', t = t', T = T', sorts = sorts', maxidx = maxidx'} end
wenzelm@22584
  1110
      handle TYPE (msg, _, _) => raise CTERM (msg, [ct]);
wenzelm@22584
  1111
wenzelm@6928
  1112
end;
wenzelm@6928
  1113
clasohm@0
  1114
wenzelm@16601
  1115
(*The trivial implication A ==> A, justified by assume and forall rules.
wenzelm@16601
  1116
  A can contain Vars, not so for assume!*)
wenzelm@16601
  1117
fun trivial (Cterm {thy_ref, t =A, T, maxidx, sorts}) =
wenzelm@16601
  1118
  if T <> propT then
wenzelm@16601
  1119
    raise THM ("trivial: the term must have type prop", 0, [])
wenzelm@16601
  1120
  else
wenzelm@16601
  1121
    Thm {thy_ref = thy_ref,
wenzelm@16601
  1122
      der = Pt.infer_derivs' I (false, Pt.AbsP ("H", NONE, Pt.PBound 0)),
wenzelm@21646
  1123
      tags = [],
wenzelm@16601
  1124
      maxidx = maxidx,
wenzelm@16601
  1125
      shyps = sorts,
wenzelm@16601
  1126
      hyps = [],
wenzelm@16601
  1127
      tpairs = [],
wenzelm@16601
  1128
      prop = implies $ A $ A};
clasohm@0
  1129
paulson@1503
  1130
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *)
wenzelm@16425
  1131
fun class_triv thy c =
wenzelm@16601
  1132
  let val Cterm {thy_ref, t, maxidx, sorts, ...} =
wenzelm@19525
  1133
    cterm_of thy (Logic.mk_inclass (TVar (("'a", 0), [c]), Sign.certify_class thy c))
wenzelm@6368
  1134
      handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
wenzelm@399
  1135
  in
wenzelm@16601
  1136
    Thm {thy_ref = thy_ref,
wenzelm@16601
  1137
      der = Pt.infer_derivs' I (false, Pt.PAxm ("ProtoPure.class_triv:" ^ c, t, SOME [])),
wenzelm@21646
  1138
      tags = [],
wenzelm@16601
  1139
      maxidx = maxidx,
wenzelm@16601
  1140
      shyps = sorts,
wenzelm@16601
  1141
      hyps = [],
wenzelm@16601
  1142
      tpairs = [],
wenzelm@16601
  1143
      prop = t}
wenzelm@399
  1144
  end;
wenzelm@399
  1145
wenzelm@19505
  1146
(*Internalize sort constraints of type variable*)
wenzelm@19505
  1147
fun unconstrainT
wenzelm@19505
  1148
    (Ctyp {thy_ref = thy_ref1, T, ...})
wenzelm@21646
  1149
    (th as Thm {thy_ref = thy_ref2, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@19505
  1150
  let
wenzelm@19505
  1151
    val ((x, i), S) = Term.dest_TVar T handle TYPE _ =>
wenzelm@19505
  1152
      raise THM ("unconstrainT: not a type variable", 0, [th]);
wenzelm@19505
  1153
    val T' = TVar ((x, i), []);
wenzelm@20548
  1154
    val unconstrain = Term.map_types (Term.map_atyps (fn U => if U = T then T' else U));
wenzelm@19505
  1155
    val constraints = map (curry Logic.mk_inclass T') S;
wenzelm@19505
  1156
  in
wenzelm@19505
  1157
    Thm {thy_ref = Theory.merge_refs (thy_ref1, thy_ref2),
wenzelm@19505
  1158
      der = Pt.infer_derivs' I (false, Pt.PAxm ("ProtoPure.unconstrainT", prop, SOME [])),
wenzelm@21646
  1159
      tags = [],
wenzelm@19505
  1160
      maxidx = Int.max (maxidx, i),
wenzelm@19505
  1161
      shyps = Sorts.remove_sort S shyps,
wenzelm@19505
  1162
      hyps = hyps,
wenzelm@19505
  1163
      tpairs = map (pairself unconstrain) tpairs,
wenzelm@19505
  1164
      prop = Logic.list_implies (constraints, unconstrain prop)}
wenzelm@19505
  1165
  end;
wenzelm@399
  1166
wenzelm@6786
  1167
(* Replace all TFrees not fixed or in the hyps by new TVars *)
wenzelm@21646
  1168
fun varifyT' fixed (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@12500
  1169
  let
berghofe@15797
  1170
    val tfrees = foldr add_term_tfrees fixed hyps;
berghofe@13658
  1171
    val prop1 = attach_tpairs tpairs prop;
haftmann@21116
  1172
    val (al, prop2) = Type.varify tfrees prop1;
wenzelm@16601
  1173
    val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2);
wenzelm@16601
  1174
  in
wenzelm@18127
  1175
    (al, Thm {thy_ref = thy_ref,
wenzelm@16601
  1176
      der = Pt.infer_derivs' (Pt.varify_proof prop tfrees) der,
wenzelm@21646
  1177
      tags = [],
wenzelm@16601
  1178
      maxidx = Int.max (0, maxidx),
wenzelm@16601
  1179
      shyps = shyps,
wenzelm@16601
  1180
      hyps = hyps,
wenzelm@16601
  1181
      tpairs = rev (map Logic.dest_equals ts),
wenzelm@18127
  1182
      prop = prop3})
clasohm@0
  1183
  end;
clasohm@0
  1184
wenzelm@18127
  1185
val varifyT = #2 o varifyT' [];
wenzelm@6786
  1186
clasohm@0
  1187
(* Replace all TVars by new TFrees *)
wenzelm@21646
  1188
fun freezeT (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
berghofe@13658
  1189
  let
berghofe@13658
  1190
    val prop1 = attach_tpairs tpairs prop;
wenzelm@16287
  1191
    val prop2 = Type.freeze prop1;
wenzelm@16601
  1192
    val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2);
wenzelm@16601
  1193
  in
wenzelm@16601
  1194
    Thm {thy_ref = thy_ref,
wenzelm@16601
  1195
      der = Pt.infer_derivs' (Pt.freezeT prop1) der,
wenzelm@21646
  1196
      tags = [],
wenzelm@16601
  1197
      maxidx = maxidx_of_term prop2,
wenzelm@16601
  1198
      shyps = shyps,
wenzelm@16601
  1199
      hyps = hyps,
wenzelm@16601
  1200
      tpairs = rev (map Logic.dest_equals ts),
wenzelm@16601
  1201
      prop = prop3}
wenzelm@1220
  1202
  end;
clasohm@0
  1203
clasohm@0
  1204
clasohm@0
  1205
(*** Inference rules for tactics ***)
clasohm@0
  1206
clasohm@0
  1207
(*Destruct proof state into constraints, other goals, goal(i), rest *)
berghofe@13658
  1208
fun dest_state (state as Thm{prop,tpairs,...}, i) =
berghofe@13658
  1209
  (case  Logic.strip_prems(i, [], prop) of
berghofe@13658
  1210
      (B::rBs, C) => (tpairs, rev rBs, B, C)
berghofe@13658
  1211
    | _ => raise THM("dest_state", i, [state]))
clasohm@0
  1212
  handle TERM _ => raise THM("dest_state", i, [state]);
clasohm@0
  1213
lcp@309
  1214
(*Increment variables and parameters of orule as required for
wenzelm@18035
  1215
  resolution with a goal.*)
wenzelm@18035
  1216
fun lift_rule goal orule =
wenzelm@16601
  1217
  let
wenzelm@18035
  1218
    val Cterm {t = gprop, T, maxidx = gmax, sorts, ...} = goal;
wenzelm@18035
  1219
    val inc = gmax + 1;
wenzelm@18035
  1220
    val lift_abs = Logic.lift_abs inc gprop;
wenzelm@18035
  1221
    val lift_all = Logic.lift_all inc gprop;
wenzelm@18035
  1222
    val Thm {der, maxidx, shyps, hyps, tpairs, prop, ...} = orule;
wenzelm@16601
  1223
    val (As, B) = Logic.strip_horn prop;
wenzelm@16601
  1224
  in
wenzelm@18035
  1225
    if T <> propT then raise THM ("lift_rule: the term must have type prop", 0, [])
wenzelm@18035
  1226
    else
wenzelm@18035
  1227
      Thm {thy_ref = merge_thys1 goal orule,
wenzelm@18035
  1228
        der = Pt.infer_derivs' (Pt.lift_proof gprop inc prop) der,
wenzelm@21646
  1229
        tags = [],
wenzelm@18035
  1230
        maxidx = maxidx + inc,
wenzelm@18035
  1231
        shyps = Sorts.union shyps sorts,  (*sic!*)
wenzelm@18035
  1232
        hyps = hyps,
wenzelm@18035
  1233
        tpairs = map (pairself lift_abs) tpairs,
wenzelm@18035
  1234
        prop = Logic.list_implies (map lift_all As, lift_all B)}
clasohm@0
  1235
  end;
clasohm@0
  1236
wenzelm@21646
  1237
fun incr_indexes i (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...}) =
wenzelm@16601
  1238
  if i < 0 then raise THM ("negative increment", 0, [thm])
wenzelm@16601
  1239
  else if i = 0 then thm
wenzelm@16601
  1240
  else
wenzelm@16425
  1241
    Thm {thy_ref = thy_ref,
wenzelm@16884
  1242
      der = Pt.infer_derivs'
wenzelm@16884
  1243
        (Pt.map_proof_terms (Logic.incr_indexes ([], i)) (Logic.incr_tvar i)) der,
wenzelm@21646
  1244
      tags = [],
wenzelm@16601
  1245
      maxidx = maxidx + i,
wenzelm@16601
  1246
      shyps = shyps,
wenzelm@16601
  1247
      hyps = hyps,
wenzelm@16601
  1248
      tpairs = map (pairself (Logic.incr_indexes ([], i))) tpairs,
wenzelm@16601
  1249
      prop = Logic.incr_indexes ([], i) prop};
berghofe@10416
  1250
clasohm@0
  1251
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
clasohm@0
  1252
fun assumption i state =
wenzelm@16601
  1253
  let
wenzelm@16601
  1254
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
wenzelm@16656
  1255
    val thy = Theory.deref thy_ref;
wenzelm@16601
  1256
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
wenzelm@16601
  1257
    fun newth n (env as Envir.Envir {maxidx, ...}, tpairs) =
wenzelm@16601
  1258
      Thm {thy_ref = thy_ref,
wenzelm@16601
  1259
        der = Pt.infer_derivs'
wenzelm@16601
  1260
          ((if Envir.is_empty env then I else (Pt.norm_proof' env)) o
wenzelm@16601
  1261
            Pt.assumption_proof Bs Bi n) der,
wenzelm@21646
  1262
        tags = [],
wenzelm@16601
  1263
        maxidx = maxidx,
wenzelm@16656
  1264
        shyps = may_insert_env_sorts thy env shyps,
wenzelm@16601
  1265
        hyps = hyps,
wenzelm@16601
  1266
        tpairs =
wenzelm@16601
  1267
          if Envir.is_empty env then tpairs
wenzelm@16601
  1268
          else map (pairself (Envir.norm_term env)) tpairs,
wenzelm@16601
  1269
        prop =
wenzelm@16601
  1270
          if Envir.is_empty env then (*avoid wasted normalizations*)
wenzelm@16601
  1271
            Logic.list_implies (Bs, C)
wenzelm@16601
  1272
          else (*normalize the new rule fully*)
wenzelm@16601
  1273
            Envir.norm_term env (Logic.list_implies (Bs, C))};
wenzelm@16601
  1274
    fun addprfs [] _ = Seq.empty
wenzelm@16601
  1275
      | addprfs ((t, u) :: apairs) n = Seq.make (fn () => Seq.pull
wenzelm@16601
  1276
          (Seq.mapp (newth n)
wenzelm@16656
  1277
            (Unify.unifiers (thy, Envir.empty maxidx, (t, u) :: tpairs))
wenzelm@16601
  1278
            (addprfs apairs (n + 1))))
wenzelm@16601
  1279
  in addprfs (Logic.assum_pairs (~1, Bi)) 1 end;
clasohm@0
  1280
wenzelm@250
  1281
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
clasohm@0
  1282
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
clasohm@0
  1283
fun eq_assumption i state =
wenzelm@16601
  1284
  let
wenzelm@16601
  1285
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
wenzelm@16601
  1286
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
wenzelm@16601
  1287
  in
wenzelm@16601
  1288
    (case find_index (op aconv) (Logic.assum_pairs (~1, Bi)) of
wenzelm@16601
  1289
      ~1 => raise THM ("eq_assumption", 0, [state])
wenzelm@16601
  1290
    | n =>
wenzelm@16601
  1291
        Thm {thy_ref = thy_ref,
wenzelm@16601
  1292
          der = Pt.infer_derivs' (Pt.assumption_proof Bs Bi (n + 1)) der,
wenzelm@21646
  1293
          tags = [],
wenzelm@16601
  1294
          maxidx = maxidx,
wenzelm@16601
  1295
          shyps = shyps,
wenzelm@16601
  1296
          hyps = hyps,
wenzelm@16601
  1297
          tpairs = tpairs,
wenzelm@16601
  1298
          prop = Logic.list_implies (Bs, C)})
clasohm@0
  1299
  end;
clasohm@0
  1300
clasohm@0
  1301
paulson@2671
  1302
(*For rotate_tac: fast rotation of assumptions of subgoal i*)
paulson@2671
  1303
fun rotate_rule k i state =
wenzelm@16601
  1304
  let
wenzelm@16601
  1305
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
wenzelm@16601
  1306
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
wenzelm@16601
  1307
    val params = Term.strip_all_vars Bi
wenzelm@16601
  1308
    and rest   = Term.strip_all_body Bi;
wenzelm@16601
  1309
    val asms   = Logic.strip_imp_prems rest
wenzelm@16601
  1310
    and concl  = Logic.strip_imp_concl rest;
wenzelm@16601
  1311
    val n = length asms;
wenzelm@16601
  1312
    val m = if k < 0 then n + k else k;
wenzelm@16601
  1313
    val Bi' =
wenzelm@16601
  1314
      if 0 = m orelse m = n then Bi
wenzelm@16601
  1315
      else if 0 < m andalso m < n then
wenzelm@19012
  1316
        let val (ps, qs) = chop m asms
wenzelm@16601
  1317
        in list_all (params, Logic.list_implies (qs @ ps, concl)) end
wenzelm@16601
  1318
      else raise THM ("rotate_rule", k, [state]);
wenzelm@16601
  1319
  in
wenzelm@16601
  1320
    Thm {thy_ref = thy_ref,
wenzelm@16601
  1321
      der = Pt.infer_derivs' (Pt.rotate_proof Bs Bi m) der,
wenzelm@21646
  1322
      tags = [],
wenzelm@16601
  1323
      maxidx = maxidx,
wenzelm@16601
  1324
      shyps = shyps,
wenzelm@16601
  1325
      hyps = hyps,
wenzelm@16601
  1326
      tpairs = tpairs,
wenzelm@16601
  1327
      prop = Logic.list_implies (Bs @ [Bi'], C)}
paulson@2671
  1328
  end;
paulson@2671
  1329
paulson@2671
  1330
paulson@7248
  1331
(*Rotates a rule's premises to the left by k, leaving the first j premises
paulson@7248
  1332
  unchanged.  Does nothing if k=0 or if k equals n-j, where n is the
wenzelm@16656
  1333
  number of premises.  Useful with etac and underlies defer_tac*)
paulson@7248
  1334
fun permute_prems j k rl =
wenzelm@16601
  1335
  let
wenzelm@21646
  1336
    val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop, ...} = rl;
wenzelm@16601
  1337
    val prems = Logic.strip_imp_prems prop
wenzelm@16601
  1338
    and concl = Logic.strip_imp_concl prop;
wenzelm@16601
  1339
    val moved_prems = List.drop (prems, j)
wenzelm@16601
  1340
    and fixed_prems = List.take (prems, j)
wenzelm@16601
  1341
      handle Subscript => raise THM ("permute_prems: j", j, [rl]);
wenzelm@16601
  1342
    val n_j = length moved_prems;
wenzelm@16601
  1343
    val m = if k < 0 then n_j + k else k;
wenzelm@16601
  1344
    val prop' =
wenzelm@16601
  1345
      if 0 = m orelse m = n_j then prop
wenzelm@16601
  1346
      else if 0 < m andalso m < n_j then
wenzelm@19012
  1347
        let val (ps, qs) = chop m moved_prems
wenzelm@16601
  1348
        in Logic.list_implies (fixed_prems @ qs @ ps, concl) end
wenzelm@16725
  1349
      else raise THM ("permute_prems: k", k, [rl]);
wenzelm@16601
  1350
  in
wenzelm@16601
  1351
    Thm {thy_ref = thy_ref,
wenzelm@16601
  1352
      der = Pt.infer_derivs' (Pt.permute_prems_prf prems j m) der,
wenzelm@21646
  1353
      tags = [],
wenzelm@16601
  1354
      maxidx = maxidx,
wenzelm@16601
  1355
      shyps = shyps,
wenzelm@16601
  1356
      hyps = hyps,
wenzelm@16601
  1357
      tpairs = tpairs,
wenzelm@16601
  1358
      prop = prop'}
paulson@7248
  1359
  end;
paulson@7248
  1360
paulson@7248
  1361
clasohm@0
  1362
(** User renaming of parameters in a subgoal **)
clasohm@0
  1363
clasohm@0
  1364
(*Calls error rather than raising an exception because it is intended
clasohm@0
  1365
  for top-level use -- exception handling would not make sense here.
clasohm@0
  1366
  The names in cs, if distinct, are used for the innermost parameters;
wenzelm@17868
  1367
  preceding parameters may be renamed to make all params distinct.*)
clasohm@0
  1368
fun rename_params_rule (cs, i) state =
wenzelm@16601
  1369
  let
wenzelm@21646
  1370
    val Thm {thy_ref, der, tags, maxidx, shyps, hyps, ...} = state;
wenzelm@16601
  1371
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
wenzelm@16601
  1372
    val iparams = map #1 (Logic.strip_params Bi);
wenzelm@16601
  1373
    val short = length iparams - length cs;
wenzelm@16601
  1374
    val newnames =
wenzelm@16601
  1375
      if short < 0 then error "More names than abstractions!"
wenzelm@20071
  1376
      else Name.variant_list cs (Library.take (short, iparams)) @ cs;
wenzelm@20330
  1377
    val freenames = Term.fold_aterms (fn Free (x, _) => insert (op =) x | _ => I) Bi [];
wenzelm@16601
  1378
    val newBi = Logic.list_rename_params (newnames, Bi);
wenzelm@250
  1379
  in
wenzelm@21182
  1380
    (case duplicates (op =) cs of
wenzelm@21182
  1381
      a :: _ => (warning ("Can't rename.  Bound variables not distinct: " ^ a); state)
wenzelm@21182
  1382
    | [] =>
wenzelm@16601
  1383
      (case cs inter_string freenames of
wenzelm@16601
  1384
        a :: _ => (warning ("Can't rename.  Bound/Free variable clash: " ^ a); state)
wenzelm@16601
  1385
      | [] =>
wenzelm@16601
  1386
        Thm {thy_ref = thy_ref,
wenzelm@16601
  1387
          der = der,
wenzelm@21646
  1388
          tags = tags,
wenzelm@16601
  1389
          maxidx = maxidx,
wenzelm@16601
  1390
          shyps = shyps,
wenzelm@16601
  1391
          hyps = hyps,
wenzelm@16601
  1392
          tpairs = tpairs,
wenzelm@21182
  1393
          prop = Logic.list_implies (Bs @ [newBi], C)}))
clasohm@0
  1394
  end;
clasohm@0
  1395
wenzelm@12982
  1396
clasohm@0
  1397
(*** Preservation of bound variable names ***)
clasohm@0
  1398
wenzelm@21646
  1399
fun rename_boundvars pat obj (thm as Thm {thy_ref, der, tags, maxidx, shyps, hyps, tpairs, prop}) =
wenzelm@12982
  1400
  (case Term.rename_abs pat obj prop of
skalberg@15531
  1401
    NONE => thm
skalberg@15531
  1402
  | SOME prop' => Thm
wenzelm@16425
  1403
      {thy_ref = thy_ref,
wenzelm@12982
  1404
       der = der,
wenzelm@21646
  1405
       tags = tags,
wenzelm@12982
  1406
       maxidx = maxidx,
wenzelm@12982
  1407
       hyps = hyps,
wenzelm@12982
  1408
       shyps = shyps,
berghofe@13658
  1409
       tpairs = tpairs,
wenzelm@12982
  1410
       prop = prop'});
berghofe@10416
  1411
clasohm@0
  1412
wenzelm@16656
  1413
(* strip_apply f (A, B) strips off all assumptions/parameters from A
clasohm@0
  1414
   introduced by lifting over B, and applies f to remaining part of A*)
clasohm@0
  1415
fun strip_apply f =
clasohm@0
  1416
  let fun strip(Const("==>",_)$ A1 $ B1,
wenzelm@250
  1417
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
wenzelm@250
  1418
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
wenzelm@250
  1419
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
wenzelm@250
  1420
        | strip(A,_) = f A
clasohm@0
  1421
  in strip end;
clasohm@0
  1422
clasohm@0
  1423
(*Use the alist to rename all bound variables and some unknowns in a term
clasohm@0
  1424
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
clasohm@0
  1425
  Preserves unknowns in tpairs and on lhs of dpairs. *)
clasohm@0
  1426
fun rename_bvs([],_,_,_) = I
clasohm@0
  1427
  | rename_bvs(al,dpairs,tpairs,B) =
wenzelm@20330
  1428
      let
wenzelm@20330
  1429
        val add_var = fold_aterms (fn Var ((x, _), _) => insert (op =) x | _ => I);
wenzelm@20330
  1430
        val vids = []
wenzelm@20330
  1431
          |> fold (add_var o fst) dpairs
wenzelm@20330
  1432
          |> fold (add_var o fst) tpairs
wenzelm@20330
  1433
          |> fold (add_var o snd) tpairs;
wenzelm@250
  1434
        (*unknowns appearing elsewhere be preserved!*)
wenzelm@250
  1435
        fun rename(t as Var((x,i),T)) =
wenzelm@20330
  1436
              (case AList.lookup (op =) al x of
wenzelm@20330
  1437
                SOME y =>
wenzelm@20330
  1438
                  if member (op =) vids x orelse member (op =) vids y then t
wenzelm@20330
  1439
                  else Var((y,i),T)
wenzelm@20330
  1440
              | NONE=> t)
clasohm@0
  1441
          | rename(Abs(x,T,t)) =
wenzelm@18944
  1442
              Abs (the_default x (AList.lookup (op =) al x), T, rename t)
clasohm@0
  1443
          | rename(f$t) = rename f $ rename t
clasohm@0
  1444
          | rename(t) = t;
wenzelm@250
  1445
        fun strip_ren Ai = strip_apply rename (Ai,B)
wenzelm@20330
  1446
      in strip_ren end;
clasohm@0
  1447
clasohm@0
  1448
(*Function to rename bounds/unknowns in the argument, lifted over B*)
clasohm@0
  1449
fun rename_bvars(dpairs, tpairs, B) =
skalberg@15574
  1450
        rename_bvs(foldr Term.match_bvars [] dpairs, dpairs, tpairs, B);
clasohm@0
  1451
clasohm@0
  1452
clasohm@0
  1453
(*** RESOLUTION ***)
clasohm@0
  1454
lcp@721
  1455
(** Lifting optimizations **)
lcp@721
  1456
clasohm@0
  1457
(*strip off pairs of assumptions/parameters in parallel -- they are
clasohm@0
  1458
  identical because of lifting*)
wenzelm@250
  1459
fun strip_assums2 (Const("==>", _) $ _ $ B1,
wenzelm@250
  1460
                   Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2)
clasohm@0
  1461
  | strip_assums2 (Const("all",_)$Abs(a,T,t1),
wenzelm@250
  1462
                   Const("all",_)$Abs(_,_,t2)) =
clasohm@0
  1463
      let val (B1,B2) = strip_assums2 (t1,t2)
clasohm@0
  1464
      in  (Abs(a,T,B1), Abs(a,T,B2))  end
clasohm@0
  1465
  | strip_assums2 BB = BB;
clasohm@0
  1466
clasohm@0
  1467
lcp@721
  1468
(*Faster normalization: skip assumptions that were lifted over*)
lcp@721
  1469
fun norm_term_skip env 0 t = Envir.norm_term env t
lcp@721
  1470
  | norm_term_skip env n (Const("all",_)$Abs(a,T,t)) =
lcp@721
  1471
        let val Envir.Envir{iTs, ...} = env
berghofe@15797
  1472
            val T' = Envir.typ_subst_TVars iTs T
wenzelm@1238
  1473
            (*Must instantiate types of parameters because they are flattened;
lcp@721
  1474
              this could be a NEW parameter*)
lcp@721
  1475
        in  all T' $ Abs(a, T', norm_term_skip env n t)  end
lcp@721
  1476
  | norm_term_skip env n (Const("==>", _) $ A $ B) =
wenzelm@1238
  1477
        implies $ A $ norm_term_skip env (n-1) B
lcp@721
  1478
  | norm_term_skip env n t = error"norm_term_skip: too few assumptions??";
lcp@721
  1479
lcp@721
  1480
clasohm@0
  1481
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C)
wenzelm@250
  1482
  Unifies B with Bi, replacing subgoal i    (1 <= i <= n)
clasohm@0
  1483
  If match then forbid instantiations in proof state
clasohm@0
  1484
  If lifted then shorten the dpair using strip_assums2.
clasohm@0
  1485
  If eres_flg then simultaneously proves A1 by assumption.
wenzelm@250
  1486
  nsubgoal is the number of new subgoals (written m above).
clasohm@0
  1487
  Curried so that resolution calls dest_state only once.
clasohm@0
  1488
*)
wenzelm@4270
  1489
local exception COMPOSE
clasohm@0
  1490
in
wenzelm@18486
  1491
fun bicompose_aux flatten match (state, (stpairs, Bs, Bi, C), lifted)
clasohm@0
  1492
                        (eres_flg, orule, nsubgoal) =
paulson@1529
  1493
 let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state
wenzelm@16425
  1494
     and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps,
berghofe@13658
  1495
             tpairs=rtpairs, prop=rprop,...} = orule
paulson@1529
  1496
         (*How many hyps to skip over during normalization*)
wenzelm@21576
  1497
     and nlift = Logic.count_prems (strip_all_body Bi) + (if eres_flg then ~1 else 0)
wenzelm@16601
  1498
     val thy_ref = merge_thys2 state orule;
wenzelm@16425
  1499
     val thy = Theory.deref thy_ref;
clasohm@0
  1500
     (** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **)
berghofe@11518
  1501
     fun addth A (As, oldAs, rder', n) ((env as Envir.Envir {maxidx, ...}, tpairs), thq) =
wenzelm@250
  1502
       let val normt = Envir.norm_term env;
wenzelm@250
  1503
           (*perform minimal copying here by examining env*)
berghofe@13658
  1504
           val (ntpairs, normp) =
berghofe@13658
  1505
             if Envir.is_empty env then (tpairs, (Bs @ As, C))
wenzelm@250
  1506
             else
wenzelm@250
  1507
             let val ntps = map (pairself normt) tpairs
wenzelm@19861
  1508
             in if Envir.above env smax then
wenzelm@1238
  1509
                  (*no assignments in state; normalize the rule only*)
wenzelm@1238
  1510
                  if lifted
berghofe@13658
  1511
                  then (ntps, (Bs @ map (norm_term_skip env nlift) As, C))
berghofe@13658
  1512
                  else (ntps, (Bs @ map normt As, C))
paulson@1529
  1513
                else if match then raise COMPOSE
wenzelm@250
  1514
                else (*normalize the new rule fully*)
berghofe@13658
  1515
                  (ntps, (map normt (Bs @ As), normt C))
wenzelm@250
  1516
             end
wenzelm@16601
  1517
           val th =
wenzelm@16425
  1518
             Thm{thy_ref = thy_ref,
berghofe@11518
  1519
                 der = Pt.infer_derivs
berghofe@11518
  1520
                   ((if Envir.is_empty env then I
wenzelm@19861
  1521
                     else if Envir.above env smax then
berghofe@11518
  1522
                       (fn f => fn der => f (Pt.norm_proof' env der))
berghofe@11518
  1523
                     else
berghofe@11518
  1524
                       curry op oo (Pt.norm_proof' env))
wenzelm@18486
  1525
                    (Pt.bicompose_proof flatten Bs oldAs As A n)) rder' sder,
wenzelm@21646
  1526
                 tags = [],
wenzelm@2386
  1527
                 maxidx = maxidx,
wenzelm@16656
  1528
                 shyps = may_insert_env_sorts thy env (Sorts.union rshyps sshyps),
wenzelm@16601
  1529
                 hyps = union_hyps rhyps shyps,
berghofe@13658
  1530
                 tpairs = ntpairs,
berghofe@13658
  1531
                 prop = Logic.list_implies normp}
wenzelm@19475
  1532
        in  Seq.cons th thq  end  handle COMPOSE => thq;
berghofe@13658
  1533
     val (rAs,B) = Logic.strip_prems(nsubgoal, [], rprop)
clasohm@0
  1534
       handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]);
clasohm@0
  1535
     (*Modify assumptions, deleting n-th if n>0 for e-resolution*)
clasohm@0
  1536
     fun newAs(As0, n, dpairs, tpairs) =
berghofe@11518
  1537
       let val (As1, rder') =
berghofe@11518
  1538
         if !Logic.auto_rename orelse not lifted then (As0, rder)
berghofe@11518
  1539
         else (map (rename_bvars(dpairs,tpairs,B)) As0,
berghofe@11518
  1540
           Pt.infer_derivs' (Pt.map_proof_terms
berghofe@11518
  1541
             (rename_bvars (dpairs, tpairs, Bound 0)) I) rder);
wenzelm@18486
  1542
       in (map (if flatten then (Logic.flatten_params n) else I) As1, As1, rder', n)
wenzelm@250
  1543
          handle TERM _ =>
wenzelm@250
  1544
          raise THM("bicompose: 1st premise", 0, [orule])
clasohm@0
  1545
       end;
paulson@2147
  1546
     val env = Envir.empty(Int.max(rmax,smax));
clasohm@0
  1547
     val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi);
clasohm@0
  1548
     val dpairs = BBi :: (rtpairs@stpairs);
clasohm@0
  1549
     (*elim-resolution: try each assumption in turn.  Initially n=1*)
berghofe@11518
  1550
     fun tryasms (_, _, _, []) = Seq.empty
berghofe@11518
  1551
       | tryasms (A, As, n, (t,u)::apairs) =
wenzelm@16425
  1552
          (case Seq.pull(Unify.unifiers(thy, env, (t,u)::dpairs))  of
wenzelm@16425
  1553
              NONE                   => tryasms (A, As, n+1, apairs)
wenzelm@16425
  1554
            | cell as SOME((_,tpairs),_) =>
wenzelm@16425
  1555
                Seq.it_right (addth A (newAs(As, n, [BBi,(u,t)], tpairs)))
wenzelm@16425
  1556
                    (Seq.make(fn()=> cell),
wenzelm@16425
  1557
                     Seq.make(fn()=> Seq.pull (tryasms(A, As, n+1, apairs)))))
clasohm@0
  1558
     fun eres [] = raise THM("bicompose: no premises", 0, [orule,state])
skalberg@15531
  1559
       | eres (A1::As) = tryasms(SOME A1, As, 1, Logic.assum_pairs(nlift+1,A1))
clasohm@0
  1560
     (*ordinary resolution*)
skalberg@15531
  1561
     fun res(NONE) = Seq.empty
skalberg@15531
  1562
       | res(cell as SOME((_,tpairs),_)) =
skalberg@15531
  1563
             Seq.it_right (addth NONE (newAs(rev rAs, 0, [BBi], tpairs)))
wenzelm@4270
  1564
                       (Seq.make (fn()=> cell), Seq.empty)
clasohm@0
  1565
 in  if eres_flg then eres(rev rAs)
wenzelm@16425
  1566
     else res(Seq.pull(Unify.unifiers(thy, env, dpairs)))
clasohm@0
  1567
 end;
wenzelm@7528
  1568
end;
clasohm@0
  1569
wenzelm@18501
  1570
fun compose_no_flatten match (orule, nsubgoal) i state =
wenzelm@18501
  1571
  bicompose_aux false match (state, dest_state (state, i), false) (false, orule, nsubgoal);
clasohm@0
  1572
wenzelm@18501
  1573
fun bicompose match arg i state =
wenzelm@18501
  1574
  bicompose_aux true match (state, dest_state (state,i), false) arg;
clasohm@0
  1575
clasohm@0
  1576
(*Quick test whether rule is resolvable with the subgoal with hyps Hs
clasohm@0
  1577
  and conclusion B.  If eres_flg then checks 1st premise of rule also*)
clasohm@0
  1578
fun could_bires (Hs, B, eres_flg, rule) =
wenzelm@16847
  1579
    let fun could_reshyp (A1::_) = exists (fn H => could_unify (A1, H)) Hs
wenzelm@250
  1580
          | could_reshyp [] = false;  (*no premise -- illegal*)
wenzelm@250
  1581
    in  could_unify(concl_of rule, B) andalso
wenzelm@250
  1582
        (not eres_flg  orelse  could_reshyp (prems_of rule))
clasohm@0
  1583
    end;
clasohm@0
  1584
clasohm@0
  1585
(*Bi-resolution of a state with a list of (flag,rule) pairs.
clasohm@0
  1586
  Puts the rule above:  rule/state.  Renames vars in the rules. *)
wenzelm@250
  1587
fun biresolution match brules i state =
wenzelm@18035
  1588
    let val (stpairs, Bs, Bi, C) = dest_state(state,i);
wenzelm@18145
  1589
        val lift = lift_rule (cprem_of state i);
wenzelm@250
  1590
        val B = Logic.strip_assums_concl Bi;
wenzelm@250
  1591
        val Hs = Logic.strip_assums_hyp Bi;
wenzelm@22573
  1592
        val compose = bicompose_aux true match (state, (stpairs, Bs, Bi, C), true);
wenzelm@4270
  1593
        fun res [] = Seq.empty
wenzelm@250
  1594
          | res ((eres_flg, rule)::brules) =
nipkow@13642
  1595
              if !Pattern.trace_unify_fail orelse
nipkow@13642
  1596
                 could_bires (Hs, B, eres_flg, rule)
wenzelm@4270
  1597
              then Seq.make (*delay processing remainder till needed*)
wenzelm@22573
  1598
                  (fn()=> SOME(compose (eres_flg, lift rule, nprems_of rule),
wenzelm@250
  1599
                               res brules))
wenzelm@250
  1600
              else res brules
wenzelm@4270
  1601
    in  Seq.flat (res brules)  end;
clasohm@0
  1602
clasohm@0
  1603
wenzelm@2509
  1604
(*** Oracles ***)
wenzelm@2509
  1605
wenzelm@16425
  1606
fun invoke_oracle_i thy1 name =
wenzelm@3812
  1607
  let
wenzelm@3812
  1608
    val oracle =
wenzelm@17412
  1609
      (case Symtab.lookup (#2 (#oracles (Theory.rep_theory thy1))) name of
skalberg@15531
  1610
        NONE => raise THM ("Unknown oracle: " ^ name, 0, [])
skalberg@15531
  1611
      | SOME (f, _) => f);
wenzelm@16847
  1612
    val thy_ref1 = Theory.self_ref thy1;
wenzelm@3812
  1613
  in
wenzelm@16425
  1614
    fn (thy2, data) =>
wenzelm@3812
  1615
      let
wenzelm@16847
  1616
        val thy' = Theory.merge (Theory.deref thy_ref1, thy2);
wenzelm@18969
  1617
        val (prop, T, maxidx) = Sign.certify_term thy' (oracle (thy', data));
wenzelm@3812
  1618
      in
wenzelm@3812
  1619
        if T <> propT then
wenzelm@3812
  1620
          raise THM ("Oracle's result must have type prop: " ^ name, 0, [])
wenzelm@16601
  1621
        else
wenzelm@16601
  1622
          Thm {thy_ref = Theory.self_ref thy',
berghofe@11518
  1623
            der = (true, Pt.oracle_proof name prop),
wenzelm@21646
  1624
            tags = [],
wenzelm@3812
  1625
            maxidx = maxidx,
wenzelm@16656
  1626
            shyps = may_insert_term_sorts thy' prop [],
wenzelm@16425
  1627
            hyps = [],
berghofe@13658
  1628
            tpairs = [],
wenzelm@16601
  1629
            prop = prop}
wenzelm@3812
  1630
      end
wenzelm@3812
  1631
  end;
wenzelm@3812
  1632
wenzelm@15672
  1633
fun invoke_oracle thy =
wenzelm@16425
  1634
  invoke_oracle_i thy o NameSpace.intern (Theory.oracle_space thy);
wenzelm@15672
  1635
wenzelm@22237
  1636
wenzelm@22237
  1637
end;
wenzelm@22237
  1638
end;
wenzelm@22237
  1639
end;
clasohm@0
  1640
end;
paulson@1503
  1641
wenzelm@6089
  1642
structure BasicThm: BASIC_THM = Thm;
wenzelm@6089
  1643
open BasicThm;