src/Pure/proofterm.ML
author obua
Sun May 29 12:39:12 2005 +0200 (2005-05-29)
changeset 16108 cf468b93a02e
parent 15797 a63605582573
child 16458 4c6fd0c01d28
permissions -rw-r--r--
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
berghofe@11519
     1
(*  Title:      Pure/proofterm.ML
berghofe@11519
     2
    ID:         $Id$
wenzelm@11540
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11519
     4
wenzelm@11540
     5
LF style proof terms.
berghofe@11519
     6
*)
berghofe@11519
     7
berghofe@11615
     8
infix 8 % %% %>;
berghofe@11519
     9
berghofe@11519
    10
signature BASIC_PROOFTERM =
berghofe@11519
    11
sig
wenzelm@11543
    12
  val proofs: int ref
berghofe@11519
    13
berghofe@11519
    14
  datatype proof =
berghofe@11519
    15
     PBound of int
berghofe@11519
    16
   | Abst of string * typ option * proof
berghofe@11519
    17
   | AbsP of string * term option * proof
gagern@15632
    18
   | op % of proof * term option
gagern@15632
    19
   | op %% of proof * proof
berghofe@11519
    20
   | Hyp of term
berghofe@11519
    21
   | PThm of (string * (string * string list) list) * proof * term * typ list option
berghofe@11519
    22
   | PAxm of string * term * typ list option
berghofe@11519
    23
   | Oracle of string * term * typ list option
berghofe@11519
    24
   | MinProof of proof list;
berghofe@11519
    25
berghofe@11615
    26
  val %> : proof * term -> proof
berghofe@11519
    27
end;
berghofe@11519
    28
berghofe@11519
    29
signature PROOFTERM =
berghofe@11519
    30
sig
berghofe@11519
    31
  include BASIC_PROOFTERM
berghofe@11519
    32
berghofe@11519
    33
  val infer_derivs : (proof -> proof -> proof) -> bool * proof -> bool * proof -> bool * proof
berghofe@11519
    34
  val infer_derivs' : (proof -> proof) -> (bool * proof -> bool * proof)
berghofe@11519
    35
berghofe@11519
    36
  (** primitive operations **)
berghofe@11519
    37
  val proof_combt : proof * term list -> proof
berghofe@11519
    38
  val proof_combt' : proof * term option list -> proof
berghofe@11519
    39
  val proof_combP : proof * proof list -> proof
berghofe@11519
    40
  val strip_combt : proof -> proof * term option list
berghofe@11519
    41
  val strip_combP : proof -> proof * proof list
berghofe@11519
    42
  val strip_thm : proof -> proof
berghofe@11519
    43
  val map_proof_terms : (term -> term) -> (typ -> typ) -> proof -> proof
berghofe@11519
    44
  val fold_proof_terms : (term * 'a -> 'a) -> (typ * 'a -> 'a) -> 'a * proof -> 'a
berghofe@11519
    45
  val add_prf_names : string list * proof -> string list
berghofe@11519
    46
  val add_prf_tfree_names : string list * proof -> string list
berghofe@11519
    47
  val add_prf_tvar_ixns : indexname list * proof -> indexname list
berghofe@12868
    48
  val maxidx_of_proof : proof -> int
berghofe@13744
    49
  val size_of_proof : proof -> int
berghofe@12907
    50
  val change_type : typ list option -> proof -> proof
berghofe@11519
    51
  val prf_abstract_over : term -> proof -> proof
berghofe@11519
    52
  val prf_incr_bv : int -> int -> int -> int -> proof -> proof
berghofe@11519
    53
  val incr_pboundvars : int -> int -> proof -> proof
berghofe@11519
    54
  val prf_loose_bvar1 : proof -> int -> bool
berghofe@11519
    55
  val prf_loose_Pbvar1 : proof -> int -> bool
berghofe@12279
    56
  val prf_add_loose_bnos : int -> int -> proof ->
berghofe@12279
    57
    int list * int list -> int list * int list
berghofe@11519
    58
  val norm_proof : Envir.env -> proof -> proof
berghofe@11519
    59
  val norm_proof' : Envir.env -> proof -> proof
berghofe@11519
    60
  val prf_subst_bounds : term list -> proof -> proof
berghofe@11519
    61
  val prf_subst_pbounds : proof list -> proof -> proof
berghofe@11519
    62
  val freeze_thaw_prf : proof -> proof * (proof -> proof)
berghofe@11519
    63
berghofe@11519
    64
  val thms_of_proof : (term * proof) list Symtab.table -> proof ->
berghofe@11519
    65
    (term * proof) list Symtab.table
berghofe@11519
    66
  val axms_of_proof : proof Symtab.table -> proof -> proof Symtab.table
berghofe@11519
    67
  val oracles_of_proof : proof list -> proof -> proof list
berghofe@11519
    68
berghofe@11519
    69
  (** proof terms for specific inference rules **)
berghofe@11519
    70
  val implies_intr_proof : term -> proof -> proof
berghofe@11519
    71
  val forall_intr_proof : term -> string -> proof -> proof
berghofe@15797
    72
  val varify_proof : term -> (string * sort) list -> proof -> proof
berghofe@11519
    73
  val freezeT : term -> proof -> proof
berghofe@11519
    74
  val rotate_proof : term list -> term -> int -> proof -> proof
berghofe@11519
    75
  val permute_prems_prf : term list -> int -> int -> proof -> proof
berghofe@15797
    76
  val instantiate : (typ * typ) list -> (term * term) list -> proof -> proof
berghofe@11519
    77
  val lift_proof : term -> int -> term -> proof -> proof
berghofe@11519
    78
  val assumption_proof : term list -> term -> int -> proof -> proof
berghofe@11519
    79
  val bicompose_proof : term list -> term list -> term list -> term option ->
berghofe@11519
    80
    int -> proof -> proof -> proof
berghofe@11519
    81
  val equality_axms : (string * term) list
berghofe@11519
    82
  val reflexive_axm : proof
berghofe@11519
    83
  val symmetric_axm : proof
berghofe@11519
    84
  val transitive_axm : proof
berghofe@11519
    85
  val equal_intr_axm : proof
berghofe@11519
    86
  val equal_elim_axm : proof
berghofe@11519
    87
  val abstract_rule_axm : proof
berghofe@11519
    88
  val combination_axm : proof
berghofe@11519
    89
  val reflexive : proof
berghofe@11519
    90
  val symmetric : proof -> proof
berghofe@11519
    91
  val transitive : term -> typ -> proof -> proof -> proof
berghofe@11519
    92
  val abstract_rule : term -> string -> proof -> proof
berghofe@11519
    93
  val combination : term -> term -> term -> term -> typ -> proof -> proof -> proof
berghofe@11519
    94
  val equal_intr : term -> term -> proof -> proof -> proof
berghofe@11519
    95
  val equal_elim : term -> term -> proof -> proof -> proof
berghofe@11519
    96
  val axm_proof : string -> term -> proof
berghofe@11519
    97
  val oracle_proof : string -> term -> proof
berghofe@11519
    98
  val thm_proof : Sign.sg -> string * (string * string list) list ->
berghofe@11519
    99
    term list -> term -> proof -> proof
wenzelm@12923
   100
  val get_name_tags : term list -> term -> proof -> string * (string * string list) list
berghofe@11519
   101
berghofe@11519
   102
  (** rewriting on proof terms **)
berghofe@12233
   103
  val add_prf_rrules : (proof * proof) list -> theory -> theory
berghofe@12233
   104
  val add_prf_rprocs : (string * (Term.typ list -> proof -> proof option)) list ->
berghofe@12233
   105
    theory -> theory
wenzelm@14787
   106
  val rewrite_proof : Type.tsig -> (proof * proof) list *
berghofe@11519
   107
    (string * (typ list -> proof -> proof option)) list -> proof -> proof
berghofe@11615
   108
  val rewrite_proof_notypes : (proof * proof) list *
berghofe@11615
   109
    (string * (typ list -> proof -> proof option)) list -> proof -> proof
berghofe@11519
   110
  val init : theory -> theory
berghofe@11519
   111
  
berghofe@11519
   112
end
berghofe@11519
   113
berghofe@11519
   114
structure Proofterm : PROOFTERM =
berghofe@11519
   115
struct
berghofe@11519
   116
berghofe@11715
   117
open Envir;
berghofe@11715
   118
berghofe@11519
   119
datatype proof =
berghofe@11519
   120
   PBound of int
berghofe@11519
   121
 | Abst of string * typ option * proof
berghofe@11519
   122
 | AbsP of string * term option * proof
wenzelm@12497
   123
 | op % of proof * term option
wenzelm@12497
   124
 | op %% of proof * proof
berghofe@11519
   125
 | Hyp of term
berghofe@11519
   126
 | PThm of (string * (string * string list) list) * proof * term * typ list option
berghofe@11519
   127
 | PAxm of string * term * typ list option
berghofe@11519
   128
 | Oracle of string * term * typ list option
berghofe@11519
   129
 | MinProof of proof list;
berghofe@11519
   130
berghofe@11519
   131
fun oracles_of_proof prfs prf =
berghofe@11519
   132
  let
berghofe@11519
   133
    fun oras_of (tabs, Abst (_, _, prf)) = oras_of (tabs, prf)
berghofe@11519
   134
      | oras_of (tabs, AbsP (_, _, prf)) = oras_of (tabs, prf)
berghofe@11615
   135
      | oras_of (tabs, prf % _) = oras_of (tabs, prf)
berghofe@11615
   136
      | oras_of (tabs, prf1 %% prf2) = oras_of (oras_of (tabs, prf1), prf2)
berghofe@11519
   137
      | oras_of (tabs as (thms, oras), PThm ((name, _), prf, prop, _)) =
berghofe@11519
   138
          (case Symtab.lookup (thms, name) of
skalberg@15531
   139
             NONE => oras_of ((Symtab.update ((name, [prop]), thms), oras), prf)
skalberg@15531
   140
           | SOME ps => if prop mem ps then tabs else
berghofe@11519
   141
               oras_of ((Symtab.update ((name, prop::ps), thms), oras), prf))
berghofe@11519
   142
      | oras_of ((thms, oras), prf as Oracle _) = (thms, prf ins oras)
skalberg@15570
   143
      | oras_of (tabs, MinProof prfs) = Library.foldl oras_of (tabs, prfs)
