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