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