berghofe@11519
   144
      | oras_of (tabs, _) = tabs
berghofe@11519
   145
  in
berghofe@11519
   146
    snd (oras_of ((Symtab.empty, prfs), prf))
berghofe@11519
   147
  end;
berghofe@11519
   148
berghofe@11519
   149
fun thms_of_proof tab (Abst (_, _, prf)) = thms_of_proof tab prf
berghofe@11519
   150
  | thms_of_proof tab (AbsP (_, _, prf)) = thms_of_proof tab prf
berghofe@11615
   151
  | thms_of_proof tab (prf1 %% prf2) = thms_of_proof (thms_of_proof tab prf1) prf2
berghofe@11615
   152
  | thms_of_proof tab (prf % _) = thms_of_proof tab prf
berghofe@11519
   153
  | thms_of_proof tab (prf' as PThm ((s, _), prf, prop, _)) =
berghofe@11519
   154
      (case Symtab.lookup (tab, s) of
skalberg@15531
   155
         NONE => thms_of_proof (Symtab.update ((s, [(prop, prf')]), tab)) prf
skalberg@15531
   156
       | SOME ps => if exists (equal prop o fst) ps then tab else
berghofe@11519
   157
           thms_of_proof (Symtab.update ((s, (prop, prf')::ps), tab)) prf)
skalberg@15570
   158
  | thms_of_proof tab (MinProof prfs) = Library.foldl (uncurry thms_of_proof) (tab, prfs)
berghofe@11519
   159
  | thms_of_proof tab _ = tab;
berghofe@11519
   160
berghofe@11519
   161
fun axms_of_proof tab (Abst (_, _, prf)) = axms_of_proof tab prf
berghofe@11519
   162
  | axms_of_proof tab (AbsP (_, _, prf)) = axms_of_proof tab prf
berghofe@11615
   163
  | axms_of_proof tab (prf1 %% prf2) = axms_of_proof (axms_of_proof tab prf1) prf2
berghofe@11615
   164
  | axms_of_proof tab (prf % _) = axms_of_proof tab prf
berghofe@11519
   165
  | axms_of_proof tab (prf as PAxm (s, _, _)) = Symtab.update ((s, prf), tab)
skalberg@15570
   166
  | axms_of_proof tab (MinProof prfs) = Library.foldl (uncurry axms_of_proof) (tab, prfs)
berghofe@11519
   167
  | axms_of_proof tab _ = tab;
berghofe@11519
   168
berghofe@11519
   169
(** collect all theorems, axioms and oracles **)
berghofe@11519
   170
berghofe@11519
   171
fun mk_min_proof (prfs, Abst (_, _, prf)) = mk_min_proof (prfs, prf)
berghofe@11519
   172
  | mk_min_proof (prfs, AbsP (_, _, prf)) = mk_min_proof (prfs, prf)
berghofe@11615
   173
  | mk_min_proof (prfs, prf % _) = mk_min_proof (prfs, prf)
berghofe@11615
   174
  | mk_min_proof (prfs, prf1 %% prf2) = mk_min_proof (mk_min_proof (prfs, prf1), prf2)
berghofe@11519
   175
  | mk_min_proof (prfs, prf as PThm _) = prf ins prfs
berghofe@11519
   176
  | mk_min_proof (prfs, prf as PAxm _) = prf ins prfs
berghofe@11519
   177
  | mk_min_proof (prfs, prf as Oracle _) = prf ins prfs
berghofe@11519
   178
  | mk_min_proof (prfs, MinProof prfs') = prfs union prfs'
berghofe@11519
   179
  | mk_min_proof (prfs, _) = prfs;
berghofe@11519
   180
berghofe@11519
   181
(** proof objects with different levels of detail **)
berghofe@11519
   182
wenzelm@11543
   183
val proofs = ref 2;
berghofe@11519
   184
wenzelm@11543
   185
fun err_illegal_level i =
wenzelm@11543
   186
  error ("Illegal level of detail for proof objects: " ^ string_of_int i);
berghofe@11519
   187
berghofe@11519
   188
fun if_ora b = if b then oracles_of_proof else K;
berghofe@11519
   189
berghofe@11519
   190
fun infer_derivs f (ora1, prf1) (ora2, prf2) =
berghofe@11519
   191
  (ora1 orelse ora2, 
wenzelm@11543
   192
   case !proofs of
wenzelm@11543
   193
     2 => f prf1 prf2
wenzelm@11543
   194
   | 1 => MinProof (mk_min_proof (mk_min_proof ([], prf1), prf2))
wenzelm@11543
   195
   | 0 => MinProof (if_ora ora2 (if_ora ora1 [] prf1) prf2)
wenzelm@11543
   196
   | i => err_illegal_level i);
berghofe@11519
   197
berghofe@15030
   198
fun infer_derivs' f = infer_derivs (K f) (false, MinProof []);
berghofe@11519
   199
skalberg@15531
   200
fun (prf %> t) = prf % SOME t;
berghofe@11519
   201
skalberg@15570
   202
val proof_combt = Library.foldl (op %>);
skalberg@15570
   203
val proof_combt' = Library.foldl (op %);
skalberg@15570
   204
val proof_combP = Library.foldl (op %%);
berghofe@11519
   205
berghofe@11519
   206
fun strip_combt prf = 
berghofe@11615
   207
    let fun stripc (prf % t, ts) = stripc (prf, t::ts)
berghofe@11519
   208
          | stripc  x =  x 
berghofe@11519
   209
    in  stripc (prf, [])  end;
berghofe@11519
   210
berghofe@11519
   211
fun strip_combP prf = 
berghofe@11615
   212
    let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs)
berghofe@11519
   213
          | stripc  x =  x
berghofe@11519
   214
    in  stripc (prf, [])  end;
berghofe@11519
   215
berghofe@11519
   216
fun strip_thm prf = (case strip_combt (fst (strip_combP prf)) of
berghofe@11519
   217
      (PThm (_, prf', _, _), _) => prf'
berghofe@11519
   218
    | _ => prf);
berghofe@11519
   219
skalberg@15574
   220
val mk_Abst = foldr (fn ((s, T:typ), prf) => Abst (s, NONE, prf));
skalberg@15531
   221
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf;
berghofe@11519
   222
skalberg@15531
   223
fun apsome' f NONE = raise SAME
skalberg@15531
   224
  | apsome' f (SOME x) = SOME (f x);
berghofe@11715
   225
berghofe@11715
   226
fun same f x =
berghofe@11715
   227
  let val x' = f x
berghofe@11715
   228
  in if x = x' then raise SAME else x' end;
berghofe@11715
   229
berghofe@11715
   230
fun map_proof_terms f g =
berghofe@11715
   231
  let
berghofe@11715
   232
    fun mapp (Abst (s, T, prf)) = (Abst (s, apsome' (same g) T, mapph prf)
berghofe@11715
   233
          handle SAME => Abst (s, T, mapp prf))
berghofe@11715
   234
      | mapp (AbsP (s, t, prf)) = (AbsP (s, apsome' (same f) t, mapph prf)
berghofe@11715
   235
          handle SAME => AbsP (s, t, mapp prf))
skalberg@15570
   236
      | mapp (prf % t) = (mapp prf % Option.map f t
berghofe@11715
   237
          handle SAME => prf % apsome' (same f) t)
berghofe@11715
   238
      | mapp (prf1 %% prf2) = (mapp prf1 %% mapph prf2
berghofe@11715
   239
          handle SAME => prf1 %% mapp prf2)
skalberg@15531
   240
      | mapp (PThm (a, prf, prop, SOME Ts)) =
skalberg@15531
   241
          PThm (a, prf, prop, SOME (same (map g) Ts))
skalberg@15531
   242
      | mapp (PAxm (a, prop, SOME Ts)) =
skalberg@15531
   243
          PAxm (a, prop, SOME (same (map g) Ts))
berghofe@11715
   244
      | mapp _ = raise SAME
berghofe@11715
   245
    and mapph prf = (mapp prf handle SAME => prf)
berghofe@11715
   246
berghofe@11715
   247
  in mapph end;
berghofe@11519
   248
skalberg@15531
   249
fun fold_proof_terms f g (a, Abst (_, SOME T, prf)) = fold_proof_terms f g (g (T, a), prf)
skalberg@15531
   250
  | fold_proof_terms f g (a, Abst (_, NONE, prf)) = fold_proof_terms f g (a, prf)
skalberg@15531
   251
  | fold_proof_terms f g (a, AbsP (_, SOME t, prf)) = fold_proof_terms f g (f (t, a), prf)
skalberg@15531
   252
  | fold_proof_terms f g (a, AbsP (_, NONE, prf)) = fold_proof_terms f g (a, prf)
skalberg@15531
   253
  | fold_proof_terms f g (a, prf % SOME t) = f (t, fold_proof_terms f g (a, prf))
skalberg@15531
   254
  | fold_proof_terms f g (a, prf % NONE) = fold_proof_terms f g (a, prf)
berghofe@11615
   255
  | fold_proof_terms f g (a, prf1 %% prf2) = fold_proof_terms f g
berghofe@11519
   256
      (fold_proof_terms f g (a, prf1), prf2)
skalberg@15574
   257
  | fold_proof_terms _ g (a, PThm (_, _, _, SOME Ts)) = foldr g a Ts
skalberg@15574
   258
  | fold_proof_terms _ g (a, PAxm (_, prop, SOME Ts)) = foldr g a Ts
berghofe@11519
   259
  | fold_proof_terms _ _ (a, _) = a;
berghofe@11519
   260
berghofe@11519
   261
val add_prf_names = fold_proof_terms add_term_names ((uncurry K) o swap);
berghofe@11519
   262
val add_prf_tfree_names = fold_proof_terms add_term_tfree_names add_typ_tfree_names;
berghofe@11519
   263
val add_prf_tvar_ixns = fold_proof_terms add_term_tvar_ixns (add_typ_ixns o swap);
berghofe@11519
   264
berghofe@12868
   265
fun maxidx_of_proof prf = fold_proof_terms
berghofe@12868
   266
  (Int.max o apfst maxidx_of_term) (Int.max o apfst maxidx_of_typ) (~1, prf); 
berghofe@12868
   267
berghofe@13744
   268
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf
berghofe@13749
   269
  | size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf
berghofe@13744
   270
  | size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2
berghofe@13749
   271
  | size_of_proof (prf % _) = 1 + size_of_proof prf
berghofe@13744
   272
  | size_of_proof _ = 1;
berghofe@13744
   273
berghofe@12907
   274
fun change_type opTs (PThm (name, prf, prop, _)) = PThm (name, prf, prop, opTs)
berghofe@12907
   275
  | change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs)
berghofe@12907
   276
  | change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs)
berghofe@12907
   277
  | change_type _ prf = prf;
berghofe@12907
   278
berghofe@11519
   279
berghofe@11519
   280
(***** utilities *****)
berghofe@11519
   281
berghofe@11519
   282
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t
berghofe@11519
   283
  | strip_abs _ t = t;
berghofe@11519
   284
skalberg@15570
   285
fun mk_abs Ts t = Library.foldl (fn (t', T) => Abs ("", T, t')) (t, Ts);
berghofe@11519
   286
berghofe@11519
   287
berghofe@11519
   288
(*Abstraction of a proof term over its occurrences of v, 
berghofe@11519
   289
    which must contain no loose bound variables.
berghofe@11519
   290
  The resulting proof term is ready to become the body of an Abst.*)
berghofe@11519
   291
berghofe@11519
   292
fun prf_abstract_over v =
berghofe@11519
   293
  let
berghofe@11715
   294
    fun abst' lev u = if v aconv u then Bound lev else
berghofe@11715
   295
      (case u of
berghofe@11715
   296
         Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t)
berghofe@11715
   297
       | f $ t => (abst' lev f $ absth' lev t handle SAME => f $ abst' lev t)
berghofe@11715
   298
       | _ => raise SAME)
berghofe@11715
   299
    and absth' lev t = (abst' lev t handle SAME => t);
berghofe@11519
   300
berghofe@11715
   301
    fun abst lev (AbsP (a, t, prf)) =
berghofe@11715
   302
          (AbsP (a, apsome' (abst' lev) t, absth lev prf)
berghofe@11715
   303
           handle SAME => AbsP (a, t, abst lev prf))
berghofe@11715
   304
      | abst lev (Abst (a, T, prf)) = Abst (a, T, abst (lev + 1) prf)
berghofe@11715
   305
      | abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2
berghofe@11715
   306
          handle SAME => prf1 %% abst lev prf2)
skalberg@15570
   307
      | abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t
berghofe@11715
   308
          handle SAME => prf % apsome' (abst' lev) t)
berghofe@11715
   309
      | abst _ _ = raise SAME
berghofe@11715
   310
    and absth lev prf = (abst lev prf handle SAME => prf)
berghofe@11519
   311
berghofe@11715
   312
  in absth 0 end;
berghofe@11519
   313
berghofe@11519
   314
berghofe@11519
   315
(*increments a proof term's non-local bound variables
berghofe@11519
   316
  required when moving a proof term within abstractions
berghofe@11519
   317
     inc is  increment for bound variables
berghofe@11519
   318
     lev is  level at which a bound variable is considered 'loose'*)
berghofe@11519
   319
berghofe@11519
   320
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t);
berghofe@11519
   321
berghofe@11715
   322
fun prf_incr_bv' incP inct Plev tlev (PBound i) =
berghofe@11715
   323
      if i >= Plev then PBound (i+incP) else raise SAME 
berghofe@11715
   324
  | prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) =
berghofe@11715
   325
      (AbsP (a, apsome' (same (incr_bv' inct tlev)) t,
berghofe@11715
   326
         prf_incr_bv incP inct (Plev+1) tlev body) handle SAME =>
berghofe@11715
   327
           AbsP (a, t, prf_incr_bv' incP inct (Plev+1) tlev body))
berghofe@11715
   328
  | prf_incr_bv' incP inct Plev tlev (Abst (a, T, body)) =
berghofe@11715
   329
      Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body)
berghofe@11715
   330
  | prf_incr_bv' incP inct Plev tlev (prf %% prf') = 
berghofe@11715
   331
      (prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf'
berghofe@11715
   332
       handle SAME => prf %% prf_incr_bv' incP inct Plev tlev prf')
berghofe@11715
   333
  | prf_incr_bv' incP inct Plev tlev (prf % t) = 
skalberg@15570
   334
      (prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t
berghofe@11715
   335
       handle SAME => prf % apsome' (same (incr_bv' inct tlev)) t)
berghofe@11715
   336
  | prf_incr_bv' _ _ _ _ _ = raise SAME
berghofe@11715
   337
and prf_incr_bv incP inct Plev tlev prf =
berghofe@11715
   338
      (prf_incr_bv' incP inct Plev tlev prf handle SAME => prf);
berghofe@11519
   339
berghofe@11519
   340
fun incr_pboundvars  0 0 prf = prf
berghofe@11519
   341
  | incr_pboundvars incP inct prf = prf_incr_bv incP inct 0 0 prf;
berghofe@11519
   342
berghofe@11519
   343
berghofe@11615
   344
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k
skalberg@15531
   345
  | prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k)
skalberg@15531
   346
  | prf_loose_bvar1 (_ % NONE) _ = true
skalberg@15531
   347
  | prf_loose_bvar1 (AbsP (_, SOME t, prf)) k = loose_bvar1 (t, k) orelse prf_loose_bvar1 prf k
skalberg@15531
   348
  | prf_loose_bvar1 (AbsP (_, NONE, _)) k = true
berghofe@11519
   349
  | prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1)
berghofe@11519
   350
  | prf_loose_bvar1 _ _ = false;
berghofe@11519
   351
berghofe@11519
   352
fun prf_loose_Pbvar1 (PBound i) k = i = k
berghofe@11615
   353
  | prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k
berghofe@11615
   354
  | prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k
berghofe@11519
   355
  | prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1)
berghofe@11519
   356
  | prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k
berghofe@11519
   357
  | prf_loose_Pbvar1 _ _ = false;
berghofe@11519
   358
berghofe@12279
   359
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) =
berghofe@12279
   360
      if i < plev then (is, js) else ((i-plev) ins is, js)
