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