src/FOL/ROOT.ML
author wenzelm
Mon Oct 20 12:50:18 1997 +0200 (1997-10-20)
changeset 3954 c8c188655948
parent 3578 b2b9a9ddb9cc
child 4024 3c056eab237c
permissions -rw-r--r--
reset global_names;
     1 (*  Title:      FOL/ROOT
     2     ID:         $Id$
     3     Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
     4     Copyright   1993  University of Cambridge
     5 
     6 Adds First-Order Logic to a database containing pure Isabelle. 
     7 Should be executed in the subdirectory FOL.
     8 *)
     9 
    10 val banner = "First-Order Logic with Natural Deduction";
    11 
    12 writeln banner;
    13 
    14 reset global_names;
    15 
    16 print_depth 1;  
    17 
    18 use "../Provers/simplifier.ML";
    19 use "../Provers/splitter.ML";
    20 use "../Provers/ind.ML";
    21 use "../Provers/hypsubst.ML";
    22 use "../Provers/classical.ML";
    23 use "../Provers/blast.ML";
    24 
    25 use_thy "IFOL";
    26 
    27 (** Applying HypsubstFun to generate hyp_subst_tac **)
    28 structure Hypsubst_Data =
    29   struct
    30   structure Simplifier = Simplifier
    31     (*Take apart an equality judgement; otherwise raise Match!*)
    32   fun dest_eq (Const("Trueprop",_) $ (Const("op =",_)  $ t $ u)) = (t,u)
    33   val eq_reflection = eq_reflection
    34   val imp_intr = impI
    35   val rev_mp = rev_mp
    36   val subst = subst
    37   val sym = sym
    38   end;
    39 
    40 structure Hypsubst = HypsubstFun(Hypsubst_Data);
    41 open Hypsubst;
    42 
    43 
    44 use "intprover.ML";
    45 
    46 use_thy "FOL";
    47 
    48 qed_goal "ex1_functional" FOL.thy
    49     "!!a b c. [| EX! z. P(a,z);  P(a,b);  P(a,c) |] ==> b = c"
    50  (fn _ => [ (deepen_tac FOL_cs 0 1) ]);
    51 
    52 
    53 print_depth 8;
    54 
    55 val FOL_build_completed = ();   (*indicate successful build*)