berghofe@12279
   361
  | prf_add_loose_bnos plev tlev (prf1 %% prf2) p =
berghofe@12279
   362
      prf_add_loose_bnos plev tlev prf2
berghofe@12279
   363
        (prf_add_loose_bnos plev tlev prf1 p)
berghofe@12279
   364
  | prf_add_loose_bnos plev tlev (prf % opt) (is, js) =
berghofe@12279
   365
      prf_add_loose_bnos plev tlev prf (case opt of
skalberg@15531
   366
          NONE => (is, ~1 ins js)
skalberg@15531
   367
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
berghofe@12279
   368
  | prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) =
berghofe@12279
   369
      prf_add_loose_bnos (plev+1) tlev prf (case opt of
skalberg@15531
   370
          NONE => (is, ~1 ins js)
skalberg@15531
   371
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
berghofe@12279
   372
  | prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p =
berghofe@12279
   373
      prf_add_loose_bnos plev (tlev+1) prf p
berghofe@12279
   374
  | prf_add_loose_bnos _ _ _ _ = ([], []);
berghofe@12279
   375
berghofe@11519
   376
berghofe@11519
   377
(**** substitutions ****)
berghofe@11519
   378
berghofe@11519
   379
fun norm_proof env =
berghofe@11519
   380
  let
wenzelm@12497
   381
    val envT = type_env env;
wenzelm@12497
   382
    fun norm (Abst (s, T, prf)) = (Abst (s, apsome' (norm_type_same envT) T, normh prf)
berghofe@11519
   383
          handle SAME => Abst (s, T, norm prf))
berghofe@11519
   384
      | norm (AbsP (s, t, prf)) = (AbsP (s, apsome' (norm_term_same env) t, normh prf)
berghofe@11519
   385
          handle SAME => AbsP (s, t, norm prf))
skalberg@15570
   386
      | norm (prf % t) = (norm prf % Option.map (norm_term env) t
berghofe@11615
   387
          handle SAME => prf % apsome' (norm_term_same env) t)
berghofe@11615
   388
      | norm (prf1 %% prf2) = (norm prf1 %% normh prf2
berghofe@11615
   389
          handle SAME => prf1 %% norm prf2)
wenzelm@12497
   390
      | norm (PThm (s, prf, t, Ts)) = PThm (s, prf, t, apsome' (norm_types_same envT) Ts)
wenzelm@12497
   391
      | norm (PAxm (s, prop, Ts)) = PAxm (s, prop, apsome' (norm_types_same envT) Ts)
berghofe@11519
   392
      | norm _ = raise SAME
berghofe@11519
   393
    and normh prf = (norm prf handle SAME => prf);
berghofe@11519
   394
  in normh end;
berghofe@11519
   395
berghofe@11519
   396
(***** Remove some types in proof term (to save space) *****)
berghofe@11519
   397
berghofe@11519
   398
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t)
berghofe@11519
   399
  | remove_types (t $ u) = remove_types t $ remove_types u
berghofe@11519
   400
  | remove_types (Const (s, _)) = Const (s, dummyT)
berghofe@11519
   401
  | remove_types t = t;
berghofe@11519
   402
berghofe@11519
   403
fun remove_types_env (Envir.Envir {iTs, asol, maxidx}) =
berghofe@15797
   404
  Envir.Envir {iTs = iTs, asol = Vartab.map (apsnd remove_types) asol,
berghofe@15797
   405
    maxidx = maxidx};
berghofe@11519
   406
berghofe@11519
   407
fun norm_proof' env prf = norm_proof (remove_types_env env) prf;
berghofe@11519
   408
berghofe@11519
   409
(**** substitution of bound variables ****)
berghofe@11519
   410
berghofe@11519
   411
fun prf_subst_bounds args prf =
berghofe@11519
   412
  let
berghofe@11519
   413
    val n = length args;
berghofe@11519
   414
    fun subst' lev (Bound i) =
berghofe@11519
   415
         (if i<lev then raise SAME    (*var is locally bound*)
berghofe@11519
   416
          else  incr_boundvars lev (List.nth (args, i-lev))
berghofe@11519
   417
                  handle Subscript => Bound (i-n)  (*loose: change it*))
berghofe@11519
   418
      | subst' lev (Abs (a, T, body)) = Abs (a, T,  subst' (lev+1) body)
berghofe@11519
   419
      | subst' lev (f $ t) = (subst' lev f $ substh' lev t
berghofe@11519
   420
          handle SAME => f $ subst' lev t)
berghofe@11519
   421
      | subst' _ _ = raise SAME
berghofe@11519
   422
    and substh' lev t = (subst' lev t handle SAME => t);
berghofe@11519
   423
berghofe@11519
   424
    fun subst lev (AbsP (a, t, body)) = (AbsP (a, apsome' (subst' lev) t, substh lev body)
berghofe@11519
   425
          handle SAME => AbsP (a, t, subst lev body))
berghofe@11519
   426
      | subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body)
berghofe@11615
   427
      | subst lev (prf %% prf') = (subst lev prf %% substh lev prf'
berghofe@11615
   428
          handle SAME => prf %% subst lev prf')
skalberg@15570
   429
      | subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t
berghofe@11615
   430
          handle SAME => prf % apsome' (subst' lev) t)
