src/LCF/ROOT.ML

Moved theorems Ord_cases_lemma and Ord_cases here from Univ,
strengthening the succ(j) case to include Ord(j). Proved trans_induct3,
le_implies_UN_le_UN, Ord_1, lt_Ord2, le_Ord2.

(*  Title: 	LCF/ROOT
    ID:         $Id$
    Author: 	Tobias Nipkow
    Copyright   1992  University of Cambridge

Adds LCF to a database containing First-Order Logic.

This theory is based on Lawrence Paulson's book Logic and Computation.
*)

val banner = "Logic for Computable Functions (in FOL)";
writeln banner;

print_depth 1;
use_thy "LCF";
use"simpdata.ML";
use"pair.ML";
use"fix.ML";

val LCF_build_completed = ();	(*indicate successful build*)