src/HOL/cladata.ML
author wenzelm
Mon Nov 03 12:09:20 1997 +0100 (1997-11-03)
changeset 4085 6e2d41a5ea43
parent 4059 59c1422c9da5
child 4179 cc4b6791d5dc
permissions -rw-r--r--
adapted to new implicit claset;
paulson@1985
     1
(*  Title:      HOL/cladata.ML
paulson@1985
     2
    ID:         $Id$
paulson@1985
     3
    Author:     Tobias Nipkow
paulson@1985
     4
    Copyright   1996  University of Cambridge
paulson@1985
     5
wenzelm@4085
     6
Setting up the classical reasoner.
paulson@1985
     7
*)
paulson@1985
     8
paulson@1985
     9
paulson@1985
    10
(** Applying HypsubstFun to generate hyp_subst_tac **)
paulson@1985
    11
section "Classical Reasoner";
paulson@1985
    12
paulson@1985
    13
structure Hypsubst_Data =
paulson@1985
    14
  struct
paulson@1985
    15
  structure Simplifier = Simplifier
paulson@1985
    16
  (*Take apart an equality judgement; otherwise raise Match!*)
paulson@1985
    17
  fun dest_eq (Const("Trueprop",_) $ (Const("op =",_)  $ t $ u)) = (t,u);
paulson@1985
    18
  val eq_reflection = eq_reflection
paulson@1985
    19
  val imp_intr = impI
paulson@1985
    20
  val rev_mp = rev_mp
paulson@1985
    21
  val subst = subst
paulson@1985
    22
  val sym = sym
paulson@1985
    23
  end;
paulson@1985
    24
paulson@1985
    25
structure Hypsubst = HypsubstFun(Hypsubst_Data);
paulson@1985
    26
open Hypsubst;
paulson@1985
    27
paulson@1985
    28
(*** Applying ClassicalFun to create a classical prover ***)
paulson@1985
    29
structure Classical_Data = 
paulson@1985
    30
  struct
paulson@1985
    31
  val sizef     = size_of_thm
paulson@1985
    32
  val mp        = mp
paulson@1985
    33
  val not_elim  = notE
paulson@1985
    34
  val classical = classical
paulson@1985
    35
  val hyp_subst_tacs=[hyp_subst_tac]
paulson@1985
    36
  end;
paulson@1985
    37
paulson@1985
    38
structure Classical = ClassicalFun(Classical_Data);
paulson@1985
    39
open Classical;
paulson@1985
    40
paulson@1985
    41
(*Propositional rules*)
paulson@1985
    42
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI]
paulson@1985
    43
                       addSEs [conjE,disjE,impCE,FalseE,iffE];
paulson@1985
    44
paulson@1985
    45
(*Quantifier rules*)
paulson@3004
    46
val HOL_cs = prop_cs addSIs [allI,ex_ex1I] addIs [exI] 
paulson@3004
    47
                     addSEs [exE] addEs [allE];
paulson@1985
    48
wenzelm@4085
    49
claset_ref() := HOL_cs;
paulson@1985
    50
paulson@3004
    51
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
paulson@3004
    52
qed_goal "alt_ex1E" thy
wenzelm@3842
    53
    "[| ?! x. P(x);                                              \
paulson@3004
    54
\       !!x. [| P(x);  ALL y y'. P(y) & P(y') --> y=y' |] ==> R  \
paulson@3004
    55
\    |] ==> R"
paulson@3004
    56
 (fn major::prems =>
paulson@3004
    57
  [ (rtac (major RS ex1E) 1),
paulson@3004
    58
    (REPEAT (ares_tac (allI::prems) 1)),
paulson@3004
    59
    (etac (dup_elim allE) 1),
paulson@3004
    60
    (Fast_tac 1)]);
paulson@3004
    61
paulson@3004
    62
AddSEs [alt_ex1E];
paulson@2860
    63
paulson@2860
    64
(*** Applying BlastFun to create Blast_tac ***)
paulson@2860
    65
structure Blast_Data = 
paulson@2860
    66
  struct
paulson@2860
    67
  type claset	= Classical.claset
paulson@2860
    68
  val notE	= notE
paulson@2860
    69
  val ccontr	= ccontr
paulson@2860
    70
  val contr_tac = Classical.contr_tac
paulson@2860
    71
  val dup_intr	= Classical.dup_intr
paulson@2860
    72
  val vars_gen_hyp_subst_tac = Hypsubst.vars_gen_hyp_subst_tac
paulson@2860
    73
  val claset	= Classical.claset
paulson@2860
    74
  val rep_claset = Classical.rep_claset
paulson@2860
    75
  end;
paulson@2860
    76
paulson@2860
    77
structure Blast = BlastFun(Blast_Data);
paulson@4059
    78
Blast.overload ("op =", domain_type);	(*overloading of equality as iff*)
paulson@2860
    79
paulson@2860
    80
val Blast_tac = Blast.Blast_tac
paulson@2860
    81
and blast_tac = Blast.blast_tac;