berghofe@11519
   431
      | subst _ _ = raise SAME
berghofe@11519
   432
    and substh lev prf = (subst lev prf handle SAME => prf)
berghofe@11519
   433
  in case args of [] => prf | _ => substh 0 prf end;
berghofe@11519
   434
berghofe@11519
   435
fun prf_subst_pbounds args prf =
berghofe@11519
   436
  let
berghofe@11519
   437
    val n = length args;
berghofe@11519
   438
    fun subst (PBound i) Plev tlev =
berghofe@11519
   439
 	 (if i < Plev then raise SAME    (*var is locally bound*)
berghofe@11519
   440
          else incr_pboundvars Plev tlev (List.nth (args, i-Plev))
berghofe@11519
   441
                 handle Subscript => PBound (i-n)  (*loose: change it*))
berghofe@11519
   442
      | subst (AbsP (a, t, body)) Plev tlev = AbsP (a, t, subst body (Plev+1) tlev)
berghofe@11519
   443
      | subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1))
berghofe@11615
   444
      | subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev
berghofe@11615
   445
          handle SAME => prf %% subst prf' Plev tlev)
berghofe@11615
   446
      | subst (prf % t) Plev tlev = subst prf Plev tlev % t
berghofe@11519
   447
      | subst  prf _ _ = raise SAME
berghofe@11519
   448
    and substh prf Plev tlev = (subst prf Plev tlev handle SAME => prf)
berghofe@11519
   449
  in case args of [] => prf | _ => substh prf 0 0 end;
berghofe@11519
   450
berghofe@11519
   451
berghofe@11519
   452
(**** Freezing and thawing of variables in proof terms ****)
berghofe@11519
   453
berghofe@11519
   454
fun frzT names =
skalberg@15570
   455
  map_type_tvar (fn (ixn, xs) => TFree (valOf (assoc (names, ixn)), xs));
berghofe@11519
   456
berghofe@11519
   457
fun thawT names =
berghofe@11519
   458
  map_type_tfree (fn (s, xs) => case assoc (names, s) of
skalberg@15531
   459
      NONE => TFree (s, xs)
skalberg@15531
   460
    | SOME ixn => TVar (ixn, xs));
berghofe@11519
   461
berghofe@11519
   462
fun freeze names names' (t $ u) =
berghofe@11519
   463
      freeze names names' t $ freeze names names' u
berghofe@11519
   464
  | freeze names names' (Abs (s, T, t)) =
berghofe@11519
   465
      Abs (s, frzT names' T, freeze names names' t)
berghofe@11519
   466
  | freeze names names' (Const (s, T)) = Const (s, frzT names' T)
berghofe@11519
   467
  | freeze names names' (Free (s, T)) = Free (s, frzT names' T)
berghofe@11519
   468
  | freeze names names' (Var (ixn, T)) =
skalberg@15570
   469
      Free (valOf (assoc (names, ixn)), frzT names' T)
berghofe@11519
   470
  | freeze names names' t = t;
berghofe@11519
   471
berghofe@11519
   472
fun thaw names names' (t $ u) =
berghofe@11519
   473
      thaw names names' t $ thaw names names' u
berghofe@11519
   474
  | thaw names names' (Abs (s, T, t)) =
berghofe@11519
   475
      Abs (s, thawT names' T, thaw names names' t)
berghofe@11519
   476
  | thaw names names' (Const (s, T)) = Const (s, thawT names' T)
berghofe@11519
   477
  | thaw names names' (Free (s, T)) = 
berghofe@11519
   478
      let val T' = thawT names' T
berghofe@11519
   479
      in case assoc (names, s) of
skalberg@15531
   480
          NONE => Free (s, T')
skalberg@15531
   481
        | SOME ixn => Var (ixn, T')
berghofe@11519
   482
      end
berghofe@11519
   483
  | thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T)
berghofe@11519
   484
  | thaw names names' t = t;
berghofe@11519
   485
berghofe@11519
   486
fun freeze_thaw_prf prf =
berghofe@11519
   487
  let
berghofe@11519
   488
    val (fs, Tfs, vs, Tvs) = fold_proof_terms
berghofe@11519
   489
      (fn (t, (fs, Tfs, vs, Tvs)) =>
berghofe@11519
   490
         (add_term_frees (t, fs), add_term_tfree_names (t, Tfs),
berghofe@11519
   491
          add_term_vars (t, vs), add_term_tvar_ixns (t, Tvs)))
berghofe@11519
   492
      (fn (T, (fs, Tfs, vs, Tvs)) =>
berghofe@11519
   493
         (fs, add_typ_tfree_names (T, Tfs),
berghofe@11519
   494
          vs, add_typ_ixns (Tvs, T)))
berghofe@11519
   495
            (([], [], [], []), prf);
berghofe@11519
   496
    val fs' = map (fst o dest_Free) fs;
berghofe@11519
   497
    val vs' = map (fst o dest_Var) vs;
berghofe@11519
   498
    val names = vs' ~~ variantlist (map fst vs', fs');
berghofe@11519
   499
    val names' = Tvs ~~ variantlist (map fst Tvs, Tfs);
berghofe@11519
   500
    val rnames = map swap names;
berghofe@11519
   501
    val rnames' = map swap names';
berghofe@11519
   502
  in
berghofe@11519
   503
    (map_proof_terms (freeze names names') (frzT names') prf,
berghofe@11519
   504
     map_proof_terms (thaw rnames rnames') (thawT rnames'))
berghofe@11519
   505
  end;
berghofe@11519
   506
berghofe@11519
   507
berghofe@11519
   508
(***** implication introduction *****)
berghofe@11519
   509
berghofe@11519
   510
fun implies_intr_proof h prf =
berghofe@11519
   511
  let
berghofe@11715
   512
    fun abshyp i (Hyp t) = if h aconv t then PBound i else raise SAME
berghofe@11519
   513
      | abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf)
berghofe@11519
   514
      | abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i+1) prf)
berghofe@11615
   515
      | abshyp i (prf % t) = abshyp i prf % t
berghofe@11715
   516
      | abshyp i (prf1 %% prf2) = (abshyp i prf1 %% abshyph i prf2
berghofe@11715
   517
          handle SAME => prf1 %% abshyp i prf2)
berghofe@11715
   518
      | abshyp _ _ = raise SAME
berghofe@11715
   519
    and abshyph i prf = (abshyp i prf handle SAME => prf)
berghofe@11519
   520
  in
skalberg@15531
   521
    AbsP ("H", NONE (*h*), abshyph 0 prf)
berghofe@11519
   522
  end;
berghofe@11519
   523
berghofe@11519
   524
berghofe@11519
   525
(***** forall introduction *****)
berghofe@11519
   526
skalberg@15531
   527
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf);
berghofe@11519
   528
berghofe@11519
   529
berghofe@11519
   530
(***** varify *****)
berghofe@11519
   531
berghofe@11519
   532
fun varify_proof t fixed prf =
berghofe@11519
   533
  let
berghofe@15797
   534
    val fs = add_term_tfrees (t, []) \\ fixed;
berghofe@11519
   535
    val ixns = add_term_tvar_ixns (t, []);
berghofe@15797
   536
    val fmap = fs ~~ variantlist (map fst fs, map #1 ixns)
berghofe@11519
   537
    fun thaw (f as (a, S)) =
berghofe@15797
   538
      (case assoc (fmap, f) of
skalberg@15531
   539
        NONE => TFree f
skalberg@15531
   540
      | SOME b => TVar ((b, 0), S));
berghofe@11519
   541
  in map_proof_terms (map_term_types (map_type_tfree thaw)) (map_type_tfree thaw) prf
berghofe@11519
   542
  end;
berghofe@11519
   543
berghofe@11519
   544
berghofe@11519
   545
local
berghofe@11519
   546
berghofe@11519
   547
fun new_name (ix, (pairs,used)) =
berghofe@11519
   548
  let val v = variant used (string_of_indexname ix)
berghofe@11519
   549
  in  ((ix, v) :: pairs, v :: used)  end;
berghofe@11519
   550
berghofe@11519
   551
fun freeze_one alist (ix, sort) = (case assoc (alist, ix) of
skalberg@15531
   552
    NONE => TVar (ix, sort)
skalberg@15531
   553
  | SOME name => TFree (name, sort));
berghofe@11519
   554
berghofe@11519
   555
in
berghofe@11519
   556
berghofe@11519
   557
fun freezeT t prf =
berghofe@11519
   558
  let
berghofe@11519
   559
    val used = it_term_types add_typ_tfree_names (t, [])
berghofe@11519
   560
    and tvars = map #1 (it_term_types add_typ_tvars (t, []));
skalberg@15574
   561
    val (alist, _) = foldr new_name ([], used) tvars;
berghofe@11519
   562
  in
berghofe@11519
   563
    (case alist of
berghofe@11519
   564
      [] => prf (*nothing to do!*)
berghofe@11519
   565
    | _ =>
berghofe@11519
   566
      let val frzT = map_type_tvar (freeze_one alist)
berghofe@11519
   567
      in map_proof_terms (map_term_types frzT) frzT prf end)
berghofe@11519
   568
  end;
berghofe@11519
   569
berghofe@11519
   570
end;
berghofe@11519
   571
berghofe@11519
   572
berghofe@11519
   573
(***** rotate assumptions *****)
berghofe@11519
   574
berghofe@11519
   575
fun rotate_proof Bs Bi m prf =
berghofe@11519
   576
  let
berghofe@11519
   577
    val params = Term.strip_all_vars Bi;
berghofe@11519
   578
    val asms = Logic.strip_imp_prems (Term.strip_all_body Bi);
berghofe@11519
   579
    val i = length asms;
berghofe@11519
   580
    val j = length Bs;
berghofe@11519
   581
  in
berghofe@11519
   582
    mk_AbsP (j+1, proof_combP (prf, map PBound
skalberg@15574
   583
      (j downto 1) @ [mk_Abst (mk_AbsP (i,
berghofe@11519
   584
        proof_combP (proof_combt (PBound i, map Bound ((length params - 1) downto 0)),
skalberg@15574
   585
          map PBound (((i-m-1) downto 0) @ ((i-1) downto (i-m)))))) params]))
berghofe@11519
   586
  end;
berghofe@11519
   587
berghofe@11519
   588
berghofe@11519
   589
(***** permute premises *****)
berghofe@11519
   590
berghofe@11519
   591
fun permute_prems_prf prems j k prf =
berghofe@11519
   592
  let val n = length prems
berghofe@11519
   593
  in mk_AbsP (n, proof_combP (prf,
berghofe@11519
   594
    map PBound ((n-1 downto n-j) @ (k-1 downto 0) @ (n-j-1 downto k))))
berghofe@11519
   595
  end;
berghofe@11519
   596
berghofe@11519
   597
berghofe@11519
   598
(***** instantiation *****)
berghofe@11519
   599
berghofe@15030
   600
fun instantiate vTs tpairs prf =
berghofe@11519
   601
  map_proof_terms (subst_atomic (map (apsnd remove_types) tpairs) o
berghofe@15797
   602
    map_term_types (typ_subst_atomic vTs)) (typ_subst_atomic vTs) prf;
berghofe@11519
   603
berghofe@11519
   604
berghofe@11519
   605
(***** lifting *****)
berghofe@11519
   606
berghofe@11519
   607
fun lift_proof Bi inc prop prf =
berghofe@11519
   608
  let
berghofe@11519
   609
    val (_, lift_all) = Logic.lift_fns (Bi, inc);
berghofe@11519
   610
berghofe@11519
   611
    fun lift'' Us Ts t = strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t));
