src/HOL/Tools/Quotient/quotient_tacs.ML
author wenzelm
Wed Dec 01 13:09:08 2010 +0100 (2010-12-01)
changeset 40840 2f97215e79bf
parent 40602 91e583511113
child 41228 e1fce873b814
permissions -rw-r--r--
just one Term.dest_funT;
haftmann@37744
     1
(*  Title:      HOL/Tools/Quotient/quotient_tacs.ML
kaliszyk@35222
     2
    Author:     Cezary Kaliszyk and Christian Urban
kaliszyk@35222
     3
wenzelm@35788
     4
Tactics for solving goal arising from lifting theorems to quotient
wenzelm@35788
     5
types.
kaliszyk@35222
     6
*)
kaliszyk@35222
     7
kaliszyk@35222
     8
signature QUOTIENT_TACS =
kaliszyk@35222
     9
sig
kaliszyk@35222
    10
  val regularize_tac: Proof.context -> int -> tactic
kaliszyk@35222
    11
  val injection_tac: Proof.context -> int -> tactic
kaliszyk@35222
    12
  val all_injection_tac: Proof.context -> int -> tactic
kaliszyk@35222
    13
  val clean_tac: Proof.context -> int -> tactic
urbanc@37593
    14
  
urbanc@38859
    15
  val descend_procedure_tac: Proof.context -> thm list -> int -> tactic
urbanc@38859
    16
  val descend_tac: Proof.context -> thm list -> int -> tactic
urbanc@37593
    17
 
urbanc@38859
    18
  val lift_procedure_tac: Proof.context -> thm list -> thm -> int -> tactic
urbanc@38859
    19
  val lift_tac: Proof.context -> thm list -> thm list -> int -> tactic
urbanc@37593
    20
urbanc@38625
    21
  val lifted: Proof.context -> typ list -> thm list -> thm -> thm
kaliszyk@35222
    22
  val lifted_attrib: attribute
kaliszyk@35222
    23
end;
kaliszyk@35222
    24
kaliszyk@35222
    25
structure Quotient_Tacs: QUOTIENT_TACS =
kaliszyk@35222
    26
struct
kaliszyk@35222
    27
kaliszyk@35222
    28
open Quotient_Info;
kaliszyk@35222
    29
open Quotient_Term;
kaliszyk@35222
    30
kaliszyk@35222
    31
kaliszyk@35222
    32
(** various helper fuctions **)
kaliszyk@35222
    33
kaliszyk@35222
    34
(* Since HOL_basic_ss is too "big" for us, we *)
kaliszyk@35222
    35
(* need to set up our own minimal simpset.    *)
kaliszyk@35222
    36
fun mk_minimal_ss ctxt =
kaliszyk@35222
    37
  Simplifier.context ctxt empty_ss
kaliszyk@35222
    38
    setsubgoaler asm_simp_tac
kaliszyk@35222
    39
    setmksimps (mksimps [])
kaliszyk@35222
    40
kaliszyk@35222
    41
(* composition of two theorems, used in maps *)
kaliszyk@35222
    42
fun OF1 thm1 thm2 = thm2 RS thm1
kaliszyk@35222
    43
kaliszyk@35222
    44
fun atomize_thm thm =
kaliszyk@35222
    45
let
wenzelm@36615
    46
  val thm' = Thm.legacy_freezeT (forall_intr_vars thm) (* FIXME/TODO: is this proper Isar-technology? *)
