src/Provers/eqsubst.ML
author wenzelm
Fri Jan 06 15:18:20 2006 +0100 (2006-01-06)
changeset 18591 04b9f2bf5a48
parent 18011 685d95c793ff
child 18598 94d658871c98
permissions -rw-r--r--
tuned EqSubst setup;
wenzelm@16978
     1
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
dixon@15538
     2
(*  Title:      Provers/eqsubst.ML
wenzelm@16434
     3
    ID:         $Id$
paulson@15481
     4
    Author:     Lucas Dixon, University of Edinburgh
paulson@15481
     5
                lucas.dixon@ed.ac.uk
wenzelm@16978
     6
    Modified:   18 Feb 2005 - Lucas -
paulson@15481
     7
    Created:    29 Jan 2005
paulson@15481
     8
*)
wenzelm@16978
     9
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
paulson@15481
    10
(*  DESCRIPTION:
paulson@15481
    11
paulson@15481
    12
    A Tactic to perform a substiution using an equation.
paulson@15481
    13
paulson@15481
    14
*)
paulson@15481
    15
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
paulson@15481
    16
dixon@16004
    17
dixon@16004
    18
dixon@15538
    19
(* Logic specific data stub *)
paulson@15481
    20
signature EQRULE_DATA =
paulson@15481
    21
sig
dixon@15538
    22
paulson@15481
    23
  (* to make a meta equality theorem in the current logic *)
paulson@15481
    24
  val prep_meta_eq : thm -> thm list
dixon@15538
    25
paulson@15481
    26
end;
paulson@15481
    27
dixon@15538
    28
paulson@15481
    29
(* the signature of an instance of the SQSUBST tactic *)
wenzelm@18591
    30
signature EQSUBST =
paulson@15481
    31
sig
dixon@15538
    32
wenzelm@16978
    33
  exception eqsubst_occL_exp of
wenzelm@16978
    34
            string * (int list) * (thm list) * int * thm;
dixon@15959
    35
wenzelm@17795
    36
  type match
wenzelm@17795
    37
  type searchinfo
dixon@16004
    38
dixon@15538
    39
  val prep_subst_in_asm :
dixon@16004
    40
         int (* subgoal to subst in *)
wenzelm@16978
    41
      -> thm (* target theorem with subgoals *)
dixon@15538
    42
      -> int (* premise to subst in *)
wenzelm@16978
    43
      -> (cterm list (* certified free var placeholders for vars *)
dixon@15538
    44
          * int (* premice no. to subst *)
dixon@15538
    45
          * int (* number of assumptions of premice *)
wenzelm@16978
    46
          * thm) (* premice as a new theorem for forward reasoning *)
dixon@16004
    47
         * searchinfo (* search info: prem id etc *)
dixon@15538
    48
dixon@15538
    49
  val prep_subst_in_asms :
dixon@16004
    50
         int (* subgoal to subst in *)
wenzelm@16978
    51
      -> thm (* target theorem with subgoals *)
wenzelm@16978
    52
      -> ((cterm list (* certified free var placeholders for vars *)
dixon@15538
    53
          * int (* premice no. to subst *)
dixon@15538
    54
          * int (* number of assumptions of premice *)
wenzelm@16978
    55
          * thm) (* premice as a new theorem for forward reasoning *)
dixon@16004
    56
         * searchinfo) list
dixon@15538
    57
dixon@15538
    58
  val apply_subst_in_asm :
dixon@15538
    59
      int (* subgoal *)
wenzelm@16978
    60
      -> thm (* overall theorem *)
wenzelm@16978
    61
      -> thm (* rule *)
wenzelm@16978
    62
      -> (cterm list (* certified free var placeholders for vars *)
dixon@15538
    63
          * int (* assump no being subst *)
wenzelm@16978
    64
          * int (* num of premises of asm *)
wenzelm@16978
    65
          * thm) (* premthm *)
dixon@16004
    66
      * match
wenzelm@16978
    67
      -> thm Seq.seq
dixon@15538
    68
dixon@15538
    69
  val prep_concl_subst :
dixon@16004
    70
         int (* subgoal *)
wenzelm@16978
    71
      -> thm (* overall goal theorem *)
wenzelm@16978
    72
      -> (cterm list * thm) * searchinfo (* (cvfs, conclthm), matchf *)
dixon@15538
    73