berghofe@11519
   612
berghofe@11715
   613
    fun lift' Us Ts (Abst (s, T, prf)) =
berghofe@11715
   614
          (Abst (s, apsome' (same (incr_tvar inc)) T, lifth' Us (dummyT::Ts) prf)
berghofe@11715
   615
           handle SAME => Abst (s, T, lift' Us (dummyT::Ts) prf))
berghofe@11715
   616
      | lift' Us Ts (AbsP (s, t, prf)) =
berghofe@11715
   617
          (AbsP (s, apsome' (same (lift'' Us Ts)) t, lifth' Us Ts prf)
berghofe@11715
   618
           handle SAME => AbsP (s, t, lift' Us Ts prf))
skalberg@15570
   619
      | lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t
berghofe@11715
   620
          handle SAME => prf % apsome' (same (lift'' Us Ts)) t)
berghofe@11715
   621
      | lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2
berghofe@11715
   622
          handle SAME => prf1 %% lift' Us Ts prf2)
berghofe@11715
   623
      | lift' _ _ (PThm (s, prf, prop, Ts)) =
berghofe@11715
   624
          PThm (s, prf, prop, apsome' (same (map (incr_tvar inc))) Ts)
berghofe@11715
   625
      | lift' _ _ (PAxm (s, prop, Ts)) =
berghofe@11715
   626
          PAxm (s, prop, apsome' (same (map (incr_tvar inc))) Ts)
berghofe@11715
   627
      | lift' _ _ _ = raise SAME
berghofe@11715
   628
    and lifth' Us Ts prf = (lift' Us Ts prf handle SAME => prf);
berghofe@11519
   629
berghofe@13662
   630
    val ps = map lift_all (Logic.strip_imp_prems prop);
berghofe@11519
   631
    val k = length ps;
berghofe@11519
   632
berghofe@11519
   633
    fun mk_app (b, (i, j, prf)) = 
berghofe@11615
   634
          if b then (i-1, j, prf %% PBound i) else (i, j-1, prf %> Bound j);
berghofe@11519
   635
berghofe@11519
   636
    fun lift Us bs i j (Const ("==>", _) $ A $ B) =
skalberg@15531
   637
	    AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B)
berghofe@11519
   638
      | lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) = 
skalberg@15531
   639
	    Abst (a, NONE (*T*), lift (T::Us) (false::bs) i (j+1) t)
berghofe@11715
   640
      | lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf,
skalberg@15574
   641
            map (fn k => (#3 (foldr mk_app (i-1, j-1, PBound k) bs)))
berghofe@11519
   642
              (i + k - 1 downto i));
berghofe@11519
   643
  in
berghofe@11519
   644
    mk_AbsP (k, lift [] [] 0 0 Bi)
berghofe@11519
   645
  end;
berghofe@11519
   646
berghofe@11519
   647
berghofe@11519
   648
(***** proof by assumption *****)
berghofe@11519
   649
skalberg@15531
   650
fun mk_asm_prf (Const ("==>", _) $ A $ B) i = AbsP ("H", NONE (*A*), mk_asm_prf B (i+1))
skalberg@15531
   651
  | mk_asm_prf (Const ("all", _) $ Abs (a, T, t)) i = Abst (a, NONE (*T*), mk_asm_prf t i)
berghofe@11519
   652
  | mk_asm_prf _ i = PBound i;
berghofe@11519
   653
berghofe@11519
   654
fun assumption_proof Bs Bi n prf =
berghofe@11519
   655
  mk_AbsP (length Bs, proof_combP (prf,
berghofe@11519
   656
    map PBound (length Bs - 1 downto 0) @ [mk_asm_prf Bi (~n)]));
berghofe@11519
   657
berghofe@11519
   658
berghofe@11519
   659
(***** Composition of object rule with proof state *****)
berghofe@11519
   660
berghofe@11519
   661
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) =
skalberg@15531
   662
      AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k))
berghofe@11519
   663
  | flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) =
skalberg@15531
   664
      Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k))
berghofe@11519
   665
  | flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i),
berghofe@11519
   666
      map Bound (j-1 downto 0)), map PBound (i-1 downto 0 \ i-n));
berghofe@11519
   667
berghofe@11519
   668
fun bicompose_proof Bs oldAs newAs A n rprf sprf =
berghofe@11519
   669
  let
berghofe@11519
   670
    val la = length newAs;
berghofe@11519
   671
    val lb = length Bs;
berghofe@11519
   672
  in
berghofe@11519
   673
    mk_AbsP (lb+la, proof_combP (sprf,
berghofe@11615
   674
      map PBound (lb + la - 1 downto la)) %%
skalberg@15570
   675
        proof_combP (rprf, (if n>0 then [mk_asm_prf (valOf A) (~n)] else []) @
berghofe@11519
   676
          map (flatten_params_proof 0 0 n) (oldAs ~~ (la - 1 downto 0))))
berghofe@11519
   677
  end;
berghofe@11519
   678
berghofe@11519
   679
berghofe@11519
   680
(***** axioms for equality *****)
berghofe@11519
   681
wenzelm@14854
   682
val aT = TFree ("'a", []);
wenzelm@14854
   683
val bT = TFree ("'b", []);
berghofe@11519
   684
val x = Free ("x", aT);
berghofe@11519
   685
val y = Free ("y", aT);
berghofe@11519
   686
val z = Free ("z", aT);
berghofe@11519
   687
val A = Free ("A", propT);
berghofe@11519
   688
val B = Free ("B", propT);
berghofe@11519
   689
val f = Free ("f", aT --> bT);
berghofe@11519
   690
val g = Free ("g", aT --> bT);
berghofe@11519
   691
berghofe@11519
   692
local open Logic in
berghofe@11519
   693
berghofe@11519
   694
val equality_axms =
berghofe@11519
   695
  [("reflexive", mk_equals (x, x)),
berghofe@11519
   696
   ("symmetric", mk_implies (mk_equals (x, y), mk_equals (y, x))),
berghofe@11519
   697
   ("transitive", list_implies ([mk_equals (x, y), mk_equals (y, z)], mk_equals (x, z))),
berghofe@11519
   698
   ("equal_intr", list_implies ([mk_implies (A, B), mk_implies (B, A)], mk_equals (A, B))),
berghofe@11519
   699
   ("equal_elim", list_implies ([mk_equals (A, B), A], B)),
berghofe@11519
   700
   ("abstract_rule", Logic.mk_implies
berghofe@11519
   701
      (all aT $ Abs ("x", aT, equals bT $ (f $ Bound 0) $ (g $ Bound 0)),
berghofe@11519
   702
       equals (aT --> bT) $
berghofe@11519
   703
         Abs ("x", aT, f $ Bound 0) $ Abs ("x", aT, g $ Bound 0))),
berghofe@11519
   704
   ("combination", Logic.list_implies
berghofe@11519
   705
      ([Logic.mk_equals (f, g), Logic.mk_equals (x, y)],
berghofe@11519
   706
       Logic.mk_equals (f $ x, g $ y)))];
berghofe@11519
   707
berghofe@11519
   708
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm,
berghofe@11519
   709
  equal_elim_axm, abstract_rule_axm, combination_axm] =
skalberg@15531
   710
    map (fn (s, t) => PAxm ("ProtoPure." ^ s, varify t, NONE)) equality_axms;
berghofe@11519
   711
berghofe@11519
   712
end;
berghofe@11519
   713
skalberg@15531
   714
val reflexive = reflexive_axm % NONE;
berghofe@11519
   715
berghofe@11615
   716
fun symmetric (prf as PAxm ("ProtoPure.reflexive", _, _) % _) = prf
skalberg@15531
   717
  | symmetric prf = symmetric_axm % NONE % NONE %% prf;
berghofe@11519
   718
berghofe@11615
   719
fun transitive _ _ (PAxm ("ProtoPure.reflexive", _, _) % _) prf2 = prf2
berghofe@11615
   720
  | transitive _ _ prf1 (PAxm ("ProtoPure.reflexive", _, _) % _) = prf1
berghofe@11519
   721
  | transitive u (Type ("prop", [])) prf1 prf2 =
skalberg@15531
   722
      transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2
berghofe@11519
   723
  | transitive u T prf1 prf2 =
skalberg@15531
   724
      transitive_axm % NONE % NONE % NONE %% prf1 %% prf2;
berghofe@11519
   725
berghofe@11519
   726
fun abstract_rule x a prf =
skalberg@15531
   727
  abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf;
