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