src/Pure/Isar/obtain.ML
author wenzelm
Sun Mar 07 12:19:47 2010 +0100 (2010-03-07)
changeset 35625 9c818cab0dd0
parent 33957 e9afca2118d4
child 35845 e5980f0ad025
permissions -rw-r--r--
modernized structure Object_Logic;
wenzelm@7674
     1
(*  Title:      Pure/Isar/obtain.ML
wenzelm@7674
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@7674
     3
wenzelm@17858
     4
The 'obtain' and 'guess' language elements -- generalized existence at
wenzelm@17858
     5
the level of proof texts: 'obtain' involves a proof that certain
wenzelm@17858
     6
fixes/assumes may be introduced into the present context; 'guess' is
wenzelm@17858
     7
similar, but derives these elements from the course of reasoning!
wenzelm@7674
     8
wenzelm@9468
     9
  <chain_facts>
wenzelm@18870
    10
  obtain x where "A x" <proof> ==
wenzelm@7674
    11
wenzelm@18870
    12
  have "!!thesis. (!!x. A x ==> thesis) ==> thesis"
wenzelm@12970
    13
  proof succeed
wenzelm@9468
    14
    fix thesis
wenzelm@18870
    15
    assume that [intro?]: "!!x. A x ==> thesis"
wenzelm@18870
    16
    <chain_facts>
wenzelm@18870
    17
    show thesis
wenzelm@18870
    18
      apply (insert that)
wenzelm@18870
    19
      <proof>
wenzelm@12970
    20
  qed
wenzelm@18870
    21
  fix x assm <<obtain_export>> "A x"
wenzelm@17858
    22
wenzelm@17858
    23
wenzelm@17858
    24
  <chain_facts>
wenzelm@17858
    25
  guess x <proof body> <proof end> ==
wenzelm@17858
    26
wenzelm@17858
    27
  {
wenzelm@17858
    28
    fix thesis
wenzelm@17858
    29
    <chain_facts> have "PROP ?guess"
wenzelm@18870
    30
      apply magic      -- {* turns goal into "thesis ==> #thesis" *}
wenzelm@17858
    31
      <proof body>
wenzelm@18870
    32
      apply_end magic  -- {* turns final "(!!x. P x ==> thesis) ==> #thesis" into
wenzelm@18870
    33
        "#((!!x. A x ==> thesis) ==> thesis)" which is a finished goal state *}
wenzelm@17858
    34
      <proof end>
wenzelm@17858
    35
  }
wenzelm@18870
    36
  fix x assm <<obtain_export>> "A x"
wenzelm@8094
    37
*)
wenzelm@7674
    38
wenzelm@7674
    39
signature OBTAIN =
wenzelm@7674
    40
sig
wenzelm@21229
    41
  val thatN: string
haftmann@29581
    42
  val obtain: string -> (binding * string option * mixfix) list ->