berghofe@11519
   728
berghofe@11615
   729
fun check_comb (PAxm ("ProtoPure.combination", _, _) % f % g % _ % _ %% prf %% _) =
skalberg@15570
   730
      isSome f orelse check_comb prf
berghofe@11615
   731
  | check_comb (PAxm ("ProtoPure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) =
berghofe@11519
   732
      check_comb prf1 andalso check_comb prf2
berghofe@11615
   733
  | check_comb (PAxm ("ProtoPure.symmetric", _, _) % _ % _ %% prf) = check_comb prf
berghofe@11519
   734
  | check_comb _ = false;
berghofe@11519
   735
berghofe@11519
   736
fun combination f g t u (Type (_, [T, U])) prf1 prf2 =
berghofe@11519
   737
  let
berghofe@11519
   738
    val f = Envir.beta_norm f;
berghofe@11519
   739
    val g = Envir.beta_norm g;
berghofe@11519
   740
    val prf =  if check_comb prf1 then
skalberg@15531
   741
        combination_axm % NONE % NONE
berghofe@11519
   742
      else (case prf1 of
berghofe@11615
   743
          PAxm ("ProtoPure.reflexive", _, _) % _ =>
skalberg@15531
   744
            combination_axm %> remove_types f % NONE
berghofe@11615
   745
        | _ => combination_axm %> remove_types f %> remove_types g)
berghofe@11519
   746
  in
berghofe@11519
   747
    (case T of
berghofe@11615
   748
       Type ("fun", _) => prf %
berghofe@11519
   749
         (case head_of f of
skalberg@15531
   750
            Abs _ => SOME (remove_types t)
skalberg@15531
   751
          | Var _ => SOME (remove_types t)
skalberg@15531
   752
          | _ => NONE) %
berghofe@11519
   753
         (case head_of g of
skalberg@15531
   754
            Abs _ => SOME (remove_types u)
skalberg@15531
   755
          | Var _ => SOME (remove_types u)
skalberg@15531
   756
          | _ => NONE) %% prf1 %% prf2
skalberg@15531
   757
     | _ => prf % NONE % NONE %% prf1 %% prf2)
berghofe@11519
   758
  end;
berghofe@11519
   759
berghofe@11519
   760
fun equal_intr A B prf1 prf2 =
berghofe@11615
   761
  equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
berghofe@11519
   762
berghofe@11519
   763
fun equal_elim A B prf1 prf2 =
berghofe@11615
   764
  equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
berghofe@11519
   765
berghofe@11519
   766
berghofe@11519
   767
(***** axioms and theorems *****)
berghofe@11519
   768
berghofe@11519
   769
fun vars_of t = rev (foldl_aterms
berghofe@11519
   770
  (fn (vs, v as Var _) => v ins vs | (vs, _) => vs) ([], t));
berghofe@11519
   771
berghofe@11519
   772
fun test_args _ [] = true
berghofe@11519
   773
  | test_args is (Bound i :: ts) =
berghofe@11519
   774
      not (i mem is) andalso test_args (i :: is) ts
berghofe@11519
   775
  | test_args _ _ = false;
berghofe@11519
   776
berghofe@11519
   777
fun is_fun (Type ("fun", _)) = true
berghofe@11519
   778
  | is_fun (TVar _) = true
berghofe@11519
   779
  | is_fun _ = false;
berghofe@11519
   780
berghofe@11519
   781
fun add_funvars Ts (vs, t) =
berghofe@11519
   782
  if is_fun (fastype_of1 (Ts, t)) then
skalberg@15570
   783
    vs union List.mapPartial (fn Var (ixn, T) =>
skalberg@15531
   784
      if is_fun T then SOME ixn else NONE | _ => NONE) (vars_of t)
berghofe@11519
   785
  else vs;
berghofe@11519
   786
berghofe@11519
   787
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) =
berghofe@11519
   788
      add_npvars q p Ts (add_npvars q (not p) Ts (vs, t), u)
berghofe@11519
   789
  | add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) =
berghofe@11519
   790
      add_npvars q p Ts (vs, if p andalso q then betapply (t, Var (("",0), T)) else t)
berghofe@12041
   791
  | add_npvars q p Ts (vs, Abs (_, T, t)) = add_npvars q p (T::Ts) (vs, t)
berghofe@12041
   792
  | add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t)
berghofe@12041
   793
and add_npvars' Ts (vs, t) = (case strip_comb t of
berghofe@11519
   794
    (Var (ixn, _), ts) => if test_args [] ts then vs
skalberg@15570
   795
      else Library.foldl (add_npvars' Ts) (overwrite (vs,
skalberg@15570
   796
        (ixn, Library.foldl (add_funvars Ts) (getOpt (assoc (vs, ixn), []), ts))), ts)
skalberg@15570
   797
  | (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts)
skalberg@15570
   798
  | (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts));
berghofe@11519
   799
berghofe@11519
   800
fun prop_vars (Const ("==>", _) $ P $ Q) = prop_vars P union prop_vars Q
berghofe@11519
   801
  | prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t
berghofe@11519
   802
  | prop_vars t = (case strip_comb t of
berghofe@11519
   803
      (Var (ixn, _), _) => [ixn] | _ => []);
berghofe@11519
   804
berghofe@11519
   805
fun is_proj t =
berghofe@11519
   806
  let
berghofe@11519
   807
    fun is_p i t = (case strip_comb t of
berghofe@11519
   808
        (Bound j, []) => false
berghofe@11519
   809
      | (Bound j, ts) => j >= i orelse exists (is_p i) ts
berghofe@11519
   810
      | (Abs (_, _, u), _) => is_p (i+1) u
berghofe@11519
   811
      | (_, ts) => exists (is_p i) ts)
berghofe@11519
   812
  in (case strip_abs_body t of
berghofe@11519
   813
        Bound _ => true
berghofe@11519
   814
      | t' => is_p 0 t')
berghofe@11519
   815
  end;
berghofe@11519
   816
berghofe@11519
   817
fun needed_vars prop = 
skalberg@15570
   818
  Library.foldl op union ([], map op ins (add_npvars true true [] ([], prop))) union
berghofe@11519
   819
  prop_vars prop;
berghofe@11519
   820
berghofe@11519
   821
fun gen_axm_proof c name prop =
berghofe@11519
   822
  let
berghofe@11519
   823
    val nvs = needed_vars prop;
berghofe@11519
   824
    val args = map (fn (v as Var (ixn, _)) =>
skalberg@15531
   825
        if ixn mem nvs then SOME v else NONE) (vars_of prop) @
skalberg@15531
   826
      map SOME (sort (make_ord atless) (term_frees prop));
berghofe@11519
   827
  in
skalberg@15531
   828
    proof_combt' (c (name, prop, NONE), args)
berghofe@11519
   829
  end;
berghofe@11519
   830
berghofe@11519
   831
val axm_proof = gen_axm_proof PAxm;
berghofe@11519
   832
val oracle_proof = gen_axm_proof Oracle;
berghofe@11519
   833
berghofe@11519
   834
