src/HOL/cladata.ML
author paulson
Fri Sep 15 12:39:57 2000 +0200 (2000-09-15)
changeset 9969 4753185f1dd2
parent 9846 bb848beb53f6
child 10197 4ea3ee8de019
permissions -rw-r--r--
renamed (most of...) the select rules
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@4466
    17
  fun dest_eq (Const("op =",T)  $ t $ u) = (t, u, domain_type T)
paulson@4466
    18
  val dest_Trueprop = HOLogic.dest_Trueprop
paulson@4466
    19
  val dest_imp = HOLogic.dest_imp
paulson@1985
    20
  val eq_reflection = eq_reflection
wenzelm@9531
    21
  val rev_eq_reflection = def_imp_eq
paulson@1985
    22
  val imp_intr = impI
paulson@1985
    23
  val rev_mp = rev_mp
paulson@1985
    24
  val subst = subst
paulson@1985
    25
  val sym = sym
wenzelm@7357
    26
  val thin_refl = prove_goal (the_context ())
oheimb@4223
    27
		  "!!X. [|x=x; PROP W|] ==> PROP W" (K [atac 1]);
paulson@1985
    28
  end;
paulson@1985
    29
paulson@1985
    30
structure Hypsubst = HypsubstFun(Hypsubst_Data);
paulson@1985
    31
open Hypsubst;
paulson@1985
    32
paulson@9158
    33
paulson@9158
    34
(*** Applying Make_Elim_Fun to create a classical "make_elim" rule ***)
wenzelm@9846
    35
structure Make_Elim = Make_Elim_Fun (val classical = classical);
paulson@9158
    36
paulson@9158
    37
(*we don't redeclare the original make_elim (Tactic.make_elim) for 
paulson@9158
    38
  compatibliity with strange things done in many existing proofs *)
paulson@9158
    39
val cla_make_elim = Make_Elim.make_elim;
paulson@9158
    40
paulson@1985
    41
(*** Applying ClassicalFun to create a classical prover ***)
paulson@1985
    42
structure Classical_Data = 
paulson@1985
    43
  struct
paulson@9158
    44
  val make_elim = cla_make_elim
paulson@1985
    45
  val mp        = mp
paulson@1985
    46
  val not_elim  = notE
paulson@1985
    47
  val classical = classical
paulson@9158
    48
  val sizef     = size_of_thm
oheimb@4206
    49
  val hyp_subst_tacs=[hyp_subst_tac]
paulson@1985
    50
  end;
paulson@1985
    51
paulson@1985
    52
structure Classical = ClassicalFun(Classical_Data);
wenzelm@8099
    53
structure BasicClassical: BASIC_CLASSICAL = Classical; open BasicClassical;
wenzelm@9472
    54
structure Obtain = ObtainFun(val atomic_thesis = HOLogic.atomic_Trueprop and
wenzelm@9472
    55
  that_atts = [Simplifier.simp_add_local, Classical.haz_intro_local]);
paulson@1985
    56
paulson@1985
    57
(*Propositional rules*)
paulson@1985
    58
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI]
paulson@4305
    59
                       addSEs [conjE,disjE,impCE,FalseE,iffCE];
paulson@1985
    60
paulson@1985
    61
(*Quantifier rules*)
paulson@9969
    62
val HOL_cs = prop_cs addSIs [allI,ex_ex1I] addIs [exI, some_equality] 
paulson@3004
    63
                     addSEs [exE] addEs [allE];
paulson@1985
    64
wenzelm@7357
    65
val clasetup = [fn thy => (claset_ref_of thy := HOL_cs; thy)];