wenzelm@30211
    43
    (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
haftmann@29581
    44
  val obtain_i: string -> (binding * typ option * mixfix) list ->
wenzelm@30211
    45
    (Thm.binding * (term * term list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@20308
    46
  val result: (Proof.context -> tactic) -> thm list -> Proof.context ->
wenzelm@32199
    47
    ((string * cterm) list * thm list) * Proof.context
haftmann@29581
    48
  val guess: (binding * string option * mixfix) list -> bool -> Proof.state -> Proof.state
haftmann@29581
    49
  val guess_i: (binding * typ option * mixfix) list -> bool -> Proof.state -> Proof.state
wenzelm@7674
    50
end;
wenzelm@7674
    51
wenzelm@10379
    52
structure Obtain: OBTAIN =
wenzelm@7674
    53
struct
wenzelm@7674
    54
wenzelm@18670
    55
(** obtain_export **)
wenzelm@18670
    56
wenzelm@18870
    57
(*
wenzelm@18897
    58
  [x, A x]
wenzelm@18897
    59
     :
wenzelm@18897
    60
     B
wenzelm@18897
    61
  --------
wenzelm@18897
    62
     B
wenzelm@18870
    63
*)
wenzelm@21686
    64
fun eliminate_term ctxt xs tm =
wenzelm@21686
    65
  let
wenzelm@21686
    66
    val vs = map (dest_Free o Thm.term_of) xs;
wenzelm@21686
    67
    val bads = Term.fold_aterms (fn t as Free v =>
wenzelm@21686
    68
      if member (op =) vs v then insert (op aconv) t else I | _ => I) tm [];
wenzelm@21686
    69
    val _ = null bads orelse
wenzelm@21686
    70
      error ("Result contains obtained parameters: " ^
wenzelm@24920
    71
        space_implode " " (map (Syntax.string_of_term ctxt) bads));
wenzelm@21686
    72
  in tm end;
wenzelm@21686
    73
wenzelm@21686
    74
fun eliminate fix_ctxt rule xs As thm =
wenzelm@9468
    75
  let
wenzelm@20308
    76
    val thy = ProofContext.theory_of fix_ctxt;
wenzelm@9468
    77
wenzelm@21686
    78
    val _ = eliminate_term fix_ctxt xs (Thm.full_prop_of thm);
wenzelm@35625
    79
    val _ = Object_Logic.is_judgment thy (Thm.concl_of thm) orelse
wenzelm@20308
    80
      error "Conclusion in obtained context must be object-logic judgment";
wenzelm@20308
    81
wenzelm@31794
    82
    val ((_, [thm']), ctxt') = Variable.import true [thm] fix_ctxt;
wenzelm@20308
    83
    val prems = Drule.strip_imp_prems (#prop (Thm.crep_thm thm'));
wenzelm@9468
    84
  in
wenzelm@20308
    85
    ((Drule.implies_elim_list thm' (map Thm.assume prems)
wenzelm@20308
    86
        |> Drule.implies_intr_list (map Drule.norm_hhf_cterm As)
wenzelm@20308
    87
        |> Drule.forall_intr_list xs)
wenzelm@20308
    88
      COMP rule)
wenzelm@20308
    89
    |> Drule.implies_intr_list prems
wenzelm@20308
    90
    |> singleton (Variable.export ctxt' fix_ctxt)
wenzelm@9468
    91
  end;
wenzelm@9468
    92
wenzelm@21686
    93
fun obtain_export ctxt rule xs _ As =
wenzelm@21686
    94
  (eliminate ctxt rule xs As, eliminate_term ctxt xs);
wenzelm@21686
    95
wenzelm@9468
    96
wenzelm@9468
    97
wenzelm@17858
    98
(** obtain **)
wenzelm@17858
    99
wenzelm@17858
   100
fun bind_judgment ctxt name =
wenzelm@18670
   101
  let
wenzelm@20308
   102
    val (bind, ctxt') = ProofContext.bind_fixes [name] ctxt;
wenzelm@35625
   103
    val (t as _ $ Free v) = bind (Object_Logic.fixed_judgment (ProofContext.theory_of ctxt) name);
wenzelm@20308
   104
  in ((v, t), ctxt') end;
wenzelm@17858
   105
wenzelm@18897
   106
val thatN = "that";
wenzelm@18897
   107
wenzelm@17858
   108
local
wenzelm@8094
   109
wenzelm@18897
   110
fun gen_obtain prep_att prep_vars prep_propp
wenzelm@18897
   111
    name raw_vars raw_asms int state =
wenzelm@7674
   112
  let
wenzelm@9468
   113
    val _ = Proof.assert_forward_or_chain state;
wenzelm@20308
   114
    val thy = Proof.theory_of state;
wenzelm@20308
   115
    val cert = Thm.cterm_of thy;
wenzelm@17858
   116
    val ctxt = Proof.context_of state;
wenzelm@17357
   117
    val chain_facts = if can Proof.assert_chain state then Proof.the_facts state else [];
wenzelm@7674
   118
wenzelm@8543
   119
    (*obtain vars*)
wenzelm@19844
   120
    val (vars, vars_ctxt) = prep_vars raw_vars ctxt;
wenzelm@30763
   121
    val (_, fix_ctxt) = vars_ctxt |> ProofContext.add_fixes vars;
wenzelm@30585
   122
    val xs = map (Name.of_binding o #1) vars;
wenzelm@7674
   123
wenzelm@8543
   124
    (*obtain asms*)
wenzelm@11890
   125
    val (asms_ctxt, proppss) = prep_propp (fix_ctxt, map snd raw_asms);
wenzelm@19482
   126
    val asm_props = maps (map fst) proppss;
wenzelm@18678
   127
    val asms = map fst (Attrib.map_specs (prep_att thy) raw_asms) ~~ proppss;
wenzelm@10464
   128
wenzelm@19897
   129
    val _ = Variable.warn_extra_tfrees fix_ctxt asms_ctxt;
wenzelm@7674
   130
wenzelm@12970
   131
    (*obtain statements*)
wenzelm@33386
   132
    val thesisN = Name.variant xs Auto_Bind.thesisN;
wenzelm@20308
   133
    val (thesis_var, thesis) = #1 (bind_judgment fix_ctxt thesisN);
wenzelm@9468
   134
wenzelm@20308
   135
    val asm_frees = fold Term.add_frees asm_props [];
wenzelm@20308
   136
    val parms = xs |> map (fn x =>
wenzelm@20308
   137
      let val x' = ProofContext.get_skolem fix_ctxt x
wenzelm@20308
   138
      in (x', the_default propT (AList.lookup (op =) asm_frees x')) end);
wenzelm@10582
   139
wenzelm@18897
   140
    val that_name = if name = "" then thatN else name;
wenzelm@10582
   141
    val that_prop =
wenzelm@20308
   142
      Term.list_all_free (parms, Logic.list_implies (asm_props, thesis))
wenzelm@20308
   143
      |> Library.curry Logic.list_rename_params xs;
wenzelm@12970
   144
    val obtain_prop =
wenzelm@33386
   145
      Logic.list_rename_params ([Auto_Bind.thesisN],
wenzelm@17858
   146
        Term.list_all_free ([thesis_var], Logic.mk_implies (that_prop, thesis)));
wenzelm@7674
   147
wenzelm@18124
   148
    fun after_qed _ =
wenzelm@17357
   149
      Proof.local_qed (NONE, false)
wenzelm@29383
   150
      #> `Proof.the_fact #-> (fn rule =>
wenzelm@28080
   151
        Proof.fix_i vars
wenzelm@29383
   152
        #> Proof.assm_i (obtain_export fix_ctxt rule (map (cert o Free) parms)) asms);
wenzelm@7674
   153
  in
wenzelm@8094
   154
    state
wenzelm@9468
   155
    |> Proof.enter_forward
wenzelm@30211
   156
    |> Proof.have_i NONE (K I) [(Thm.empty_binding, [(obtain_prop, [])])] int
wenzelm@17858
   157
    |> Proof.proof (SOME Method.succeed_text) |> Seq.hd
haftmann@28965
   158
    |> Proof.fix_i [(Binding.name thesisN, NONE, NoSyn)]
wenzelm@28080
   159
    |> Proof.assume_i
wenzelm@33369
   160
      [((Binding.name that_name, [Context_Rules.intro_query NONE]), [(that_prop, [])])]
wenzelm@16842
   161
    |> `Proof.the_facts
wenzelm@17357
   162
    ||> Proof.chain_facts chain_facts
wenzelm@30211
   163
    ||> Proof.show_i NONE after_qed [(Thm.empty_binding, [(thesis, [])])] false
wenzelm@18907
   164
    |-> Proof.refine_insert
wenzelm@7674
   165
  end;
wenzelm@7674
   166
wenzelm@17858
   167
in
wenzelm@17858
   168
wenzelm@18728
   169
val obtain = gen_obtain Attrib.attribute ProofContext.read_vars ProofContext.read_propp;
wenzelm@17111
   170
val obtain_i = gen_obtain (K I) ProofContext.cert_vars ProofContext.cert_propp;
wenzelm@8094
   171
wenzelm@8094
   172
end;
wenzelm@17858
   173
wenzelm@17858
   174
wenzelm@17858
   175
wenzelm@20308
   176
(** tactical result **)
wenzelm@20308
   177
wenzelm@20308
   178
fun check_result ctxt thesis th =
wenzelm@20308
   179
  (case Thm.prems_of th of
wenzelm@20308
   180
    [prem] =>
wenzelm@20308
   181
      if Thm.concl_of th aconv thesis andalso
wenzelm@20308
   182
        Logic.strip_assums_concl prem aconv thesis then th
wenzelm@32091
   183
      else error ("Guessed a different clause:\n" ^ Display.string_of_thm ctxt th)
wenzelm@20308
   184
  | [] => error "Goal solved -- nothing guessed."
wenzelm@32091
   185
  | _ => error ("Guess split into several cases:\n" ^ Display.string_of_thm ctxt th));
wenzelm@20308
   186
wenzelm@20308
   187
fun result tac facts ctxt =
wenzelm@20308
   188
  let
wenzelm@20308
   189
    val thy = ProofContext.theory_of ctxt;
wenzelm@20308
   190
    val cert = Thm.cterm_of thy;
wenzelm@20308
   191
wenzelm@33386
   192
    val ((thesis_var, thesis), thesis_ctxt) = bind_judgment ctxt Auto_Bind.thesisN;
wenzelm@20308
   193
    val rule =
wenzelm@20308
   194
      (case SINGLE (Method.insert_tac facts 1 THEN tac thesis_ctxt) (Goal.init (cert thesis)) of
wenzelm@20308
   195
        NONE => raise THM ("Obtain.result: tactic failed", 0, facts)
wenzelm@21605
   196
      | SOME th => check_result ctxt thesis (MetaSimplifier.norm_hhf (Goal.conclude th)));
wenzelm@20308
   197
wenzelm@20308
   198
    val closed_rule = Thm.forall_intr (cert (Free thesis_var)) rule;
wenzelm@31794
   199
    val ((_, [rule']), ctxt') = Variable.import false [closed_rule] ctxt;
wenzelm@20308
   200
    val obtain_rule = Thm.forall_elim (cert (Logic.varify (Free thesis_var))) rule';
wenzelm@20308
   201
    val ((params, stmt), fix_ctxt) = Variable.focus (Thm.cprem_of obtain_rule 1) ctxt';
wenzelm@20308
   202
    val (prems, ctxt'') =
wenzelm@32199
   203
      Assumption.add_assms (obtain_export fix_ctxt obtain_rule (map #2 params))
wenzelm@20308
   204
        (Drule.strip_imp_prems stmt) fix_ctxt;
wenzelm@20308
   205
  in ((params, prems), ctxt'') end;
wenzelm@20308
   206
wenzelm@20308
   207
wenzelm@20308
   208
wenzelm@17858
   209
(** guess **)
wenzelm@17858
   210
wenzelm@17858
   211
local
wenzelm@17858
   212
wenzelm@20308
   213
fun unify_params vars thesis_var raw_rule ctxt =
wenzelm@17858
   214
  let
wenzelm@18678
   215
    val thy = ProofContext.theory_of ctxt;
wenzelm@19978
   216
    val certT = Thm.ctyp_of thy;
wenzelm@19978
   217
    val cert = Thm.cterm_of thy;
wenzelm@32966
   218
    val string_of_term = setmp_CRITICAL show_types true (Syntax.string_of_term ctxt);
wenzelm@17891
   219
wenzelm@32091
   220
    fun err msg th = error (msg ^ ":\n" ^ Display.string_of_thm ctxt th);
wenzelm@17858
   221
wenzelm@19978
   222
    val maxidx = fold (Term.maxidx_typ o snd o fst) vars ~1;
wenzelm@19779
   223
    val rule = Thm.incr_indexes (maxidx + 1) raw_rule;
wenzelm@19779
   224
wenzelm@33368
   225
    val params = Rule_Cases.strip_params (Logic.nth_prem (1, Thm.prop_of rule));
wenzelm@17858
   226
    val m = length vars;
wenzelm@17858
   227
    val n = length params;
wenzelm@19779
   228
    val _ = m <= n orelse err "More variables than parameters in obtained rule" rule;
wenzelm@17858
   229
wenzelm@19779
   230
    fun unify ((x, T), (y, U)) (tyenv, max) = Sign.typ_unify thy (T, U) (tyenv, max)
wenzelm@19779
   231
      handle Type.TUNIFY =>
wenzelm@19779
   232
        err ("Failed to unify variable " ^
wenzelm@19779
   233
          string_of_term (Free (x, Envir.norm_type tyenv T)) ^ " against parameter " ^
wenzelm@19779
   234
          string_of_term (Syntax.mark_boundT (y, Envir.norm_type tyenv U)) ^ " in") rule;
haftmann@33957
   235
    val (tyenv, _) = fold unify (map #1 vars ~~ take m params)
wenzelm@19779
   236
      (Vartab.empty, Int.max (maxidx, Thm.maxidx_of rule));
wenzelm@17858
   237
    val norm_type = Envir.norm_type tyenv;
wenzelm@17858
   238
wenzelm@19978
   239
    val xs = map (apsnd norm_type o fst) vars;
haftmann@33957
   240
    val ys = map (apsnd norm_type) (drop m params);
wenzelm@20085
   241
    val ys' = map Name.internal (Name.variant_list (map fst xs) (map fst ys)) ~~ map #2 ys;
wenzelm@19978
   242
    val terms = map (Drule.mk_term o cert o Free) (xs @ ys');
wenzelm@19779
   243
wenzelm@17858
   244
    val instT =
wenzelm@17858
   245
      fold (Term.add_tvarsT o #2) params []
wenzelm@19978
   246
      |> map (TVar #> (fn T => (certT T, certT (norm_type T))));
wenzelm@20308
   247
    val closed_rule = rule
wenzelm@20308
   248
      |> Thm.forall_intr (cert (Free thesis_var))
wenzelm@20308
   249
      |> Thm.instantiate (instT, []);
wenzelm@17891
   250
wenzelm@31794
   251
    val ((_, rule' :: terms'), ctxt') = Variable.import false (closed_rule :: terms) ctxt;
wenzelm@19978
   252
    val vars' =
wenzelm@19978
   253
      map (dest_Free o Thm.term_of o Drule.dest_term) terms' ~~
wenzelm@19978
   254
      (map snd vars @ replicate (length ys) NoSyn);
wenzelm@20308
   255
    val rule'' = Thm.forall_elim (cert (Logic.varify (Free thesis_var))) rule';
wenzelm@19978
   256
  in ((vars', rule''), ctxt') end;
wenzelm@17858
   257
wenzelm@28080
   258
fun inferred_type (binding, _, mx) ctxt =
wenzelm@28080
   259
  let
wenzelm@30585
   260
    val x = Name.of_binding binding;
wenzelm@28080
   261
    val (T, ctxt') = ProofContext.inferred_param x ctxt
wenzelm@19779
   262
  in ((x, T, mx), ctxt') end;
wenzelm@19779
   263
wenzelm@20004
   264
fun polymorphic ctxt vars =
wenzelm@19897
   265
  let val Ts = map Logic.dest_type (Variable.polymorphic ctxt (map (Logic.mk_type o #2) vars))
wenzelm@19779
   266
  in map2 (fn (x, _, mx) => fn T => ((x, T), mx)) vars Ts end;
wenzelm@18693
   267
wenzelm@17858
   268
fun gen_guess prep_vars raw_vars int state =
wenzelm@17858
   269
  let
wenzelm@17858
   270
    val _ = Proof.assert_forward_or_chain state;
wenzelm@17858
   271
    val thy = Proof.theory_of state;
wenzelm@20308
   272
    val cert = Thm.cterm_of thy;
wenzelm@17858
   273
    val ctxt = Proof.context_of state;
wenzelm@17858
   274
    val chain_facts = if can Proof.assert_chain state then Proof.the_facts state else [];
wenzelm@17858
   275
wenzelm@33386
   276
    val (thesis_var, thesis) = #1 (bind_judgment ctxt Auto_Bind.thesisN);
wenzelm@20004
   277
    val vars = ctxt |> prep_vars raw_vars |-> fold_map inferred_type |> fst |> polymorphic ctxt;
wenzelm@17858
   278
wenzelm@19978
   279
    fun guess_context raw_rule state' =
wenzelm@17858
   280
      let
wenzelm@19978
   281
        val ((parms, rule), ctxt') =
wenzelm@20308
   282
          unify_params vars thesis_var raw_rule (Proof.context_of state');
wenzelm@19978
   283
        val (bind, _) = ProofContext.bind_fixes (map (#1 o #1) parms) ctxt';
wenzelm@19978
   284
        val ts = map (bind o Free o #1) parms;
wenzelm@17858
   285
        val ps = map dest_Free ts;
wenzelm@17858
   286
        val asms =
wenzelm@17858
   287
          Logic.strip_assums_hyp (Logic.nth_prem (1, Thm.prop_of rule))
wenzelm@19585
   288
          |> map (fn asm => (Term.betapplys (Term.list_abs (ps, asm), ts), []));
wenzelm@19779
   289
        val _ = not (null asms) orelse error "Trivial result -- nothing guessed";
wenzelm@17858
   290
      in
wenzelm@19978
   291
        state'
wenzelm@19978
   292
        |> Proof.map_context (K ctxt')
haftmann@28965
   293
        |> Proof.fix_i (map (fn ((x, T), mx) => (Binding.name x, SOME T, mx)) parms)
wenzelm@28080
   294
        |> `Proof.context_of |-> (fn fix_ctxt => Proof.assm_i
wenzelm@30211
   295
          (obtain_export fix_ctxt rule (map cert ts)) [(Thm.empty_binding, asms)])
wenzelm@33386
   296
        |> Proof.bind_terms Auto_Bind.no_facts
wenzelm@17858
   297
      end;
wenzelm@17858
   298
wenzelm@19779
   299
    val goal = Var (("guess", 0), propT);
wenzelm@19779
   300
    fun print_result ctxt' (k, [(s, [_, th])]) =
wenzelm@33389
   301
      Proof_Display.print_results int ctxt' (k, [(s, [th])]);
wenzelm@21605
   302
    val before_qed = SOME (Method.primitive_text (Goal.conclude #> MetaSimplifier.norm_hhf #>
wenzelm@20308
   303
        (fn th => Goal.protect (Conjunction.intr (Drule.mk_term (Thm.cprop_of th)) th))));
wenzelm@19779
   304
    fun after_qed [[_, res]] =
wenzelm@29383
   305
      Proof.end_block #> guess_context (check_result ctxt thesis res);
wenzelm@17858
   306
  in
wenzelm@17858
   307
    state
wenzelm@17858
   308
    |> Proof.enter_forward
wenzelm@17858
   309
    |> Proof.begin_block
wenzelm@33386
   310
    |> Proof.fix_i [(Binding.name Auto_Bind.thesisN, NONE, NoSyn)]
wenzelm@17858
   311
    |> Proof.chain_facts chain_facts
wenzelm@19779
   312
    |> Proof.local_goal print_result (K I) (apsnd (rpair I))
wenzelm@30211
   313
      "guess" before_qed after_qed [(Thm.empty_binding, [Logic.mk_term goal, goal])]
wenzelm@20308
   314
    |> Proof.refine (Method.primitive_text (K (Goal.init (cert thesis)))) |> Seq.hd
wenzelm@17858
   315
  end;
wenzelm@17858
   316
wenzelm@17858
   317
in
wenzelm@17858
   318
wenzelm@17858
   319
val guess = gen_guess ProofContext.read_vars;
wenzelm@17858
   320
val guess_i = gen_guess ProofContext.cert_vars;
wenzelm@17858
   321
wenzelm@17858
   322
end;
wenzelm@17858
   323
wenzelm@17858
   324
end;