wenzelm@35625
    47
  val thm'' = Object_Logic.atomize (cprop_of thm')
kaliszyk@35222
    48
in
kaliszyk@35222
    49
  @{thm equal_elim_rule1} OF [thm'', thm']
kaliszyk@35222
    50
end
kaliszyk@35222
    51
kaliszyk@35222
    52
kaliszyk@35222
    53
kaliszyk@35222
    54
(*** Regularize Tactic ***)
kaliszyk@35222
    55
kaliszyk@35222
    56
(** solvers for equivp and quotient assumptions **)
kaliszyk@35222
    57
kaliszyk@35222
    58
fun equiv_tac ctxt =
kaliszyk@35222
    59
  REPEAT_ALL_NEW (resolve_tac (equiv_rules_get ctxt))
kaliszyk@35222
    60
kaliszyk@35222
    61
fun equiv_solver_tac ss = equiv_tac (Simplifier.the_context ss)
kaliszyk@35222
    62
val equiv_solver = Simplifier.mk_solver' "Equivalence goal solver" equiv_solver_tac
kaliszyk@35222
    63
kaliszyk@35222
    64
fun quotient_tac ctxt =
kaliszyk@35222
    65
  (REPEAT_ALL_NEW (FIRST'
kaliszyk@35222
    66
    [rtac @{thm identity_quotient},
kaliszyk@35222
    67
     resolve_tac (quotient_rules_get ctxt)]))
kaliszyk@35222
    68
kaliszyk@35222
    69
fun quotient_solver_tac ss = quotient_tac (Simplifier.the_context ss)
kaliszyk@35222
    70
val quotient_solver =
kaliszyk@35222
    71
  Simplifier.mk_solver' "Quotient goal solver" quotient_solver_tac
kaliszyk@35222
    72
kaliszyk@35222
    73
fun solve_quotient_assm ctxt thm =
kaliszyk@35222
    74
  case Seq.pull (quotient_tac ctxt 1 thm) of
kaliszyk@35222
    75
    SOME (t, _) => t
kaliszyk@35222
    76
  | _ => error "Solve_quotient_assm failed. Possibly a quotient theorem is missing."
kaliszyk@35222
    77
kaliszyk@35222
    78
kaliszyk@35222
    79
fun prep_trm thy (x, (T, t)) =
kaliszyk@35222
    80
  (cterm_of thy (Var (x, T)), cterm_of thy t)
kaliszyk@35222
    81
kaliszyk@35222
    82
fun prep_ty thy (x, (S, ty)) =
kaliszyk@35222
    83
  (ctyp_of thy (TVar (x, S)), ctyp_of thy ty)
kaliszyk@35222
    84
kaliszyk@35222
    85
fun get_match_inst thy pat trm =
kaliszyk@35222
    86
let
kaliszyk@35222
    87
  val univ = Unify.matchers thy [(pat, trm)]
wenzelm@35789
    88
  val SOME (env, _) = Seq.pull univ           (* raises Bind, if no unifier *)  (* FIXME fragile *)
kaliszyk@35222
    89
  val tenv = Vartab.dest (Envir.term_env env)
kaliszyk@35222
    90
  val tyenv = Vartab.dest (Envir.type_env env)
kaliszyk@35222
    91
in
kaliszyk@35222
    92
  (map (prep_ty thy) tyenv, map (prep_trm thy) tenv)
kaliszyk@35222
    93
end
kaliszyk@35222
    94
kaliszyk@35222
    95
(* Calculates the instantiations for the lemmas:
kaliszyk@35222
    96
kaliszyk@35222
    97
      ball_reg_eqv_range and bex_reg_eqv_range
kaliszyk@35222
    98
kaliszyk@35222
    99
   Since the left-hand-side contains a non-pattern '?P (f ?x)'
kaliszyk@35222
   100
   we rely on unification/instantiation to check whether the
kaliszyk@35222
   101
   theorem applies and return NONE if it doesn't.
kaliszyk@35222
   102
*)
kaliszyk@35222
   103
fun calculate_inst ctxt ball_bex_thm redex R1 R2 =
kaliszyk@35222
   104
let
kaliszyk@35222
   105
  val thy = ProofContext.theory_of ctxt
kaliszyk@35222
   106
  fun get_lhs thm = fst (Logic.dest_equals (Thm.concl_of thm))
kaliszyk@35222
   107
  val ty_inst = map (SOME o ctyp_of thy) [domain_type (fastype_of R2)]
kaliszyk@35222
   108
  val trm_inst = map (SOME o cterm_of thy) [R2, R1]
kaliszyk@35222
   109
in
kaliszyk@35222
   110
  case try (Drule.instantiate' ty_inst trm_inst) ball_bex_thm of
kaliszyk@35222
   111
    NONE => NONE
kaliszyk@35222
   112
  | SOME thm' =>
kaliszyk@35222
   113
      (case try (get_match_inst thy (get_lhs thm')) redex of
kaliszyk@35222
   114
        NONE => NONE
kaliszyk@35222
   115
      | SOME inst2 => try (Drule.instantiate inst2) thm')
kaliszyk@35222
   116
end
kaliszyk@35222
   117
kaliszyk@35222
   118
fun ball_bex_range_simproc ss redex =
kaliszyk@35222
   119
let
kaliszyk@35222
   120
  val ctxt = Simplifier.the_context ss
kaliszyk@35222
   121
in
kaliszyk@35222
   122
  case redex of
kaliszyk@35222
   123
    (Const (@{const_name "Ball"}, _) $ (Const (@{const_name "Respects"}, _) $
kaliszyk@35222
   124
      (Const (@{const_name "fun_rel"}, _) $ R1 $ R2)) $ _) =>
kaliszyk@35222
   125
        calculate_inst ctxt @{thm ball_reg_eqv_range[THEN eq_reflection]} redex R1 R2
kaliszyk@35222
   126
kaliszyk@35222
   127
  | (Const (@{const_name "Bex"}, _) $ (Const (@{const_name "Respects"}, _) $
kaliszyk@35222
   128
      (Const (@{const_name "fun_rel"}, _) $ R1 $ R2)) $ _) =>
kaliszyk@35222
   129
        calculate_inst ctxt @{thm bex_reg_eqv_range[THEN eq_reflection]} redex R1 R2
kaliszyk@35222
   130
kaliszyk@35222
   131
  | _ => NONE
kaliszyk@35222
   132
end
kaliszyk@35222
   133
kaliszyk@35222
   134
(* Regularize works as follows:
kaliszyk@35222
   135
kaliszyk@35222
   136
  0. preliminary simplification step according to
kaliszyk@35222
   137
     ball_reg_eqv bex_reg_eqv babs_reg_eqv ball_reg_eqv_range bex_reg_eqv_range
kaliszyk@35222
   138
kaliszyk@35222
   139
  1. eliminating simple Ball/Bex instances (ball_reg_right bex_reg_left)
kaliszyk@35222
   140
kaliszyk@35222
   141
  2. monos
kaliszyk@35222
   142
kaliszyk@35222
   143
  3. commutation rules for ball and bex (ball_all_comm bex_ex_comm)
kaliszyk@35222
   144
kaliszyk@35222
   145
  4. then rel-equalities, which need to be instantiated with 'eq_imp_rel'
kaliszyk@35222
   146
     to avoid loops
kaliszyk@35222
   147
kaliszyk@35222
   148
  5. then simplification like 0
kaliszyk@35222
   149
kaliszyk@35222
   150
  finally jump back to 1
kaliszyk@35222
   151
*)
kaliszyk@35222
   152
kaliszyk@37493
   153
fun reflp_get ctxt =
kaliszyk@37493
   154
  map_filter (fn th => if prems_of th = [] then SOME (OF1 @{thm equivp_reflp} th) else NONE
kaliszyk@37493
   155
    handle THM _ => NONE) (equiv_rules_get ctxt)
kaliszyk@37493
   156
kaliszyk@37493
   157
val eq_imp_rel = @{lemma "equivp R ==> a = b --> R a b" by (simp add: equivp_reflp)}
kaliszyk@37493
   158
kaliszyk@37493
   159
fun eq_imp_rel_get ctxt = map (OF1 eq_imp_rel) (equiv_rules_get ctxt)
kaliszyk@37493
   160
kaliszyk@35222
   161
fun regularize_tac ctxt =
kaliszyk@35222
   162
let
kaliszyk@35222
   163
  val thy = ProofContext.theory_of ctxt
kaliszyk@35222
   164
  val ball_pat = @{term "Ball (Respects (R1 ===> R2)) P"}
kaliszyk@35222
   165
  val bex_pat  = @{term "Bex (Respects (R1 ===> R2)) P"}
wenzelm@38715
   166
  val simproc = Simplifier.simproc_global_i thy "" [ball_pat, bex_pat] (K (ball_bex_range_simproc))
kaliszyk@35222
   167
  val simpset = (mk_minimal_ss ctxt)
kaliszyk@35222
   168
                       addsimps @{thms ball_reg_eqv bex_reg_eqv babs_reg_eqv babs_simp}
kaliszyk@35222
   169
                       addsimprocs [simproc]
kaliszyk@35222
   170
                       addSolver equiv_solver addSolver quotient_solver
kaliszyk@37493
   171
  val eq_eqvs = eq_imp_rel_get ctxt
kaliszyk@35222
   172
in
kaliszyk@35222
   173
  simp_tac simpset THEN'
kaliszyk@35222
   174
  REPEAT_ALL_NEW (CHANGED o FIRST'
kaliszyk@35222
   175
    [resolve_tac @{thms ball_reg_right bex_reg_left bex1_bexeq_reg},
kaliszyk@35222
   176
     resolve_tac (Inductive.get_monos ctxt),
kaliszyk@35222
   177
     resolve_tac @{thms ball_all_comm bex_ex_comm},
kaliszyk@35222
   178
     resolve_tac eq_eqvs,
kaliszyk@35222
   179
     simp_tac simpset])
kaliszyk@35222
   180
end
kaliszyk@35222
   181
kaliszyk@35222
   182
kaliszyk@35222
   183
kaliszyk@35222
   184
(*** Injection Tactic ***)
kaliszyk@35222
   185
kaliszyk@35222
   186
(* Looks for Quot_True assumptions, and in case its parameter
kaliszyk@35222
   187
   is an application, it returns the function and the argument.
kaliszyk@35222
   188
*)
kaliszyk@35222
   189
fun find_qt_asm asms =
kaliszyk@35222
   190
let
kaliszyk@35222
   191
  fun find_fun trm =
kaliszyk@35222
   192
    case trm of
kaliszyk@35222
   193
      (Const(@{const_name Trueprop}, _) $ (Const (@{const_name Quot_True}, _) $ _)) => true
kaliszyk@35222
   194
    | _ => false
kaliszyk@35222
   195
in
kaliszyk@35222
   196
 case find_first find_fun asms of
kaliszyk@35222
   197
   SOME (_ $ (_ $ (f $ a))) => SOME (f, a)
kaliszyk@35222
   198
 | _ => NONE
kaliszyk@35222
   199
end
kaliszyk@35222
   200
kaliszyk@35222
   201
fun quot_true_simple_conv ctxt fnctn ctrm =
kaliszyk@35222
   202
  case (term_of ctrm) of
kaliszyk@35222
   203
    (Const (@{const_name Quot_True}, _) $ x) =>
kaliszyk@35222
   204
    let
kaliszyk@35222
   205
      val fx = fnctn x;
kaliszyk@35222
   206
      val thy = ProofContext.theory_of ctxt;
kaliszyk@35222
   207
      val cx = cterm_of thy x;
kaliszyk@35222
   208
      val cfx = cterm_of thy fx;
kaliszyk@35222
   209
      val cxt = ctyp_of thy (fastype_of x);
kaliszyk@35222
   210
      val cfxt = ctyp_of thy (fastype_of fx);
kaliszyk@35222
   211
      val thm = Drule.instantiate' [SOME cxt, SOME cfxt] [SOME cx, SOME cfx] @{thm QT_imp}
kaliszyk@35222
   212
    in
kaliszyk@35222
   213
      Conv.rewr_conv thm ctrm
kaliszyk@35222
   214
    end
kaliszyk@35222
   215
kaliszyk@35222
   216
fun quot_true_conv ctxt fnctn ctrm =
kaliszyk@35222
   217
  case (term_of ctrm) of
kaliszyk@35222
   218
    (Const (@{const_name Quot_True}, _) $ _) =>
kaliszyk@35222
   219
      quot_true_simple_conv ctxt fnctn ctrm
kaliszyk@35222
   220
  | _ $ _ => Conv.comb_conv (quot_true_conv ctxt fnctn) ctrm
kaliszyk@35222
   221
  | Abs _ => Conv.abs_conv (fn (_, ctxt) => quot_true_conv ctxt fnctn) ctxt ctrm
kaliszyk@35222
   222
  | _ => Conv.all_conv ctrm
kaliszyk@35222
   223
kaliszyk@35222
   224
fun quot_true_tac ctxt fnctn =
kaliszyk@35222
   225
   CONVERSION
kaliszyk@35222
   226
    ((Conv.params_conv ~1 (fn ctxt =>
kaliszyk@35222
   227
       (Conv.prems_conv ~1 (quot_true_conv ctxt fnctn)))) ctxt)
kaliszyk@35222
   228
kaliszyk@35222
   229
fun dest_comb (f $ a) = (f, a)
kaliszyk@35222
   230
fun dest_bcomb ((_ $ l) $ r) = (l, r)
kaliszyk@35222
   231
kaliszyk@35222
   232
fun unlam t =
kaliszyk@35222
   233
  case t of
kaliszyk@35222
   234
    (Abs a) => snd (Term.dest_abs a)
kaliszyk@35222
   235
  | _ => unlam (Abs("", domain_type (fastype_of t), (incr_boundvars 1 t) $ (Bound 0)))
kaliszyk@35222
   236
kaliszyk@35222
   237
val bare_concl = HOLogic.dest_Trueprop o Logic.strip_assums_concl
kaliszyk@35222
   238
kaliszyk@35222
   239
(* We apply apply_rsp only in case if the type needs lifting.
kaliszyk@35222
   240
   This is the case if the type of the data in the Quot_True
kaliszyk@35222
   241
   assumption is different from the corresponding type in the goal.
kaliszyk@35222
   242
*)
kaliszyk@35222
   243
val apply_rsp_tac =
kaliszyk@35222
   244
  Subgoal.FOCUS (fn {concl, asms, context,...} =>
kaliszyk@35222
   245
  let
kaliszyk@35222
   246
    val bare_concl = HOLogic.dest_Trueprop (term_of concl)
kaliszyk@35222
   247
    val qt_asm = find_qt_asm (map term_of asms)
kaliszyk@35222
   248
  in
kaliszyk@35222
   249
    case (bare_concl, qt_asm) of
kaliszyk@35222
   250
      (R2 $ (f $ x) $ (g $ y), SOME (qt_fun, qt_arg)) =>
kaliszyk@35222
   251
         if fastype_of qt_fun = fastype_of f
kaliszyk@35222
   252
         then no_tac
kaliszyk@35222
   253
         else
kaliszyk@35222
   254
           let
kaliszyk@35222
   255
             val ty_x = fastype_of x
kaliszyk@35222
   256
             val ty_b = fastype_of qt_arg
kaliszyk@35222
   257
             val ty_f = range_type (fastype_of f)
kaliszyk@35222
   258
             val thy = ProofContext.theory_of context
kaliszyk@35222
   259
             val ty_inst = map (SOME o (ctyp_of thy)) [ty_x, ty_b, ty_f]
kaliszyk@35222
   260
             val t_inst = map (SOME o (cterm_of thy)) [R2, f, g, x, y];
kaliszyk@35222
   261
             val inst_thm = Drule.instantiate' ty_inst
kaliszyk@35222
   262
               ([NONE, NONE, NONE] @ t_inst) @{thm apply_rsp}
kaliszyk@35222
   263
           in
kaliszyk@37493
   264
             (rtac inst_thm THEN' SOLVED' (quotient_tac context)) 1
kaliszyk@35222
   265
           end
kaliszyk@35222
   266
    | _ => no_tac
kaliszyk@35222
   267
  end)
kaliszyk@35222
   268
kaliszyk@35222
   269
(* Instantiates and applies 'equals_rsp'. Since the theorem is
kaliszyk@35222
   270
   complex we rely on instantiation to tell us if it applies
kaliszyk@35222
   271
*)
kaliszyk@35222
   272
fun equals_rsp_tac R ctxt =
kaliszyk@35222
   273
let
kaliszyk@35222
   274
  val thy = ProofContext.theory_of ctxt
kaliszyk@35222
   275
in
kaliszyk@35222
   276
  case try (cterm_of thy) R of (* There can be loose bounds in R *)
kaliszyk@35222
   277
    SOME ctm =>
kaliszyk@35222
   278
      let
kaliszyk@35222
   279
        val ty = domain_type (fastype_of R)
kaliszyk@35222
   280
      in
kaliszyk@35222
   281
        case try (Drule.instantiate' [SOME (ctyp_of thy ty)]
kaliszyk@35222
   282
          [SOME (cterm_of thy R)]) @{thm equals_rsp} of
kaliszyk@35222
   283
          SOME thm => rtac thm THEN' quotient_tac ctxt
kaliszyk@35222
   284
        | NONE => K no_tac
kaliszyk@35222
   285
      end
kaliszyk@35222
   286
  | _ => K no_tac
kaliszyk@35222
   287
end
kaliszyk@35222
   288
kaliszyk@35222
   289
fun rep_abs_rsp_tac ctxt =
kaliszyk@35222
   290
  SUBGOAL (fn (goal, i) =>
kaliszyk@35222
   291
    case (try bare_concl goal) of
kaliszyk@35843
   292
      SOME (rel $ _ $ (rep $ (Bound _ $ _))) => no_tac
kaliszyk@35843
   293
    | SOME (rel $ _ $ (rep $ (abs $ _))) =>
kaliszyk@35222
   294
        let
kaliszyk@35222
   295
          val thy = ProofContext.theory_of ctxt;
wenzelm@40840
   296
          val (ty_a, ty_b) = dest_funT (fastype_of abs);
kaliszyk@35222
   297
          val ty_inst = map (SOME o (ctyp_of thy)) [ty_a, ty_b];
kaliszyk@35222
   298
        in
kaliszyk@35222
   299
          case try (map (SOME o (cterm_of thy))) [rel, abs, rep] of
kaliszyk@35222
   300
            SOME t_inst =>
kaliszyk@35222
   301
              (case try (Drule.instantiate' ty_inst t_inst) @{thm rep_abs_rsp} of
kaliszyk@35222
   302
                SOME inst_thm => (rtac inst_thm THEN' quotient_tac ctxt) i
kaliszyk@35222
   303
              | NONE => no_tac)
kaliszyk@35222
   304
          | NONE => no_tac
kaliszyk@35222
   305
        end
kaliszyk@35222
   306
    | _ => no_tac)
kaliszyk@35222
   307
kaliszyk@35222
   308
kaliszyk@35222
   309
urbanc@38718
   310
(* Injection means to prove that the regularized theorem implies
kaliszyk@35222
   311
   the abs/rep injected one.
kaliszyk@35222
   312
kaliszyk@35222
   313
   The deterministic part:
kaliszyk@35222
   314
    - remove lambdas from both sides
kaliszyk@35222
   315
    - prove Ball/Bex/Babs equalities using ball_rsp, bex_rsp, babs_rsp
urbanc@38317
   316
    - prove Ball/Bex relations using fun_relI
kaliszyk@35222
   317
    - reflexivity of equality
kaliszyk@35222
   318
    - prove equality of relations using equals_rsp
kaliszyk@35222
   319
    - use user-supplied RSP theorems
kaliszyk@35222
   320
    - solve 'relation of relations' goals using quot_rel_rsp
kaliszyk@35222
   321
    - remove rep_abs from the right side
kaliszyk@35222
   322
      (Lambdas under respects may have left us some assumptions)
kaliszyk@35222
   323
kaliszyk@35222
   324
   Then in order:
kaliszyk@35222
   325
    - split applications of lifted type (apply_rsp)
kaliszyk@35222
   326
    - split applications of non-lifted type (cong_tac)
kaliszyk@35222
   327
    - apply extentionality
kaliszyk@35222
   328
    - assumption
kaliszyk@35222
   329
    - reflexivity of the relation
kaliszyk@35222
   330
*)
kaliszyk@35222
   331
fun injection_match_tac ctxt = SUBGOAL (fn (goal, i) =>
kaliszyk@35222
   332
(case (bare_concl goal) of
kaliszyk@35222
   333
    (* (R1 ===> R2) (%x...) (%x...) ----> [|R1 x y|] ==> R2 (...x) (...y) *)
kaliszyk@35222
   334
  (Const (@{const_name fun_rel}, _) $ _ $ _) $ (Abs _) $ (Abs _)
urbanc@38317
   335
      => rtac @{thm fun_relI} THEN' quot_true_tac ctxt unlam
kaliszyk@35222
   336
kaliszyk@35222
   337
    (* (op =) (Ball...) (Ball...) ----> (op =) (...) (...) *)
haftmann@38864
   338
| (Const (@{const_name HOL.eq},_) $
kaliszyk@35222
   339
    (Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
kaliszyk@35222
   340
    (Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _))
kaliszyk@35222
   341
      => rtac @{thm ball_rsp} THEN' dtac @{thm QT_all}
kaliszyk@35222
   342
kaliszyk@35222
   343
    (* (R1 ===> op =) (Ball...) (Ball...) ----> [|R1 x y|] ==> (Ball...x) = (Ball...y) *)
kaliszyk@35222
   344
| (Const (@{const_name fun_rel}, _) $ _ $ _) $
kaliszyk@35222
   345
    (Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
kaliszyk@35222
   346
    (Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
urbanc@38317
   347
      => rtac @{thm fun_relI} THEN' quot_true_tac ctxt unlam
kaliszyk@35222
   348
kaliszyk@35222
   349
    (* (op =) (Bex...) (Bex...) ----> (op =) (...) (...) *)
haftmann@38864
   350
| Const (@{const_name HOL.eq},_) $
kaliszyk@35222
   351
    (Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
kaliszyk@35222
   352
    (Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
kaliszyk@35222
   353
      => rtac @{thm bex_rsp} THEN' dtac @{thm QT_ex}
kaliszyk@35222
   354
kaliszyk@35222
   355
    (* (R1 ===> op =) (Bex...) (Bex...) ----> [|R1 x y|] ==> (Bex...x) = (Bex...y) *)
kaliszyk@35222
   356
| (Const (@{const_name fun_rel}, _) $ _ $ _) $
kaliszyk@35222
   357
    (Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
kaliszyk@35222
   358
    (Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
urbanc@38317
   359
      => rtac @{thm fun_relI} THEN' quot_true_tac ctxt unlam
kaliszyk@35222
   360
kaliszyk@35222
   361
| (Const (@{const_name fun_rel}, _) $ _ $ _) $
kaliszyk@35222
   362
    (Const(@{const_name Bex1_rel},_) $ _) $ (Const(@{const_name Bex1_rel},_) $ _)
kaliszyk@35222
   363
      => rtac @{thm bex1_rel_rsp} THEN' quotient_tac ctxt
kaliszyk@35222
   364
kaliszyk@35222
   365
| (_ $
kaliszyk@35222
   366
    (Const(@{const_name Babs},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
kaliszyk@35222
   367
    (Const(@{const_name Babs},_) $ (Const (@{const_name Respects}, _) $ _) $ _))
kaliszyk@35222
   368
      => rtac @{thm babs_rsp} THEN' RANGE [quotient_tac ctxt]
kaliszyk@35222
   369
haftmann@38864
   370
| Const (@{const_name HOL.eq},_) $ (R $ _ $ _) $ (_ $ _ $ _) =>
kaliszyk@35222
   371
   (rtac @{thm refl} ORELSE'
kaliszyk@35222
   372
    (equals_rsp_tac R ctxt THEN' RANGE [
kaliszyk@35222
   373
       quot_true_tac ctxt (fst o dest_bcomb), quot_true_tac ctxt (snd o dest_bcomb)]))
kaliszyk@35222
   374
kaliszyk@35222
   375
    (* reflexivity of operators arising from Cong_tac *)
haftmann@38864
   376
| Const (@{const_name HOL.eq},_) $ _ $ _ => rtac @{thm refl}
kaliszyk@35222
   377
kaliszyk@35222
   378
   (* respectfulness of constants; in particular of a simple relation *)
kaliszyk@35222
   379
| _ $ (Const _) $ (Const _)  (* fun_rel, list_rel, etc but not equality *)
kaliszyk@35222
   380
    => resolve_tac (rsp_rules_get ctxt) THEN_ALL_NEW quotient_tac ctxt
kaliszyk@35222
   381
kaliszyk@35222
   382
    (* R (...) (Rep (Abs ...)) ----> R (...) (...) *)
haftmann@40602
   383
    (* observe map_fun *)
kaliszyk@35222
   384
| _ $ _ $ _
kaliszyk@35222
   385
    => (rtac @{thm quot_rel_rsp} THEN_ALL_NEW quotient_tac ctxt)
kaliszyk@35222
   386
       ORELSE' rep_abs_rsp_tac ctxt
kaliszyk@35222
   387
kaliszyk@35222
   388
| _ => K no_tac
kaliszyk@35222
   389
) i)
kaliszyk@35222
   390
kaliszyk@35222
   391
fun injection_step_tac ctxt rel_refl =
kaliszyk@35222
   392
 FIRST' [
kaliszyk@35222
   393
    injection_match_tac ctxt,
kaliszyk@35222
   394
kaliszyk@35222
   395
    (* R (t $ ...) (t' $ ...) ----> apply_rsp   provided type of t needs lifting *)
kaliszyk@35222
   396
    apply_rsp_tac ctxt THEN'
kaliszyk@35222
   397
                 RANGE [quot_true_tac ctxt (fst o dest_comb), quot_true_tac ctxt (snd o dest_comb)],
kaliszyk@35222
   398
kaliszyk@35222
   399
    (* (op =) (t $ ...) (t' $ ...) ----> Cong   provided type of t does not need lifting *)
kaliszyk@35222
   400
    (* merge with previous tactic *)
kaliszyk@35222
   401
    Cong_Tac.cong_tac @{thm cong} THEN'
kaliszyk@35222
   402
                 RANGE [quot_true_tac ctxt (fst o dest_comb), quot_true_tac ctxt (snd o dest_comb)],
kaliszyk@35222
   403
kaliszyk@35222
   404
    (* (op =) (%x...) (%y...) ----> (op =) (...) (...) *)
kaliszyk@35222
   405
    rtac @{thm ext} THEN' quot_true_tac ctxt unlam,
kaliszyk@35222
   406
kaliszyk@35222
   407
    (* resolving with R x y assumptions *)
kaliszyk@35222
   408
    atac,
kaliszyk@35222
   409
kaliszyk@35222
   410
    (* reflexivity of the basic relations *)
kaliszyk@35222
   411
    (* R ... ... *)
kaliszyk@35222
   412
    resolve_tac rel_refl]
kaliszyk@35222
   413
kaliszyk@35222
   414
fun injection_tac ctxt =
kaliszyk@35222
   415
let
kaliszyk@37493
   416
  val rel_refl = reflp_get ctxt
kaliszyk@35222
   417
in
kaliszyk@35222
   418
  injection_step_tac ctxt rel_refl
kaliszyk@35222
   419
end
kaliszyk@35222
   420
kaliszyk@35222
   421
fun all_injection_tac ctxt =
kaliszyk@35222
   422
  REPEAT_ALL_NEW (injection_tac ctxt)
kaliszyk@35222
   423
kaliszyk@35222
   424
kaliszyk@35222
   425
kaliszyk@35222
   426
(*** Cleaning of the Theorem ***)
kaliszyk@35222
   427
haftmann@40602
   428
(* expands all map_funs, except in front of the (bound) variables listed in xs *)
haftmann@40602
   429
fun map_fun_simple_conv xs ctrm =
kaliszyk@35222
   430
  case (term_of ctrm) of
haftmann@40602
   431
    ((Const (@{const_name "map_fun"}, _) $ _ $ _) $ h $ _) =>
kaliszyk@35222
   432
        if member (op=) xs h
kaliszyk@35222
   433
        then Conv.all_conv ctrm
haftmann@40602
   434
        else Conv.rewr_conv @{thm map_fun_apply [THEN eq_reflection]} ctrm
kaliszyk@35222
   435
  | _ => Conv.all_conv ctrm
kaliszyk@35222
   436
haftmann@40602
   437
fun map_fun_conv xs ctxt ctrm =
kaliszyk@35222
   438
  case (term_of ctrm) of
haftmann@40602
   439
      _ $ _ => (Conv.comb_conv (map_fun_conv xs ctxt) then_conv
haftmann@40602
   440
                map_fun_simple_conv xs) ctrm
haftmann@40602
   441
    | Abs _ => Conv.abs_conv (fn (x, ctxt) => map_fun_conv ((term_of x)::xs) ctxt) ctxt ctrm
kaliszyk@35222
   442
    | _ => Conv.all_conv ctrm
kaliszyk@35222
   443
haftmann@40602
   444
fun map_fun_tac ctxt = CONVERSION (map_fun_conv [] ctxt)
kaliszyk@35222
   445
kaliszyk@35222
   446
(* custom matching functions *)
kaliszyk@35222
   447
fun mk_abs u i t =
kaliszyk@35222
   448
  if incr_boundvars i u aconv t then Bound i else
kaliszyk@35222
   449
  case t of
kaliszyk@35222
   450
    t1 $ t2 => mk_abs u i t1 $ mk_abs u i t2
kaliszyk@35222
   451
  | Abs (s, T, t') => Abs (s, T, mk_abs u (i + 1) t')
kaliszyk@35222
   452
  | Bound j => if i = j then error "make_inst" else t
kaliszyk@35222
   453
  | _ => t
kaliszyk@35222
   454
kaliszyk@35222
   455
fun make_inst lhs t =
kaliszyk@35222
   456
let
kaliszyk@35222
   457
  val _ $ (Abs (_, _, (_ $ ((f as Var (_, Type ("fun", [T, _]))) $ u)))) = lhs;
kaliszyk@35222
   458
  val _ $ (Abs (_, _, (_ $ g))) = t;
kaliszyk@35222
   459
in
kaliszyk@35222
   460
  (f, Abs ("x", T, mk_abs u 0 g))
kaliszyk@35222
   461
end
kaliszyk@35222
   462
kaliszyk@35222
   463
fun make_inst_id lhs t =
kaliszyk@35222
   464
let
kaliszyk@35222
   465
  val _ $ (Abs (_, _, (f as Var (_, Type ("fun", [T, _]))) $ u)) = lhs;
kaliszyk@35222
   466
  val _ $ (Abs (_, _, g)) = t;
kaliszyk@35222
   467
in
kaliszyk@35222
   468
  (f, Abs ("x", T, mk_abs u 0 g))
kaliszyk@35222
   469
end
kaliszyk@35222
   470
kaliszyk@35222
   471
(* Simplifies a redex using the 'lambda_prs' theorem.
kaliszyk@35222
   472
   First instantiates the types and known subterms.
kaliszyk@35222
   473
   Then solves the quotient assumptions to get Rep2 and Abs1
kaliszyk@35222
   474
   Finally instantiates the function f using make_inst
kaliszyk@35222
   475
   If Rep2 is an identity then the pattern is simpler and
kaliszyk@35222
   476
   make_inst_id is used
kaliszyk@35222
   477
*)
kaliszyk@35222
   478
fun lambda_prs_simple_conv ctxt ctrm =
kaliszyk@35222
   479
  case (term_of ctrm) of
haftmann@40602
   480
    (Const (@{const_name map_fun}, _) $ r1 $ a2) $ (Abs _) =>
kaliszyk@35222
   481
      let
kaliszyk@35222
   482
        val thy = ProofContext.theory_of ctxt
wenzelm@40840
   483
        val (ty_b, ty_a) = dest_funT (fastype_of r1)
wenzelm@40840
   484
        val (ty_c, ty_d) = dest_funT (fastype_of a2)
kaliszyk@35222
   485
        val tyinst = map (SOME o (ctyp_of thy)) [ty_a, ty_b, ty_c, ty_d]
kaliszyk@35222
   486
        val tinst = [NONE, NONE, SOME (cterm_of thy r1), NONE, SOME (cterm_of thy a2)]
kaliszyk@35222
   487
        val thm1 = Drule.instantiate' tyinst tinst @{thm lambda_prs[THEN eq_reflection]}
kaliszyk@35222
   488
        val thm2 = solve_quotient_assm ctxt (solve_quotient_assm ctxt thm1)
kaliszyk@35222
   489
        val thm3 = MetaSimplifier.rewrite_rule @{thms id_apply[THEN eq_reflection]} thm2
kaliszyk@35222
   490
        val (insp, inst) =
kaliszyk@35222
   491
          if ty_c = ty_d
kaliszyk@35222
   492
          then make_inst_id (term_of (Thm.lhs_of thm3)) (term_of ctrm)
kaliszyk@35222
   493
          else make_inst (term_of (Thm.lhs_of thm3)) (term_of ctrm)
kaliszyk@35222
   494
        val thm4 = Drule.instantiate ([], [(cterm_of thy insp, cterm_of thy inst)]) thm3
kaliszyk@35222
   495
      in
kaliszyk@35222
   496
        Conv.rewr_conv thm4 ctrm
kaliszyk@35222
   497
      end
kaliszyk@35222
   498
  | _ => Conv.all_conv ctrm
kaliszyk@35222
   499
wenzelm@36936
   500
fun lambda_prs_conv ctxt = Conv.top_conv lambda_prs_simple_conv ctxt
kaliszyk@35222
   501
fun lambda_prs_tac ctxt = CONVERSION (lambda_prs_conv ctxt)
kaliszyk@35222
   502
kaliszyk@35222
   503
kaliszyk@35222
   504
(* Cleaning consists of:
kaliszyk@35222
   505
kaliszyk@35222
   506
  1. unfolding of ---> in front of everything, except
kaliszyk@35222
   507
     bound variables (this prevents lambda_prs from
kaliszyk@35222
   508
     becoming stuck)
kaliszyk@35222
   509
kaliszyk@35222
   510
  2. simplification with lambda_prs
kaliszyk@35222
   511
kaliszyk@35222
   512
  3. simplification with:
kaliszyk@35222
   513
kaliszyk@35222
   514
      - Quotient_abs_rep Quotient_rel_rep
kaliszyk@35222
   515
        babs_prs all_prs ex_prs ex1_prs
kaliszyk@35222
   516
kaliszyk@35222
   517
      - id_simps and preservation lemmas and
kaliszyk@35222
   518
kaliszyk@35222
   519
      - symmetric versions of the definitions
kaliszyk@35222
   520
        (that is definitions of quotient constants
kaliszyk@35222
   521
         are folded)
kaliszyk@35222
   522
kaliszyk@35222
   523
  4. test for refl
kaliszyk@35222
   524
*)
kaliszyk@35222
   525
fun clean_tac lthy =
kaliszyk@35222
   526
let
wenzelm@36945
   527
  val defs = map (Thm.symmetric o #def) (qconsts_dest lthy)
kaliszyk@35222
   528
  val prs = prs_rules_get lthy
kaliszyk@35222
   529
  val ids = id_simps_get lthy
kaliszyk@35222
   530
  val thms = @{thms Quotient_abs_rep Quotient_rel_rep babs_prs all_prs ex_prs ex1_prs} @ ids @ prs @ defs
kaliszyk@35222
   531
kaliszyk@35222
   532
  val ss = (mk_minimal_ss lthy) addsimps thms addSolver quotient_solver
kaliszyk@35222
   533
in
haftmann@40602
   534
  EVERY' [map_fun_tac lthy,
kaliszyk@35222
   535
          lambda_prs_tac lthy,
kaliszyk@35222
   536
          simp_tac ss,
kaliszyk@35222
   537
          TRY o rtac refl]
kaliszyk@35222
   538
end
kaliszyk@35222
   539
kaliszyk@35222
   540
urbanc@38718
   541
(* Tactic for Generalising Free Variables in a Goal *)
kaliszyk@35222
   542
kaliszyk@35222
   543
fun inst_spec ctrm =
kaliszyk@35222
   544
   Drule.instantiate' [SOME (ctyp_of_term ctrm)] [NONE, SOME ctrm] @{thm spec}
kaliszyk@35222
   545
kaliszyk@35222
   546
fun inst_spec_tac ctrms =
kaliszyk@35222
   547
  EVERY' (map (dtac o inst_spec) ctrms)
kaliszyk@35222
   548
kaliszyk@35222
   549
fun all_list xs trm =
kaliszyk@35222
   550
  fold (fn (x, T) => fn t' => HOLogic.mk_all (x, T, t')) xs trm
kaliszyk@35222
   551
kaliszyk@35222
   552
fun apply_under_Trueprop f =
kaliszyk@35222
   553
  HOLogic.dest_Trueprop #> f #> HOLogic.mk_Trueprop
kaliszyk@35222
   554
kaliszyk@35222
   555
fun gen_frees_tac ctxt =
kaliszyk@35222
   556
  SUBGOAL (fn (concl, i) =>
kaliszyk@35222
   557
    let
kaliszyk@35222
   558
      val thy = ProofContext.theory_of ctxt
kaliszyk@35222
   559
      val vrs = Term.add_frees concl []
kaliszyk@35222
   560
      val cvrs = map (cterm_of thy o Free) vrs
kaliszyk@35222
   561
      val concl' = apply_under_Trueprop (all_list vrs) concl
kaliszyk@35222
   562
      val goal = Logic.mk_implies (concl', concl)
kaliszyk@35222
   563
      val rule = Goal.prove ctxt [] [] goal
kaliszyk@35222
   564
        (K (EVERY1 [inst_spec_tac (rev cvrs), atac]))
kaliszyk@35222
   565
    in
kaliszyk@35222
   566
      rtac rule i
kaliszyk@35222
   567
    end)
kaliszyk@35222
   568
kaliszyk@35222
   569
kaliszyk@35222
   570
(** The General Shape of the Lifting Procedure **)
kaliszyk@35222
   571
kaliszyk@35222
   572
(* - A is the original raw theorem
kaliszyk@35222
   573
   - B is the regularized theorem
kaliszyk@35222
   574
   - C is the rep/abs injected version of B
kaliszyk@35222
   575
   - D is the lifted theorem
kaliszyk@35222
   576
kaliszyk@35222
   577
   - 1st prem is the regularization step
kaliszyk@35222
   578
   - 2nd prem is the rep/abs injection step
kaliszyk@35222
   579
   - 3rd prem is the cleaning part
kaliszyk@35222
   580
kaliszyk@35222
   581
   the Quot_True premise in 2nd records the lifted theorem
kaliszyk@35222
   582
*)
kaliszyk@35222
   583
val lifting_procedure_thm =
kaliszyk@35222
   584
  @{lemma  "[|A;
kaliszyk@35222
   585
              A --> B;
kaliszyk@35222
   586
              Quot_True D ==> B = C;
kaliszyk@35222
   587
              C = D|] ==> D"
kaliszyk@35222
   588
      by (simp add: Quot_True_def)}
kaliszyk@35222
   589
kaliszyk@35222
   590
fun lift_match_error ctxt msg rtrm qtrm =
kaliszyk@35222
   591
let
kaliszyk@35222
   592
  val rtrm_str = Syntax.string_of_term ctxt rtrm
kaliszyk@35222
   593
  val qtrm_str = Syntax.string_of_term ctxt qtrm
kaliszyk@35222
   594
  val msg = cat_lines [enclose "[" "]" msg, "The quotient theorem", qtrm_str,
kaliszyk@35222
   595
    "", "does not match with original theorem", rtrm_str]
kaliszyk@35222
   596
in
kaliszyk@35222
   597
  error msg
kaliszyk@35222
   598
end
kaliszyk@35222
   599
kaliszyk@35222
   600
fun procedure_inst ctxt rtrm qtrm =
kaliszyk@35222
   601
let
kaliszyk@35222
   602
  val thy = ProofContext.theory_of ctxt
kaliszyk@35222
   603
  val rtrm' = HOLogic.dest_Trueprop rtrm
kaliszyk@35222
   604
  val qtrm' = HOLogic.dest_Trueprop qtrm
kaliszyk@35222
   605
  val reg_goal = regularize_trm_chk ctxt (rtrm', qtrm')
urbanc@38859
   606
    handle LIFT_MATCH msg => lift_match_error ctxt msg rtrm qtrm
kaliszyk@35222
   607
  val inj_goal = inj_repabs_trm_chk ctxt (reg_goal, qtrm')
urbanc@38859
   608
    handle LIFT_MATCH msg => lift_match_error ctxt msg rtrm qtrm
kaliszyk@35222
   609
in
kaliszyk@35222
   610
  Drule.instantiate' []
kaliszyk@35222
   611
    [SOME (cterm_of thy rtrm'),
kaliszyk@35222
   612
     SOME (cterm_of thy reg_goal),
kaliszyk@35222
   613
     NONE,
kaliszyk@35222
   614
     SOME (cterm_of thy inj_goal)] lifting_procedure_thm
kaliszyk@35222
   615
end
kaliszyk@35222
   616
urbanc@37593
   617
urbanc@38860
   618
(* Since we use Ball and Bex during the lifting and descending,
kaliszyk@38862
   619
   we cannot deal with lemmas containing them, unless we unfold
kaliszyk@38862
   620
   them by default. *)
urbanc@38860
   621
kaliszyk@38862
   622
val default_unfolds = @{thms Ball_def Bex_def}
urbanc@38860
   623
urbanc@38860
   624
urbanc@37593
   625
(** descending as tactic **)
urbanc@37593
   626
urbanc@38859
   627
fun descend_procedure_tac ctxt simps =
urbanc@38859
   628
let
urbanc@38860
   629
  val ss = (mk_minimal_ss ctxt) addsimps (simps @ default_unfolds)
urbanc@38859
   630
in
urbanc@38859
   631
  full_simp_tac ss
urbanc@38859
   632
  THEN' Object_Logic.full_atomize_tac
kaliszyk@35222
   633
  THEN' gen_frees_tac ctxt
kaliszyk@35222
   634
  THEN' SUBGOAL (fn (goal, i) =>
kaliszyk@37564
   635
        let
kaliszyk@37564
   636
          val qtys = map #qtyp (Quotient_Info.quotdata_dest ctxt)
urbanc@38624
   637
          val rtrm = derive_rtrm ctxt qtys goal
urbanc@37593
   638
          val rule = procedure_inst ctxt rtrm  goal
kaliszyk@37564
   639
        in
kaliszyk@37564
   640
          rtac rule i
urbanc@37593
   641
        end)
urbanc@38859
   642
end
urbanc@37593
   643
urbanc@38859
   644
fun descend_tac ctxt simps =
urbanc@37593
   645
let
urbanc@37593
   646
  val mk_tac_raw =
urbanc@38859
   647
    descend_procedure_tac ctxt simps
urbanc@37593
   648
    THEN' RANGE
urbanc@37593
   649
      [Object_Logic.rulify_tac THEN' (K all_tac),
urbanc@37593
   650
       regularize_tac ctxt,
urbanc@37593
   651
       all_injection_tac ctxt,
urbanc@37593
   652
       clean_tac ctxt]
urbanc@37593
   653
in
urbanc@37593
   654
  Goal.conjunction_tac THEN_ALL_NEW mk_tac_raw
urbanc@37593
   655
end
kaliszyk@35222
   656
kaliszyk@35222
   657
urbanc@38625
   658
(** lifting as a tactic **)
urbanc@37593
   659
urbanc@38718
   660
urbanc@37593
   661
(* the tactic leaves three subgoals to be proved *)
urbanc@38859
   662
fun lift_procedure_tac ctxt simps rthm =
urbanc@38859
   663
let
urbanc@38860
   664
  val ss = (mk_minimal_ss ctxt) addsimps (simps @ default_unfolds)
urbanc@38859
   665
in
urbanc@38859
   666
  full_simp_tac ss
urbanc@38859
   667
  THEN' Object_Logic.full_atomize_tac
urbanc@37593
   668
  THEN' gen_frees_tac ctxt
urbanc@37593
   669
  THEN' SUBGOAL (fn (goal, i) =>
urbanc@37593
   670
    let
urbanc@38717
   671
      (* full_atomize_tac contracts eta redexes,
urbanc@38717
   672
         so we do it also in the original theorem *)
urbanc@38717
   673
      val rthm' = 
urbanc@38859
   674
        rthm |> full_simplify ss
urbanc@38859
   675
             |> Drule.eta_contraction_rule 
urbanc@38717
   676
             |> Thm.forall_intr_frees
urbanc@38717
   677
             |> atomize_thm 
urbanc@38717
   678
urbanc@37593
   679
      val rule = procedure_inst ctxt (prop_of rthm') goal
urbanc@37593
   680
    in
urbanc@37593
   681
      (rtac rule THEN' rtac rthm') i
urbanc@37593
   682
    end)
urbanc@38859
   683
end
urbanc@38625
   684
urbanc@38859
   685
fun lift_single_tac ctxt simps rthm = 
urbanc@38859
   686
  lift_procedure_tac ctxt simps rthm
urbanc@38625
   687
  THEN' RANGE
urbanc@38625
   688
    [ regularize_tac ctxt,
urbanc@38625
   689
      all_injection_tac ctxt,
urbanc@38625
   690
      clean_tac ctxt ]
urbanc@38625
   691
urbanc@38859
   692
fun lift_tac ctxt simps rthms =
urbanc@38625
   693
  Goal.conjunction_tac 
urbanc@38859
   694
  THEN' RANGE (map (lift_single_tac ctxt simps) rthms)
urbanc@38625
   695
urbanc@38625
   696
urbanc@38625
   697
(* automated lifting with pre-simplification of the theorems;
urbanc@38625
   698
   for internal usage *)
urbanc@38625
   699
fun lifted ctxt qtys simps rthm =
kaliszyk@35222
   700
let
urbanc@38859
   701
  val ((_, [rthm']), ctxt') = Variable.import true [rthm] ctxt
urbanc@38859
   702
  val goal = derive_qtrm ctxt' qtys (prop_of rthm')
kaliszyk@35222
   703
in
urbanc@38625
   704
  Goal.prove ctxt' [] [] goal 
urbanc@38859
   705
    (K (HEADGOAL (lift_single_tac ctxt' simps rthm')))
urbanc@38625
   706
  |> singleton (ProofContext.export ctxt' ctxt)
kaliszyk@35222
   707
end
kaliszyk@35222
   708
urbanc@37593
   709
urbanc@38625
   710
(* lifting as an attribute *)
kaliszyk@35222
   711
urbanc@37560
   712
val lifted_attrib = Thm.rule_attribute (fn context => 
urbanc@37593
   713
  let
urbanc@37593
   714
    val ctxt = Context.proof_of context
urbanc@37593
   715
    val qtys = map #qtyp (Quotient_Info.quotdata_dest ctxt)
urbanc@37593
   716
  in
urbanc@38625
   717
    lifted ctxt qtys []
urbanc@37593
   718
  end)
kaliszyk@35222
   719
kaliszyk@35222
   720
end; (* structure *)