fun shrink ls lev (prf as Abst (a, T, body)) =
berghofe@11519
   835
      let val (b, is, ch, body') = shrink ls (lev+1) body
berghofe@11519
   836
      in (b, is, ch, if ch then Abst (a, T, body') else prf) end
berghofe@11519
   837
  | shrink ls lev (prf as AbsP (a, t, body)) =
berghofe@11519
   838
      let val (b, is, ch, body') = shrink (lev::ls) lev body
skalberg@15570
   839
      in (b orelse 0 mem is, List.mapPartial (fn 0 => NONE | i => SOME (i-1)) is,
berghofe@11519
   840
        ch, if ch then AbsP (a, t, body') else prf)
berghofe@11519
   841
      end
berghofe@11519
   842
  | shrink ls lev prf =
berghofe@11519
   843
      let val (is, ch, _, prf') = shrink' ls lev [] [] prf
berghofe@11519
   844
      in (false, is, ch, prf') end
berghofe@11615
   845
and shrink' ls lev ts prfs (prf as prf1 %% prf2) =
berghofe@11519
   846
      let
berghofe@11519
   847
        val p as (_, is', ch', prf') = shrink ls lev prf2;
berghofe@11519
   848
        val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1
berghofe@11519
   849
      in (is union is', ch orelse ch', ts',
berghofe@11615
   850
          if ch orelse ch' then prf'' %% prf' else prf)
berghofe@11519
   851
      end
berghofe@11615
   852
  | shrink' ls lev ts prfs (prf as prf1 % t) =
berghofe@11519
   853
      let val (is, ch, (ch', t')::ts', prf') = shrink' ls lev (t::ts) prfs prf1
berghofe@11615
   854
      in (is, ch orelse ch', ts', if ch orelse ch' then prf' % t' else prf) end
berghofe@11519
   855
  | shrink' ls lev ts prfs (prf as PBound i) =
skalberg@15570
   856
      (if exists (fn SOME (Bound j) => lev-j <= List.nth (ls, i) | _ => true) ts
berghofe@12233
   857
         orelse not (null (duplicates
skalberg@15570
   858
           (Library.foldl (fn (js, SOME (Bound j)) => j :: js | (js, _) => js) ([], ts))))
berghofe@11519
   859
         orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf)
berghofe@11519
   860
  | shrink' ls lev ts prfs (prf as Hyp _) = ([], false, map (pair false) ts, prf)
berghofe@11615
   861
  | shrink' ls lev ts prfs (prf as MinProof _) =
berghofe@11615
   862
      ([], false, map (pair false) ts, prf)
berghofe@11519
   863
  | shrink' ls lev ts prfs prf =
berghofe@11519
   864
      let
berghofe@11519
   865
        val prop = (case prf of PThm (_, _, prop, _) => prop | PAxm (_, prop, _) => prop
berghofe@11519
   866
          | Oracle (_, prop, _) => prop | _ => error "shrink: proof not in normal form");
berghofe@11519
   867
        val vs = vars_of prop;
nipkow@13629
   868
        val (ts', ts'') = splitAt (length vs, ts)
skalberg@15570
   869
        val insts = Library.take (length ts', map (fst o dest_Var) vs) ~~ ts';
skalberg@15570
   870
        val nvs = Library.foldl (fn (ixns', (ixn, ixns)) =>
berghofe@11519
   871
          ixn ins (case assoc (insts, ixn) of
skalberg@15531
   872
              SOME (SOME t) => if is_proj t then ixns union ixns' else ixns'
berghofe@11519
   873
            | _ => ixns union ixns'))
berghofe@11519
   874
              (needed prop ts'' prfs, add_npvars false true [] ([], prop));
berghofe@11519
   875
        val insts' = map
skalberg@15531
   876
          (fn (ixn, x as SOME _) => if ixn mem nvs then (false, x) else (true, NONE)
berghofe@11519
   877
            | (_, x) => (false, x)) insts
berghofe@11519
   878
      in ([], false, insts' @ map (pair false) ts'', prf) end
berghofe@11519
   879
and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) =
berghofe@11519
   880
      (if b then map (fst o dest_Var) (vars_of t) else []) union needed u ts prfs
berghofe@11519
   881
  | needed (Var (ixn, _)) (_::_) _ = [ixn]
berghofe@11519
   882
  | needed _ _ _ = [];
berghofe@11519
   883
berghofe@11519
   884
berghofe@11519
   885
(**** Simple first order matching functions for terms and proofs ****)
berghofe@11519
   886
berghofe@11519
   887
exception PMatch;
berghofe@11519
   888
berghofe@11519
   889
(** see pattern.ML **)
berghofe@11519
   890
skalberg@15570
   891
fun flt (i: int) = List.filter (fn n => n < i);
berghofe@12279
   892
berghofe@12279
   893
fun fomatch Ts tymatch j =
berghofe@11519
   894
  let
berghofe@11519
   895
    fun mtch (instsp as (tyinsts, insts)) = fn
berghofe@11519
   896
        (Var (ixn, T), t)  =>
berghofe@12279
   897
          if j>0 andalso not (null (flt j (loose_bnos t)))
berghofe@12279
   898
          then raise PMatch
berghofe@12279
   899
          else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))),
berghofe@12279
   900
            (ixn, t) :: insts)
berghofe@11519
   901
      | (Free (a, T), Free (b, U)) =>
berghofe@12279
   902
	  if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
berghofe@11519
   903
      | (Const (a, T), Const (b, U))  =>
berghofe@12279
   904
	  if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
berghofe@11519
   905
      | (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u)
berghofe@12279
   906
      | (Bound i, Bound j) => if i=j then instsp else raise PMatch
berghofe@11519
   907
      | _ => raise PMatch
berghofe@11519
   908
  in mtch end;
berghofe@11519
   909
berghofe@12279
   910
fun match_proof Ts tymatch =
berghofe@11519
   911
  let
skalberg@15531
   912
    fun optmatch _ inst (NONE, _) = inst
skalberg@15531
   913
      | optmatch _ _ (SOME _, NONE) = raise PMatch
skalberg@15531
   914
      | optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y)
berghofe@12279
   915
berghofe@12279
   916
    fun matcht Ts j (pinst, tinst) (t, u) =
berghofe@12279
   917
      (pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u));
berghofe@12279
   918
    fun matchT (pinst, (tyinsts, insts)) p =
berghofe@12279
   919
      (pinst, (tymatch (tyinsts, K p), insts));
skalberg@15570
   920
    fun matchTs inst (Ts, Us) = Library.foldl (uncurry matchT) (inst, Ts ~~ Us);
berghofe@12279
   921
berghofe@12279
   922
    fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) =
berghofe@12279
   923
          if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst)
berghofe@12279
   924
          else (case apfst (flt i) (apsnd (flt j)
berghofe@12279
   925
                  (prf_add_loose_bnos 0 0 prf ([], []))) of
berghofe@12279
   926
              ([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
berghofe@12279
   927
            | ([], _) => if j = 0 then
berghofe@12279
   928
                   ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
berghofe@12279
   929
                 else raise PMatch
berghofe@12279
   930
            | _ => raise PMatch)
berghofe@12279
   931
      | mtch Ts i j inst (prf1 % opt1, prf2 % opt2) =
berghofe@12279
   932
          optmatch (matcht Ts j) (mtch Ts i j inst (prf1, prf2)) (opt1, opt2)
berghofe@12279
   933
      | mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') =
berghofe@12279
   934
          mtch Ts i j (mtch Ts i j inst (prf1, prf1')) (prf2, prf2')
berghofe@12279
   935
      | mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) =
skalberg@15570
   936
          mtch (getOpt (opU,dummyT) :: Ts) i (j+1)
berghofe@12279
   937
            (optmatch matchT inst (opT, opU)) (prf1, prf2)
berghofe@12279
   938
      | mtch Ts i j inst (prf1, Abst (_, opU, prf2)) =
skalberg@15570
   939
          mtch (getOpt (opU,dummyT) :: Ts) i (j+1) inst
berghofe@12279
   940
            (incr_pboundvars 0 1 prf1 %> Bound 0, prf2)
berghofe@12279
   941
      | mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) =
berghofe@12279
   942
          mtch Ts (i+1) j (optmatch (matcht Ts j) inst (opt, opu)) (prf1, prf2)
berghofe@12279
   943
      | mtch Ts i j inst (prf1, AbsP (_, _, prf2)) =
berghofe@12279
   944
          mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2)
berghofe@12279
   945
      | mtch Ts i j inst (PThm ((name1, _), _, prop1, opTs),
berghofe@12279
   946
            PThm ((name2, _), _, prop2, opUs)) =
berghofe@11519
   947
          if name1=name2 andalso prop1=prop2 then
berghofe@12279
   948
            optmatch matchTs inst (opTs, opUs)
berghofe@11519
   949
          else raise PMatch
berghofe@12279
   950
      | mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) =
berghofe@12279
   951
          if s1=s2 then optmatch matchTs inst (opTs, opUs)
berghofe@11519
   952
          else raise PMatch
berghofe@12279
   953
      | mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch
berghofe@12279
   954
      | mtch _ _ _ _ _ = raise PMatch
berghofe@12279
   955
  in mtch Ts 0 0 end;
berghofe@11519
   956
berghofe@11519
   957
fun prf_subst (pinst, (tyinsts, insts)) =
berghofe@11519
   958
  let
berghofe@15797
   959
    val substT = Envir.typ_subst_TVars tyinsts;
berghofe@11519
   960
berghofe@11519
   961
    fun subst' lev (t as Var (ixn, _)) = (case assoc (insts, ixn) of
skalberg@15531
   962
          NONE => t
skalberg@15531
   963
        | SOME u => incr_boundvars lev u)
berghofe@11519
   964
      | subst' lev (Const (s, T)) = Const (s, substT T)
berghofe@11519
   965
      | subst' lev (Free (s, T)) = Free (s, substT T)
berghofe@11519
   966
      | subst' lev (Abs (a, T, body)) = Abs (a, substT T, subst' (lev+1) body)
berghofe@11519
   967
      | subst' lev (f $ t) = subst' lev f $ subst' lev t
berghofe@11519
   968
      | subst' _ t = t;
berghofe@11519
   969
berghofe@11519
   970
    fun subst plev tlev (AbsP (a, t, body)) =
skalberg@15570
   971
          AbsP (a, Option.map (subst' tlev) t, subst (plev+1) tlev body)
berghofe@11519
   972
      | subst plev tlev (Abst (a, T, body)) =
skalberg@15570
   973
          Abst (a, Option.map substT T, subst plev (tlev+1) body)
berghofe@11615
   974
      | subst plev tlev (prf %% prf') = subst plev tlev prf %% subst plev tlev prf'
skalberg@15570
   975
      | subst plev tlev (prf % t) = subst plev tlev prf % Option.map (subst' tlev) t
berghofe@11519
   976
      | subst plev tlev (prf as Hyp (Var (ixn, _))) = (case assoc (pinst, ixn) of
skalberg@15531
   977
          NONE => prf
skalberg@15531
   978
        | SOME prf' => incr_pboundvars plev tlev prf')
berghofe@11519
   979
      | subst _ _ (PThm (id, prf, prop, Ts)) =
skalberg@15570
   980
          PThm (id, prf, prop, Option.map (map substT) Ts)
berghofe@11519
   981
      | subst _ _ (PAxm (id, prop, Ts)) =
skalberg@15570
   982
          PAxm (id, prop, Option.map (map substT) Ts)
berghofe@11519
   983
      | subst _ _ t = t
berghofe@11519
   984
  in subst 0 0 end;
berghofe@11519
   985
berghofe@12871
   986
(*A fast unification filter: true unless the two terms cannot be unified. 
berghofe@12871
   987
  Terms must be NORMAL.  Treats all Vars as distinct. *)
berghofe@12871
   988
fun could_unify prf1 prf2 =
berghofe@12871
   989
  let
berghofe@12871
   990
    fun matchrands (prf1 %% prf2) (prf1' %% prf2') =
berghofe@12871
   991
          could_unify prf2 prf2' andalso matchrands prf1 prf1'
skalberg@15531
   992
      | matchrands (prf % SOME t) (prf' % SOME t') =
berghofe@12871
   993
          Term.could_unify (t, t') andalso matchrands prf prf'
berghofe@12871
   994
      | matchrands (prf % _) (prf' % _) = matchrands prf prf'
berghofe@12871
   995
      | matchrands _ _ = true
berghofe@12871
   996
berghofe@12871
   997
    fun head_of (prf %% _) = head_of prf
berghofe@12871
   998
      | head_of (prf % _) = head_of prf
berghofe@12871
   999
      | head_of prf = prf
berghofe@12871
  1000
berghofe@12871
  1001
  in case (head_of prf1, head_of prf2) of
berghofe@12871
  1002
        (_, Hyp (Var _)) => true
berghofe@12871
  1003
      | (Hyp (Var _), _) => true
berghofe@12871
  1004
      | (PThm ((a, _), _, propa, _), PThm ((b, _), _, propb, _)) =>
berghofe@12871
  1005
          a = b andalso propa = propb andalso matchrands prf1 prf2
berghofe@12871
  1006
      | (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2
berghofe@12871
  1007
      | (PBound i, PBound j) =>  i = j andalso matchrands prf1 prf2
berghofe@12871
  1008
      | (AbsP _, _) =>  true   (*because of possible eta equality*)
berghofe@12871
  1009
      | (Abst _, _) =>  true
berghofe@12871
  1010
      | (_, AbsP _) =>  true
berghofe@12871
  1011
      | (_, Abst _) =>  true
berghofe@12871
  1012
      | _ => false
berghofe@12871
  1013
  end;
berghofe@12871
  1014
berghofe@11519
  1015
(**** rewriting on proof terms ****)
berghofe@11519
  1016
berghofe@13102
  1017
val skel0 = PBound 0;
berghofe@13102
  1018
berghofe@12279
  1019
fun rewrite_prf tymatch (rules, procs) prf =
berghofe@11519
  1020
  let
skalberg@15531
  1021
    fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, skel0)
skalberg@15531
  1022
      | rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, skel0)
berghofe@11519
  1023
      | rew Ts prf = (case get_first (fn (_, r) => r Ts prf) procs of
skalberg@15531
  1024
          SOME prf' => SOME (prf', skel0)
skalberg@15531
  1025
        | NONE => get_first (fn (prf1, prf2) => SOME (prf_subst
berghofe@13102
  1026
            (match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2)
skalberg@15570
  1027
               handle PMatch => NONE) (List.filter (could_unify prf o fst) rules));
berghofe@11519
  1028
berghofe@11615
  1029
    fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) =
berghofe@11519
  1030
          if prf_loose_Pbvar1 prf' 0 then rew Ts prf
berghofe@11519
  1031
          else
berghofe@11519
  1032
            let val prf'' = incr_pboundvars (~1) 0 prf'
skalberg@15570
  1033
            in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end
skalberg@15531
  1034
      | rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) =
berghofe@11519
  1035
          if prf_loose_bvar1 prf' 0 then rew Ts prf
berghofe@11519
  1036
          else
berghofe@11519
  1037
            let val prf'' = incr_pboundvars 0 (~1) prf'
skalberg@15570
  1038
            in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end
berghofe@11519
  1039
      | rew0 Ts prf = rew Ts prf;
berghofe@11519
  1040
skalberg@15531
  1041
    fun rew1 _ (Hyp (Var _)) _ = NONE
berghofe@13102
  1042
      | rew1 Ts skel prf = (case rew2 Ts skel prf of
skalberg@15531
  1043
          SOME prf1 => (case rew0 Ts prf1 of
skalberg@15570
  1044
              SOME (prf2, skel') => SOME (getOpt (rew1 Ts skel' prf2, prf2))
skalberg@15531
  1045
            | NONE => SOME prf1)
skalberg@15531
  1046
        | NONE => (case rew0 Ts prf of
skalberg@15570
  1047
              SOME (prf1, skel') => SOME (getOpt (rew1 Ts skel' prf1, prf1))
skalberg@15531
  1048
            | NONE => NONE))
berghofe@11519
  1049
skalberg@15531
  1050
    and rew2 Ts skel (prf % SOME t) = (case prf of
berghofe@11519
  1051
            Abst (_, _, body) =>
berghofe@11519
  1052
              let val prf' = prf_subst_bounds [t] body
skalberg@15570
  1053
              in SOME (getOpt (rew2 Ts skel0 prf', prf')) end
berghofe@13102
  1054
          | _ => (case rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf of
skalberg@15531
  1055
              SOME prf' => SOME (prf' % SOME t)
skalberg@15531
  1056
            | NONE => NONE))
skalberg@15570
  1057
      | rew2 Ts skel (prf % NONE) = Option.map (fn prf' => prf' % NONE)
berghofe@13102
  1058
          (rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf)
berghofe@13102
  1059
      | rew2 Ts skel (prf1 %% prf2) = (case prf1 of
berghofe@11519
  1060
            AbsP (_, _, body) =>
berghofe@11519
  1061
              let val prf' = prf_subst_pbounds [prf2] body
skalberg@15570
  1062
              in SOME (getOpt (rew2 Ts skel0 prf', prf')) end
berghofe@13102
  1063
          | _ =>
berghofe@13102
  1064
            let val (skel1, skel2) = (case skel of
berghofe@13102
  1065
                skel1 %% skel2 => (skel1, skel2)
berghofe@13102
  1066
              | _ => (skel0, skel0))
berghofe@13102
  1067
            in case rew1 Ts skel1 prf1 of
skalberg@15531
  1068
                SOME prf1' => (case rew1 Ts skel2 prf2 of
skalberg@15531
  1069
                    SOME prf2' => SOME (prf1' %% prf2')
skalberg@15531
  1070
                  | NONE => SOME (prf1' %% prf2))
skalberg@15531
  1071
              | NONE => (case rew1 Ts skel2 prf2 of
skalberg@15531
  1072
                    SOME prf2' => SOME (prf1 %% prf2')
skalberg@15531
  1073
                  | NONE => NONE)
berghofe@13102
  1074
            end)
skalberg@15570
  1075
      | rew2 Ts skel (Abst (s, T, prf)) = (case rew1 (getOpt (T,dummyT) :: Ts)
berghofe@13102
  1076
              (case skel of Abst (_, _, skel') => skel' | _ => skel0) prf of
skalberg@15531
  1077
            SOME prf' => SOME (Abst (s, T, prf'))
skalberg@15531
  1078
          | NONE => NONE)
berghofe@13102
  1079
      | rew2 Ts skel (AbsP (s, t, prf)) = (case rew1 Ts
berghofe@13102
  1080
              (case skel of AbsP (_, _, skel') => skel' | _ => skel0) prf of
skalberg@15531
  1081
            SOME prf' => SOME (AbsP (s, t, prf'))
skalberg@15531
  1082
          | NONE => NONE)
skalberg@15531
  1083
      | rew2 _ _ _ = NONE
berghofe@11519
  1084
skalberg@15570
  1085
  in getOpt (rew1 [] skel0 prf, prf) end;
berghofe@11519
  1086
berghofe@11519
  1087
fun rewrite_proof tsig = rewrite_prf (fn (tab, f) =>
berghofe@11519
  1088
  Type.typ_match tsig (tab, f ()) handle Type.TYPE_MATCH => raise PMatch);
berghofe@11519
  1089
berghofe@11715
  1090
fun rewrite_proof_notypes rews = rewrite_prf fst rews;
berghofe@11615
  1091
berghofe@11519
  1092
(**** theory data ****)
berghofe@11519
  1093
berghofe@11519
  1094
(* data kind 'Pure/proof' *)
berghofe@11519
  1095
berghofe@11519
  1096
structure ProofArgs =
berghofe@11519
  1097
struct
berghofe@11519
  1098
  val name = "Pure/proof";
berghofe@11519
  1099
  type T = ((proof * proof) list *
berghofe@12233
  1100
    (string * (typ list -> proof -> proof option)) list);
berghofe@11519
  1101
berghofe@12233
  1102
  val empty = ([], []);
berghofe@12233
  1103
  val copy = I;
berghofe@12233
  1104
  val prep_ext = I;
berghofe@12233
  1105
  fun merge ((rules1, procs1), (rules2, procs2)) =
wenzelm@12293
  1106
    (merge_lists rules1 rules2, merge_alists procs1 procs2);
berghofe@11519
  1107
  fun print _ _ = ();
berghofe@11519
  1108
end;
berghofe@11519
  1109
berghofe@11519
  1110
structure ProofData = TheoryDataFun(ProofArgs);
berghofe@11519
  1111
berghofe@11519
  1112
val init = ProofData.init;
berghofe@11519
  1113
berghofe@12233
  1114
fun add_prf_rrules rs thy =
berghofe@11519
  1115
  let val r = ProofData.get thy
berghofe@12233
  1116
  in ProofData.put (rs @ fst r, snd r) thy end;
berghofe@11519
  1117
berghofe@12233
  1118
fun add_prf_rprocs ps thy =
berghofe@11519
  1119
  let val r = ProofData.get thy
berghofe@12233
  1120
  in ProofData.put (fst r, ps @ snd r) thy end;
berghofe@11519
  1121
berghofe@11519
  1122
fun thm_proof sign (name, tags) hyps prop prf =
berghofe@11519
  1123
  let
wenzelm@12923
  1124
    val prop = Logic.list_implies (hyps, prop);
berghofe@11519
  1125
    val nvs = needed_vars prop;
berghofe@11519
  1126
    val args = map (fn (v as Var (ixn, _)) =>
skalberg@15531
  1127
        if ixn mem nvs then SOME v else NONE) (vars_of prop) @
skalberg@15531
  1128
      map SOME (sort (make_ord atless) (term_frees prop));
wenzelm@11543
  1129
    val opt_prf = if ! proofs = 2 then
berghofe@12233
  1130
        #4 (shrink [] 0 (rewrite_prf fst (ProofData.get_sg sign)
skalberg@15574
  1131
          (foldr (uncurry implies_intr_proof) prf hyps)))
