src/FOL/ROOT.ML
 author paulson Wed, 03 Dec 1997 10:48:16 +0100 changeset 4349 50403e5a44c0 parent 4223 f60e3d2c81d3 child 4466 305390f23734 permissions -rw-r--r--
Instantiated the one-point-rule quantifier simpprocs for FOL New file fologic.ML holds abstract syntax operations Also, miniscoping provided for intuitionistic logic
```
(*  Title:      FOL/ROOT
ID:         \$Id\$
Author:     Lawrence C Paulson, Cambridge University Computer Laboratory

Adds First-Order Logic to a database containing pure Isabelle.
Should be executed in the subdirectory FOL.
*)

val banner = "First-Order Logic with Natural Deduction";

writeln banner;

print_depth 1;

use "\$ISABELLE_HOME/src/Provers/simplifier.ML";
use "\$ISABELLE_HOME/src/Provers/splitter.ML";
use "\$ISABELLE_HOME/src/Provers/ind.ML";
use "\$ISABELLE_HOME/src/Provers/hypsubst.ML";
use "\$ISABELLE_HOME/src/Provers/classical.ML";
use "\$ISABELLE_HOME/src/Provers/blast.ML";
use "\$ISABELLE_HOME/src/Provers/quantifier1.ML";

use_thy "IFOL";
use "fologic.ML";

(** Applying HypsubstFun to generate hyp_subst_tac **)
structure Hypsubst_Data =
struct
structure Simplifier = Simplifier
(*Take apart an equality judgement; otherwise raise Match!*)
fun dest_eq (Const("Trueprop",_) \$ (Const("op =",T)  \$ t \$ u)) =
(t, u, domain_type T)
val eq_reflection = eq_reflection
val imp_intr = impI
val rev_mp = rev_mp
val subst = subst
val sym = sym
val thin_refl = prove_goal IFOL.thy
"!!X. [|x=x; PROP W|] ==> PROP W" (K [atac 1]);
end;

structure Hypsubst = HypsubstFun(Hypsubst_Data);
open Hypsubst;

use "intprover.ML";

use_thy "FOL";