dixon@15538
    74
  val apply_subst_in_concl :
dixon@15538
    75
        int (* subgoal *)
wenzelm@16978
    76
        -> thm (* thm with all goals *)
wenzelm@16978
    77
        -> cterm list (* certified free var placeholders for vars *)
wenzelm@16978
    78
           * thm  (* trivial thm of goal concl *)
dixon@15538
    79
            (* possible matches/unifiers *)
wenzelm@16978
    80
        -> thm (* rule *)
dixon@15550
    81
        -> match
wenzelm@16978
    82
        -> thm Seq.seq (* substituted goal *)
dixon@15538
    83
dixon@16004
    84
  (* basic notion of search *)
wenzelm@16978
    85
  val searchf_tlr_unify_all :
wenzelm@16978
    86
      (searchinfo
wenzelm@16978
    87
       -> term (* lhs *)
dixon@16004
    88
       -> match Seq.seq Seq.seq)
wenzelm@16978
    89
  val searchf_tlr_unify_valid :
wenzelm@16978
    90
      (searchinfo
wenzelm@16978
    91
       -> term (* lhs *)
dixon@16004
    92
       -> match Seq.seq Seq.seq)
dixon@15814
    93
wenzelm@16978
    94
  (* specialise search constructor for conclusion skipping occurrences. *)
dixon@16004
    95
     val skip_first_occs_search :
