wenzelm@17980: (*  Title:      Pure/goal.ML
wenzelm@17980:     ID:         $Id$
wenzelm@17980:     Author:     Makarius and Lawrence C Paulson
wenzelm@17980: 
wenzelm@18139: Goals in tactical theorem proving.
wenzelm@17980: *)
wenzelm@17980: 
wenzelm@17980: signature BASIC_GOAL =
wenzelm@17980: sig
wenzelm@17980:   val SELECT_GOAL: tactic -> int -> tactic
wenzelm@23418:   val CONJUNCTS: tactic -> int -> tactic
wenzelm@23414:   val PRECISE_CONJUNCTS: int -> tactic -> int -> tactic
wenzelm@17980: end;
wenzelm@17980: 
wenzelm@17980: signature GOAL =
wenzelm@17980: sig
wenzelm@17980:   include BASIC_GOAL
wenzelm@17980:   val init: cterm -> thm
wenzelm@18027:   val protect: thm -> thm
wenzelm@17980:   val conclude: thm -> thm
wenzelm@17980:   val finish: thm -> thm
wenzelm@21604:   val norm_result: thm -> thm
wenzelm@28973:   val future_result: Proof.context -> thm future -> term -> thm
wenzelm@23356:   val prove_internal: cterm list -> cterm -> (thm list -> tactic) -> thm
wenzelm@20290:   val prove_multi: Proof.context -> string list -> term list -> term list ->
wenzelm@20290:     ({prems: thm list, context: Proof.context} -> tactic) -> thm list
wenzelm@28446:   val prove_future: Proof.context -> string list -> term list -> term ->
wenzelm@28340:     ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@20290:   val prove: Proof.context -> string list -> term list -> term ->
wenzelm@20290:     ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@26713:   val prove_global: theory -> string list -> term list -> term ->
wenzelm@26713:     ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@19184:   val extract: int -> int -> thm -> thm Seq.seq
wenzelm@19184:   val retrofit: int -> int -> thm -> thm -> thm Seq.seq
wenzelm@23418:   val conjunction_tac: int -> tactic
wenzelm@23414:   val precise_conjunction_tac: int -> int -> tactic
wenzelm@23418:   val recover_conjunction_tac: tactic
wenzelm@21687:   val norm_hhf_tac: int -> tactic
wenzelm@21687:   val compose_hhf_tac: thm -> int -> tactic
wenzelm@23237:   val assume_rule_tac: Proof.context -> int -> tactic
wenzelm@17980: end;
wenzelm@17980: 
wenzelm@17980: structure Goal: GOAL =
wenzelm@17980: struct
wenzelm@17980: 
wenzelm@18027: (** goals **)
wenzelm@18027: 
wenzelm@18027: (*
wenzelm@18027:   -------- (init)
wenzelm@18027:   C ==> #C
wenzelm@18027: *)
wenzelm@20290: val init =
wenzelm@22902:   let val A = #1 (Thm.dest_implies (Thm.cprop_of Drule.protectI))
wenzelm@20290:   in fn C => Thm.instantiate ([], [(A, C)]) Drule.protectI end;
wenzelm@17980: 
wenzelm@17980: (*
wenzelm@18119:    C
wenzelm@18119:   --- (protect)
wenzelm@18119:   #C
wenzelm@17980: *)
wenzelm@21579: fun protect th = th COMP_INCR Drule.protectI;
wenzelm@17980: 
wenzelm@17980: (*
wenzelm@18027:   A ==> ... ==> #C
wenzelm@18027:   ---------------- (conclude)
wenzelm@17980:   A ==> ... ==> C
wenzelm@17980: *)
wenzelm@17980: fun conclude th =
wenzelm@18497:   (case SINGLE (Thm.compose_no_flatten false (th, Thm.nprems_of th) 1)
wenzelm@18027:       (Drule.incr_indexes th Drule.protectD) of
wenzelm@17980:     SOME th' => th'
wenzelm@17980:   | NONE => raise THM ("Failed to conclude goal", 0, [th]));
wenzelm@17980: 
wenzelm@17980: (*
wenzelm@18027:   #C
wenzelm@18027:   --- (finish)
wenzelm@18027:    C
wenzelm@17983: *)
wenzelm@17980: fun finish th =
wenzelm@17980:   (case Thm.nprems_of th of
wenzelm@17980:     0 => conclude th
wenzelm@17980:   | n => raise THM ("Proof failed.\n" ^
wenzelm@17980:       Pretty.string_of (Pretty.chunks (Display.pretty_goals n th)) ^
wenzelm@17980:       ("\n" ^ string_of_int n ^ " unsolved goal(s)!"), 0, [th]));
wenzelm@17980: 
wenzelm@17980: 
wenzelm@18027: 
wenzelm@18027: (** results **)
wenzelm@18027: 
wenzelm@28340: (* normal form *)
wenzelm@28340: 
wenzelm@21604: val norm_result =
wenzelm@21604:   Drule.flexflex_unique
wenzelm@21604:   #> MetaSimplifier.norm_hhf_protect
wenzelm@21604:   #> Thm.strip_shyps
wenzelm@21604:   #> Drule.zero_var_indexes;
wenzelm@21604: 
wenzelm@21604: 
wenzelm@28446: (* future_result *)
wenzelm@28340: 
wenzelm@28446: fun future_result ctxt result prop =
wenzelm@28340:   let
wenzelm@28340:     val thy = ProofContext.theory_of ctxt;
wenzelm@28340:     val _ = Context.reject_draft thy;
wenzelm@28340:     val cert = Thm.cterm_of thy;
wenzelm@28340:     val certT = Thm.ctyp_of thy;
wenzelm@28340: 
wenzelm@28340:     val assms = Assumption.assms_of ctxt;
wenzelm@28340:     val As = map Thm.term_of assms;
wenzelm@28340: 
wenzelm@28340:     val xs = map Free (fold Term.add_frees (prop :: As) []);
wenzelm@28340:     val fixes = map cert xs;
wenzelm@28340: 
wenzelm@28340:     val tfrees = fold Term.add_tfrees (prop :: As) [];
wenzelm@28340:     val instT = map (fn (a, S) => (certT (TVar ((a, 0), S)), certT (TFree (a, S)))) tfrees;
wenzelm@28340: 
wenzelm@28340:     val global_prop =
wenzelm@28340:       Term.map_types Logic.varifyT (fold_rev Logic.all xs (Logic.list_implies (As, prop)));
wenzelm@28973:     val global_result = result |> Future.map
wenzelm@28973:       (Thm.adjust_maxidx_thm ~1 #>
wenzelm@28973:         Drule.implies_intr_list assms #>
wenzelm@28973:         Drule.forall_intr_list fixes #>
wenzelm@28973:         Thm.generalize (map #1 tfrees, []) 0);
wenzelm@28340:     val local_result =
wenzelm@28446:       Thm.future global_result (cert global_prop)
wenzelm@28340:       |> Thm.instantiate (instT, [])
wenzelm@28340:       |> Drule.forall_elim_list fixes
wenzelm@28340:       |> fold (Thm.elim_implies o Thm.assume) assms;
wenzelm@28340:   in local_result end;
wenzelm@28340: 
wenzelm@28340: 
wenzelm@18027: 
wenzelm@18027: (** tactical theorem proving **)
wenzelm@18027: 
wenzelm@23356: (* prove_internal -- minimal checks, no normalization of result! *)
wenzelm@20250: 
wenzelm@23356: fun prove_internal casms cprop tac =
wenzelm@20250:   (case SINGLE (tac (map Assumption.assume casms)) (init cprop) of
wenzelm@20250:     SOME th => Drule.implies_intr_list casms (finish th)
wenzelm@20250:   | NONE => error "Tactic failed.");
wenzelm@20250: 
wenzelm@20250: 
wenzelm@28340: (* prove_common etc. *)
wenzelm@17986: 
wenzelm@28340: fun prove_common immediate ctxt xs asms props tac =
wenzelm@17980:   let
wenzelm@21516:     val thy = ProofContext.theory_of ctxt;
wenzelm@26939:     val string_of_term = Syntax.string_of_term ctxt;
wenzelm@20056: 
wenzelm@28355:     val pos = Position.thread_data ();
wenzelm@20250:     fun err msg = cat_error msg
wenzelm@20250:       ("The error(s) above occurred for the goal statement:\n" ^
wenzelm@28355:         string_of_term (Logic.list_implies (asms, Logic.mk_conjunction_list props)) ^
wenzelm@28355:         (case Position.str_of pos of "" => "" | s => "\n" ^ s));
wenzelm@17980: 
wenzelm@20250:     fun cert_safe t = Thm.cterm_of thy (Envir.beta_norm (Term.no_dummy_patterns t))
wenzelm@17980:       handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg;
wenzelm@20250:     val casms = map cert_safe asms;
wenzelm@20250:     val cprops = map cert_safe props;
wenzelm@17980: 
wenzelm@20250:     val (prems, ctxt') = ctxt
wenzelm@20250:       |> Variable.add_fixes_direct xs
wenzelm@27218:       |> fold Variable.declare_term (asms @ props)
wenzelm@26713:       |> Assumption.add_assumes casms
wenzelm@26713:       ||> Variable.set_body true;
wenzelm@28619:     val sorts = Variable.sorts_of ctxt';
wenzelm@17980: 
wenzelm@28619:     val stmt = Thm.weaken_sorts sorts (Conjunction.mk_conjunction_balanced cprops);
wenzelm@28340: 
wenzelm@28340:     fun result () =
wenzelm@28340:       (case SINGLE (tac {prems = prems, context = ctxt'}) (init stmt) of
wenzelm@19774:         NONE => err "Tactic failed."
wenzelm@28340:       | SOME st =>
wenzelm@28340:           let val res = finish st handle THM (msg, _, _) => err msg in
wenzelm@28619:             if Unify.matches_list thy [Thm.term_of stmt] [Thm.prop_of res]
wenzelm@28619:             then Thm.check_shyps sorts res
wenzelm@28340:             else err ("Proved a different theorem: " ^ string_of_term (Thm.prop_of res))
wenzelm@28340:           end);
wenzelm@28340:     val res =
wenzelm@29088:       if immediate orelse #maxidx (Thm.rep_cterm stmt) >= 0 orelse not (Future.enabled ())
wenzelm@29088:       then result ()
wenzelm@28973:       else future_result ctxt' (Future.fork_background result) (Thm.term_of stmt);
wenzelm@17980:   in
wenzelm@28340:     Conjunction.elim_balanced (length props) res
wenzelm@20290:     |> map (Assumption.export false ctxt' ctxt)
wenzelm@20056:     |> Variable.export ctxt' ctxt
wenzelm@20250:     |> map Drule.zero_var_indexes
wenzelm@17980:   end;
wenzelm@17980: 
wenzelm@28341: val prove_multi = prove_common true;
wenzelm@17980: 
wenzelm@28446: fun prove_future ctxt xs asms prop tac = hd (prove_common false ctxt xs asms [prop] tac);
wenzelm@28340: fun prove ctxt xs asms prop tac = hd (prove_common true ctxt xs asms [prop] tac);
wenzelm@20056: 
wenzelm@20056: fun prove_global thy xs asms prop tac =
wenzelm@26713:   Drule.standard (prove (ProofContext.init thy) xs asms prop tac);
wenzelm@18027: 
wenzelm@18027: 
wenzelm@17980: 
wenzelm@21687: (** goal structure **)
wenzelm@21687: 
wenzelm@21687: (* nested goals *)
wenzelm@18207: 
wenzelm@19184: fun extract i n st =
wenzelm@19184:   (if i < 1 orelse n < 1 orelse i + n - 1 > Thm.nprems_of st then Seq.empty
wenzelm@19184:    else if n = 1 then Seq.single (Thm.cprem_of st i)
wenzelm@23418:    else
wenzelm@23418:      Seq.single (Conjunction.mk_conjunction_balanced (map (Thm.cprem_of st) (i upto i + n - 1))))
wenzelm@20260:   |> Seq.map (Thm.adjust_maxidx_cterm ~1 #> init);
wenzelm@17980: 
wenzelm@19221: fun retrofit i n st' st =
wenzelm@19221:   (if n = 1 then st
wenzelm@23418:    else st |> Drule.with_subgoal i (Conjunction.uncurry_balanced n))
wenzelm@19221:   |> Thm.compose_no_flatten false (conclude st', Thm.nprems_of st') i;
wenzelm@18207: 
wenzelm@17980: fun SELECT_GOAL tac i st =
wenzelm@19191:   if Thm.nprems_of st = 1 andalso i = 1 then tac st
wenzelm@19184:   else Seq.lifts (retrofit i 1) (Seq.maps tac (extract i 1 st)) st;
wenzelm@17980: 
wenzelm@21687: 
wenzelm@21687: (* multiple goals *)
wenzelm@21687: 
wenzelm@23418: fun precise_conjunction_tac 0 i = eq_assume_tac i
wenzelm@23418:   | precise_conjunction_tac 1 i = SUBGOAL (K all_tac) i
wenzelm@23418:   | precise_conjunction_tac n i = PRIMITIVE (Drule.with_subgoal i (Conjunction.curry_balanced n));
wenzelm@23414: 
wenzelm@23418: val adhoc_conjunction_tac = REPEAT_ALL_NEW
wenzelm@23418:   (SUBGOAL (fn (goal, i) =>
wenzelm@23418:     if can Logic.dest_conjunction goal then rtac Conjunction.conjunctionI i
wenzelm@23418:     else no_tac));
wenzelm@21687: 
wenzelm@23418: val conjunction_tac = SUBGOAL (fn (goal, i) =>
wenzelm@23418:   precise_conjunction_tac (length (Logic.dest_conjunctions goal)) i ORELSE
wenzelm@23418:   TRY (adhoc_conjunction_tac i));
wenzelm@21687: 
wenzelm@23418: val recover_conjunction_tac = PRIMITIVE (fn th =>
wenzelm@23418:   Conjunction.uncurry_balanced (Thm.nprems_of th) th);
wenzelm@23414: 
wenzelm@23414: fun PRECISE_CONJUNCTS n tac =
wenzelm@23414:   SELECT_GOAL (precise_conjunction_tac n 1
wenzelm@23414:     THEN tac
wenzelm@23418:     THEN recover_conjunction_tac);
wenzelm@23414: 
wenzelm@21687: fun CONJUNCTS tac =
wenzelm@21687:   SELECT_GOAL (conjunction_tac 1
wenzelm@21687:     THEN tac
wenzelm@23418:     THEN recover_conjunction_tac);
wenzelm@21687: 
wenzelm@21687: 
wenzelm@21687: (* hhf normal form *)
wenzelm@21687: 
wenzelm@21687: val norm_hhf_tac =
wenzelm@21687:   rtac Drule.asm_rl  (*cheap approximation -- thanks to builtin Logic.flatten_params*)
wenzelm@21687:   THEN' SUBGOAL (fn (t, i) =>
wenzelm@21687:     if Drule.is_norm_hhf t then all_tac
wenzelm@28619:     else MetaSimplifier.rewrite_goal_tac Drule.norm_hhf_eqs i);
wenzelm@21687: 
wenzelm@25301: fun compose_hhf_tac th i st =
wenzelm@25301:   PRIMSEQ (Thm.bicompose false (false, Drule.lift_all (Thm.cprem_of st i) th, 0) i) st;
wenzelm@21687: 
wenzelm@23237: 
wenzelm@23237: (* non-atomic goal assumptions *)
wenzelm@23237: 
wenzelm@23356: fun non_atomic (Const ("==>", _) $ _ $ _) = true
wenzelm@23356:   | non_atomic (Const ("all", _) $ _) = true
wenzelm@23356:   | non_atomic _ = false;
wenzelm@23356: 
wenzelm@23237: fun assume_rule_tac ctxt = norm_hhf_tac THEN' CSUBGOAL (fn (goal, i) =>
wenzelm@23237:   let
wenzelm@23237:     val ((_, goal'), ctxt') = Variable.focus goal ctxt;
wenzelm@23237:     val goal'' = Drule.cterm_rule (singleton (Variable.export ctxt' ctxt)) goal';
wenzelm@23356:     val Rs = filter (non_atomic o Thm.term_of) (Drule.strip_imp_prems goal'');
wenzelm@23237:     val tacs = Rs |> map (fn R =>
wenzelm@23237:       Tactic.etac (MetaSimplifier.norm_hhf (Thm.trivial R)) THEN_ALL_NEW assume_tac);
wenzelm@23237:   in fold_rev (curry op APPEND') tacs (K no_tac) i end);
wenzelm@23237: 
wenzelm@18207: end;
wenzelm@18207: 
wenzelm@17980: structure BasicGoal: BASIC_GOAL = Goal;
wenzelm@17980: open BasicGoal;