berghofe@11519
  1132
      else MinProof (mk_min_proof ([], prf));
berghofe@12233
  1133
    val head = (case strip_combt (fst (strip_combP prf)) of
skalberg@15531
  1134
        (PThm ((old_name, _), prf', prop', NONE), args') =>
berghofe@11519
  1135
          if (old_name="" orelse old_name=name) andalso
berghofe@11519
  1136
             prop = prop' andalso args = args' then
skalberg@15531
  1137
            PThm ((name, tags), prf', prop, NONE)
berghofe@11519
  1138
          else
skalberg@15531
  1139
            PThm ((name, tags), opt_prf, prop, NONE)
skalberg@15531
  1140
      | _ => PThm ((name, tags), opt_prf, prop, NONE))
berghofe@11519
  1141
  in
wenzelm@12923
  1142
    proof_combP (proof_combt' (head, args), map Hyp hyps)
berghofe@11519
  1143
  end;
berghofe@11519
  1144
wenzelm@12923
  1145
fun get_name_tags hyps prop prf =
wenzelm@12923
  1146
  let val prop = Logic.list_implies (hyps, prop) in
wenzelm@12923
  1147
    (case strip_combt (fst (strip_combP prf)) of
berghofe@11519
  1148
      (PThm ((name, tags), _, prop', _), _) =>
berghofe@11519
  1149
        if prop=prop' then (name, tags) else ("", [])
berghofe@11519
  1150
    | (PAxm (name, prop', _), _) =>
berghofe@11519
  1151
        if prop=prop' then (name, []) else ("", [])
wenzelm@12923
  1152
    | _ => ("", []))
wenzelm@12923
  1153
  end;
berghofe@11519
  1154
berghofe@11519
  1155
end;
berghofe@11519
  1156
berghofe@11519
  1157
structure BasicProofterm : BASIC_PROOFTERM = Proofterm;
berghofe@11519
  1158
open BasicProofterm;