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