src/HOL/Import/proof_kernel.ML
author nipkow
Mon Jan 30 21:49:41 2012 +0100 (2012-01-30)
changeset 46372 6fa9cdb8b850
parent 46202 78175db15b91
child 46506 c7faa011bfa7
permissions -rw-r--r--
added "'a rel"
     1 (*  Title:      HOL/Import/proof_kernel.ML
     2     Author:     Sebastian Skalberg and Steven Obua, TU Muenchen
     3 *)
     4 
     5 signature ProofKernel =
     6 sig
     7     type hol_type
     8     type tag
     9     type term
    10     type thm
    11     type ('a,'b) subst
    12 
    13     type proof_info
    14     datatype proof = Proof of proof_info * proof_content
    15          and proof_content
    16            = PRefl of term
    17            | PInstT of proof * (hol_type,hol_type) subst
    18            | PSubst of proof list * term * proof
    19            | PAbs of proof * term
    20            | PDisch of proof * term
    21            | PMp of proof * proof
    22            | PHyp of term
    23            | PAxm of string * term
    24            | PDef of string * string * term
    25            | PTmSpec of string * string list * proof
    26            | PTyDef of string * string * proof
    27            | PTyIntro of string * string * string * string * term * term * proof
    28            | POracle of tag * term list * term
    29            | PDisk
    30            | PSpec of proof * term
    31            | PInst of proof * (term,term) subst
    32            | PGen of proof * term
    33            | PGenAbs of proof * term option * term list
    34            | PImpAS of proof * proof
    35            | PSym of proof
    36            | PTrans of proof * proof
    37            | PComb of proof * proof
    38            | PEqMp of proof * proof
    39            | PEqImp of proof
    40            | PExists of proof * term * term
    41            | PChoose of term * proof * proof
    42            | PConj of proof * proof
    43            | PConjunct1 of proof
    44            | PConjunct2 of proof
    45            | PDisj1 of proof * term
    46            | PDisj2 of proof * term
    47            | PDisjCases of proof * proof * proof
    48            | PNotI of proof
    49            | PNotE of proof
    50            | PContr of proof * term
    51 
    52     exception PK of string * string
    53 
    54     val get_proof_dir: string -> theory -> string option
    55     val disambiguate_frees : Thm.thm -> Thm.thm
    56     val debug : bool Unsynchronized.ref
    57     val disk_info_of : proof -> (string * string) option
    58     val set_disk_info_of : proof -> string -> string -> unit
    59     val mk_proof : proof_content -> proof
    60     val content_of : proof -> proof_content
    61     val import_proof : string -> string -> theory -> (theory -> term) option * (theory -> proof)
    62 
    63     val rewrite_hol4_term: Term.term -> theory -> Thm.thm
    64 
    65     val type_of : term -> hol_type
    66 
    67     val get_thm  : string -> string         -> theory -> (theory * thm option)
    68     val get_def  : string -> string -> term -> theory -> (theory * thm option)
    69     val get_axiom: string -> string         -> theory -> (theory * thm option)
    70 
    71     val store_thm : string -> string -> thm -> theory -> theory * thm
    72 
    73     val to_isa_thm : thm -> (term * term) list * Thm.thm
    74     val to_isa_term: term -> Term.term
    75     val to_hol_thm : Thm.thm -> thm
    76 
    77     val REFL : term -> theory -> theory * thm
    78     val ASSUME : term -> theory -> theory * thm
    79     val INST_TYPE : (hol_type,hol_type) subst -> thm -> theory -> theory * thm
    80     val INST : (term,term)subst -> thm -> theory -> theory * thm
    81     val EQ_MP : thm -> thm -> theory -> theory * thm
    82     val EQ_IMP_RULE : thm -> theory -> theory * thm
    83     val SUBST : thm list -> term -> thm -> theory -> theory * thm
    84     val DISJ_CASES : thm -> thm -> thm -> theory -> theory * thm
    85     val DISJ1: thm -> term -> theory -> theory * thm
    86     val DISJ2: term -> thm -> theory -> theory * thm
    87     val IMP_ANTISYM: thm -> thm -> theory -> theory * thm
    88     val SYM : thm -> theory -> theory * thm
    89     val MP : thm -> thm -> theory -> theory * thm
    90     val GEN : term -> thm -> theory -> theory * thm
    91     val CHOOSE : term -> thm -> thm -> theory -> theory * thm
    92     val EXISTS : term -> term -> thm -> theory -> theory * thm
    93     val ABS : term -> thm -> theory -> theory * thm
    94     val GEN_ABS : term option -> term list -> thm -> theory -> theory * thm
    95     val TRANS : thm -> thm -> theory -> theory * thm
    96     val CCONTR : term -> thm -> theory -> theory * thm
    97     val CONJ : thm -> thm -> theory -> theory * thm
    98     val CONJUNCT1: thm -> theory -> theory * thm
    99     val CONJUNCT2: thm -> theory -> theory * thm
   100     val NOT_INTRO: thm -> theory -> theory * thm
   101     val NOT_ELIM : thm -> theory -> theory * thm
   102     val SPEC : term -> thm -> theory -> theory * thm
   103     val COMB : thm -> thm -> theory -> theory * thm
   104     val DISCH: term -> thm -> theory -> theory * thm
   105 
   106     val type_introduction: string -> string -> string -> string -> string -> term * term -> thm -> theory -> theory * thm
   107 
   108     val new_definition : string -> string -> term -> theory -> theory * thm
   109     val new_specification : string -> string -> string list -> thm -> theory -> theory * thm
   110     val new_type_definition : string -> string -> string -> thm -> theory -> theory * thm
   111     val new_axiom : string -> term -> theory -> theory * thm
   112 
   113     val prin : term -> unit
   114     val protect_factname : string -> string
   115     val replay_protect_varname : string -> string -> unit
   116     val replay_add_dump : string -> theory -> theory
   117 end
   118 
   119 structure ProofKernel :> ProofKernel =
   120 struct
   121 type hol_type = Term.typ
   122 type term = Term.term
   123 datatype tag = Tag of string list
   124 type ('a,'b) subst = ('a * 'b) list
   125 datatype thm = HOLThm of (Term.term * Term.term) list * Thm.thm
   126 
   127 fun hthm2thm (HOLThm (_, th)) = th
   128 
   129 fun to_hol_thm th = HOLThm ([], th)
   130 
   131 val replay_add_dump = add_dump
   132 fun add_dump s thy = replay_add_dump s thy
   133 
   134 datatype proof_info
   135   = Info of {disk_info: (string * string) option Unsynchronized.ref}
   136 
   137 datatype proof = Proof of proof_info * proof_content
   138      and proof_content
   139        = PRefl of term
   140        | PInstT of proof * (hol_type,hol_type) subst
   141        | PSubst of proof list * term * proof
   142        | PAbs of proof * term
   143        | PDisch of proof * term
   144        | PMp of proof * proof
   145        | PHyp of term
   146        | PAxm of string * term
   147        | PDef of string * string * term
   148        | PTmSpec of string * string list * proof
   149        | PTyDef of string * string * proof
   150        | PTyIntro of string * string * string * string * term * term * proof
   151        | POracle of tag * term list * term
   152        | PDisk
   153        | PSpec of proof * term
   154        | PInst of proof * (term,term) subst
   155        | PGen of proof * term
   156        | PGenAbs of proof * term option * term list
   157        | PImpAS of proof * proof
   158        | PSym of proof
   159        | PTrans of proof * proof
   160        | PComb of proof * proof
   161        | PEqMp of proof * proof
   162        | PEqImp of proof
   163        | PExists of proof * term * term
   164        | PChoose of term * proof * proof
   165        | PConj of proof * proof
   166        | PConjunct1 of proof
   167        | PConjunct2 of proof
   168        | PDisj1 of proof * term
   169        | PDisj2 of proof * term
   170        | PDisjCases of proof * proof * proof
   171        | PNotI of proof
   172        | PNotE of proof
   173        | PContr of proof * term
   174 
   175 exception PK of string * string
   176 fun ERR f mesg = PK (f,mesg)
   177 
   178 
   179 (* Compatibility. *)
   180 
   181 val string_of_mixfix = Pretty.string_of o Mixfix.pretty_mixfix;
   182 
   183 fun mk_syn thy c =
   184   if Lexicon.is_identifier c andalso not (Syntax.is_keyword (Sign.syn_of thy) c) then NoSyn
   185   else Delimfix (Syntax_Ext.escape c)
   186 
   187 fun quotename c =
   188   if Lexicon.is_identifier c andalso not (Keyword.is_keyword c) then c else quote c
   189 
   190 exception SMART_STRING
   191 
   192 fun no_vars context tm =
   193   let
   194     val ctxt = Variable.set_body false context;
   195     val ([tm'], _) = Variable.import_terms true [tm] ctxt;
   196   in tm' end
   197 
   198 fun smart_string_of_cterm ctxt0 ct =
   199     let
   200         val ctxt = ctxt0
   201           |> Config.put Syntax.ambiguity_enabled true
   202           |> Config.put show_brackets false
   203           |> Config.put show_all_types false
   204           |> Config.put show_types false
   205           |> Config.put show_sorts false;
   206         val {t,T,...} = rep_cterm ct
   207         (* Hack to avoid parse errors with Trueprop *)
   208         val t' = HOLogic.dest_Trueprop t
   209                  handle TERM _ => t
   210         val tn = no_vars ctxt t'
   211         fun match u =
   212             let val _ = Thm.match (ct, cterm_of (Proof_Context.theory_of ctxt) u) in true end
   213             handle Pattern.MATCH => false
   214         fun G 0 f ctxt x = f ctxt x
   215           | G 1 f ctxt x = f (Config.put show_types true ctxt) x
   216           | G 2 f ctxt x = G 1 f (Config.put show_sorts true ctxt) x
   217           | G 3 f ctxt x = G 2 f (Config.put show_all_types true ctxt) x
   218           | G 4 f ctxt x = G 3 f (Config.put show_brackets true ctxt) x
   219           | G _ _ _ _ = raise SMART_STRING
   220         fun F n =
   221             let
   222                 val str = G n Syntax.string_of_term ctxt tn
   223                 val _ = warning (@{make_string} (n, str))
   224                 val u = Syntax.parse_term ctxt str
   225                 val u = if t = t' then u else HOLogic.mk_Trueprop u
   226                 val u = Syntax.check_term ctxt (Type.constraint T u)
   227             in
   228                 if match u
   229                 then quote str
   230                 else F (n+1)
   231             end
   232             handle ERROR _ => F (n + 1)
   233               | SMART_STRING =>
   234                   let val _ =
   235                     warning ("smart_string failed for: "^ G 0 Syntax.string_of_term ctxt (term_of ct))
   236                   in quote (G 2 Syntax.string_of_term ctxt tn) end
   237     in
   238       Print_Mode.setmp [] F 0
   239     end
   240 
   241 fun smart_string_of_thm ctxt = smart_string_of_cterm ctxt o cprop_of
   242 
   243 fun prth th = writeln (Print_Mode.setmp [] Display.string_of_thm_without_context th);
   244 val topctxt = ML_Context.the_local_context ();
   245 fun prin t = writeln (Print_Mode.setmp []
   246   (fn () => Syntax.string_of_term topctxt t) ());
   247 fun pth (HOLThm(ren,thm)) =
   248     let
   249         (*val _ = writeln "Renaming:"
   250         val _ = app (fn(v,w) => (prin v; writeln " -->"; prin w)) ren*)
   251         val _ = prth thm
   252     in
   253         ()
   254     end
   255 
   256 fun disk_info_of (Proof(Info{disk_info,...},_)) = !disk_info
   257 fun mk_proof p = Proof(Info{disk_info = Unsynchronized.ref NONE},p)
   258 fun content_of (Proof(_,p)) = p
   259 
   260 fun set_disk_info_of (Proof(Info{disk_info,...},_)) thyname thmname =
   261     disk_info := SOME(thyname,thmname)
   262 
   263 structure Lib =
   264 struct
   265 
   266 fun assoc x =
   267     let
   268         fun F [] = raise PK("Lib.assoc","Not found")
   269           | F ((x',y)::rest) = if x = x'
   270                                then y
   271                                else F rest
   272     in
   273         F
   274     end
   275 infix mem;
   276 fun i mem L =
   277     let fun itr [] = false
   278           | itr (a::rst) = i=a orelse itr rst
   279     in itr L end;
   280 
   281 infix union;
   282 fun [] union S = S
   283   | S union [] = S
   284   | (a::rst) union S2 = rst union (insert (op =) a S2);
   285 
   286 fun implode_subst [] = []
   287   | implode_subst (x::r::rest) = ((x,r)::(implode_subst rest))
   288   | implode_subst _ = raise ERR "implode_subst" "malformed substitution list"
   289 
   290 end
   291 open Lib
   292 
   293 structure Tag =
   294 struct
   295 val empty_tag = Tag []
   296 fun read name = Tag [name]
   297 fun merge (Tag tag1) (Tag tag2) = Tag (Lib.union(tag1,tag2))
   298 end
   299 
   300 (* Actual code. *)
   301 
   302 fun get_segment thyname l = (Lib.assoc "s" l
   303                              handle PK _ => thyname)
   304 val get_name : (string * string) list -> string = Lib.assoc "n"
   305 
   306 exception XML of string
   307 
   308 datatype xml = Elem of string * (string * string) list * xml list
   309 datatype XMLtype = XMLty of xml | FullType of hol_type
   310 datatype XMLterm = XMLtm of xml | FullTerm of term
   311 
   312 fun xml_to_import_xml (XML.Elem ((n, l), ts)) = Elem (n, l, map xml_to_import_xml ts)
   313   | xml_to_import_xml (XML.Text _) = raise XML "Incorrect proof file: text";
   314 
   315 val type_of = Term.type_of
   316 
   317 val propT = Type("prop",[])
   318 
   319 fun mk_defeq name rhs thy =
   320     let
   321         val ty = type_of rhs
   322     in
   323         Logic.mk_equals (Const(Sign.intern_const thy name,ty),rhs)
   324     end
   325 
   326 fun mk_teq name rhs thy =
   327     let
   328         val ty = type_of rhs
   329     in
   330         HOLogic.mk_eq (Const(Sign.intern_const thy name,ty),rhs)
   331     end
   332 
   333 fun intern_const_name thyname const thy =
   334     case get_hol4_const_mapping thyname const thy of
   335         SOME (_,cname,_) => cname
   336       | NONE => (case get_hol4_const_renaming thyname const thy of
   337                      SOME cname => Sign.intern_const thy (thyname ^ "." ^ cname)
   338                    | NONE => Sign.intern_const thy (thyname ^ "." ^ const))
   339 
   340 fun intern_type_name thyname const thy =
   341     case get_hol4_type_mapping thyname const thy of
   342         SOME (_,cname) => cname
   343       | NONE => Sign.intern_const thy (thyname ^ "." ^ const)
   344 
   345 fun mk_vartype name = TFree(name,["HOL.type"])
   346 fun mk_thy_type thy Thy Tyop Args = Type(intern_type_name Thy Tyop thy,Args)
   347 
   348 val mk_var = Free
   349 
   350 fun mk_thy_const thy Thy Nam Ty = Const(intern_const_name Thy Nam thy,Ty)
   351 
   352 local
   353   fun get_const sg thyname name =
   354     (case Sign.const_type sg name of
   355       SOME ty => Const (name, ty)
   356     | NONE => raise ERR "get_type" (name ^ ": No such constant"))
   357 in
   358 fun prim_mk_const thy Thy Nam =
   359     let
   360       val name = intern_const_name Thy Nam thy
   361       val cmaps = HOL4ConstMaps.get thy
   362     in
   363       case StringPair.lookup cmaps (Thy,Nam) of
   364         SOME(_,_,SOME ty) => Const(name,ty)
   365       | _ => get_const thy Thy name
   366     end
   367 end
   368 
   369 fun mk_comb(f,a) = f $ a
   370 
   371 (* Needed for HOL Light *)
   372 fun protect_tyvarname s =
   373     let
   374         fun no_quest s =
   375             if Char.contains s #"?"
   376             then String.translate (fn #"?" => "q_" | c => Char.toString c) s
   377             else s
   378         fun beg_prime s =
   379             if String.isPrefix "'" s
   380             then s
   381             else "'" ^ s
   382     in
   383         s |> no_quest |> beg_prime
   384     end
   385 
   386 val protected_varnames = Unsynchronized.ref (Symtab.empty:string Symtab.table)
   387 val invented_isavar = Unsynchronized.ref 0
   388 
   389 fun innocent_varname s = Lexicon.is_identifier s andalso not (String.isPrefix "u_" s)
   390 
   391 fun valid_boundvarname s =
   392   can (fn () => Syntax.read_term_global @{theory Main} ("SOME "^s^". True")) ();
   393 
   394 fun valid_varname s =
   395   can (fn () => Syntax.read_term_global @{theory Main} s) ();
   396 
   397 fun protect_varname s =
   398     if innocent_varname s andalso valid_varname s then s else
   399     case Symtab.lookup (!protected_varnames) s of
   400       SOME t => t
   401     | NONE =>
   402       let
   403           val _ = Unsynchronized.inc invented_isavar
   404           val t = "u_" ^ string_of_int (!invented_isavar)
   405           val _ = protected_varnames := Symtab.update (s, t) (!protected_varnames)
   406       in
   407           t
   408       end
   409 
   410 exception REPLAY_PROTECT_VARNAME of string*string*string
   411 
   412 fun replay_protect_varname s t =
   413         case Symtab.lookup (!protected_varnames) s of
   414           SOME t' => raise REPLAY_PROTECT_VARNAME (s, t, t')
   415         | NONE =>
   416           let
   417               val _ = Unsynchronized.inc invented_isavar
   418               val t = "u_" ^ string_of_int (!invented_isavar)
   419               val _ = protected_varnames := Symtab.update (s, t) (!protected_varnames)
   420           in
   421               ()
   422           end
   423 
   424 fun protect_boundvarname s = if innocent_varname s andalso valid_boundvarname s then s else "u"
   425 
   426 fun mk_lambda (v as Free (x, T)) t = Abs (protect_boundvarname x, T, abstract_over (v, t))
   427   | mk_lambda (v as Var ((x, _), T)) t = Abs (protect_boundvarname x, T, abstract_over (v, t))
   428   | mk_lambda v t = raise TERM ("lambda", [v, t]);
   429 
   430 fun replacestr x y s =
   431 let
   432   val xl = raw_explode x
   433   val yl = raw_explode y
   434   fun isprefix [] ys = true
   435     | isprefix (x::xs) (y::ys) = if x = y then isprefix xs ys else false
   436     | isprefix _ _ = false
   437   fun isp s = isprefix xl s
   438   fun chg s = yl@(List.drop (s, List.length xl))
   439   fun r [] = []
   440     | r (S as (s::ss)) = if isp S then r (chg S) else s::(r ss)
   441 in
   442   implode(r (raw_explode s))
   443 end
   444 
   445 fun protect_factname s = replacestr "." "_dot_" s
   446 fun unprotect_factname s = replacestr "_dot_" "." s
   447 
   448 val ty_num_prefix = "N_"
   449 
   450 fun startsWithDigit s = Char.isDigit (hd (String.explode s))
   451 
   452 fun protect_tyname tyn =
   453   let
   454     val tyn' =
   455       if String.isPrefix ty_num_prefix tyn then raise (ERR "protect_ty_name" ("type name '"^tyn^"' is reserved")) else
   456       (if startsWithDigit tyn then ty_num_prefix^tyn else tyn)
   457   in
   458     tyn'
   459   end
   460 
   461 fun protect_constname tcn = tcn
   462  (* if tcn = ".." then "dotdot"
   463   else if tcn = "==" then "eqeq"
   464   else tcn*)
   465 
   466 structure TypeNet =
   467 struct
   468 
   469 fun get_type_from_index thy thyname types is =
   470     case Int.fromString is of
   471         SOME i => (case Array.sub(types,i) of
   472                        FullType ty => ty
   473                      | XMLty xty =>
   474                        let
   475                            val ty = get_type_from_xml thy thyname types xty
   476                            val _  = Array.update(types,i,FullType ty)
   477                        in
   478                            ty
   479                        end)
   480       | NONE => raise ERR "get_type_from_index" "Bad index"
   481 and get_type_from_xml thy thyname types =
   482     let
   483         fun gtfx (Elem("tyi",[("i",iS)],[])) =
   484                  get_type_from_index thy thyname types iS
   485           | gtfx (Elem("tyc",atts,[])) =
   486             mk_thy_type thy
   487                         (get_segment thyname atts)
   488                         (protect_tyname (get_name atts))
   489                         []
   490           | gtfx (Elem("tyv",[("n",s)],[])) = mk_vartype (protect_tyvarname s)
   491           | gtfx (Elem("tya",[],(Elem("tyc",atts,[]))::tys)) =
   492             mk_thy_type thy
   493                         (get_segment thyname atts)
   494                         (protect_tyname (get_name atts))
   495                         (map gtfx tys)
   496           | gtfx _ = raise ERR "get_type" "Bad type"
   497     in
   498         gtfx
   499     end
   500 
   501 fun input_types thyname (Elem("tylist",[("i",i)],xtys)) =
   502     let
   503         val types = Array.array(the (Int.fromString i),XMLty (Elem("",[],[])))
   504         fun IT _ [] = ()
   505           | IT n (xty::xtys) =
   506             (Array.update(types,n,XMLty xty);
   507              IT (n+1) xtys)
   508         val _ = IT 0 xtys
   509     in
   510         types
   511     end
   512   | input_types _ _ = raise ERR "input_types" "Bad type list"
   513 end
   514 
   515 structure TermNet =
   516 struct
   517 
   518 fun get_term_from_index thy thyname types terms is =
   519     case Int.fromString is of
   520         SOME i => (case Array.sub(terms,i) of
   521                        FullTerm tm => tm
   522                      | XMLtm xtm =>
   523                        let
   524                            val tm = get_term_from_xml thy thyname types terms xtm
   525                            val _  = Array.update(terms,i,FullTerm tm)
   526                        in
   527                            tm
   528                        end)
   529       | NONE => raise ERR "get_term_from_index" "Bad index"
   530 and get_term_from_xml thy thyname types terms =
   531     let
   532         fun get_type [] = NONE
   533           | get_type [ty] = SOME (TypeNet.get_type_from_xml thy thyname types ty)
   534           | get_type _ = raise ERR "get_term" "Bad type"
   535 
   536         fun gtfx (Elem("tmv",[("n",name),("t",tyi)],[])) =
   537             mk_var(protect_varname name,TypeNet.get_type_from_index thy thyname types tyi)
   538           | gtfx (Elem("tmc",atts,[])) =
   539             let
   540                 val segment = get_segment thyname atts
   541                 val name = protect_constname(get_name atts)
   542             in
   543                 mk_thy_const thy segment name (TypeNet.get_type_from_index thy thyname types (Lib.assoc "t" atts))
   544                 handle PK _ => prim_mk_const thy segment name
   545             end
   546           | gtfx (Elem("tma",[("f",tmf),("a",tma)],[])) =
   547             let
   548                 val f = get_term_from_index thy thyname types terms tmf
   549                 val a = get_term_from_index thy thyname types terms tma
   550             in
   551                 mk_comb(f,a)
   552             end
   553           | gtfx (Elem("tml",[("x",tmx),("a",tma)],[])) =
   554             let
   555                 val x = get_term_from_index thy thyname types terms tmx
   556                 val a = get_term_from_index thy thyname types terms tma
   557             in
   558                 mk_lambda x a
   559             end
   560           | gtfx (Elem("tmi",[("i",iS)],[])) =
   561             get_term_from_index thy thyname types terms iS
   562           | gtfx (Elem(tag,_,_)) =
   563             raise ERR "get_term" ("Not a term: "^tag)
   564     in
   565         gtfx
   566     end
   567 
   568 fun input_terms thyname types (Elem("tmlist",[("i",i)],xtms)) =
   569     let
   570         val terms = Array.array(the (Int.fromString i), XMLtm (Elem("",[],[])))
   571 
   572         fun IT _ [] = ()
   573           | IT n (xtm::xtms) =
   574             (Array.update(terms,n,XMLtm xtm);
   575              IT (n+1) xtms)
   576         val _ = IT 0 xtms
   577     in
   578         terms
   579     end
   580   | input_terms _ _ _ = raise ERR "input_terms" "Bad term list"
   581 end
   582 
   583 fun get_proof_dir (thyname:string) thy =
   584     let
   585         val import_segment =
   586             case get_segment2 thyname thy of
   587                 SOME seg => seg
   588               | NONE => get_import_segment thy
   589         val path = space_explode ":" (getenv "HOL4_PROOFS")
   590         fun find [] = NONE
   591           | find (p::ps) =
   592             (let
   593                  val dir = OS.Path.joinDirFile {dir = p,file=import_segment}
   594              in
   595                  if OS.FileSys.isDir dir
   596                  then SOME dir
   597                  else find ps
   598              end) handle OS.SysErr _ => find ps
   599     in
   600         Option.map (fn p => OS.Path.joinDirFile {dir = p, file = thyname}) (find path)
   601     end
   602 
   603 fun proof_file_name thyname thmname thy =
   604     let
   605         val path = case get_proof_dir thyname thy of
   606                        SOME p => p
   607                      | NONE => error "Cannot find proof files"
   608         val _ = OS.FileSys.mkDir path handle OS.SysErr _ => ()
   609     in
   610         OS.Path.joinDirFile {dir = path, file = OS.Path.joinBaseExt {base = (unprotect_factname thmname), ext = SOME "prf"}}
   611     end
   612 
   613 fun xml_to_proof thyname types terms prf thy =
   614     let
   615         val xml_to_hol_type = TypeNet.get_type_from_xml thy thyname types
   616         val xml_to_term = TermNet.get_term_from_xml thy thyname types terms
   617 
   618         fun index_to_term is =
   619             TermNet.get_term_from_index thy thyname types terms is
   620 
   621         fun x2p (Elem("prefl",[("i",is)],[])) = mk_proof (PRefl (index_to_term is))
   622           | x2p (Elem("pinstt",[],p::lambda)) =
   623             let
   624                 val p = x2p p
   625                 val lambda = implode_subst (map xml_to_hol_type lambda)
   626             in
   627                 mk_proof (PInstT(p,lambda))
   628             end
   629           | x2p (Elem("psubst",[("i",is)],prf::prfs)) =
   630             let
   631                 val tm = index_to_term is
   632                 val prf = x2p prf
   633                 val prfs = map x2p prfs
   634             in
   635                 mk_proof (PSubst(prfs,tm,prf))
   636             end
   637           | x2p (Elem("pabs",[("i",is)],[prf])) =
   638             let
   639                 val p = x2p prf
   640                 val t = index_to_term is
   641             in
   642                 mk_proof (PAbs (p,t))
   643             end
   644           | x2p (Elem("pdisch",[("i",is)],[prf])) =
   645             let
   646                 val p = x2p prf
   647                 val t = index_to_term is
   648             in
   649                 mk_proof (PDisch (p,t))
   650             end
   651           | x2p (Elem("pmp",[],[prf1,prf2])) =
   652             let
   653                 val p1 = x2p prf1
   654                 val p2 = x2p prf2
   655             in
   656                 mk_proof (PMp(p1,p2))
   657             end
   658           | x2p (Elem("phyp",[("i",is)],[])) = mk_proof (PHyp (index_to_term is))
   659           | x2p (Elem("paxiom",[("n",n),("i",is)],[])) =
   660             mk_proof (PAxm(n,index_to_term is))
   661           | x2p (Elem("pfact",atts,[])) =
   662             let
   663                 val thyname = get_segment thyname atts
   664                 val thmname = protect_factname (get_name atts)
   665                 val p = mk_proof PDisk
   666                 val _  = set_disk_info_of p thyname thmname
   667             in
   668                 p
   669             end
   670           | x2p (Elem("pdef",[("s",seg),("n",name),("i",is)],[])) =
   671             mk_proof (PDef(seg,protect_constname name,index_to_term is))
   672           | x2p (Elem("ptmspec",[("s",seg)],p::names)) =
   673             let
   674                 val names = map (fn Elem("name",[("n",name)],[]) => name
   675                                   | _ => raise ERR "x2p" "Bad proof (ptmspec)") names
   676             in
   677                 mk_proof (PTmSpec(seg,names,x2p p))
   678             end
   679           | x2p (Elem("ptyintro",[("s",seg),("n",name),("a",abs_name),("r",rep_name)],[xP,xt,p])) =
   680             let
   681                 val P = xml_to_term xP
   682                 val t = xml_to_term xt
   683             in
   684                 mk_proof (PTyIntro(seg,protect_tyname name,protect_constname abs_name,protect_constname rep_name,P,t,x2p p))
   685             end
   686           | x2p (Elem("ptydef",[("s",seg),("n",name)],[p])) =
   687             mk_proof (PTyDef(seg,protect_tyname name,x2p p))
   688           | x2p (xml as Elem("poracle",[],chldr)) =
   689             let
   690                 val (oracles,terms) = List.partition (fn (Elem("oracle",_,_)) => true | _ => false) chldr
   691                 val ors = map (fn (Elem("oracle",[("n",name)],[])) => name | xml => raise ERR "x2p" "bad oracle") oracles
   692                 val (c,asl) = case terms of
   693                                   [] => raise ERR "x2p" "Bad oracle description"
   694                                 | (hd::tl) => (hd,tl)
   695                 val tg = fold_rev (Tag.merge o Tag.read) ors Tag.empty_tag
   696             in
   697                 mk_proof (POracle(tg,map xml_to_term asl,xml_to_term c))
   698             end
   699           | x2p (Elem("pspec",[("i",is)],[prf])) =
   700             let
   701                 val p = x2p prf
   702                 val tm = index_to_term is
   703             in
   704                 mk_proof (PSpec(p,tm))
   705             end
   706           | x2p (Elem("pinst",[],p::theta)) =
   707             let
   708                 val p = x2p p
   709                 val theta = implode_subst (map xml_to_term theta)
   710             in
   711                 mk_proof (PInst(p,theta))
   712             end
   713           | x2p (Elem("pgen",[("i",is)],[prf])) =
   714             let
   715                 val p = x2p prf
   716                 val tm = index_to_term is
   717             in
   718                 mk_proof (PGen(p,tm))
   719             end
   720           | x2p (Elem("pgenabs",[],prf::tms)) =
   721             let
   722                 val p = x2p prf
   723                 val tml = map xml_to_term tms
   724             in
   725                 mk_proof (PGenAbs(p,NONE,tml))
   726             end
   727           | x2p (Elem("pgenabs",[("i",is)],prf::tms)) =
   728             let
   729                 val p = x2p prf
   730                 val tml = map xml_to_term tms
   731             in
   732                 mk_proof (PGenAbs(p,SOME (index_to_term is),tml))
   733             end
   734           | x2p (Elem("pimpas",[],[prf1,prf2])) =
   735             let
   736                 val p1 = x2p prf1
   737                 val p2 = x2p prf2
   738             in
   739                 mk_proof (PImpAS(p1,p2))
   740             end
   741           | x2p (Elem("psym",[],[prf])) =
   742             let
   743                 val p = x2p prf
   744             in
   745                 mk_proof (PSym p)
   746             end
   747           | x2p (Elem("ptrans",[],[prf1,prf2])) =
   748             let
   749                 val p1 = x2p prf1
   750                 val p2 = x2p prf2
   751             in
   752                 mk_proof (PTrans(p1,p2))
   753             end
   754           | x2p (Elem("pcomb",[],[prf1,prf2])) =
   755             let
   756                 val p1 = x2p prf1
   757                 val p2 = x2p prf2
   758             in
   759                 mk_proof (PComb(p1,p2))
   760             end
   761           | x2p (Elem("peqmp",[],[prf1,prf2])) =
   762             let
   763                 val p1 = x2p prf1
   764                 val p2 = x2p prf2
   765             in
   766                 mk_proof (PEqMp(p1,p2))
   767             end
   768           | x2p (Elem("peqimp",[],[prf])) =
   769             let
   770                 val p = x2p prf
   771             in
   772                 mk_proof (PEqImp p)
   773             end
   774           | x2p (Elem("pexists",[("e",ise),("w",isw)],[prf])) =
   775             let
   776                 val p = x2p prf
   777                 val ex = index_to_term ise
   778                 val w = index_to_term isw
   779             in
   780                 mk_proof (PExists(p,ex,w))
   781             end
   782           | x2p (Elem("pchoose",[("i",is)],[prf1,prf2])) =
   783             let
   784                 val v  = index_to_term is
   785                 val p1 = x2p prf1
   786                 val p2 = x2p prf2
   787             in
   788                 mk_proof (PChoose(v,p1,p2))
   789             end
   790           | x2p (Elem("pconj",[],[prf1,prf2])) =
   791             let
   792                 val p1 = x2p prf1
   793                 val p2 = x2p prf2
   794             in
   795                 mk_proof (PConj(p1,p2))
   796             end
   797           | x2p (Elem("pconjunct1",[],[prf])) =
   798             let
   799                 val p = x2p prf
   800             in
   801                 mk_proof (PConjunct1 p)
   802             end
   803           | x2p (Elem("pconjunct2",[],[prf])) =
   804             let
   805                 val p = x2p prf
   806             in
   807                 mk_proof (PConjunct2 p)
   808             end
   809           | x2p (Elem("pdisj1",[("i",is)],[prf])) =
   810             let
   811                 val p = x2p prf
   812                 val t = index_to_term is
   813             in
   814                 mk_proof (PDisj1 (p,t))
   815             end
   816           | x2p (Elem("pdisj2",[("i",is)],[prf])) =
   817             let
   818                 val p = x2p prf
   819                 val t = index_to_term is
   820             in
   821                 mk_proof (PDisj2 (p,t))
   822             end
   823           | x2p (Elem("pdisjcases",[],[prf1,prf2,prf3])) =
   824             let
   825                 val p1 = x2p prf1
   826                 val p2 = x2p prf2
   827                 val p3 = x2p prf3
   828             in
   829                 mk_proof (PDisjCases(p1,p2,p3))
   830             end
   831           | x2p (Elem("pnoti",[],[prf])) =
   832             let
   833                 val p = x2p prf
   834             in
   835                 mk_proof (PNotI p)
   836             end
   837           | x2p (Elem("pnote",[],[prf])) =
   838             let
   839                 val p = x2p prf
   840             in
   841                 mk_proof (PNotE p)
   842             end
   843           | x2p (Elem("pcontr",[("i",is)],[prf])) =
   844             let
   845                 val p = x2p prf
   846                 val t = index_to_term is
   847             in
   848                 mk_proof (PContr (p,t))
   849             end
   850           | x2p xml = raise ERR "x2p" "Bad proof"
   851     in
   852         x2p prf
   853     end
   854 
   855 fun import_proof_concl thyname thmname thy =
   856     let
   857         val is = TextIO.openIn(proof_file_name thyname thmname thy)
   858         val proof_xml = xml_to_import_xml (XML.parse (TextIO.inputAll is))
   859         val _ = TextIO.closeIn is
   860     in
   861         case proof_xml of
   862             Elem("proof",[],xtypes::xterms::prf::rest) =>
   863             let
   864                 val types = TypeNet.input_types thyname xtypes
   865                 val terms = TermNet.input_terms thyname types xterms
   866                 fun f xtm thy = TermNet.get_term_from_xml thy thyname types terms xtm
   867             in
   868                 case rest of
   869                     [] => NONE
   870                   | [xtm] => SOME (f xtm)
   871                   | _ => raise ERR "import_proof" "Bad argument list"
   872             end
   873           | _ => raise ERR "import_proof" "Bad proof"
   874     end
   875 
   876 fun import_proof thyname thmname thy =
   877     let
   878         val is = TextIO.openIn(proof_file_name thyname thmname thy)
   879         val proof_xml = xml_to_import_xml (XML.parse (TextIO.inputAll is))
   880         val _ = TextIO.closeIn is
   881     in
   882         case proof_xml of
   883             Elem("proof",[],xtypes::xterms::prf::rest) =>
   884             let
   885                 val types = TypeNet.input_types thyname xtypes
   886                 val terms = TermNet.input_terms thyname types xterms
   887             in
   888                 (case rest of
   889                      [] => NONE
   890                    | [xtm] => SOME (fn thy => TermNet.get_term_from_xml thy thyname types terms xtm)
   891                    | _ => raise ERR "import_proof" "Bad argument list",
   892                  xml_to_proof thyname types terms prf)
   893             end
   894           | _ => raise ERR "import_proof" "Bad proof"
   895     end
   896 
   897 fun uniq_compose m th i st =
   898     let
   899         val res = Thm.bicompose false (false,th,m) i st
   900     in
   901         case Seq.pull res of
   902             SOME (th,rest) => (case Seq.pull rest of
   903                                    SOME _ => raise ERR "uniq_compose" "Not unique!"
   904                                  | NONE => th)
   905           | NONE => raise ERR "uniq_compose" "No result"
   906     end
   907 
   908 val reflexivity_thm = @{thm refl}
   909 val mp_thm = @{thm mp}
   910 val imp_antisym_thm = @{thm light_imp_as}
   911 val disch_thm = @{thm impI}
   912 val ccontr_thm = @{thm ccontr}
   913 
   914 val meta_eq_to_obj_eq_thm = @{thm meta_eq_to_obj_eq}
   915 
   916 val gen_thm = @{thm HOLallI}
   917 val choose_thm = @{thm exE}
   918 val exists_thm = @{thm exI}
   919 val conj_thm = @{thm conjI}
   920 val conjunct1_thm = @{thm conjunct1}
   921 val conjunct2_thm = @{thm conjunct2}
   922 val spec_thm = @{thm spec}
   923 val disj_cases_thm = @{thm disjE}
   924 val disj1_thm = @{thm disjI1}
   925 val disj2_thm = @{thm disjI2}
   926 
   927 local
   928     val th = @{thm not_def}
   929     val thy = theory_of_thm th
   930     val pp = Thm.reflexive (cterm_of thy (Const(@{const_name Trueprop},HOLogic.boolT-->propT)))
   931 in
   932 val not_elim_thm = Thm.combination pp th
   933 end
   934 
   935 val not_intro_thm = Thm.symmetric not_elim_thm
   936 val abs_thm = @{thm ext}
   937 val trans_thm = @{thm trans}
   938 val symmetry_thm = @{thm sym}
   939 val eqmp_thm = @{thm iffD1}
   940 val eqimp_thm = @{thm HOL4Setup.eq_imp}
   941 val comb_thm = @{thm cong}
   942 
   943 (* Beta-eta normalizes a theorem (only the conclusion, not the *
   944 hypotheses!)  *)
   945 
   946 fun beta_eta_thm th =
   947     let
   948         val th1 = Thm.equal_elim (Thm.beta_conversion true (cprop_of th))  th
   949         val th2 = Thm.equal_elim (Thm.eta_conversion       (cprop_of th1)) th1
   950     in
   951         th2
   952     end
   953 
   954 fun implies_elim_all th =
   955     Library.foldl (fn (th,p) => Thm.implies_elim th (Thm.assume p)) (th,cprems_of th)
   956 
   957 fun norm_hyps th =
   958     th |> beta_eta_thm
   959        |> implies_elim_all
   960        |> implies_intr_hyps
   961 
   962 fun mk_GEN v th sg =
   963     let
   964         val c = HOLogic.dest_Trueprop (concl_of th)
   965         val cv = cterm_of sg v
   966         val lc = Term.lambda v c
   967         val clc = Thm.cterm_of sg lc
   968         val cvty = ctyp_of_term cv
   969         val th1 = implies_elim_all th
   970         val th2 = beta_eta_thm (Thm.forall_intr cv th1)
   971         val th3 = th2 COMP (beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME clc] gen_thm))
   972         val c = prop_of th3
   973         val vname = fst(dest_Free v)
   974         val (cold,cnew) = case c of
   975                               tpc $ (Const(@{const_name All},allT) $ Abs(oldname,ty,body)) =>
   976                               (Abs(oldname,dummyT,Bound 0),Abs(vname,dummyT,Bound 0))
   977                             | tpc $ (Const(@{const_name All},allT) $ rest) => (tpc,tpc)
   978                             | _ => raise ERR "mk_GEN" "Unknown conclusion"
   979         val th4 = Thm.rename_boundvars cold cnew th3
   980         val res = implies_intr_hyps th4
   981     in
   982         res
   983     end
   984 
   985 fun rearrange sg tm th =
   986     let
   987         val tm' = Envir.beta_eta_contract tm
   988         fun find []      n = Thm.permute_prems 0 1 (Thm.implies_intr (Thm.cterm_of sg tm) th)
   989           | find (p::ps) n = if tm' aconv (Envir.beta_eta_contract p)
   990                              then Thm.permute_prems n 1 th
   991                              else find ps (n+1)
   992     in
   993         find (prems_of th) 0
   994     end
   995 
   996 fun zip (x::xs) (y::ys) = (x,y)::(zip xs ys)
   997   | zip [] [] = []
   998   | zip _ _ = raise ERR "zip" "arguments not of same length"
   999 
  1000 fun mk_INST dom rng th =
  1001     th |> forall_intr_list dom
  1002        |> forall_elim_list rng
  1003 
  1004 (* Code for disambiguating variablenames (wrt. types) *)
  1005 
  1006 val disamb_info_empty = {vars=[],rens=[]}
  1007 
  1008 fun rens_of {vars,rens} = rens
  1009 
  1010 fun disamb_term_from info tm = (info, tm)
  1011 
  1012 fun has_ren (HOLThm _) = false
  1013 
  1014 fun disamb_thm_from info (HOLThm (_,thm)) = (info, thm)
  1015 
  1016 fun disamb_terms_from info tms = (info, tms)
  1017 
  1018 fun disamb_thms_from info hthms = (info, map hthm2thm hthms)
  1019 
  1020 fun disamb_term tm   = disamb_term_from disamb_info_empty tm
  1021 fun disamb_thm thm   = disamb_thm_from disamb_info_empty thm
  1022 fun disamb_thms thms = disamb_thms_from disamb_info_empty thms
  1023 
  1024 fun norm_hthm thy (hth as HOLThm _) = hth
  1025 
  1026 (* End of disambiguating code *)
  1027 
  1028 fun disambiguate_frees thm =
  1029     let
  1030       fun ERR s = error ("Drule.disambiguate_frees: "^s)
  1031       val ct = cprop_of thm
  1032       val t = term_of ct
  1033       val thy = theory_of_cterm ct
  1034       val frees = Misc_Legacy.term_frees t
  1035       val freenames = Term.add_free_names t []
  1036       val is_old_name = member (op =) freenames
  1037       fun name_of (Free (n, _)) = n
  1038         | name_of _ = ERR "name_of"
  1039       fun new_name' bump map n =
  1040           let val n' = n^bump in
  1041             if is_old_name n' orelse Symtab.lookup map n' <> NONE then
  1042               new_name' (Symbol.bump_string bump) map n
  1043             else
  1044               n'
  1045           end
  1046       val new_name = new_name' "a"
  1047       fun replace_name n' (Free (n, t)) = Free (n', t)
  1048         | replace_name _ _ = ERR "replace_name"
  1049       (* map: old or fresh name -> old free,
  1050          invmap: old free which has fresh name assigned to it -> fresh name *)
  1051       fun dis v (mapping as (map,invmap)) =
  1052           let val n = name_of v in
  1053             case Symtab.lookup map n of
  1054               NONE => (Symtab.update (n, v) map, invmap)
  1055             | SOME v' =>
  1056               if v=v' then
  1057                 mapping
  1058               else
  1059                 let val n' = new_name map n in
  1060                   (Symtab.update (n', v) map,
  1061                    Termtab.update (v, n') invmap)
  1062                 end
  1063           end
  1064     in
  1065       if (length freenames = length frees) then
  1066         thm
  1067       else
  1068         let
  1069           val (_, invmap) =
  1070               fold dis frees (Symtab.empty, Termtab.empty)
  1071           fun make_subst (oldfree, newname) (intros, elims) =
  1072               (cterm_of thy oldfree :: intros,
  1073                cterm_of thy (replace_name newname oldfree) :: elims)
  1074           val (intros, elims) = fold make_subst (Termtab.dest invmap) ([], [])
  1075         in
  1076           forall_elim_list elims (forall_intr_list intros thm)
  1077         end
  1078     end
  1079 
  1080 val debug = Unsynchronized.ref false
  1081 
  1082 fun if_debug f x = if !debug then f x else ()
  1083 val message = if_debug writeln
  1084 
  1085 fun get_hol4_thm thyname thmname thy =
  1086     case get_hol4_theorem thyname thmname thy of
  1087         SOME hth => SOME (HOLThm hth)
  1088       | NONE =>
  1089         let
  1090             val pending = HOL4Pending.get thy
  1091         in
  1092             case StringPair.lookup pending (thyname,thmname) of
  1093                 SOME hth => SOME (HOLThm hth)
  1094               | NONE => NONE
  1095         end
  1096 
  1097 fun non_trivial_term_consts t = fold_aterms
  1098   (fn Const (c, _) =>
  1099       if c = @{const_name Trueprop} orelse c = @{const_name All}
  1100         orelse c = @{const_name HOL.implies} orelse c = @{const_name HOL.conj} orelse c = @{const_name HOL.eq}
  1101       then I else insert (op =) c
  1102     | _ => I) t [];
  1103 
  1104 fun split_name str =
  1105     let
  1106         val sub = Substring.full str
  1107         val (f,idx) = apsnd Substring.string (Substring.splitr Char.isDigit sub)
  1108         val (newstr,u) = pairself Substring.string (Substring.splitr (fn c => c = #"_") f)
  1109     in
  1110         if not (idx = "") andalso u = "_"
  1111         then SOME (newstr, the (Int.fromString idx))
  1112         else NONE
  1113     end
  1114     handle _ => NONE  (* FIXME avoid handle _ *)
  1115 
  1116 fun rewrite_hol4_term t thy =
  1117     let
  1118         val hol4rews1 = map (Thm.transfer thy) (HOL4Rewrites.get thy)
  1119         val hol4ss = Simplifier.global_context thy empty_ss addsimps hol4rews1
  1120     in
  1121         Thm.transfer thy (Simplifier.full_rewrite hol4ss (cterm_of thy t))
  1122     end
  1123 
  1124 fun get_isabelle_thm thyname thmname hol4conc thy =
  1125     let
  1126         val (info,hol4conc') = disamb_term hol4conc
  1127         val i2h_conc = Thm.symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
  1128         val isaconc =
  1129             case concl_of i2h_conc of
  1130                 Const("==",_) $ lhs $ _ => lhs
  1131               | _ => error "get_isabelle_thm" "Bad rewrite rule"
  1132         val _ = (message "Original conclusion:";
  1133                  if_debug prin hol4conc';
  1134                  message "Modified conclusion:";
  1135                  if_debug prin isaconc)
  1136 
  1137         fun mk_res th = HOLThm (rens_of info, Thm.equal_elim i2h_conc th)
  1138     in
  1139         case get_hol4_mapping thyname thmname thy of
  1140             SOME (SOME thmname) =>
  1141             let
  1142                 val th1 = (SOME (Global_Theory.get_thm thy thmname)
  1143                            handle ERROR _ =>
  1144                                   (case split_name thmname of
  1145                                        SOME (listname,idx) => (SOME (nth (Global_Theory.get_thms thy listname) (idx - 1))
  1146                                                                handle _ => NONE)  (* FIXME avoid handle _ *)
  1147                                      | NONE => NONE))
  1148             in
  1149                 case th1 of
  1150                     SOME th2 =>
  1151                     (case Shuffler.set_prop thy isaconc [(thmname,th2)] of
  1152                          SOME (_,th) => (message "YES";(thy, SOME (mk_res th)))
  1153                        | NONE => (message "NO2";error "get_isabelle_thm" "Bad mapping"))
  1154                   | NONE => (message "NO1";error "get_isabelle_thm" "Bad mapping")
  1155             end
  1156           | SOME NONE => error ("Trying to access ignored theorem " ^ thmname)
  1157           | NONE =>
  1158             let
  1159                 val _ = (message "Looking for conclusion:";
  1160                          if_debug prin isaconc)
  1161                 val cs = non_trivial_term_consts isaconc;
  1162                 val _ = (message "Looking for consts:";
  1163                          message (commas cs))
  1164                 val pot_thms = Shuffler.find_potential thy isaconc
  1165                 val _ = message (string_of_int (length pot_thms) ^ " potential theorems")
  1166             in
  1167                 case Shuffler.set_prop thy isaconc pot_thms of
  1168                     SOME (isaname,th) =>
  1169                     let
  1170                         val hth as HOLThm args = mk_res th
  1171                         val thy' =  thy |> add_hol4_theorem thyname thmname args
  1172                                         |> add_hol4_mapping thyname thmname isaname
  1173                     in
  1174                         (thy',SOME hth)
  1175                     end
  1176                   | NONE => (thy,NONE)
  1177             end
  1178     end
  1179     handle e =>
  1180       if Exn.is_interrupt e then reraise e
  1181       else
  1182         (if_debug (fn () =>
  1183             writeln ("Exception in get_isabelle_thm:\n" ^ ML_Compiler.exn_message e)) ();
  1184           (thy,NONE))
  1185 
  1186 fun get_isabelle_thm_and_warn thyname thmname hol4conc thy =
  1187   let
  1188     val (a, b) = get_isabelle_thm thyname thmname hol4conc thy
  1189     fun warn () =
  1190         let
  1191             val (info,hol4conc') = disamb_term hol4conc
  1192             val i2h_conc = Thm.symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
  1193         in
  1194             case concl_of i2h_conc of
  1195                 Const("==",_) $ lhs $ _ =>
  1196                 (warning ("Failed lookup of theorem '"^thmname^"':");
  1197                  writeln "Original conclusion:";
  1198                  prin hol4conc';
  1199                  writeln "Modified conclusion:";
  1200                  prin lhs)
  1201               | _ => ()
  1202         end
  1203   in
  1204       case b of
  1205           NONE => (warn () handle _ => (); (a,b)) (* FIXME avoid handle _ *)
  1206         | _ => (a, b)
  1207   end
  1208 
  1209 fun get_thm thyname thmname thy =
  1210     case get_hol4_thm thyname thmname thy of
  1211         SOME hth => (thy,SOME hth)
  1212       | NONE => ((case import_proof_concl thyname thmname thy of
  1213                       SOME f => get_isabelle_thm_and_warn thyname thmname (f thy) thy
  1214                     | NONE => (message "No conclusion"; (thy,NONE)))
  1215                  handle e as IO.Io _ => (message "IO exception"; (thy,NONE))
  1216                       | e as PK _ => (message "PK exception"; (thy,NONE)))
  1217 
  1218 fun rename_const thyname thy name =
  1219     case get_hol4_const_renaming thyname name thy of
  1220         SOME cname => cname
  1221       | NONE => name
  1222 
  1223 fun get_def thyname constname rhs thy =
  1224     let
  1225         val constname = rename_const thyname thy constname
  1226         val (thmname,thy') = get_defname thyname constname thy
  1227         val _ = message ("Looking for definition " ^ thyname ^ "." ^ thmname)
  1228     in
  1229         get_isabelle_thm_and_warn thyname thmname (mk_teq (thyname ^ "." ^ constname) rhs thy') thy'
  1230     end
  1231 
  1232 fun get_axiom thyname axname thy =
  1233     case get_thm thyname axname thy of
  1234         arg as (_,SOME _) => arg
  1235       | _ => raise ERR "get_axiom" ("Trying to retrieve axiom (" ^ axname ^ ")")
  1236 
  1237 fun intern_store_thm gen_output thyname thmname hth thy =
  1238     let
  1239         val (hth' as HOLThm (args as (_,th))) = norm_hthm thy hth
  1240         val rew = rewrite_hol4_term (concl_of th) thy
  1241         val th  = Thm.equal_elim rew th
  1242         val thy' = add_hol4_pending thyname thmname args thy
  1243         val th = disambiguate_frees th
  1244         val th = Object_Logic.rulify th
  1245         val thy2 =
  1246           if gen_output
  1247           then
  1248             add_dump ("lemma " ^ (quotename thmname) ^ ": " ^
  1249                 (smart_string_of_thm (Syntax.init_pretty_global thy') th) ^ "\n  by (import " ^
  1250                 thyname ^ " " ^ (quotename thmname) ^ ")") thy'
  1251           else thy'
  1252     in
  1253         (thy2,hth')
  1254     end
  1255 
  1256 val store_thm = intern_store_thm true
  1257 
  1258 fun mk_REFL ctm =
  1259     let
  1260         val cty = Thm.ctyp_of_term ctm
  1261     in
  1262         Drule.instantiate' [SOME cty] [SOME ctm] reflexivity_thm
  1263     end
  1264 
  1265 fun REFL tm thy =
  1266     let
  1267         val _ = message "REFL:"
  1268         val (info,tm') = disamb_term tm
  1269         val ctm = Thm.cterm_of thy tm'
  1270         val res = HOLThm(rens_of info,mk_REFL ctm)
  1271         val _ = if_debug pth res
  1272     in
  1273         (thy,res)
  1274     end
  1275 
  1276 fun ASSUME tm thy =
  1277     let
  1278         val _ = message "ASSUME:"
  1279         val (info,tm') = disamb_term tm
  1280         val ctm = Thm.cterm_of thy (HOLogic.mk_Trueprop tm')
  1281         val th = Thm.trivial ctm
  1282         val res = HOLThm(rens_of info,th)
  1283         val _ = if_debug pth res
  1284     in
  1285         (thy,res)
  1286     end
  1287 
  1288 fun INST_TYPE lambda (hth as HOLThm(rens,th)) thy =
  1289     let
  1290         val _ = message "INST_TYPE:"
  1291         val _ = if_debug pth hth
  1292         val tys_before = Misc_Legacy.add_term_tfrees (prop_of th,[])
  1293         val th1 = Thm.varifyT_global th
  1294         val tys_after = Misc_Legacy.add_term_tvars (prop_of th1,[])
  1295         val tyinst = map (fn (bef, iS) =>
  1296                              (case try (Lib.assoc (TFree bef)) lambda of
  1297                                   SOME ty => (ctyp_of thy (TVar iS), ctyp_of thy ty)
  1298                                 | NONE => (ctyp_of thy (TVar iS), ctyp_of thy (TFree bef))
  1299                              ))
  1300                          (zip tys_before tys_after)
  1301         val res = Drule.instantiate_normalize (tyinst,[]) th1
  1302         val hth = HOLThm([],res)
  1303         val res = norm_hthm thy hth
  1304         val _ = message "RESULT:"
  1305         val _ = if_debug pth res
  1306     in
  1307         (thy,res)
  1308     end
  1309 
  1310 fun INST sigma hth thy =
  1311     let
  1312         val _ = message "INST:"
  1313         val _ = if_debug (app (fn (x,y) => (prin x; prin y))) sigma
  1314         val _ = if_debug pth hth
  1315         val (sdom,srng) = ListPair.unzip (rev sigma)
  1316         val th = hthm2thm hth
  1317         val th1 = mk_INST (map (cterm_of thy) sdom) (map (cterm_of thy) srng) th
  1318         val res = HOLThm([],th1)
  1319         val _ = message "RESULT:"
  1320         val _ = if_debug pth res
  1321     in
  1322         (thy,res)
  1323     end
  1324 
  1325 fun EQ_IMP_RULE (hth as HOLThm(rens,th)) thy =
  1326     let
  1327         val _ = message "EQ_IMP_RULE:"
  1328         val _ = if_debug pth hth
  1329         val res = HOLThm(rens,th RS eqimp_thm)
  1330         val _ = message "RESULT:"
  1331         val _ = if_debug pth res
  1332     in
  1333         (thy,res)
  1334     end
  1335 
  1336 fun mk_EQ_MP th1 th2 = [beta_eta_thm th1, beta_eta_thm th2] MRS eqmp_thm
  1337 
  1338 fun EQ_MP hth1 hth2 thy =
  1339     let
  1340         val _ = message "EQ_MP:"
  1341         val _ = if_debug pth hth1
  1342         val _ = if_debug pth hth2
  1343         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1344         val res = HOLThm(rens_of info,mk_EQ_MP th1 th2)
  1345         val _ = message "RESULT:"
  1346         val _ = if_debug pth res
  1347     in
  1348         (thy,res)
  1349     end
  1350 
  1351 fun mk_COMB th1 th2 thy =
  1352     let
  1353         val (f,g) = case concl_of th1 of
  1354                         _ $ (Const(@{const_name HOL.eq},_) $ f $ g) => (f,g)
  1355                       | _ => raise ERR "mk_COMB" "First theorem not an equality"
  1356         val (x,y) = case concl_of th2 of
  1357                         _ $ (Const(@{const_name HOL.eq},_) $ x $ y) => (x,y)
  1358                       | _ => raise ERR "mk_COMB" "Second theorem not an equality"
  1359         val fty = type_of f
  1360         val (fd,fr) = Term.dest_funT fty
  1361         val comb_thm' = Drule.instantiate'
  1362                             [SOME (ctyp_of thy fd),SOME (ctyp_of thy fr)]
  1363                             [SOME (cterm_of thy f),SOME (cterm_of thy g),
  1364                              SOME (cterm_of thy x),SOME (cterm_of thy y)] comb_thm
  1365     in
  1366         [th1,th2] MRS comb_thm'
  1367     end
  1368 
  1369 fun SUBST rews ctxt hth thy =
  1370     let
  1371         val _ = message "SUBST:"
  1372         val _ = if_debug (app pth) rews
  1373         val _ = if_debug prin ctxt
  1374         val _ = if_debug pth hth
  1375         val (info,th) = disamb_thm hth
  1376         val (info1,ctxt') = disamb_term_from info ctxt
  1377         val (info2,rews') = disamb_thms_from info1 rews
  1378 
  1379         val cctxt = cterm_of thy ctxt'
  1380         fun subst th [] = th
  1381           | subst th (rew::rews) = subst (mk_COMB th rew thy) rews
  1382         val res = HOLThm(rens_of info2,mk_EQ_MP (subst (mk_REFL cctxt) rews') th)
  1383         val _ = message "RESULT:"
  1384         val _ = if_debug pth res
  1385     in
  1386         (thy,res)
  1387     end
  1388 
  1389 fun DISJ_CASES hth hth1 hth2 thy =
  1390     let
  1391         val _ = message "DISJ_CASES:"
  1392         val _ = if_debug (app pth) [hth,hth1,hth2]
  1393         val (info,th) = disamb_thm hth
  1394         val (info1,th1) = disamb_thm_from info hth1
  1395         val (info2,th2) = disamb_thm_from info1 hth2
  1396         val th1 = norm_hyps th1
  1397         val th2 = norm_hyps th2
  1398         val (l,r) = case concl_of th of
  1399                         _ $ (Const(@{const_name HOL.disj},_) $ l $ r) => (l,r)
  1400                       | _ => raise ERR "DISJ_CASES" "Conclusion not a disjunction"
  1401         val th1' = rearrange thy (HOLogic.mk_Trueprop l) th1
  1402         val th2' = rearrange thy (HOLogic.mk_Trueprop r) th2
  1403         val res1 = th RS disj_cases_thm
  1404         val res2 = uniq_compose ((nprems_of th1')-1) th1' ((nprems_of th)+1) res1
  1405         val res3 = uniq_compose ((nprems_of th2')-1) th2' (nprems_of res2) res2
  1406         val res  = HOLThm(rens_of info2,res3)
  1407         val _ = message "RESULT:"
  1408         val _ = if_debug pth res
  1409     in
  1410         (thy,res)
  1411     end
  1412 
  1413 fun DISJ1 hth tm thy =
  1414     let
  1415         val _ = message "DISJ1:"
  1416         val _ = if_debug pth hth
  1417         val _ = if_debug prin tm
  1418         val (info,th) = disamb_thm hth
  1419         val (info',tm') = disamb_term_from info tm
  1420         val ct = Thm.cterm_of thy tm'
  1421         val disj1_thm' = Drule.instantiate' [] [NONE,SOME ct] disj1_thm
  1422         val res = HOLThm(rens_of info',th RS disj1_thm')
  1423         val _ = message "RESULT:"
  1424         val _ = if_debug pth res
  1425     in
  1426         (thy,res)
  1427     end
  1428 
  1429 fun DISJ2 tm hth thy =
  1430     let
  1431         val _ = message "DISJ1:"
  1432         val _ = if_debug prin tm
  1433         val _ = if_debug pth hth
  1434         val (info,th) = disamb_thm hth
  1435         val (info',tm') = disamb_term_from info tm
  1436         val ct = Thm.cterm_of thy tm'
  1437         val disj2_thm' = Drule.instantiate' [] [NONE,SOME ct] disj2_thm
  1438         val res = HOLThm(rens_of info',th RS disj2_thm')
  1439         val _ = message "RESULT:"
  1440         val _ = if_debug pth res
  1441     in
  1442         (thy,res)
  1443     end
  1444 
  1445 fun IMP_ANTISYM hth1 hth2 thy =
  1446     let
  1447         val _ = message "IMP_ANTISYM:"
  1448         val _ = if_debug pth hth1
  1449         val _ = if_debug pth hth2
  1450         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1451         val th = [beta_eta_thm th1,beta_eta_thm th2] MRS imp_antisym_thm
  1452         val res = HOLThm(rens_of info,th)
  1453         val _ = message "RESULT:"
  1454         val _ = if_debug pth res
  1455     in
  1456         (thy,res)
  1457     end
  1458 
  1459 fun SYM (hth as HOLThm(rens,th)) thy =
  1460     let
  1461         val _ = message "SYM:"
  1462         val _ = if_debug pth hth
  1463         val th = th RS symmetry_thm
  1464         val res = HOLThm(rens,th)
  1465         val _ = message "RESULT:"
  1466         val _ = if_debug pth res
  1467     in
  1468         (thy,res)
  1469     end
  1470 
  1471 fun MP hth1 hth2 thy =
  1472     let
  1473         val _ = message "MP:"
  1474         val _ = if_debug pth hth1
  1475         val _ = if_debug pth hth2
  1476         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1477         val th = [beta_eta_thm th1,beta_eta_thm th2] MRS mp_thm
  1478         val res = HOLThm(rens_of info,th)
  1479         val _ = message "RESULT:"
  1480         val _ = if_debug pth res
  1481     in
  1482         (thy,res)
  1483     end
  1484 
  1485 fun CONJ hth1 hth2 thy =
  1486     let
  1487         val _ = message "CONJ:"
  1488         val _ = if_debug pth hth1
  1489         val _ = if_debug pth hth2
  1490         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1491         val th = [th1,th2] MRS conj_thm
  1492         val res = HOLThm(rens_of info,th)
  1493         val _ = message "RESULT:"
  1494         val _ = if_debug pth res
  1495     in
  1496         (thy,res)
  1497     end
  1498 
  1499 fun CONJUNCT1 (hth as HOLThm(rens,th)) thy =
  1500     let
  1501         val _ = message "CONJUNCT1:"
  1502         val _ = if_debug pth hth
  1503         val res = HOLThm(rens,th RS conjunct1_thm)
  1504         val _ = message "RESULT:"
  1505         val _ = if_debug pth res
  1506     in
  1507         (thy,res)
  1508     end
  1509 
  1510 fun CONJUNCT2 (hth as HOLThm(rens,th)) thy =
  1511     let
  1512         val _ = message "CONJUNCT1:"
  1513         val _ = if_debug pth hth
  1514         val res = HOLThm(rens,th RS conjunct2_thm)
  1515         val _ = message "RESULT:"
  1516         val _ = if_debug pth res
  1517     in
  1518         (thy,res)
  1519     end
  1520 
  1521 fun EXISTS ex wit hth thy =
  1522     let
  1523         val _ = message "EXISTS:"
  1524         val _ = if_debug prin ex
  1525         val _ = if_debug prin wit
  1526         val _ = if_debug pth hth
  1527         val (info,th) = disamb_thm hth
  1528         val (info',[ex',wit']) = disamb_terms_from info [ex,wit]
  1529         val cwit = cterm_of thy wit'
  1530         val cty = ctyp_of_term cwit
  1531         val a = case ex' of
  1532                     (Const(@{const_name Ex},_) $ a) => a
  1533                   | _ => raise ERR "EXISTS" "Argument not existential"
  1534         val ca = cterm_of thy a
  1535         val exists_thm' = beta_eta_thm (Drule.instantiate' [SOME cty] [SOME ca,SOME cwit] exists_thm)
  1536         val th1 = beta_eta_thm th
  1537         val th2 = implies_elim_all th1
  1538         val th3 = th2 COMP exists_thm'
  1539         val th  = implies_intr_hyps th3
  1540         val res = HOLThm(rens_of info',th)
  1541         val _   = message "RESULT:"
  1542         val _   = if_debug pth res
  1543     in
  1544         (thy,res)
  1545     end
  1546 
  1547 fun CHOOSE v hth1 hth2 thy =
  1548     let
  1549         val _ = message "CHOOSE:"
  1550         val _ = if_debug prin v
  1551         val _ = if_debug pth hth1
  1552         val _ = if_debug pth hth2
  1553         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1554         val (info',v') = disamb_term_from info v
  1555         fun strip 0 _ th = th
  1556           | strip n (p::ps) th =
  1557             strip (n-1) ps (Thm.implies_elim th (Thm.assume p))
  1558           | strip _ _ _ = raise ERR "CHOOSE" "strip error"
  1559         val cv = cterm_of thy v'
  1560         val th2 = norm_hyps th2
  1561         val cvty = ctyp_of_term cv
  1562         val c = HOLogic.dest_Trueprop (concl_of th2)
  1563         val cc = cterm_of thy c
  1564         val a = case concl_of th1 of
  1565                     _ $ (Const(@{const_name Ex},_) $ a) => a
  1566                   | _ => raise ERR "CHOOSE" "Conclusion not existential"
  1567         val ca = cterm_of (theory_of_thm th1) a
  1568         val choose_thm' = beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME ca,SOME cc] choose_thm)
  1569         val th21 = rearrange thy (HOLogic.mk_Trueprop (a $ v')) th2
  1570         val th22 = strip ((nprems_of th21)-1) (cprems_of th21) th21
  1571         val th23 = beta_eta_thm (Thm.forall_intr cv th22)
  1572         val th11 = implies_elim_all (beta_eta_thm th1)
  1573         val th' = th23 COMP (th11 COMP choose_thm')
  1574         val th = implies_intr_hyps th'
  1575         val res = HOLThm(rens_of info',th)
  1576         val _   = message "RESULT:"
  1577         val _   = if_debug pth res
  1578     in
  1579         (thy,res)
  1580     end
  1581 
  1582 fun GEN v hth thy =
  1583     let
  1584       val _ = message "GEN:"
  1585         val _ = if_debug prin v
  1586         val _ = if_debug pth hth
  1587         val (info,th) = disamb_thm hth
  1588         val (info',v') = disamb_term_from info v
  1589         val res = HOLThm(rens_of info',mk_GEN v' th thy)
  1590         val _ = message "RESULT:"
  1591         val _ = if_debug pth res
  1592     in
  1593         (thy,res)
  1594     end
  1595 
  1596 fun SPEC tm hth thy =
  1597     let
  1598         val _ = message "SPEC:"
  1599         val _ = if_debug prin tm
  1600         val _ = if_debug pth hth
  1601         val (info,th) = disamb_thm hth
  1602         val (info',tm') = disamb_term_from info tm
  1603         val ctm = Thm.cterm_of thy tm'
  1604         val cty = Thm.ctyp_of_term ctm
  1605         val spec' = Drule.instantiate' [SOME cty] [NONE,SOME ctm] spec_thm
  1606         val th = th RS spec'
  1607         val res = HOLThm(rens_of info',th)
  1608         val _ = message "RESULT:"
  1609         val _ = if_debug pth res
  1610     in
  1611         (thy,res)
  1612     end
  1613 
  1614 fun COMB hth1 hth2 thy =
  1615     let
  1616         val _ = message "COMB:"
  1617         val _ = if_debug pth hth1
  1618         val _ = if_debug pth hth2
  1619         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1620         val res = HOLThm(rens_of info,mk_COMB th1 th2 thy)
  1621         val _ = message "RESULT:"
  1622         val _ = if_debug pth res
  1623     in
  1624         (thy,res)
  1625     end
  1626 
  1627 fun TRANS hth1 hth2 thy =
  1628     let
  1629         val _ = message "TRANS:"
  1630         val _ = if_debug pth hth1
  1631         val _ = if_debug pth hth2
  1632         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1633         val th = [th1,th2] MRS trans_thm
  1634         val res = HOLThm(rens_of info,th)
  1635         val _ = message "RESULT:"
  1636         val _ = if_debug pth res
  1637     in
  1638         (thy,res)
  1639     end
  1640 
  1641 
  1642 fun CCONTR tm hth thy =
  1643     let
  1644         val _ = message "SPEC:"
  1645         val _ = if_debug prin tm
  1646         val _ = if_debug pth hth
  1647         val (info,th) = disamb_thm hth
  1648         val (info',tm') = disamb_term_from info tm
  1649         val th = norm_hyps th
  1650         val ct = cterm_of thy tm'
  1651         val th1 = rearrange thy (HOLogic.mk_Trueprop (Const(@{const_name Not},HOLogic.boolT-->HOLogic.boolT) $ tm')) th
  1652         val ccontr_thm' = Drule.instantiate' [] [SOME ct] ccontr_thm
  1653         val res1 = uniq_compose ((nprems_of th1) - 1) th1 1 ccontr_thm'
  1654         val res = HOLThm(rens_of info',res1)
  1655         val _ = message "RESULT:"
  1656         val _ = if_debug pth res
  1657     in
  1658         (thy,res)
  1659     end
  1660 
  1661 fun mk_ABS v th thy =
  1662     let
  1663         val cv = cterm_of thy v
  1664         val th1 = implies_elim_all (beta_eta_thm th)
  1665         val (f,g) = case concl_of th1 of
  1666                         _ $ (Const(@{const_name HOL.eq},_) $ f $ g) => (Term.lambda v f,Term.lambda v g)
  1667                       | _ => raise ERR "mk_ABS" "Bad conclusion"
  1668         val (fd,fr) = Term.dest_funT (type_of f)
  1669         val abs_thm' = Drule.instantiate' [SOME (ctyp_of thy fd), SOME (ctyp_of thy fr)] [SOME (cterm_of thy f), SOME (cterm_of thy g)] abs_thm
  1670         val th2 = Thm.forall_intr cv th1
  1671         val th3 = th2 COMP abs_thm'
  1672         val res = implies_intr_hyps th3
  1673     in
  1674         res
  1675     end
  1676 
  1677 fun ABS v hth thy =
  1678     let
  1679         val _ = message "ABS:"
  1680         val _ = if_debug prin v
  1681         val _ = if_debug pth hth
  1682         val (info,th) = disamb_thm hth
  1683         val (info',v') = disamb_term_from info v
  1684         val res = HOLThm(rens_of info',mk_ABS v' th thy)
  1685         val _ = message "RESULT:"
  1686         val _ = if_debug pth res
  1687     in
  1688         (thy,res)
  1689     end
  1690 
  1691 fun GEN_ABS copt vlist hth thy =
  1692     let
  1693         val _ = message "GEN_ABS:"
  1694         val _ = case copt of
  1695                     SOME c => if_debug prin c
  1696                   | NONE => ()
  1697         val _ = if_debug (app prin) vlist
  1698         val _ = if_debug pth hth
  1699         val (info,th) = disamb_thm hth
  1700         val (info',vlist') = disamb_terms_from info vlist
  1701         val th1 =
  1702             case copt of
  1703                 SOME (c as Const(cname,cty)) =>
  1704                 let
  1705                     fun inst_type ty1 ty2 (TVar _) = raise ERR "GEN_ABS" "Type variable found!"
  1706                       | inst_type ty1 ty2 (ty as TFree _) = if ty1 = ty
  1707                                                             then ty2
  1708                                                             else ty
  1709                       | inst_type ty1 ty2 (Type(name,tys)) =
  1710                         Type(name,map (inst_type ty1 ty2) tys)
  1711                 in
  1712                     fold_rev (fn v => fn th =>
  1713                               let
  1714                                   val cdom = fst (Term.dest_funT (fst (Term.dest_funT cty)))
  1715                                   val vty  = type_of v
  1716                                   val newcty = inst_type cdom vty cty
  1717                                   val cc = cterm_of thy (Const(cname,newcty))
  1718                               in
  1719                                   mk_COMB (mk_REFL cc) (mk_ABS v th thy) thy
  1720                               end) vlist' th
  1721                 end
  1722               | SOME _ => raise ERR "GEN_ABS" "Bad constant"
  1723               | NONE =>
  1724                 fold_rev (fn v => fn th => mk_ABS v th thy) vlist' th
  1725         val res = HOLThm(rens_of info',th1)
  1726         val _ = message "RESULT:"
  1727         val _ = if_debug pth res
  1728     in
  1729         (thy,res)
  1730     end
  1731 
  1732 fun NOT_INTRO (hth as HOLThm(rens,th)) thy =
  1733     let
  1734         val _ = message "NOT_INTRO:"
  1735         val _ = if_debug pth hth
  1736         val th1 = implies_elim_all (beta_eta_thm th)
  1737         val a = case concl_of th1 of
  1738                     _ $ (Const(@{const_name HOL.implies},_) $ a $ Const(@{const_name False},_)) => a
  1739                   | _ => raise ERR "NOT_INTRO" "Conclusion of bad form"
  1740         val ca = cterm_of thy a
  1741         val th2 = Thm.equal_elim (Drule.instantiate' [] [SOME ca] not_intro_thm) th1
  1742         val res = HOLThm(rens,implies_intr_hyps th2)
  1743         val _ = message "RESULT:"
  1744         val _ = if_debug pth res
  1745     in
  1746         (thy,res)
  1747     end
  1748 
  1749 fun NOT_ELIM (hth as HOLThm(rens,th)) thy =
  1750     let
  1751         val _ = message "NOT_INTRO:"
  1752         val _ = if_debug pth hth
  1753         val th1 = implies_elim_all (beta_eta_thm th)
  1754         val a = case concl_of th1 of
  1755                     _ $ (Const(@{const_name Not},_) $ a) => a
  1756                   | _ => raise ERR "NOT_ELIM" "Conclusion of bad form"
  1757         val ca = cterm_of thy a
  1758         val th2 = Thm.equal_elim (Drule.instantiate' [] [SOME ca] not_elim_thm) th1
  1759         val res = HOLThm(rens,implies_intr_hyps th2)
  1760         val _ = message "RESULT:"
  1761         val _ = if_debug pth res
  1762     in
  1763         (thy,res)
  1764     end
  1765 
  1766 fun DISCH tm hth thy =
  1767     let
  1768         val _ = message "DISCH:"
  1769         val _ = if_debug prin tm
  1770         val _ = if_debug pth hth
  1771         val (info,th) = disamb_thm hth
  1772         val (info',tm') = disamb_term_from info tm
  1773         val th1 = beta_eta_thm th
  1774         val th2 = implies_elim_all th1
  1775         val th3 = Thm.implies_intr (cterm_of thy (HOLogic.mk_Trueprop tm')) th2
  1776         val th4 = th3 COMP disch_thm
  1777         val res = HOLThm (rens_of info', implies_intr_hyps th4)
  1778         val _ = message "RESULT:"
  1779         val _ = if_debug pth res
  1780     in
  1781         (thy,res)
  1782     end
  1783 
  1784 val spaces = space_implode " "
  1785 
  1786 fun new_definition thyname constname rhs thy =
  1787     let
  1788         val constname = rename_const thyname thy constname
  1789         val redeclared = is_some (Sign.const_type thy (Sign.intern_const thy constname));
  1790         val _ = warning ("Introducing constant " ^ constname)
  1791         val (thmname,thy) = get_defname thyname constname thy
  1792         val (info,rhs') = disamb_term rhs
  1793         val ctype = type_of rhs'
  1794         val csyn = mk_syn thy constname
  1795         val thy1 = case HOL4DefThy.get thy of
  1796                        Replaying _ => thy
  1797                      | _ => Sign.add_consts_i [(Binding.name constname,ctype,csyn)] thy
  1798         val eq = mk_defeq constname rhs' thy1
  1799         val (thms, thy2) = Global_Theory.add_defs false [((Binding.name thmname,eq),[])] thy1
  1800         val def_thm = hd thms
  1801         val thm' = def_thm RS meta_eq_to_obj_eq_thm
  1802         val (thy',th) = (thy2, thm')
  1803         val fullcname = Sign.intern_const thy' constname
  1804         val thy'' = add_hol4_const_mapping thyname constname true fullcname thy'
  1805         val (linfo,tm24) = disamb_term (mk_teq constname rhs' thy'')
  1806         val rew = rewrite_hol4_term eq thy''
  1807         val crhs = cterm_of thy'' (#2 (Logic.dest_equals (prop_of rew)))
  1808         val thy22 =
  1809           if Thm.def_name constname = thmname andalso not redeclared andalso csyn = NoSyn
  1810           then
  1811               let
  1812                   val ctxt = Syntax.init_pretty_global thy''
  1813                   val p1 = quotename constname
  1814                   val p2 = Syntax.string_of_typ ctxt ctype
  1815                   val p3 = string_of_mixfix csyn
  1816                   val p4 = smart_string_of_cterm ctxt crhs
  1817               in
  1818                 add_dump ("definition\n  " ^ p1 ^ " :: \"" ^ p2 ^ "\" "^ p3 ^ " where\n  " ^ p4) thy''
  1819               end
  1820           else
  1821               let val ctxt = Syntax.init_pretty_global thy'' in
  1822                 add_dump ("consts\n  " ^ quotename constname ^ " :: \"" ^
  1823                   Syntax.string_of_typ ctxt ctype ^
  1824                   "\" " ^ string_of_mixfix csyn ^ "\n\ndefs\n  " ^
  1825                   quotename thmname ^ ": " ^ smart_string_of_cterm ctxt crhs) thy''
  1826               end
  1827         val hth = case Shuffler.set_prop thy22 (HOLogic.mk_Trueprop tm24) [("",th)] of
  1828                       SOME (_,res) => HOLThm(rens_of linfo,res)
  1829                     | NONE => raise ERR "new_definition" "Bad conclusion"
  1830         val fullname = Sign.full_bname thy22 thmname
  1831         val thy22' = case opt_get_output_thy thy22 of
  1832                          "" => add_hol4_mapping thyname thmname fullname thy22
  1833                        | output_thy =>
  1834                          let
  1835                              val moved_thmname = output_thy ^ "." ^ thyname ^ "." ^ thmname
  1836                          in
  1837                              thy22 |> add_hol4_move fullname moved_thmname
  1838                                    |> add_hol4_mapping thyname thmname moved_thmname
  1839                          end
  1840         val _ = message "new_definition:"
  1841         val _ = if_debug pth hth
  1842     in
  1843         (thy22',hth)
  1844     end
  1845 
  1846 fun new_specification thyname thmname names hth thy =
  1847     case HOL4DefThy.get thy of
  1848         Replaying _ => (thy,hth)
  1849       | _ =>
  1850         let
  1851             val _ = message "NEW_SPEC:"
  1852             val _ = if_debug pth hth
  1853             val names = map (rename_const thyname thy) names
  1854             val _ = warning ("Introducing constants " ^ commas names)
  1855             val (HOLThm(rens,th)) = norm_hthm thy hth
  1856             val thy1 = case HOL4DefThy.get thy of
  1857                            Replaying _ => thy
  1858                          | _ =>
  1859                            let
  1860                                fun dest_eta_abs (Abs(x,xT,body)) = (x,xT,body)
  1861                                  | dest_eta_abs body =
  1862                                    let
  1863                                        val (dT,rT) = Term.dest_funT (type_of body)
  1864                                    in
  1865                                        ("x",dT,body $ Bound 0)
  1866                                    end
  1867                                    handle TYPE _ => raise ERR "new_specification" "not an abstraction type"
  1868                                fun dest_exists (Const(@{const_name Ex},_) $ abody) =
  1869                                    dest_eta_abs abody
  1870                                  | dest_exists tm =
  1871                                    raise ERR "new_specification" "Bad existential formula"
  1872 
  1873                                val (consts,_) = Library.foldl (fn ((cs,ex),cname) =>
  1874                                                           let
  1875                                                               val (_,cT,p) = dest_exists ex
  1876                                                           in
  1877                                                               ((cname,cT,mk_syn thy cname)::cs,p)
  1878                                                           end) (([],HOLogic.dest_Trueprop (concl_of th)),names)
  1879                                val str = Library.foldl (fn (acc, (c, T, csyn)) =>
  1880                                    acc ^ "\n  " ^ quotename c ^ " :: \"" ^
  1881                                    Syntax.string_of_typ_global thy T ^ "\" " ^ string_of_mixfix csyn) ("consts", consts)
  1882                                val thy' = add_dump str thy
  1883                            in
  1884                                Sign.add_consts_i (map (fn (c, T, mx) => (Binding.name c, T, mx)) consts) thy'
  1885                            end
  1886 
  1887             val thy1 = fold_rev (fn name => fn thy =>
  1888                                 snd (get_defname thyname name thy)) names thy1
  1889             fun new_name name = fst (get_defname thyname name thy1)
  1890             val names' = map (fn name => (new_name name,name,false)) names
  1891             val (thy',res) = Choice_Specification.add_specification NONE
  1892                                  names'
  1893                                  (thy1,th)
  1894             val res' = Thm.unvarify_global res
  1895             val hth = HOLThm(rens,res')
  1896             val rew = rewrite_hol4_term (concl_of res') thy'
  1897             val th  = Thm.equal_elim rew res'
  1898             fun handle_const (name,thy) =
  1899                 let
  1900                     val defname = Thm.def_name name
  1901                     val (newname,thy') = get_defname thyname name thy
  1902                 in
  1903                     (if defname = newname
  1904                      then quotename name
  1905                      else (quotename newname) ^ ": " ^ (quotename name),thy')
  1906                 end
  1907             val (new_names,thy') = fold_rev (fn name => fn (names, thy) =>
  1908                                             let
  1909                                                 val (name',thy') = handle_const (name,thy)
  1910                                             in
  1911                                                 (name'::names,thy')
  1912                                             end) names ([], thy')
  1913             val thy'' =
  1914               add_dump ("specification (" ^ (spaces new_names) ^ ") " ^ thmname ^ ": " ^
  1915                 (smart_string_of_thm (Syntax.init_pretty_global thy') th) ^
  1916                 "\n  by (import " ^ thyname ^ " " ^ thmname ^ ")")
  1917                 thy'
  1918             val _ = message "RESULT:"
  1919             val _ = if_debug pth hth
  1920         in
  1921             intern_store_thm false thyname thmname hth thy''
  1922         end
  1923 
  1924 fun new_axiom name tm thy = raise ERR "new_axiom" ("Oh, no you don't! (" ^ name ^ ")")
  1925 
  1926 fun to_isa_thm (hth as HOLThm(_,th)) =
  1927     let
  1928         val (HOLThm args) = norm_hthm (theory_of_thm th) hth
  1929     in
  1930         apsnd Thm.strip_shyps args
  1931     end
  1932 
  1933 fun to_isa_term tm = tm
  1934 
  1935 local
  1936     val light_nonempty = @{thm light_ex_imp_nonempty}
  1937     val ex_imp_nonempty = @{thm ex_imp_nonempty}
  1938     val typedef_hol2hol4 = @{thm typedef_hol2hol4}
  1939     val typedef_hol2hollight = @{thm typedef_hol2hollight}
  1940 in
  1941 fun new_type_definition thyname thmname tycname hth thy =
  1942     case HOL4DefThy.get thy of
  1943         Replaying _ => (thy,hth)
  1944       | _ =>
  1945         let
  1946             val _ = message "TYPE_DEF:"
  1947             val _ = if_debug pth hth
  1948             val _ = warning ("Introducing type " ^ tycname)
  1949             val (HOLThm(rens,td_th)) = norm_hthm thy hth
  1950             val th2 = beta_eta_thm (td_th RS ex_imp_nonempty)
  1951             val c = case concl_of th2 of
  1952                         _ $ (Const(@{const_name Ex},_) $ Abs(_,_,Const(@{const_name Set.member},_) $ _ $ c)) => c
  1953                       | _ => raise ERR "new_type_definition" "Bad type definition theorem"
  1954             val tfrees = Misc_Legacy.term_tfrees c
  1955             val tnames = map fst tfrees
  1956             val tsyn = mk_syn thy tycname
  1957             val ((_, typedef_info), thy') =
  1958               Typedef.add_typedef_global false (SOME (Binding.name thmname))
  1959                 (Binding.name tycname, map (rpair dummyS) tnames, tsyn) c NONE (rtac th2 1) thy
  1960 
  1961             val th3 = (#type_definition (#2 typedef_info)) RS typedef_hol2hol4
  1962 
  1963             val fulltyname = Sign.intern_type thy' tycname
  1964             val thy'' = add_hol4_type_mapping thyname tycname true fulltyname thy'
  1965 
  1966             val (hth' as HOLThm args) = norm_hthm thy'' (HOLThm(rens,th3))
  1967             val _ = if has_ren hth' then warning ("Theorem " ^ thmname ^ " needs variable-disambiguating")
  1968                     else ()
  1969             val thy4 = add_hol4_pending thyname thmname args thy''
  1970 
  1971             val rew = rewrite_hol4_term (concl_of td_th) thy4
  1972             val th  = Thm.equal_elim rew (Thm.transfer thy4 td_th)
  1973             val c   = case HOLogic.dest_Trueprop (prop_of th) of
  1974                           Const(@{const_name Ex},exT) $ P =>
  1975                           let
  1976                               val PT = domain_type exT
  1977                           in
  1978                               Const (@{const_name Collect},PT-->HOLogic.mk_setT (domain_type PT)) $ P
  1979                           end
  1980                         | _ => error "Internal error in ProofKernel.new_typedefinition"
  1981             val tnames_string = if null tnames
  1982                                 then ""
  1983                                 else "(" ^ commas tnames ^ ") "
  1984             val proc_prop =
  1985               smart_string_of_cterm
  1986                 (Syntax.init_pretty_global thy4
  1987                   |> not (null tnames) ? Config.put show_all_types true)
  1988             val thy5 = add_dump ("typedef (open) " ^ tnames_string ^ (quotename tycname) ^ " = " ^ (proc_prop (cterm_of thy4 c)) ^ " "
  1989                                  ^ (string_of_mixfix tsyn) ^ "\n  by (rule typedef_helper,import " ^ thyname ^ " " ^ thmname ^ ")") thy4
  1990 
  1991             val thy6 = add_dump ("lemmas " ^ thmname ^ " = typedef_hol2hol4 [OF type_definition_" ^ tycname ^ "]") thy5
  1992 
  1993             val _ = message "RESULT:"
  1994             val _ = if_debug pth hth'
  1995         in
  1996             (thy6,hth')
  1997         end
  1998 
  1999 fun add_dump_syntax thy name =
  2000     let
  2001       val n = quotename name
  2002       val syn = string_of_mixfix (mk_syn thy name)
  2003     in
  2004       add_dump ("syntax\n  "^n^" :: _ "^syn) thy
  2005     end
  2006 
  2007 fun type_introduction thyname thmname tycname abs_name rep_name (P,t) hth thy =
  2008     case HOL4DefThy.get thy of
  2009         Replaying _ => (thy,
  2010           HOLThm([], Global_Theory.get_thm thy (thmname^"_@intern")) handle ERROR _ => hth)
  2011       | _ =>
  2012         let
  2013             val _ = message "TYPE_INTRO:"
  2014             val _ = if_debug pth hth
  2015             val _ = warning ("Introducing type " ^ tycname ^ " (with morphisms " ^ abs_name ^ " and " ^ rep_name ^ ")")
  2016             val (HOLThm(rens,td_th)) = norm_hthm thy hth
  2017             val tT = type_of t
  2018             val light_nonempty' =
  2019                 Drule.instantiate' [SOME (ctyp_of thy tT)]
  2020                                    [SOME (cterm_of thy P),
  2021                                     SOME (cterm_of thy t)] light_nonempty
  2022             val th2 = beta_eta_thm (td_th RS (beta_eta_thm light_nonempty'))
  2023             val c = case concl_of th2 of
  2024                         _ $ (Const(@{const_name Ex},_) $ Abs(_,_,Const(@{const_name Set.member},_) $ _ $ c)) => c
  2025                       | _ => raise ERR "type_introduction" "Bad type definition theorem"
  2026             val tfrees = Misc_Legacy.term_tfrees c
  2027             val tnames = sort_strings (map fst tfrees)
  2028             val tsyn = mk_syn thy tycname
  2029             val ((_, typedef_info), thy') =
  2030               Typedef.add_typedef_global false NONE
  2031                 (Binding.name tycname, map (rpair dummyS) tnames, tsyn) c
  2032                 (SOME(Binding.name rep_name,Binding.name abs_name)) (rtac th2 1) thy
  2033             val fulltyname = Sign.intern_type thy' tycname
  2034             val aty = Type (fulltyname, map mk_vartype tnames)
  2035             val typedef_hol2hollight' =
  2036                 Drule.instantiate'
  2037                     [SOME (ctyp_of thy' aty), SOME (ctyp_of thy' tT)]
  2038                     [NONE, NONE, NONE, SOME (cterm_of thy' (Free ("a", aty))), SOME (cterm_of thy' (Free ("r", tT)))]
  2039                     typedef_hol2hollight
  2040             val th4 = (#type_definition (#2 typedef_info)) RS typedef_hol2hollight'
  2041             val _ = null (Thm.fold_terms Term.add_tvars th4 []) orelse
  2042               raise ERR "type_introduction" "no type variables expected any more"
  2043             val _ = null (Thm.fold_terms Term.add_vars th4 []) orelse
  2044               raise ERR "type_introduction" "no term variables expected any more"
  2045             val _ = message ("step 3: thyname="^thyname^", tycname="^tycname^", fulltyname="^fulltyname)
  2046             val thy'' = add_hol4_type_mapping thyname tycname true fulltyname thy'
  2047             val _ = message "step 4"
  2048             val (hth' as HOLThm args) = norm_hthm thy'' (HOLThm(rens,th4))
  2049             val thy4 = add_hol4_pending thyname thmname args thy''
  2050 
  2051             val P' = P (* why !? #2 (Logic.dest_equals (concl_of (rewrite_hol4_term P thy4))) *)
  2052             val c   =
  2053                 let
  2054                     val PT = type_of P'
  2055                 in
  2056                     Const (@{const_name Collect},PT-->HOLogic.mk_setT (domain_type PT)) $ P'
  2057                 end
  2058 
  2059             val tnames_string = if null tnames
  2060                                 then ""
  2061                                 else "(" ^ commas tnames ^ ") "
  2062             val proc_prop =
  2063               smart_string_of_cterm
  2064                 (Syntax.init_pretty_global thy4
  2065                   |> not (null tnames) ? Config.put show_all_types true)
  2066             val thy = add_dump ("typedef (open) " ^ tnames_string ^ (quotename tycname) ^
  2067               " = " ^ (proc_prop (cterm_of thy4 c)) ^ " " ^
  2068               (string_of_mixfix tsyn) ^ " morphisms "^
  2069               (quote rep_name)^" "^(quote abs_name)^"\n"^
  2070               ("  apply (rule light_ex_imp_nonempty[where t="^
  2071               (proc_prop (cterm_of thy4 t))^"])\n"^
  2072               ("  by (import " ^ thyname ^ " " ^ (quotename thmname) ^ ")"))) thy4
  2073             val str_aty = Syntax.string_of_typ_global thy aty
  2074             val thy = add_dump_syntax thy rep_name
  2075             val thy = add_dump_syntax thy abs_name
  2076             val thy = add_dump ("lemmas " ^ (quote (thmname^"_@intern")) ^
  2077               " = typedef_hol2hollight \n"^
  2078               "  [where a=\"a :: "^str_aty^"\" and r=r" ^
  2079               " ,\n   OF "^(quotename ("type_definition_" ^ tycname)) ^ "]") thy
  2080             val _ = message "RESULT:"
  2081             val _ = if_debug pth hth'
  2082         in
  2083             (thy,hth')
  2084         end
  2085 end
  2086 
  2087 val prin = prin
  2088 
  2089 end