src/HOL/HOL.ML
author wenzelm
Tue Jan 12 13:54:51 1999 +0100 (1999-01-12)
changeset 6092 d9db67970c73
parent 5888 d8e51792ca85
child 6214 0513cfd1a598
permissions -rw-r--r--
eliminated tthm type and Attribute structure;
clasohm@1465
     1
(*  Title:      HOL/HOL.ML
clasohm@923
     2
    ID:         $Id$
clasohm@1465
     3
    Author:     Tobias Nipkow
clasohm@923
     4
    Copyright   1991  University of Cambridge
clasohm@923
     5
clasohm@923
     6
Derived rules from Appendix of Mike Gordons HOL Report, Cambridge TR 68 
clasohm@923
     7
*)
clasohm@923
     8
clasohm@923
     9
clasohm@923
    10
(** Equality **)
oheimb@1660
    11
section "=";
clasohm@923
    12
clasohm@923
    13
qed_goal "sym" HOL.thy "s=t ==> t=s"
clasohm@923
    14
 (fn prems => [cut_facts_tac prems 1, etac subst 1, rtac refl 1]);
clasohm@923
    15
clasohm@923
    16
(*calling "standard" reduces maxidx to 0*)
clasohm@923
    17
bind_thm ("ssubst", (sym RS subst));
clasohm@923
    18
clasohm@923
    19
qed_goal "trans" HOL.thy "[| r=s; s=t |] ==> r=t"
clasohm@923
    20
 (fn prems =>
clasohm@1465
    21
        [rtac subst 1, resolve_tac prems 1, resolve_tac prems 1]);
clasohm@923
    22
paulson@5309
    23
val prems = goal thy "(A == B) ==> A = B";
paulson@5309
    24
by (rewrite_goals_tac prems);
paulson@5309
    25
by (rtac refl 1);
paulson@5309
    26
qed "def_imp_eq";
paulson@5309
    27
clasohm@923
    28
(*Useful with eresolve_tac for proving equalties from known equalities.
clasohm@1465
    29
        a = b
clasohm@1465
    30
        |   |
clasohm@1465
    31
        c = d   *)
clasohm@923
    32
qed_goal "box_equals" HOL.thy
clasohm@923
    33
    "[| a=b;  a=c;  b=d |] ==> c=d"  
clasohm@923
    34
 (fn prems=>
clasohm@923
    35
  [ (rtac trans 1),
clasohm@923
    36
    (rtac trans 1),
clasohm@923
    37
    (rtac sym 1),
clasohm@923
    38
    (REPEAT (resolve_tac prems 1)) ]);
clasohm@923
    39
oheimb@1660
    40
clasohm@923
    41
(** Congruence rules for meta-application **)
oheimb@1660
    42
section "Congruence";
clasohm@923
    43
clasohm@923
    44
