src/HOL/ROOT.ML
author nipkow
Mon Apr 10 08:40:58 1995 +0200 (1995-04-10)
changeset 1024 b86042000035
parent 923 ff1574a81019
child 1165 97b2bb5d43c3
permissions -rw-r--r--
ROOT.ML: installed new hyp_subst_tac

Nat.ML: Changed proof of lessE for new hyp_subst_tac
clasohm@923
     1
(*  Title:      CHOL/ROOT.ML
clasohm@923
     2
    ID:         $Id$
clasohm@923
     3
    Author:     Tobias Nipkow
clasohm@923
     4
    Copyright   1993  University of Cambridge
clasohm@923
     5
clasohm@923
     6
Adds Classical Higher-order Logic to a database containing Pure Isabelle.
clasohm@923
     7
Should be executed in the subdirectory HOL.
clasohm@923
     8
*)
clasohm@923
     9
clasohm@923
    10
val banner = "Higher-Order Logic with curried functions";
clasohm@923
    11
writeln banner;
clasohm@923
    12
clasohm@923
    13
print_depth 1;
clasohm@923
    14
set eta_contract;
clasohm@923
    15
clasohm@923
    16
(* Add user sections *)
clasohm@923
    17
use "../Pure/section_utils.ML";
clasohm@923
    18
use "thy_syntax.ML";
clasohm@923
    19
clasohm@923
    20
use_thy "HOL";
nipkow@1024
    21
use "../Provers/simplifier.ML";
nipkow@1024
    22
use "../Provers/splitter.ML";
clasohm@923
    23
use "../Provers/hypsubst.ML";
clasohm@923
    24
use "../Provers/classical.ML";
clasohm@923
    25
clasohm@923
    26
(** Applying HypsubstFun to generate hyp_subst_tac **)
clasohm@923
    27
clasohm@923
    28
structure Hypsubst_Data =
clasohm@923
    29
  struct
nipkow@1024
    30
  structure Simplifier = Simplifier
clasohm@923
    31
  (*Take apart an equality judgement; otherwise raise Match!*)
clasohm@923
    32
  fun dest_eq (Const("Trueprop",_) $ (Const("op =",_)  $ t $ u)) = (t,u);
nipkow@1024
    33
  val eq_reflection = eq_reflection
clasohm@923
    34
  val imp_intr = impI
clasohm@923
    35
  val rev_mp = rev_mp
clasohm@923
    36
  val subst = subst
clasohm@923
    37
  val sym = sym
clasohm@923
    38
  end;
clasohm@923
    39
clasohm@923
    40
structure Hypsubst = HypsubstFun(Hypsubst_Data);
clasohm@923
    41
open Hypsubst;
clasohm@923
    42
clasohm@923
    43
(*** Applying ClassicalFun to create a classical prover ***)
clasohm@923
    44
structure Classical_Data = 
clasohm@923
    45
  struct
clasohm@923
    46
  val sizef	= size_of_thm
clasohm@923
    47
  val mp	= mp
clasohm@923
    48
  val not_elim	= notE
clasohm@923
    49
  val classical	= classical
clasohm@923
    50
  val hyp_subst_tacs=[hyp_subst_tac]
clasohm@923
    51
  end;
clasohm@923
    52
clasohm@923
    53
structure Classical = ClassicalFun(Classical_Data);
clasohm@923
    54
open Classical;
clasohm@923
    55
clasohm@923
    56
(*Propositional rules*)
clasohm@923
    57
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI]
clasohm@923
    58
                       addSEs [conjE,disjE,impCE,FalseE,iffE];
clasohm@923
    59
clasohm@923
    60
(*Quantifier rules*)
clasohm@923
    61
val HOL_cs = prop_cs addSIs [allI] addIs [exI,ex1I]
clasohm@923
    62
                     addSEs [exE,ex1E] addEs [allE];
clasohm@923
    63
clasohm@923
    64
use     "simpdata.ML";
clasohm@923
    65
use_thy "Ord";
clasohm@923
    66
use_thy "subset";
clasohm@923
    67
use_thy "equalities";
clasohm@923
    68
use     "hologic.ML";
clasohm@923
    69
use     "subtype.ML";
clasohm@923
    70
use_thy "Prod";
clasohm@923
    71
use_thy "Sum";
clasohm@923
    72
use_thy "Gfp";
clasohm@923
    73
use_thy "Nat";
clasohm@923
    74
clasohm@923
    75
use "datatype.ML";
clasohm@923
    76
use "ind_syntax.ML";
clasohm@923
    77
use "add_ind_def.ML";
clasohm@923
    78
use "intr_elim.ML";
clasohm@923
    79
use "indrule.ML";
clasohm@923
    80
use_thy "Inductive";
clasohm@923
    81
clasohm@923
    82
use_thy "Finite";
clasohm@923
    83
use_thy "Sexp";
clasohm@923
    84
use_thy "List";
clasohm@923
    85
clasohm@923
    86
init_pps ();
clasohm@923
    87
print_depth 8;
clasohm@923
    88
clasohm@923
    89
val CHOL_build_completed = ();   (*indicate successful build*)