src/HOL/Tools/TFL/post.ML

  * Extract termination goals so that they can be put it into a goalstack, or
  * have a tactic directly applied to them.
  *--------------------------------------------------------------------------*)
 fun termination_goals rules =
     map (Type.legacy_freeze o HOLogic.dest_Trueprop)
-      (fold_rev (union (op aconv) o prems_of) rules []);
+      (fold_rev (union (op aconv) o Thm.prems_of) rules []);
 
 (*---------------------------------------------------------------------------
  * Three postprocessors are applied to the definition.  It
  * attempts to prove wellfoundedness of the given relation, simplifies the
  * non-proved termination conditions, and finally attempts to prove the

    let val {lhs,rhs} = USyntax.dest_eq (#2 (USyntax.strip_forall (#2 (Rules.dest_thm th))));
    in lhs aconv rhs end
    handle Utils.ERR _ => false;
    
 val P_imp_P_eq_True = @{thm eqTrueI} RS eq_reflection;
-fun mk_meta_eq r = case concl_of r of
+fun mk_meta_eq r =
+  (case Thm.concl_of r of
      Const(@{const_name Pure.eq},_)$_$_ => r
   |   _ $(Const(@{const_name HOL.eq},_)$_$_) => r RS eq_reflection
-  |   _ => r RS P_imp_P_eq_True
+  |   _ => r RS P_imp_P_eq_True)
 
 (*Is this the best way to invoke the simplifier??*)
 fun rewrite ctxt L = rewrite_rule ctxt (map mk_meta_eq (filter_out id_thm L))
 
 fun join_assums ctxt th =
   let val thy = Thm.theory_of_thm th
-      val tych = cterm_of thy
+      val tych = Thm.cterm_of thy
       val {lhs,rhs} = USyntax.dest_eq(#2 (USyntax.strip_forall (concl th)))
       val cntxtl = (#1 o USyntax.strip_imp) lhs  (* cntxtl should = cntxtr *)
       val cntxtr = (#1 o USyntax.strip_imp) rhs  (* but union is solider *)
       val cntxt = union (op aconv) cntxtl cntxtr
   in

   end;
 
 
 (*lcp: curry the predicate of the induction rule*)
 fun curry_rule ctxt rl =
-  Split_Rule.split_rule_var ctxt (Term.head_of (HOLogic.dest_Trueprop (concl_of rl))) rl;
+  Split_Rule.split_rule_var ctxt (Term.head_of (HOLogic.dest_Trueprop (Thm.concl_of rl))) rl;
 
 (*lcp: put a theorem into Isabelle form, using meta-level connectives*)
 fun meta_outer ctxt =
   curry_rule ctxt o Drule.export_without_context o
   rule_by_tactic ctxt (REPEAT (FIRSTGOAL (resolve_tac ctxt [allI, impI, conjI] ORELSE' etac conjE)));

  *---------------------------------------------------------------------------*)
 fun define_i strict ctxt congs wfs fid R eqs thy =
   let val {functional,pats} = Prim.mk_functional thy eqs
       val (thy, def) = Prim.wfrec_definition0 thy fid R functional
       val ctxt = Proof_Context.transfer thy ctxt
-      val (lhs, _) = Logic.dest_equals (prop_of def)
+      val (lhs, _) = Logic.dest_equals (Thm.prop_of def)
       val {induct, rules, tcs} = simplify_defn strict thy ctxt congs wfs fid pats def
       val rules' = 
           if strict then derive_init_eqs ctxt rules eqs
           else rules
   in ({lhs = lhs, rules = rules', induct = induct, tcs = tcs}, thy) end;