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