(*similar to AP_THM in Gordon's HOL*)
clasohm@923
    45
qed_goal "fun_cong" HOL.thy "(f::'a=>'b) = g ==> f(x)=g(x)"
clasohm@923
    46
  (fn [prem] => [rtac (prem RS subst) 1, rtac refl 1]);
clasohm@923
    47
clasohm@923
    48
(*similar to AP_TERM in Gordon's HOL and FOL's subst_context*)
clasohm@923
    49
qed_goal "arg_cong" HOL.thy "x=y ==> f(x)=f(y)"
clasohm@923
    50
 (fn [prem] => [rtac (prem RS subst) 1, rtac refl 1]);
clasohm@923
    51
clasohm@923
    52
qed_goal "cong" HOL.thy
clasohm@923
    53
   "[| f = g; (x::'a) = y |] ==> f(x) = g(y)"
clasohm@923
    54
 (fn [prem1,prem2] =>
clasohm@923
    55
   [rtac (prem1 RS subst) 1, rtac (prem2 RS subst) 1, rtac refl 1]);
clasohm@923
    56
oheimb@1660
    57
clasohm@923
    58
(** Equality of booleans -- iff **)
oheimb@1660
    59
section "iff";
clasohm@923
    60
clasohm@923
    61
qed_goal "iffI" HOL.thy
clasohm@923
    62
   "[| P ==> Q;  Q ==> P |] ==> P=Q"
clasohm@923
    63
 (fn prems=> [ (REPEAT (ares_tac (prems@[impI, iff RS mp RS mp]) 1)) ]);
clasohm@923
    64
clasohm@923
    65
qed_goal "iffD2" HOL.thy "[| P=Q; Q |] ==> P"
clasohm@923
    66
 (fn prems =>
clasohm@1465
    67
        [rtac ssubst 1, resolve_tac prems 1, resolve_tac prems 1]);
clasohm@923
    68
paulson@4467
    69
qed_goal "rev_iffD2" HOL.thy "!!P. [| Q; P=Q |] ==> P"
paulson@4467
    70
 (fn _ => [etac iffD2 1, assume_tac 1]);
paulson@4467
    71
paulson@4467
    72
bind_thm ("iffD1", sym RS iffD2);
paulson@4467
    73
bind_thm ("rev_iffD1", sym RSN (2, rev_iffD2));
clasohm@923
    74
clasohm@923
    75
qed_goal "iffE" HOL.thy
clasohm@923
    76
    "[| P=Q; [| P --> Q; Q --> P |] ==> R |] ==> R"
clasohm@923
    77
 (fn [p1,p2] => [REPEAT(ares_tac([p1 RS iffD2, p1 RS iffD1, p2, impI])1)]);
clasohm@923
    78
oheimb@1660
    79
clasohm@923
    80
(** True **)
oheimb@1660
    81
section "True";
clasohm@923
    82
clasohm@923
    83
qed_goalw "TrueI" HOL.thy [True_def] "True"
clasohm@923
    84
  (fn _ => [rtac refl 1]);
clasohm@923
    85
wenzelm@4025
    86
qed_goal "eqTrueI" HOL.thy "P ==> P=True" 
clasohm@923
    87
 (fn prems => [REPEAT(resolve_tac ([iffI,TrueI]@prems) 1)]);
clasohm@923
    88
clasohm@923
    89
qed_goal "eqTrueE" HOL.thy "P=True ==> P" 
clasohm@923
    90
 (fn prems => [REPEAT(resolve_tac (prems@[TrueI,iffD2]) 1)]);
clasohm@923
    91
oheimb@1660
    92
clasohm@923
    93
(** Universal quantifier **)
oheimb@1660
    94
section "!";
clasohm@923
    95
clasohm@923
    96
qed_goalw "allI" HOL.thy [All_def] "(!!x::'a. P(x)) ==> !x. P(x)"
clasohm@923
    97
 (fn prems => [resolve_tac (prems RL [eqTrueI RS ext]) 1]);
clasohm@923
    98
wenzelm@3842
    99
qed_goalw "spec" HOL.thy [All_def] "! x::'a. P(x) ==> P(x)"
clasohm@923
   100
 (fn prems => [rtac eqTrueE 1, resolve_tac (prems RL [fun_cong]) 1]);
clasohm@923
   101
wenzelm@3842
   102
qed_goal "allE" HOL.thy "[| !x. P(x);  P(x) ==> R |] ==> R"
clasohm@923
   103
 (fn major::prems=>
clasohm@923
   104
  [ (REPEAT (resolve_tac (prems @ [major RS spec]) 1)) ]);
clasohm@923
   105
clasohm@923
   106
qed_goal "all_dupE" HOL.thy 
wenzelm@3842
   107
    "[| ! x. P(x);  [| P(x); ! x. P(x) |] ==> R |] ==> R"
clasohm@923
   108
 (fn prems =>
clasohm@923
   109
  [ (REPEAT (resolve_tac (prems @ (prems RL [spec])) 1)) ]);
clasohm@923
   110
clasohm@923
   111
clasohm@923
   112
(** False ** Depends upon spec; it is impossible to do propositional logic
clasohm@923
   113
             before quantifiers! **)
oheimb@1660
   114
section "False";
clasohm@923
   115
clasohm@923
   116
qed_goalw "FalseE" HOL.thy [False_def] "False ==> P"
clasohm@923
   117
 (fn [major] => [rtac (major RS spec) 1]);
clasohm@923
   118
clasohm@923
   119
qed_goal "False_neq_True" HOL.thy "False=True ==> P"
clasohm@923
   120
 (fn [prem] => [rtac (prem RS eqTrueE RS FalseE) 1]);
clasohm@923
   121
clasohm@923
   122
clasohm@923
   123
(** Negation **)
oheimb@1660
   124
section "~";
clasohm@923
   125
clasohm@923
   126
qed_goalw "notI" HOL.thy [not_def] "(P ==> False) ==> ~P"
clasohm@923
   127
 (fn prems=> [rtac impI 1, eresolve_tac prems 1]);
clasohm@923
   128
berghofe@5760
   129
qed_goal "False_not_True" HOL.thy "False ~= True"
berghofe@5760
   130
  (K [rtac notI 1, etac False_neq_True 1]);
berghofe@5760
   131
berghofe@5760
   132
qed_goal "True_not_False" HOL.thy "True ~= False"
berghofe@5760
   133
  (K [rtac notI 1, dtac sym 1, etac False_neq_True 1]);
berghofe@5760
   134
clasohm@923
   135
qed_goalw "notE" HOL.thy [not_def] "[| ~P;  P |] ==> R"
clasohm@923
   136
 (fn prems => [rtac (prems MRS mp RS FalseE) 1]);
clasohm@923
   137
oheimb@2442
   138
bind_thm ("classical2", notE RS notI);
oheimb@2442
   139
paulson@1840
   140
qed_goal "rev_notE" HOL.thy "!!P R. [| P; ~P |] ==> R"
paulson@1840
   141
 (fn _ => [REPEAT (ares_tac [notE] 1)]);
paulson@1840
   142
oheimb@1660
   143
clasohm@923
   144
(** Implication **)
oheimb@1660
   145
section "-->";
clasohm@923
   146
clasohm@923
   147
qed_goal "impE" HOL.thy "[| P-->Q;  P;  Q ==> R |] ==> R"
clasohm@923
   148
 (fn prems=> [ (REPEAT (resolve_tac (prems@[mp]) 1)) ]);
clasohm@923
   149
clasohm@923
   150
(* Reduces Q to P-->Q, allowing substitution in P. *)
clasohm@923
   151
qed_goal "rev_mp" HOL.thy "[| P;  P --> Q |] ==> Q"
clasohm@923
   152
 (fn prems=>  [ (REPEAT (resolve_tac (prems@[mp]) 1)) ]);
clasohm@923
   153
clasohm@923
   154
qed_goal "contrapos" HOL.thy "[| ~Q;  P==>Q |] ==> ~P"
clasohm@923
   155
 (fn [major,minor]=> 
clasohm@923
   156
  [ (rtac (major RS notE RS notI) 1), 
clasohm@923
   157
    (etac minor 1) ]);
clasohm@923
   158
nipkow@1334
   159
qed_goal "rev_contrapos" HOL.thy "[| P==>Q; ~Q |] ==> ~P"
nipkow@1334
   160
 (fn [major,minor]=> 
nipkow@1334
   161
  [ (rtac (minor RS contrapos) 1), (etac major 1) ]);
nipkow@1334
   162
clasohm@923
   163
(* ~(?t = ?s) ==> ~(?s = ?t) *)
nipkow@1334
   164
bind_thm("not_sym", sym COMP rev_contrapos);
clasohm@923
   165
clasohm@923
   166
clasohm@923
   167
(** Existential quantifier **)
oheimb@1660
   168
section "?";
clasohm@923
   169
oheimb@4527
   170
qed_goalw "exI" HOL.thy [Ex_def] "P x ==> ? x::'a. P x"
clasohm@923
   171
 (fn prems => [rtac selectI 1, resolve_tac prems 1]);
clasohm@923
   172
clasohm@923
   173
qed_goalw "exE" HOL.thy [Ex_def]
wenzelm@3842
   174
  "[| ? x::'a. P(x); !!x. P(x) ==> Q |] ==> Q"
clasohm@923
   175
  (fn prems => [REPEAT(resolve_tac prems 1)]);
clasohm@923
   176
clasohm@923
   177
clasohm@923
   178
(** Conjunction **)
oheimb@1660
   179
section "&";
clasohm@923
   180
clasohm@923
   181
qed_goalw "conjI" HOL.thy [and_def] "[| P; Q |] ==> P&Q"
clasohm@923
   182
 (fn prems =>
clasohm@923
   183
  [REPEAT (resolve_tac (prems@[allI,impI]) 1 ORELSE etac (mp RS mp) 1)]);
clasohm@923
   184
clasohm@923
   185
qed_goalw "conjunct1" HOL.thy [and_def] "[| P & Q |] ==> P"
clasohm@923
   186
 (fn prems =>
clasohm@923
   187
   [resolve_tac (prems RL [spec] RL [mp]) 1, REPEAT(ares_tac [impI] 1)]);
clasohm@923
   188
clasohm@923
   189
qed_goalw "conjunct2" HOL.thy [and_def] "[| P & Q |] ==> Q"
clasohm@923
   190
 (fn prems =>
clasohm@923
   191
   [resolve_tac (prems RL [spec] RL [mp]) 1, REPEAT(ares_tac [impI] 1)]);
clasohm@923
   192
clasohm@923
   193
qed_goal "conjE" HOL.thy "[| P&Q;  [| P; Q |] ==> R |] ==> R"
clasohm@923
   194
 (fn prems =>
clasohm@1465
   195
         [cut_facts_tac prems 1, resolve_tac prems 1,
clasohm@1465
   196
          etac conjunct1 1, etac conjunct2 1]);
clasohm@923
   197
oheimb@1660
   198
clasohm@923
   199
(** Disjunction *)
oheimb@1660
   200
section "|";
clasohm@923
   201
clasohm@923
   202
qed_goalw "disjI1" HOL.thy [or_def] "P ==> P|Q"
clasohm@923
   203
 (fn [prem] => [REPEAT(ares_tac [allI,impI, prem RSN (2,mp)] 1)]);
clasohm@923
   204
clasohm@923
   205
qed_goalw "disjI2" HOL.thy [or_def] "Q ==> P|Q"
clasohm@923
   206
 (fn [prem] => [REPEAT(ares_tac [allI,impI, prem RSN (2,mp)] 1)]);
clasohm@923
   207
clasohm@923
   208
qed_goalw "disjE" HOL.thy [or_def] "[| P | Q; P ==> R; Q ==> R |] ==> R"
clasohm@923
   209
 (fn [a1,a2,a3] =>
clasohm@1465
   210
        [rtac (mp RS mp) 1, rtac spec 1, rtac a1 1,
clasohm@1465
   211
         rtac (a2 RS impI) 1, assume_tac 1, rtac (a3 RS impI) 1, assume_tac 1]);
clasohm@923
   212
oheimb@1660
   213
clasohm@923
   214
(** CCONTR -- classical logic **)
oheimb@1660
   215
section "classical logic";
clasohm@923
   216
clasohm@923
   217
qed_goalw "classical" HOL.thy [not_def]  "(~P ==> P) ==> P"
clasohm@923
   218
 (fn [prem] =>
clasohm@923
   219
   [rtac (True_or_False RS (disjE RS eqTrueE)) 1,  assume_tac 1,
clasohm@923
   220
    rtac (impI RS prem RS eqTrueI) 1,
clasohm@923
   221
    etac subst 1,  assume_tac 1]);
clasohm@923
   222
clasohm@923
   223
val ccontr = FalseE RS classical;
clasohm@923
   224
clasohm@923
   225
(*Double negation law*)
clasohm@923
   226
qed_goal "notnotD" HOL.thy "~~P ==> P"
clasohm@923
   227
 (fn [major]=>
clasohm@923
   228
  [ (rtac classical 1), (eresolve_tac [major RS notE] 1) ]);
clasohm@923
   229
oheimb@1660
   230
qed_goal "contrapos2" HOL.thy "[| Q; ~ P ==> ~ Q |] ==> P" (fn [p1,p2] => [
paulson@2031
   231
        rtac classical 1,
paulson@2031
   232
        dtac p2 1,
paulson@2031
   233
        etac notE 1,
paulson@2031
   234
        rtac p1 1]);
oheimb@1660
   235
oheimb@1660
   236
qed_goal "swap2" HOL.thy "[| P;  Q ==> ~ P |] ==> ~ Q" (fn [p1,p2] => [
paulson@2031
   237
        rtac notI 1,
paulson@2031
   238
        dtac p2 1,
paulson@2031
   239
        etac notE 1,
paulson@2031
   240
        rtac p1 1]);
clasohm@923
   241
clasohm@923
   242
(** Unique existence **)
oheimb@1660
   243
section "?!";
clasohm@923
   244
clasohm@923
   245
qed_goalw "ex1I" HOL.thy [Ex1_def]
paulson@2031
   246
            "[| P(a);  !!x. P(x) ==> x=a |] ==> ?! x. P(x)"
clasohm@923
   247
 (fn prems =>
clasohm@923
   248
  [REPEAT (ares_tac (prems@[exI,conjI,allI,impI]) 1)]);
clasohm@923
   249
paulson@3003
   250
(*Sometimes easier to use: the premises have no shared variables.  Safe!*)
paulson@3003
   251
qed_goal "ex_ex1I" HOL.thy
wenzelm@3842
   252
    "[| ? x. P(x);  !!x y. [| P(x); P(y) |] ==> x=y |] ==> ?! x. P(x)"
paulson@3003
   253
 (fn [ex,eq] => [ (rtac (ex RS exE) 1),
paulson@3003
   254
                  (REPEAT (ares_tac [ex1I,eq] 1)) ]);
paulson@3003
   255
clasohm@923
   256
qed_goalw "ex1E" HOL.thy [Ex1_def]
wenzelm@3842
   257
    "[| ?! x. P(x);  !!x. [| P(x);  ! y. P(y) --> y=x |] ==> R |] ==> R"
clasohm@923
   258
 (fn major::prems =>
clasohm@923
   259
  [rtac (major RS exE) 1, REPEAT (etac conjE 1 ORELSE ares_tac prems 1)]);
clasohm@923
   260
berghofe@5185
   261
Goal "?! x. P x ==> ? x. P x";
wenzelm@5228
   262
by (etac ex1E 1);
wenzelm@5228
   263
by (rtac exI 1);
wenzelm@5228
   264
by (assume_tac 1);
berghofe@5185
   265
qed "ex1_implies_ex";
berghofe@5185
   266
clasohm@923
   267
clasohm@923
   268
(** Select: Hilbert's Epsilon-operator **)
oheimb@1660
   269
section "@";
clasohm@923
   270
clasohm@923
   271
(*Easier to apply than selectI: conclusion has only one occurrence of P*)
clasohm@923
   272
qed_goal "selectI2" HOL.thy
oheimb@4527
   273
    "[| P a;  !!x. P x ==> Q x |] ==> Q (@x. P x)"
clasohm@923
   274
 (fn prems => [ resolve_tac prems 1, 
clasohm@1465
   275
                rtac selectI 1, 
clasohm@1465
   276
                resolve_tac prems 1 ]);
clasohm@923
   277
nipkow@3646
   278
(*Easier to apply than selectI2 if witness ?a comes from an EX-formula*)
nipkow@3646
   279
qed_goal "selectI2EX" HOL.thy
oheimb@4527
   280
  "[| ? a. P a; !!x. P x ==> Q x |] ==> Q (Eps P)"
nipkow@3646
   281
(fn [major,minor] => [rtac (major RS exE) 1, etac selectI2 1, etac minor 1]);
nipkow@3646
   282
clasohm@923
   283
qed_goal "select_equality" HOL.thy
oheimb@4527
   284
    "[| P a;  !!x. P x ==> x=a |] ==> (@x. P x) = a"
clasohm@923
   285
 (fn prems => [ rtac selectI2 1, 
clasohm@1465
   286
                REPEAT (ares_tac prems 1) ]);
clasohm@923
   287
nipkow@3646
   288
qed_goalw "select1_equality" HOL.thy [Ex1_def]
oheimb@4527
   289
  "!!P. [| ?!x. P x; P a |] ==> (@x. P x) = a" (K [
oheimb@4131
   290
	  rtac select_equality 1, atac 1,
nipkow@3646
   291
          etac exE 1, etac conjE 1,
nipkow@3646
   292
          rtac allE 1, atac 1,
nipkow@3646
   293
          etac impE 1, atac 1, etac ssubst 1,
nipkow@3646
   294
          etac allE 1, etac impE 1, atac 1, etac ssubst 1,
nipkow@3646
   295
          rtac refl 1]);
nipkow@3436
   296
oheimb@4131
   297
qed_goal "select_eq_Ex" HOL.thy "P (@ x. P x) =  (? x. P x)" (K [
oheimb@1660
   298
        rtac iffI 1,
oheimb@1660
   299
        etac exI 1,
oheimb@1660
   300
        etac exE 1,
oheimb@1660
   301
        etac selectI 1]);
oheimb@1660
   302
nipkow@5447
   303
qed_goal "Eps_eq" HOL.thy "(@y. y=x) = x" (K [
nipkow@5447
   304
	rtac select_equality 1,
nipkow@5447
   305
	rtac refl 1,
nipkow@5447
   306
	atac 1]);
nipkow@5447
   307
nipkow@5447
   308
qed_goal "Eps_sym_eq" HOL.thy "(Eps (op = x)) = x" (K [
oheimb@5299
   309
	rtac select_equality 1,
oheimb@5299
   310
	rtac refl 1,
oheimb@5299
   311
	etac sym 1]);
clasohm@923
   312
clasohm@923
   313
(** Classical intro rules for disjunction and existential quantifiers *)
oheimb@1660
   314
section "classical intro rules";
clasohm@923
   315
clasohm@923
   316
qed_goal "disjCI" HOL.thy "(~Q ==> P) ==> P|Q"
clasohm@923
   317
 (fn prems=>
clasohm@923
   318
  [ (rtac classical 1),
clasohm@923
   319
    (REPEAT (ares_tac (prems@[disjI1,notI]) 1)),
clasohm@923
   320
    (REPEAT (ares_tac (prems@[disjI2,notE]) 1)) ]);
clasohm@923
   321
clasohm@923
   322
qed_goal "excluded_middle" HOL.thy "~P | P"
clasohm@923
   323
 (fn _ => [ (REPEAT (ares_tac [disjCI] 1)) ]);
clasohm@923
   324
clasohm@923
   325
(*For disjunctive case analysis*)
clasohm@923
   326
fun excluded_middle_tac sP =
clasohm@923
   327
    res_inst_tac [("Q",sP)] (excluded_middle RS disjE);
clasohm@923
   328
clasohm@923
   329
(*Classical implies (-->) elimination. *)
clasohm@923
   330
qed_goal "impCE" HOL.thy "[| P-->Q; ~P ==> R; Q ==> R |] ==> R" 
clasohm@923
   331
 (fn major::prems=>
clasohm@923
   332
  [ rtac (excluded_middle RS disjE) 1,
clasohm@923
   333
    REPEAT (DEPTH_SOLVE_1 (ares_tac (prems @ [major RS mp]) 1))]);
clasohm@923
   334
paulson@4302
   335
(*This version of --> elimination works on Q before P.  It works best for
paulson@4302
   336
  those cases in which P holds "almost everywhere".  Can't install as
paulson@4302
   337
  default: would break old proofs.*)
paulson@4302
   338
qed_goal "impCE'" thy 
paulson@4302
   339
    "[| P-->Q;  Q ==> R;  ~P ==> R |] ==> R"
paulson@4302
   340
 (fn major::prems=>
paulson@4302
   341
  [ (resolve_tac [excluded_middle RS disjE] 1),
paulson@4302
   342
    (DEPTH_SOLVE (ares_tac (prems@[major RS mp]) 1)) ]);
paulson@4302
   343
clasohm@923
   344
(*Classical <-> elimination. *)
clasohm@923
   345
qed_goal "iffCE" HOL.thy
clasohm@923
   346
    "[| P=Q;  [| P; Q |] ==> R;  [| ~P; ~Q |] ==> R |] ==> R"
clasohm@923
   347
 (fn major::prems =>
clasohm@923
   348
  [ (rtac (major RS iffE) 1),
clasohm@923
   349
    (REPEAT (DEPTH_SOLVE_1 
clasohm@1465
   350
        (eresolve_tac ([asm_rl,impCE,notE]@prems) 1))) ]);
clasohm@923
   351
wenzelm@3842
   352
qed_goal "exCI" HOL.thy "(! x. ~P(x) ==> P(a)) ==> ? x. P(x)"
clasohm@923
   353
 (fn prems=>
clasohm@923
   354
  [ (rtac ccontr 1),
clasohm@923
   355
    (REPEAT (ares_tac (prems@[exI,allI,notI,notE]) 1))  ]);
clasohm@923
   356
clasohm@923
   357
clasohm@923
   358
(* case distinction *)
clasohm@923
   359
clasohm@923
   360
qed_goal "case_split_thm" HOL.thy "[| P ==> Q; ~P ==> Q |] ==> Q"
paulson@5154
   361
  (fn [p1,p2] => [rtac (excluded_middle RS disjE) 1,
clasohm@923
   362
                  etac p2 1, etac p1 1]);
clasohm@923
   363
clasohm@923
   364
fun case_tac a = res_inst_tac [("P",a)] case_split_thm;
clasohm@923
   365
oheimb@1660
   366
clasohm@923
   367
(** Standard abbreviations **)
clasohm@923
   368
paulson@5309
   369
(*Apply an equality or definition ONCE.
paulson@5309
   370
  Fails unless the substitution has an effect*)
paulson@5309
   371
fun stac th = 
paulson@5309
   372
  let val th' = th RS def_imp_eq handle _ => th
paulson@5309
   373
  in  CHANGED_GOAL (rtac (th' RS ssubst))
paulson@5309
   374
  end;
paulson@5139
   375
clasohm@923
   376
fun strip_tac i = REPEAT(resolve_tac [impI,allI] i); 
clasohm@1338
   377
paulson@2562
   378
paulson@2562
   379
(** strip ! and --> from proved goal while preserving !-bound var names **)
nipkow@1485
   380
nipkow@1485
   381
local
nipkow@1485
   382
nipkow@1515
   383
(* Use XXX to avoid forall_intr failing because of duplicate variable name *)
nipkow@1485
   384
val myspec = read_instantiate [("P","?XXX")] spec;
nipkow@1485
   385
val _ $ (_ $ (vx as Var(_,vxT))) = concl_of myspec;
nipkow@1485
   386
val cvx = cterm_of (#sign(rep_thm myspec)) vx;
nipkow@1485
   387
val aspec = forall_intr cvx myspec;
nipkow@1485
   388
nipkow@1485
   389
in
nipkow@1485
   390
nipkow@1515
   391
fun RSspec th =
nipkow@1515
   392
  (case concl_of th of
nipkow@1515
   393
     _ $ (Const("All",_) $ Abs(a,_,_)) =>
nipkow@1515
   394
         let val ca = cterm_of (#sign(rep_thm th)) (Var((a,0),vxT))
nipkow@1515
   395
         in th RS forall_elim ca aspec end
nipkow@1515
   396
  | _ => raise THM("RSspec",0,[th]));
nipkow@1515
   397
nipkow@1515
   398
fun RSmp th =
nipkow@1515
   399
  (case concl_of th of
nipkow@1515
   400
     _ $ (Const("op -->",_)$_$_) => th RS mp
nipkow@1515
   401
  | _ => raise THM("RSmp",0,[th]));
nipkow@1515
   402
nipkow@1515
   403
fun normalize_thm funs =
paulson@5346
   404
  let fun trans [] th = th
paulson@5346
   405
	| trans (f::fs) th = (trans funs (f th)) handle THM _ => trans fs th
paulson@5346
   406
  in zero_var_indexes o trans funs end;
nipkow@1515
   407
berghofe@3615
   408
fun qed_spec_mp name =
berghofe@3615
   409
  let val thm = normalize_thm [RSspec,RSmp] (result())
paulson@5346
   410
  in ml_store_thm(name, thm) end;
berghofe@3615
   411
berghofe@3615
   412
fun qed_goal_spec_mp name thy s p = 
berghofe@3615
   413
	bind_thm (name, normalize_thm [RSspec,RSmp] (prove_goal thy s p));
berghofe@3615
   414
berghofe@3615
   415
fun qed_goalw_spec_mp name thy defs s p = 
berghofe@3615
   416
	bind_thm (name, normalize_thm [RSspec,RSmp] (prove_goalw thy defs s p));
oheimb@1660
   417
wenzelm@3621
   418
end;
wenzelm@5888
   419
wenzelm@5888
   420
wenzelm@5888
   421
(* attributes *)
wenzelm@5888
   422
wenzelm@5888
   423
local
wenzelm@5888
   424
wenzelm@6092
   425
fun gen_rulify x = Attrib.no_args (Drule.rule_attribute (K (normalize_thm [RSspec, RSmp]))) x;
wenzelm@5888
   426
wenzelm@5888
   427
in
wenzelm@5888
   428
wenzelm@5888
   429
val attrib_setup =
wenzelm@5888
   430
 [Attrib.add_attributes
wenzelm@5888
   431
  [("rulify", (gen_rulify, gen_rulify), "put theorem into standard rule form")]];
wenzelm@5888
   432
wenzelm@5888
   433
end;