dixon@16004
    96
        int -> ('a -> 'b -> 'c Seq.seq Seq.seq) -> 'a -> 'b -> 'c Seq.seq
dixon@16004
    97
  (* specialised search constructor for assumptions using skips *)
dixon@16004
    98
     val skip_first_asm_occs_search :
dixon@16004
    99
        ('a -> 'b -> 'c Seq.seq Seq.seq) ->
dixon@16004
   100
        'a -> int -> 'b -> 'c IsaPLib.skipseqT
dixon@16004
   101
dixon@16004
   102
  (* tactics and methods *)
wenzelm@16978
   103
  val eqsubst_asm_meth : int list -> thm list -> Proof.method
wenzelm@16978
   104
  val eqsubst_asm_tac :
wenzelm@16978
   105
      int list -> thm list -> int -> thm -> thm Seq.seq
wenzelm@16978
   106
  val eqsubst_asm_tac' :
dixon@16004
   107
      (* search function with skips *)
wenzelm@16978
   108
      (searchinfo -> int -> term -> match IsaPLib.skipseqT)
dixon@16004
   109
      -> int (* skip to *)
wenzelm@16978
   110
      -> thm (* rule *)
dixon@16004
   111
      -> int (* subgoal number *)
wenzelm@16978
   112
      -> thm (* tgt theorem with subgoals *)
wenzelm@16978
   113
      -> thm Seq.seq (* new theorems *)
dixon@15538
   114
wenzelm@16978
   115
  val eqsubst_meth : int list -> thm list -> Proof.method
wenzelm@16978
   116
  val eqsubst_tac :
wenzelm@16978
   117
      int list -> thm list -> int -> thm -> thm Seq.seq
wenzelm@16978
   118
  val eqsubst_tac' :
wenzelm@16978
   119
      (searchinfo -> term -> match Seq.seq)
wenzelm@16978
   120
      -> thm -> int -> thm -> thm Seq.seq
dixon@15538
   121
wenzelm@16978
   122
  val meth : (bool * int list) * thm list -> Proof.context -> Proof.method
paulson@15481
   123
  val setup : (Theory.theory -> Theory.theory) list
paulson@15481
   124
end;
paulson@15481
   125
dixon@16004
   126
wenzelm@18591
   127
functor EqSubstFun (EqRuleData : EQRULE_DATA): EQSUBST =
wenzelm@18591
   128
struct
paulson@15481
   129
dixon@15915
   130
  (* a type abriviation for match information *)
wenzelm@16978
   131
  type match =
wenzelm@16978
   132
       ((indexname * (sort * typ)) list (* type instantiations *)
wenzelm@16978
   133
        * (indexname * (typ * term)) list) (* term instantiations *)
wenzelm@16978
   134
       * (string * typ) list (* fake named type abs env *)
wenzelm@16978
   135
       * (string * typ) list (* type abs env *)
wenzelm@16978
   136
       * term (* outer term *)
dixon@15550
   137
wenzelm@16978
   138
  type searchinfo =
dixon@16004
   139
       Sign.sg (* sign for matching *)
dixon@16004
   140
       * int (* maxidx *)
dixon@16004
   141
       * BasicIsaFTerm.FcTerm (* focusterm to search under *)
dixon@15550
   142
dixon@15538
   143
(* FOR DEBUGGING...
dixon@15538
   144
type trace_subst_errT = int (* subgoal *)
wenzelm@16978
   145
        * thm (* thm with all goals *)
dixon@15538
   146
        * (Thm.cterm list (* certified free var placeholders for vars *)
wenzelm@16978
   147
           * thm)  (* trivial thm of goal concl *)
dixon@15538
   148
            (* possible matches/unifiers *)
wenzelm@16978
   149
        * thm (* rule *)
wenzelm@16978
   150
        * (((indexname * typ) list (* type instantiations *)
wenzelm@16978
   151
              * (indexname * term) list ) (* term instantiations *)
wenzelm@16978
   152
             * (string * typ) list (* Type abs env *)
wenzelm@16978
   153
             * term) (* outer term *);
dixon@15538
   154
dixon@15538
   155
val trace_subst_err = (ref NONE : trace_subst_errT option ref);
dixon@15538
   156
val trace_subst_search = ref false;
dixon@15538
   157
exception trace_subst_exp of trace_subst_errT;
dixon@15538
   158
 *)
dixon@15538
   159
wenzelm@16978
   160
(* also defined in /HOL/Tools/inductive_codegen.ML,
dixon@15538
   161
   maybe move this to seq.ML ? *)
dixon@15538
   162
infix 5 :->;
dixon@15538
   163
fun s :-> f = Seq.flat (Seq.map f s);
dixon@15538
   164
dixon@15814
   165
(* search from top, left to right, then down *)
wenzelm@16978
   166
fun search_tlr_all_f f ft =
paulson@15481
   167
    let
wenzelm@16978
   168
      fun maux ft =
wenzelm@16978
   169
          let val t' = (IsaFTerm.focus_of_fcterm ft)
wenzelm@16978
   170
            (* val _ =
wenzelm@16978
   171
                if !trace_subst_search then
dixon@15538
   172
                  (writeln ("Examining: " ^ (TermLib.string_of_term t'));
dixon@15538
   173
                   TermLib.writeterm t'; ())
dixon@15538
   174
                else (); *)
wenzelm@16978
   175
          in
wenzelm@16978
   176
          (case t' of
wenzelm@16978
   177
            (_ $ _) => Seq.append(maux (IsaFTerm.focus_left ft),
wenzelm@16978
   178
                       Seq.cons(f ft,
paulson@15481
   179
                                  maux (IsaFTerm.focus_right ft)))
dixon@15929
   180
          | (Abs _) => Seq.cons(f ft, maux (IsaFTerm.focus_abs ft))
dixon@15929
   181
          | leaf => Seq.single (f ft)) end
paulson@15481
   182
    in maux ft end;
paulson@15481
   183
dixon@15814
   184
(* search from top, left to right, then down *)
wenzelm@16978
   185
fun search_tlr_valid_f f ft =
dixon@15814
   186
    let
wenzelm@16978
   187
      fun maux ft =
wenzelm@16978
   188
          let
dixon@15814
   189
            val hereseq = if IsaFTerm.valid_match_start ft then f ft else Seq.empty
wenzelm@16978
   190
          in
wenzelm@16978
   191
          (case (IsaFTerm.focus_of_fcterm ft) of
wenzelm@16978
   192
            (_ $ _) => Seq.append(maux (IsaFTerm.focus_left ft),
wenzelm@16978
   193
                       Seq.cons(hereseq,
dixon@15814
   194
                                  maux (IsaFTerm.focus_right ft)))
dixon@15929
   195
          | (Abs _) => Seq.cons(hereseq, maux (IsaFTerm.focus_abs ft))
dixon@15929
   196
          | leaf => Seq.single (hereseq))
dixon@15814
   197
          end
dixon@15814
   198
    in maux ft end;
dixon@15814
   199
dixon@15814
   200
(* search all unifications *)
wenzelm@16978
   201
fun searchf_tlr_unify_all (sgn, maxidx, ft) lhs =
wenzelm@16978
   202
    IsaFTerm.find_fcterm_matches
wenzelm@16978
   203
      search_tlr_all_f
dixon@16004
   204
      (IsaFTerm.clean_unify_ft sgn maxidx lhs)
dixon@16004
   205
      ft;
paulson@15481
   206
dixon@15814
   207
(* search only for 'valid' unifiers (non abs subterms and non vars) *)
wenzelm@16978
   208
fun searchf_tlr_unify_valid (sgn, maxidx, ft) lhs  =
wenzelm@16978
   209
    IsaFTerm.find_fcterm_matches
wenzelm@16978
   210
      search_tlr_valid_f
dixon@16004
   211
      (IsaFTerm.clean_unify_ft sgn maxidx lhs)
dixon@16004
   212
      ft;
dixon@15929
   213
dixon@15814
   214
dixon@15538
   215
(* apply a substitution in the conclusion of the theorem th *)
dixon@15538
   216
(* cfvs are certified free var placeholders for goal params *)
dixon@15538
   217
(* conclthm is a theorem of for just the conclusion *)
dixon@15538
   218
(* m is instantiation/match information *)
dixon@15538
   219
(* rule is the equation for substitution *)
wenzelm@16978
   220
fun apply_subst_in_concl i th (cfvs, conclthm) rule m =
dixon@15538
   221
    (RWInst.rw m rule conclthm)
dixon@15855
   222
      |> IsaND.unfix_frees cfvs
dixon@15915
   223
      |> RWInst.beta_eta_contract
dixon@15538
   224
      |> (fn r => Tactic.rtac r i th);
paulson@15481
   225
paulson@15481
   226
(* substitute within the conclusion of goal i of gth, using a meta
dixon@15538
   227
equation rule. Note that we assume rule has var indicies zero'd *)
wenzelm@16978
   228
fun prep_concl_subst i gth =
wenzelm@16978
   229
    let
paulson@15481
   230
      val th = Thm.incr_indexes 1 gth;
paulson@15481
   231
      val tgt_term = Thm.prop_of th;
paulson@15481
   232
paulson@15481
   233
      val sgn = Thm.sign_of_thm th;
paulson@15481
   234
      val ctermify = Thm.cterm_of sgn;
paulson@15481
   235
      val trivify = Thm.trivial o ctermify;
paulson@15481
   236
paulson@15481
   237
      val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
paulson@15481
   238
      val cfvs = rev (map ctermify fvs);
paulson@15481
   239
dixon@15538
   240
      val conclterm = Logic.strip_imp_concl fixedbody;
dixon@15538
   241
      val conclthm = trivify conclterm;
dixon@15538
   242
      val maxidx = Term.maxidx_of_term conclterm;
wenzelm@16978
   243
      val ft = ((IsaFTerm.focus_right
dixon@16004
   244
                 o IsaFTerm.focus_left
wenzelm@16978
   245
                 o IsaFTerm.fcterm_of_term
dixon@16004
   246
                 o Thm.prop_of) conclthm)
paulson@15481
   247
    in
dixon@16004
   248
      ((cfvs, conclthm), (sgn, maxidx, ft))
paulson@15481
   249
    end;
paulson@15481
   250
paulson@15481
   251
(* substitute using an object or meta level equality *)
wenzelm@16978
   252
fun eqsubst_tac' searchf instepthm i th =
wenzelm@16978
   253
    let
dixon@16004
   254
      val (cvfsconclthm, searchinfo) = prep_concl_subst i th;
wenzelm@16978
   255
      val stepthms =
wenzelm@16978
   256
          Seq.map Drule.zero_var_indexes
dixon@15538
   257
                  (Seq.of_list (EqRuleData.prep_meta_eq instepthm));
dixon@15538
   258
      fun rewrite_with_thm r =
dixon@15538
   259
          let val (lhs,_) = Logic.dest_equals (Thm.concl_of r);
dixon@16004
   260
          in (searchf searchinfo lhs)
dixon@15538
   261
             :-> (apply_subst_in_concl i th cvfsconclthm r) end;
dixon@16004
   262
    in stepthms :-> rewrite_with_thm end;
dixon@15538
   263
dixon@15538
   264
dixon@16004
   265
(* Tactic.distinct_subgoals_tac -- fails to free type variables *)
dixon@15959
   266
wenzelm@16978
   267
(* custom version of distinct subgoals that works with term and
wenzelm@16978
   268
   type variables. Asssumes th is in beta-eta normal form.
dixon@15959
   269
   Also, does nothing if flexflex contraints are present. *)
dixon@15959
   270
fun distinct_subgoals th =
dixon@15959
   271
    if List.null (Thm.tpairs_of th) then
dixon@15959
   272
      let val (fixes,fixedthm) = IsaND.fix_vars_and_tvars th
dixon@15959
   273
        val (fixedthconcl,cprems) = IsaND.hide_prems fixedthm
dixon@15959
   274
      in
wenzelm@16978
   275
        IsaND.unfix_frees_and_tfrees
dixon@15959
   276
          fixes
wenzelm@16978
   277
          (Drule.implies_intr_list
wenzelm@16978
   278
             (Library.gen_distinct
dixon@15959
   279
                (fn (x, y) => Thm.term_of x = Thm.term_of y)
dixon@15959
   280
                cprems) fixedthconcl)
dixon@15959
   281
      end
dixon@15959
   282
    else th;
dixon@15538
   283
wenzelm@16978
   284
(* General substiuttion of multiple occurances using one of
dixon@15936
   285
   the given theorems*)
wenzelm@16978
   286
exception eqsubst_occL_exp of
wenzelm@16978
   287
          string * (int list) * (thm list) * int * thm;
wenzelm@16978
   288
fun skip_first_occs_search occ srchf sinfo lhs =
wenzelm@16978
   289
    case (IsaPLib.skipto_seqseq occ (srchf sinfo lhs)) of
dixon@16004
   290
      IsaPLib.skipmore _ => Seq.empty
dixon@16004
   291
    | IsaPLib.skipseq ss => Seq.flat ss;
dixon@16004
   292
wenzelm@16978
   293
fun eqsubst_tac occL thms i th =
dixon@15936
   294
    let val nprems = Thm.nprems_of th in
dixon@15936
   295
      if nprems < i then Seq.empty else
wenzelm@16978
   296
      let val thmseq = (Seq.of_list thms)
wenzelm@16978
   297
        fun apply_occ occ th =
wenzelm@16978
   298
            thmseq :->
wenzelm@16978
   299
                    (fn r => eqsubst_tac' (skip_first_occs_search
dixon@15936
   300
                                    occ searchf_tlr_unify_valid) r
dixon@15936
   301
                                 (i + ((Thm.nprems_of th) - nprems))
dixon@15936
   302
                                 th);
wenzelm@16978
   303
        val sortedoccL =
dixon@16004
   304
            Library.sort (Library.rev_order o Library.int_ord) occL;
dixon@15936
   305
      in
dixon@16004
   306
        Seq.map distinct_subgoals (Seq.EVERY (map apply_occ sortedoccL) th)
dixon@15936
   307
      end
dixon@15959
   308
    end
dixon@15959
   309
    handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
dixon@15959
   310
paulson@15481
   311
paulson@15481
   312
(* inthms are the given arguments in Isar, and treated as eqstep with
paulson@15481
   313
   the first one, then the second etc *)
dixon@15936
   314
fun eqsubst_meth occL inthms =
wenzelm@16978
   315
    Method.METHOD
dixon@15538
   316
      (fn facts =>
dixon@15936
   317
          HEADGOAL ( Method.insert_tac facts THEN' eqsubst_tac occL inthms ));
paulson@15481
   318
dixon@16004
   319
(* apply a substitution inside assumption j, keeps asm in the same place *)
wenzelm@16978
   320
fun apply_subst_in_asm i th rule ((cfvs, j, ngoalprems, pth),m) =
wenzelm@16978
   321
    let
dixon@16004
   322
      val th2 = Thm.rotate_rule (j - 1) i th; (* put premice first *)
wenzelm@16978
   323
      val preelimrule =
dixon@16004
   324
          (RWInst.rw m rule pth)
dixon@16004
   325
            |> (Seq.hd o Tactic.prune_params_tac)
dixon@16004
   326
            |> Thm.permute_prems 0 ~1 (* put old asm first *)
dixon@16004
   327
            |> IsaND.unfix_frees cfvs (* unfix any global params *)
dixon@16004
   328
            |> RWInst.beta_eta_contract; (* normal form *)
wenzelm@16978
   329
  (*    val elimrule =
dixon@16004
   330
          preelimrule
dixon@16004
   331
            |> Tactic.make_elim (* make into elim rule *)
dixon@16004
   332
            |> Thm.lift_rule (th2, i); (* lift into context *)
dixon@16007
   333
   *)
dixon@16004
   334
    in
dixon@16004
   335
      (* ~j because new asm starts at back, thus we subtract 1 *)
dixon@16007
   336
      Seq.map (Thm.rotate_rule (~j) ((Thm.nprems_of rule) + i))
dixon@16007
   337
      (Tactic.dtac preelimrule i th2)
dixon@16007
   338
wenzelm@16978
   339
      (* (Thm.bicompose
dixon@16004
   340
                 false (* use unification *)
dixon@16004
   341
                 (true, (* elim resolution *)
dixon@16007
   342
                  elimrule, (2 + (Thm.nprems_of rule)) - ngoalprems)
dixon@16007
   343
                 i th2) *)
dixon@16004
   344
    end;
paulson@15481
   345
paulson@15481
   346
dixon@15538
   347
(* prepare to substitute within the j'th premise of subgoal i of gth,
dixon@15538
   348
using a meta-level equation. Note that we assume rule has var indicies
dixon@15538
   349
zero'd. Note that we also assume that premt is the j'th premice of
dixon@15538
   350
subgoal i of gth. Note the repetition of work done for each
dixon@15538
   351
assumption, i.e. this can be made more efficient for search over
dixon@15538
   352
multiple assumptions.  *)
wenzelm@16978
   353
fun prep_subst_in_asm i gth j =
wenzelm@16978
   354
    let
paulson@15481
   355
      val th = Thm.incr_indexes 1 gth;
paulson@15481
   356
      val tgt_term = Thm.prop_of th;
paulson@15481
   357
paulson@15481
   358
      val sgn = Thm.sign_of_thm th;
paulson@15481
   359
      val ctermify = Thm.cterm_of sgn;
paulson@15481
   360
      val trivify = Thm.trivial o ctermify;
paulson@15481
   361
paulson@15481
   362
      val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
paulson@15481
   363
      val cfvs = rev (map ctermify fvs);
paulson@15481
   364
haftmann@18011
   365
      val asmt = nth (Logic.strip_imp_prems fixedbody) (j - 1);
dixon@15538
   366
      val asm_nprems = length (Logic.strip_imp_prems asmt);
dixon@15538
   367
dixon@15538
   368
      val pth = trivify asmt;
dixon@15538
   369
      val maxidx = Term.maxidx_of_term asmt;
dixon@15538
   370
wenzelm@16978
   371
      val ft = ((IsaFTerm.focus_right
wenzelm@16978
   372
                 o IsaFTerm.fcterm_of_term
dixon@16004
   373
                 o Thm.prop_of) pth)
dixon@16004
   374
    in ((cfvs, j, asm_nprems, pth), (sgn, maxidx, ft)) end;
paulson@15481
   375
dixon@15538
   376
(* prepare subst in every possible assumption *)
wenzelm@16978
   377
fun prep_subst_in_asms i gth =
dixon@16004
   378
    map (prep_subst_in_asm i gth)
wenzelm@16978
   379
        ((rev o IsaPLib.mk_num_list o length)
dixon@16004
   380
           (Logic.prems_of_goal (Thm.prop_of gth) i));
dixon@15538
   381
dixon@15538
   382
dixon@15538
   383
(* substitute in an assumption using an object or meta level equality *)
wenzelm@16978
   384
fun eqsubst_asm_tac' searchf skipocc instepthm i th =
wenzelm@16978
   385
    let
dixon@16004
   386
      val asmpreps = prep_subst_in_asms i th;
wenzelm@16978
   387
      val stepthms =
wenzelm@16978
   388
          Seq.map Drule.zero_var_indexes
dixon@16004
   389
              (Seq.of_list (EqRuleData.prep_meta_eq instepthm))
dixon@16004
   390
      fun rewrite_with_thm r =
dixon@16004
   391
          let val (lhs,_) = Logic.dest_equals (Thm.concl_of r)
dixon@16004
   392
            fun occ_search occ [] = Seq.empty
dixon@16004
   393
              | occ_search occ ((asminfo, searchinfo)::moreasms) =
wenzelm@16978
   394
                (case searchf searchinfo occ lhs of
dixon@16004
   395
                   IsaPLib.skipmore i => occ_search i moreasms
wenzelm@16978
   396
                 | IsaPLib.skipseq ss =>
dixon@16004
   397
                   Seq.append (Seq.map (Library.pair asminfo)
wenzelm@16978
   398
                                       (Seq.flat ss),
dixon@16004
   399
                               occ_search 1 moreasms))
dixon@16004
   400
                              (* find later substs also *)
wenzelm@16978
   401
          in
dixon@16004
   402
            (occ_search skipocc asmpreps) :-> (apply_subst_in_asm i th r)
dixon@16004
   403
          end;
dixon@16004
   404
    in stepthms :-> rewrite_with_thm end;
dixon@15538
   405
dixon@16004
   406
wenzelm@16978
   407
fun skip_first_asm_occs_search searchf sinfo occ lhs =
dixon@16004
   408
    IsaPLib.skipto_seqseq occ (searchf sinfo lhs);
dixon@16004
   409
wenzelm@16978
   410
fun eqsubst_asm_tac occL thms i th =
wenzelm@16978
   411
    let val nprems = Thm.nprems_of th
dixon@15538
   412
    in
dixon@16004
   413
      if nprems < i then Seq.empty else
wenzelm@16978
   414
      let val thmseq = (Seq.of_list thms)
wenzelm@16978
   415
        fun apply_occ occK th =
wenzelm@16978
   416
            thmseq :->
wenzelm@16978
   417
                    (fn r =>
wenzelm@16978
   418
                        eqsubst_asm_tac' (skip_first_asm_occs_search
dixon@16004
   419
                                            searchf_tlr_unify_valid) occK r
dixon@16004
   420
                                         (i + ((Thm.nprems_of th) - nprems))
dixon@16004
   421
                                         th);
wenzelm@16978
   422
        val sortedoccs =
dixon@16004
   423
            Library.sort (Library.rev_order o Library.int_ord) occL
dixon@16004
   424
      in
dixon@16004
   425
        Seq.map distinct_subgoals
dixon@16004
   426
                (Seq.EVERY (map apply_occ sortedoccs) th)
dixon@16004
   427
      end
dixon@16004
   428
    end
dixon@16004
   429
    handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
paulson@15481
   430
paulson@15481
   431
(* inthms are the given arguments in Isar, and treated as eqstep with
paulson@15481
   432
   the first one, then the second etc *)
dixon@15936
   433
fun eqsubst_asm_meth occL inthms =
wenzelm@16978
   434
    Method.METHOD
dixon@15538
   435
      (fn facts =>
dixon@15936
   436
          HEADGOAL (Method.insert_tac facts THEN' eqsubst_asm_tac occL inthms ));
paulson@15481
   437
paulson@15481
   438
(* combination method that takes a flag (true indicates that subst
paulson@15481
   439
should be done to an assumption, false = apply to the conclusion of
paulson@15481
   440
the goal) as well as the theorems to use *)
wenzelm@16978
   441
fun meth ((asmflag, occL), inthms) ctxt =
dixon@15936
   442
    if asmflag then eqsubst_asm_meth occL inthms else eqsubst_meth occL inthms;
paulson@15481
   443
paulson@15481
   444
(* syntax for options, given "(asm)" will give back true, without
paulson@15481
   445
   gives back false *)
paulson@15481
   446
val options_syntax =
paulson@15481
   447
    (Args.parens (Args.$$$ "asm") >> (K true)) ||
paulson@15481
   448
     (Scan.succeed false);
dixon@15936
   449
dixon@15929
   450
val ith_syntax =
dixon@15936
   451
    (Args.parens (Scan.repeat Args.nat))
dixon@15936
   452
      || (Scan.succeed [0]);
paulson@15481
   453
paulson@15481
   454
(* method syntax, first take options, then theorems *)
paulson@15481
   455
fun meth_syntax meth src ctxt =
wenzelm@16978
   456
    meth (snd (Method.syntax ((Scan.lift options_syntax)
wenzelm@16978
   457
                                -- (Scan.lift ith_syntax)
wenzelm@16978
   458
                                -- Attrib.local_thms) src ctxt))
paulson@15481
   459
         ctxt;
paulson@15481
   460
paulson@15481
   461
(* setup function for adding method to theory. *)
wenzelm@16978
   462
val setup =
paulson@15481
   463
    [Method.add_method ("subst", meth_syntax meth, "Substiution with an equation. Use \"(asm)\" option to substitute in an assumption.")];
paulson@15481
   464
wenzelm@16978
   465
end;