TFL/rules.sml
author wenzelm
Thu, 01 Jul 1999 21:19:45 +0200
changeset 6874 747f656e04ec
parent 6498 1ebbe18fe236
child 7262 a05dc63ca29b
permissions -rw-r--r--
renamed with/APP to of/OF;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     1
(*  Title:      TFL/rules
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     2
    ID:         $Id$
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     3
    Author:     Konrad Slind, Cambridge University Computer Laboratory
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     4
    Copyright   1997  University of Cambridge
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     5
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     6
Emulation of HOL inference rules for TFL
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     7
*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     8
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
     9
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    10
structure Rules : Rules_sig = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    11
struct
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    12
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    13
open Utils;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    14
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    15
structure USyntax  = USyntax;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    16
structure S  = USyntax;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    17
structure U  = Utils;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    18
structure D = Dcterm;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    19
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    20
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    21
fun RULES_ERR{func,mesg} = Utils.ERR{module = "Rules",func=func,mesg=mesg};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    22
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    23
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    24
fun cconcl thm = D.drop_prop(#prop(crep_thm thm));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    25
fun chyps thm = map D.drop_prop(#hyps(crep_thm thm));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    26
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    27
fun dest_thm thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    28
   let val {prop,hyps,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    29
   in (map HOLogic.dest_Trueprop hyps, HOLogic.dest_Trueprop prop)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    30
   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    31
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    32
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    33
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    34
(* Inference rules *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    35
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    36
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    37
 *        Equality (one step)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    38
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    39
fun REFL tm = Thm.reflexive tm RS meta_eq_to_obj_eq;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    40
fun SYM thm = thm RS sym;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    41
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    42
fun ALPHA thm ctm1 =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    43
   let val ctm2 = cprop_of thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    44
       val ctm2_eq = reflexive ctm2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    45
       val ctm1_eq = reflexive ctm1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    46
   in equal_elim (transitive ctm2_eq ctm1_eq) thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    47
   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    48
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    49
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    50
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    51
 *        typ instantiation
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    52
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    53
fun INST_TYPE blist thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    54
  let val {sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    55
      val blist' = map (fn (TVar(idx,_), B) => (idx, ctyp_of sign B)) blist
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    56
  in Thm.instantiate (blist',[]) thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    57
  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    58
  handle _ => raise RULES_ERR{func = "INST_TYPE", mesg = ""};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    59
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    60
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    61
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    62
 *        Implication and the assumption list
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    63
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    64
 * Assumptions get stuck on the meta-language assumption list. Implications 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    65
 * are in the object language, so discharging an assumption "A" from theorem
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    66
 * "B" results in something that looks like "A --> B".
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    67
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    68
fun ASSUME ctm = Thm.assume (D.mk_prop ctm);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    69
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    70
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    71
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    72
 * Implication in TFL is -->. Meta-language implication (==>) is only used
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    73
 * in the implementation of some of the inference rules below.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    74
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    75
fun MP th1 th2 = th2 RS (th1 RS mp);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    76
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    77
(*forces the first argument to be a proposition if necessary*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    78
fun DISCH tm thm = Thm.implies_intr (D.mk_prop tm) thm COMP impI;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    79
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    80
fun DISCH_ALL thm = Utils.itlist DISCH (#hyps (crep_thm thm)) thm;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    81
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    82
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    83
fun FILTER_DISCH_ALL P thm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    84
 let fun check tm = U.holds P (#t(rep_cterm tm))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    85
 in  foldr (fn (tm,th) => if (check tm) then DISCH tm th else th)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    86
              (chyps thm, thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    87
 end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    88
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    89
(* freezeT expensive! *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    90
fun UNDISCH thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    91
   let val tm = D.mk_prop(#1(D.dest_imp(cconcl (freezeT thm))))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    92
   in implies_elim (thm RS mp) (ASSUME tm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    93
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    94
   handle _ => raise RULES_ERR{func = "UNDISCH", mesg = ""};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    95
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    96
fun PROVE_HYP ath bth =  MP (DISCH (cconcl ath) bth) ath;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    97
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    98
local val [p1,p2] = goal HOL.thy "(A-->B) ==> (B --> C) ==> (A-->C)"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
    99
      val dummy = by (rtac impI 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   100
      val dummy = by (rtac (p2 RS mp) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   101
      val dummy = by (rtac (p1 RS mp) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   102
      val dummy = by (assume_tac 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   103
      val imp_trans = result()
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   104
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   105
fun IMP_TRANS th1 th2 = th2 RS (th1 RS imp_trans)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   106
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   107
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   108
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   109
 *        Conjunction
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   110
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   111
fun CONJUNCT1 thm = (thm RS conjunct1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   112
fun CONJUNCT2 thm = (thm RS conjunct2);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   113
fun CONJUNCTS th  = (CONJUNCTS (CONJUNCT1 th) @ CONJUNCTS (CONJUNCT2 th))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   114
                    handle _ => [th];
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   115
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   116
fun LIST_CONJ [] = raise RULES_ERR{func = "LIST_CONJ", mesg = "empty list"}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   117
  | LIST_CONJ [th] = th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   118
  | LIST_CONJ (th::rst) = MP(MP(conjI COMP (impI RS impI)) th) (LIST_CONJ rst);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   119
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   120
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   121
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   122
 *        Disjunction
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   123
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   124
local val {prop,sign,...} = rep_thm disjI1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   125
      val [P,Q] = term_vars prop
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   126
      val disj1 = forall_intr (cterm_of sign Q) disjI1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   127
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   128
fun DISJ1 thm tm = thm RS (forall_elim (D.drop_prop tm) disj1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   129
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   130
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   131
local val {prop,sign,...} = rep_thm disjI2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   132
      val [P,Q] = term_vars prop
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   133
      val disj2 = forall_intr (cterm_of sign P) disjI2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   134
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   135
fun DISJ2 tm thm = thm RS (forall_elim (D.drop_prop tm) disj2)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   136
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   137
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   138
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   139
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   140
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   141
 *                   A1 |- M1, ..., An |- Mn
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   142
 *     ---------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   143
 *     [A1 |- M1 \/ ... \/ Mn, ..., An |- M1 \/ ... \/ Mn]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   144
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   145
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   146
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   147
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   148
fun EVEN_ORS thms =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   149
  let fun blue ldisjs [] _ = []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   150
        | blue ldisjs (th::rst) rdisjs =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   151
            let val tail = tl rdisjs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   152
                val rdisj_tl = D.list_mk_disj tail
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   153
            in itlist DISJ2 ldisjs (DISJ1 th rdisj_tl)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   154
               :: blue (ldisjs@[cconcl th]) rst tail
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   155
            end handle _ => [itlist DISJ2 ldisjs th]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   156
   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   157
   blue [] thms (map cconcl thms)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   158
   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   159
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   160
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   161
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   162
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   163
 *         A |- P \/ Q   B,P |- R    C,Q |- R
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   164
 *     ---------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   165
 *                     A U B U C |- R
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   166
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   167
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   168
local val [p1,p2,p3] = goal HOL.thy "(P | Q) ==> (P --> R) ==> (Q --> R) ==> R"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   169
      val dummy = by (rtac (p1 RS disjE) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   170
      val dummy = by (rtac (p2 RS mp) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   171
      val dummy = by (assume_tac 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   172
      val dummy = by (rtac (p3 RS mp) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   173
      val dummy = by (assume_tac 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   174
      val tfl_exE = result()
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   175
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   176
fun DISJ_CASES th1 th2 th3 = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   177
   let val c = D.drop_prop(cconcl th1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   178
       val (disj1,disj2) = D.dest_disj c
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   179
       val th2' = DISCH disj1 th2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   180
       val th3' = DISCH disj2 th3
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   181
   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   182
   th3' RS (th2' RS (th1 RS tfl_exE))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   183
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   184
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   185
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   186
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   187
(*-----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   188
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   189
 *       |- A1 \/ ... \/ An     [A1 |- M, ..., An |- M]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   190
 *     ---------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   191
 *                           |- M
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   192
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   193
 * Note. The list of theorems may be all jumbled up, so we have to 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   194
 * first organize it to align with the first argument (the disjunctive 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   195
 * theorem).
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   196
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   197
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   198
fun organize eq =    (* a bit slow - analogous to insertion sort *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   199
 let fun extract a alist =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   200
     let fun ex (_,[]) = raise RULES_ERR{func = "organize",
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   201
                                         mesg = "not a permutation.1"}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   202
           | ex(left,h::t) = if (eq h a) then (h,rev left@t) else ex(h::left,t)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   203
     in ex ([],alist)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   204
     end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   205
     fun place [] [] = []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   206
       | place (a::rst) alist =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   207
           let val (item,next) = extract a alist
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   208
           in item::place rst next
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   209
           end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   210
       | place _ _ = raise RULES_ERR{func = "organize",
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   211
                                     mesg = "not a permutation.2"}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   212
 in place
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   213
 end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   214
(* freezeT expensive! *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   215
fun DISJ_CASESL disjth thl =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   216
   let val c = cconcl disjth
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   217
       fun eq th atm = exists (fn t => HOLogic.dest_Trueprop t 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   218
			               aconv term_of atm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   219
	                      (#hyps(rep_thm th))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   220
       val tml = D.strip_disj c
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   221
       fun DL th [] = raise RULES_ERR{func="DISJ_CASESL",mesg="no cases"}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   222
         | DL th [th1] = PROVE_HYP th th1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   223
         | DL th [th1,th2] = DISJ_CASES th th1 th2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   224
         | DL th (th1::rst) = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   225
            let val tm = #2(D.dest_disj(D.drop_prop(cconcl th)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   226
             in DISJ_CASES th th1 (DL (ASSUME tm) rst) end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   227
   in DL (freezeT disjth) (organize eq tml thl)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   228
   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   229
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   230
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   231
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   232
 *        Universals
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   233
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   234
local (* this is fragile *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   235
      val {prop,sign,...} = rep_thm spec
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   236
      val x = hd (tl (term_vars prop))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   237
      val (TVar (indx,_)) = type_of x
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   238
      val gspec = forall_intr (cterm_of sign x) spec
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   239
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   240
fun SPEC tm thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   241
   let val {sign,T,...} = rep_cterm tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   242
       val gspec' = instantiate([(indx,ctyp_of sign T)],[]) gspec
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   243
   in 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   244
      thm RS (forall_elim tm gspec')
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   245
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   246
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   247
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   248
fun SPEC_ALL thm = rev_itlist SPEC (#1(D.strip_forall(cconcl thm))) thm;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   249
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   250
val ISPEC = SPEC
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   251
val ISPECL = rev_itlist ISPEC;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   252
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   253
(* Not optimized! Too complicated. *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   254
local val {prop,sign,...} = rep_thm allI
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   255
      val [P] = add_term_vars (prop, [])
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   256
      fun cty_theta s = map (fn (i,ty) => (i, ctyp_of s ty))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   257
      fun ctm_theta s = map (fn (i,tm2) => 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   258
                             let val ctm2 = cterm_of s tm2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   259
                             in (cterm_of s (Var(i,#T(rep_cterm ctm2))), ctm2)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   260
                             end)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   261
      fun certify s (ty_theta,tm_theta) = (cty_theta s ty_theta, 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   262
                                           ctm_theta s tm_theta)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   263
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   264
fun GEN v th =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   265
   let val gth = forall_intr v th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   266
       val {prop=Const("all",_)$Abs(x,ty,rst),sign,...} = rep_thm gth
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   267
       val P' = Abs(x,ty, HOLogic.dest_Trueprop rst)  (* get rid of trueprop *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   268
       val tsig = #tsig(Sign.rep_sg sign)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   269
       val theta = Pattern.match tsig (P,P')
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   270
       val allI2 = instantiate (certify sign theta) allI
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   271
       val thm = implies_elim allI2 gth
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   272
       val {prop = tp $ (A $ Abs(_,_,M)),sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   273
       val prop' = tp $ (A $ Abs(x,ty,M))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   274
   in ALPHA thm (cterm_of sign prop')
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   275
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   276
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   277
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   278
val GENL = itlist GEN;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   279
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   280
fun GEN_ALL thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   281
   let val {prop,sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   282
       val tycheck = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   283
       val vlist = map tycheck (add_term_vars (prop, []))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   284
  in GENL vlist thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   285
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   286
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   287
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   288
fun MATCH_MP th1 th2 = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   289
   if (D.is_forall (D.drop_prop(cconcl th1)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   290
   then MATCH_MP (th1 RS spec) th2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   291
   else MP th1 th2;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   292
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   293
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   294
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   295
 *        Existentials
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   296
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   297
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   298
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   299
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   300
(*--------------------------------------------------------------------------- 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   301
 * Existential elimination
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   302
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   303
 *      A1 |- ?x.t[x]   ,   A2, "t[v]" |- t'
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   304
 *      ------------------------------------     (variable v occurs nowhere)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   305
 *                A1 u A2 |- t'
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   306
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   307
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   308
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   309
local val [p1,p2] = goal HOL.thy "(? x. P x) ==> (!x. P x --> Q) ==> Q"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   310
      val dummy = by (rtac (p1 RS exE) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   311
      val dummy = by (rtac ((p2 RS allE) RS mp) 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   312
      val dummy = by (assume_tac 2)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   313
      val dummy = by (assume_tac 1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   314
      val choose_thm = result()
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   315
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   316
fun CHOOSE(fvar,exth) fact =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   317
   let val lam = #2(dest_comb(D.drop_prop(cconcl exth)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   318
       val redex = capply lam fvar
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   319
       val {sign, t = t$u,...} = rep_cterm redex
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   320
       val residue = cterm_of sign (betapply(t,u))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   321
    in GEN fvar (DISCH residue fact)  RS (exth RS choose_thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   322
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   323
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   324
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   325
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   326
local val {prop,sign,...} = rep_thm exI
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   327
      val [P,x] = term_vars prop
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   328
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   329
fun EXISTS (template,witness) thm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   330
   let val {prop,sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   331
       val P' = cterm_of sign P
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   332
       val x' = cterm_of sign x
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   333
       val abstr = #2(dest_comb template)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   334
   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   335
   thm RS (cterm_instantiate[(P',abstr), (x',witness)] exI)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   336
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   337
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   338
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   339
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   340
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   341
 *         A |- M
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   342
 *   -------------------   [v_1,...,v_n]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   343
 *    A |- ?v1...v_n. M
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   344
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   345
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   346
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   347
fun EXISTL vlist th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   348
  U.itlist (fn v => fn thm => EXISTS(D.mk_exists(v,cconcl thm), v) thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   349
           vlist th;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   350
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   351
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   352
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   353
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   354
 *       A |- M[x_1,...,x_n]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   355
 *   ----------------------------   [(x |-> y)_1,...,(x |-> y)_n]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   356
 *       A |- ?y_1...y_n. M
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   357
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   358
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   359
(* Could be improved, but needs "subst_free" for certified terms *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   360
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   361
fun IT_EXISTS blist th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   362
   let val {sign,...} = rep_thm th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   363
       val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   364
       val detype = #t o rep_cterm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   365
       val blist' = map (fn (x,y) => (detype x, detype y)) blist
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   366
       fun ?v M  = cterm_of sign (S.mk_exists{Bvar=v,Body = M})
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   367
       
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   368
  in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   369
  U.itlist (fn (b as (r1,r2)) => fn thm => 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   370
        EXISTS(?r2(subst_free[b] 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   371
		   (HOLogic.dest_Trueprop(#prop(rep_thm thm)))), tych r1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   372
              thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   373
       blist' th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   374
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   375
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   376
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   377
 *  Faster version, that fails for some as yet unknown reason
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   378
 * fun IT_EXISTS blist th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   379
 *    let val {sign,...} = rep_thm th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   380
 *        val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   381
 *        fun detype (x,y) = ((#t o rep_cterm) x, (#t o rep_cterm) y)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   382
 *   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   383
 *  fold (fn (b as (r1,r2), thm) => 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   384
 *  EXISTS(D.mk_exists(r2, tych(subst_free[detype b](#t(rep_cterm(cconcl thm))))),
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   385
 *           r1) thm)  blist th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   386
 *   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   387
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   388
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   389
(*----------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   390
 *        Rewriting
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   391
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   392
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   393
fun SUBS thl = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   394
   rewrite_rule (map (fn th => (th RS eq_reflection) handle _ => th) thl);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   395
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   396
local fun rew_conv mss = Thm.rewrite_cterm (true,false,false) mss (K(K None))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   397
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   398
fun simpl_conv ss thl ctm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   399
 rew_conv (Thm.mss_of (#simps (Thm.dest_mss (#mss (rep_ss ss))) @ thl)) ctm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   400
 RS meta_eq_to_obj_eq
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   401
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   402
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   403
local fun prover s = prove_goal HOL.thy s (fn _ => [fast_tac HOL_cs 1])
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   404
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   405
val RIGHT_ASSOC = rewrite_rule [prover"((a|b)|c) = (a|(b|c))" RS eq_reflection]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   406
val ASM = refl RS iffD1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   407
end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   408
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   409
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   410
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   411
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   412
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   413
 *                  TERMINATION CONDITION EXTRACTION
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   414
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   415
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   416
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   417
(* Object language quantifier, i.e., "!" *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   418
fun Forall v M = S.mk_forall{Bvar=v, Body=M};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   419
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   420
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   421
(* Fragile: it's a cong if it is not "R y x ==> cut f R x y = f y" *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   422
fun is_cong thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   423
  let val {prop, ...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   424
  in case prop 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   425
     of (Const("==>",_)$(Const("Trueprop",_)$ _) $
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   426
         (Const("==",_) $ (Const ("cut",_) $ f $ R $ a $ x) $ _)) => false
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   427
      | _ => true
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   428
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   429
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   430
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   431
   
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   432
fun dest_equal(Const ("==",_) $ 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   433
	       (Const ("Trueprop",_) $ lhs) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   434
	       $ (Const ("Trueprop",_) $ rhs)) = {lhs=lhs, rhs=rhs}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   435
  | dest_equal(Const ("==",_) $ lhs $ rhs)  = {lhs=lhs, rhs=rhs}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   436
  | dest_equal tm = S.dest_eq tm;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   437
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   438
fun get_lhs tm = #lhs(dest_equal (HOLogic.dest_Trueprop tm));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   439
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   440
fun dest_all(Const("all",_) $ (a as Abs _)) = S.dest_abs a
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   441
  | dest_all _ = raise RULES_ERR{func = "dest_all", mesg = "not a !!"};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   442
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   443
val is_all = Utils.can dest_all;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   444
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   445
fun strip_all fm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   446
   if (is_all fm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   447
   then let val {Bvar,Body} = dest_all fm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   448
            val (bvs,core)  = strip_all Body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   449
        in ((Bvar::bvs), core)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   450
        end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   451
   else ([],fm);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   452
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   453
fun break_all(Const("all",_) $ Abs (_,_,body)) = body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   454
  | break_all _ = raise RULES_ERR{func = "break_all", mesg = "not a !!"};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   455
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   456
fun list_break_all(Const("all",_) $ Abs (s,ty,body)) = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   457
     let val (L,core) = list_break_all body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   458
     in ((s,ty)::L, core)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   459
     end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   460
  | list_break_all tm = ([],tm);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   461
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   462
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   463
 * Rename a term of the form
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   464
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   465
 *      !!x1 ...xn. x1=M1 ==> ... ==> xn=Mn 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   466
 *                  ==> ((%v1...vn. Q) x1 ... xn = g x1 ... xn.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   467
 * to one of
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   468
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   469
 *      !!v1 ... vn. v1=M1 ==> ... ==> vn=Mn 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   470
 *      ==> ((%v1...vn. Q) v1 ... vn = g v1 ... vn.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   471
 * 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   472
 * This prevents name problems in extraction, and helps the result to read
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   473
 * better. There is a problem with varstructs, since they can introduce more
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   474
 * than n variables, and some extra reasoning needs to be done.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   475
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   476
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   477
fun get ([],_,L) = rev L
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   478
  | get (ant::rst,n,L) =  
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   479
      case (list_break_all ant)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   480
        of ([],_) => get (rst, n+1,L)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   481
         | (vlist,body) =>
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   482
            let val eq = Logic.strip_imp_concl body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   483
                val (f,args) = S.strip_comb (get_lhs eq)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   484
                val (vstrl,_) = S.strip_abs f
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   485
                val names  = variantlist (map (#1 o dest_Free) vstrl,
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   486
					  add_term_names(body, []))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   487
            in get (rst, n+1, (names,n)::L)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   488
            end handle _ => get (rst, n+1, L);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   489
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   490
(* Note: rename_params_rule counts from 1, not 0 *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   491
fun rename thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   492
  let val {prop,sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   493
      val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   494
      val ants = Logic.strip_imp_prems prop
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   495
      val news = get (ants,1,[])
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   496
  in 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   497
  U.rev_itlist rename_params_rule news thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   498
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   499
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   500
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   501
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   502
 * Beta-conversion to the rhs of an equation (taken from hol90/drule.sml)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   503
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   504
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   505
fun list_beta_conv tm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   506
  let fun rbeta th = transitive th (beta_conversion(#2(D.dest_eq(cconcl th))))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   507
      fun iter [] = reflexive tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   508
        | iter (v::rst) = rbeta (combination(iter rst) (reflexive v))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   509
  in iter  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   510
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   511
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   512
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   513
 * Trace information for the rewriter
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   514
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   515
val term_ref = ref[] : term list ref
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   516
val mss_ref = ref [] : meta_simpset list ref;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   517
val thm_ref = ref [] : thm list ref;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   518
val tracing = ref false;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   519
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   520
fun say s = if !tracing then writeln s else ();
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   521
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   522
fun print_thms s L = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   523
  say (cat_lines (s :: map string_of_thm L));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   524
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   525
fun print_cterms s L = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   526
  say (cat_lines (s :: map string_of_cterm L));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   527
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   528
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   529
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   530
 * General abstraction handlers, should probably go in USyntax.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   531
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   532
fun mk_aabs(vstr,body) = S.mk_abs{Bvar=vstr,Body=body}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   533
                         handle _ => S.mk_pabs{varstruct = vstr, body = body};
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   534
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   535
fun list_mk_aabs (vstrl,tm) =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   536
    U.itlist (fn vstr => fn tm => mk_aabs(vstr,tm)) vstrl tm;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   537
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   538
fun dest_aabs tm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   539
   let val {Bvar,Body} = S.dest_abs tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   540
   in (Bvar,Body)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   541
   end handle _ => let val {varstruct,body} = S.dest_pabs tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   542
                   in (varstruct,body)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   543
                   end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   544
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   545
fun strip_aabs tm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   546
   let val (vstr,body) = dest_aabs tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   547
       val (bvs, core) = strip_aabs body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   548
   in (vstr::bvs, core)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   549
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   550
   handle _ => ([],tm);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   551
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   552
fun dest_combn tm 0 = (tm,[])
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   553
  | dest_combn tm n = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   554
     let val {Rator,Rand} = S.dest_comb tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   555
         val (f,rands) = dest_combn Rator (n-1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   556
     in (f,Rand::rands)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   557
     end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   558
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   559
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   560
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   561
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   562
local fun dest_pair M = let val {fst,snd} = S.dest_pair M in (fst,snd) end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   563
      fun mk_fst tm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   564
          let val ty as Type("*", [fty,sty]) = type_of tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   565
          in  Const ("fst", ty --> fty) $ tm  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   566
      fun mk_snd tm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   567
          let val ty as Type("*", [fty,sty]) = type_of tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   568
          in  Const ("snd", ty --> sty) $ tm  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   569
in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   570
fun XFILL tych x vstruct = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   571
  let fun traverse p xocc L =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   572
        if (is_Free p)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   573
        then tych xocc::L
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   574
        else let val (p1,p2) = dest_pair p
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   575
             in traverse p1 (mk_fst xocc) (traverse p2  (mk_snd xocc) L)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   576
             end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   577
  in 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   578
  traverse vstruct x []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   579
end end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   580
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   581
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   582
 * Replace a free tuple (vstr) by a universally quantified variable (a).
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   583
 * Note that the notion of "freeness" for a tuple is different than for a
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   584
 * variable: if variables in the tuple also occur in any other place than
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   585
 * an occurrences of the tuple, they aren't "free" (which is thus probably
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   586
 *  the wrong word to use).
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   587
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   588
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   589
fun VSTRUCT_ELIM tych a vstr th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   590
  let val L = S.free_vars_lr vstr
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   591
      val bind1 = tych (HOLogic.mk_Trueprop (HOLogic.mk_eq(a,vstr)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   592
      val thm1 = implies_intr bind1 (SUBS [SYM(assume bind1)] th)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   593
      val thm2 = forall_intr_list (map tych L) thm1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   594
      val thm3 = forall_elim_list (XFILL tych a vstr) thm2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   595
  in refl RS
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   596
     rewrite_rule[symmetric (surjective_pairing RS eq_reflection)] thm3
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   597
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   598
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   599
fun PGEN tych a vstr th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   600
  let val a1 = tych a
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   601
      val vstr1 = tych vstr
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   602
  in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   603
  forall_intr a1 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   604
     (if (is_Free vstr) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   605
      then cterm_instantiate [(vstr1,a1)] th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   606
      else VSTRUCT_ELIM tych a vstr th)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   607
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   608
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   609
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   610
(*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   611
 * Takes apart a paired beta-redex, looking like "(\(x,y).N) vstr", into
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   612
 *
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   613
 *     (([x,y],N),vstr)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   614
 *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   615
fun dest_pbeta_redex M n = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   616
  let val (f,args) = dest_combn M n
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   617
      val dummy = dest_aabs f
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   618
  in (strip_aabs f,args)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   619
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   620
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   621
fun pbeta_redex M n = U.can (U.C dest_pbeta_redex n) M;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   622
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   623
fun dest_impl tm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   624
  let val ants = Logic.strip_imp_prems tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   625
      val eq = Logic.strip_imp_concl tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   626
  in (ants,get_lhs eq)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   627
  end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   628
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   629
fun restricted t = is_some (S.find_term
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   630
			    (fn (Const("cut",_)) =>true | _ => false) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   631
			    t)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   632
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   633
fun CONTEXT_REWRITE_RULE (func, G, cut_lemma, congs) th =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   634
 let val globals = func::G
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   635
     val pbeta_reduce = simpl_conv empty_ss [split RS eq_reflection];
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   636
     val tc_list = ref[]: term list ref
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   637
     val dummy = term_ref := []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   638
     val dummy = thm_ref  := []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   639
     val dummy = mss_ref  := []
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   640
     val cut_lemma' = cut_lemma RS eq_reflection
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   641
     fun prover mss thm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   642
     let fun cong_prover mss thm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   643
         let val dummy = say "cong_prover:"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   644
             val cntxt = prems_of_mss mss
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   645
             val dummy = print_thms "cntxt:" cntxt
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   646
             val dummy = say "cong rule:"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   647
             val dummy = say (string_of_thm thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   648
             val dummy = thm_ref := (thm :: !thm_ref)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   649
             val dummy = mss_ref := (mss :: !mss_ref)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   650
             (* Unquantified eliminate *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   651
             fun uq_eliminate (thm,imp,sign) = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   652
                 let val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   653
                     val dummy = print_cterms "To eliminate:" [tych imp]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   654
                     val ants = map tych (Logic.strip_imp_prems imp)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   655
                     val eq = Logic.strip_imp_concl imp
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   656
                     val lhs = tych(get_lhs eq)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   657
                     val mss' = add_prems(mss, map ASSUME ants)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   658
                     val lhs_eq_lhs1 = Thm.rewrite_cterm(false,true,false)mss' prover lhs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   659
                       handle _ => reflexive lhs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   660
                     val dummy = print_thms "proven:" [lhs_eq_lhs1]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   661
                     val lhs_eq_lhs2 = implies_intr_list ants lhs_eq_lhs1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   662
                     val lhs_eeq_lhs2 = lhs_eq_lhs2 RS meta_eq_to_obj_eq
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   663
                  in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   664
                  lhs_eeq_lhs2 COMP thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   665
                  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   666
             fun pq_eliminate (thm,sign,vlist,imp_body,lhs_eq) =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   667
              let val ((vstrl,_),args) = dest_pbeta_redex lhs_eq(length vlist)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   668
                  val dummy = assert (forall (op aconv)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   669
                                      (ListPair.zip (vlist, args)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   670
                               "assertion failed in CONTEXT_REWRITE_RULE"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   671
                  val imp_body1 = subst_free (ListPair.zip (args, vstrl))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   672
                                             imp_body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   673
                  val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   674
                  val ants1 = map tych (Logic.strip_imp_prems imp_body1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   675
                  val eq1 = Logic.strip_imp_concl imp_body1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   676
                  val Q = get_lhs eq1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   677
                  val QeqQ1 = pbeta_reduce (tych Q)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   678
                  val Q1 = #2(D.dest_eq(cconcl QeqQ1))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   679
                  val mss' = add_prems(mss, map ASSUME ants1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   680
                  val Q1eeqQ2 = Thm.rewrite_cterm (false,true,false) mss' prover Q1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   681
                                handle _ => reflexive Q1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   682
                  val Q2 = #2 (Logic.dest_equals (#prop(rep_thm Q1eeqQ2)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   683
                  val Q3 = tych(list_comb(list_mk_aabs(vstrl,Q2),vstrl))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   684
                  val Q2eeqQ3 = symmetric(pbeta_reduce Q3 RS eq_reflection)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   685
                  val thA = transitive(QeqQ1 RS eq_reflection) Q1eeqQ2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   686
                  val QeeqQ3 = transitive thA Q2eeqQ3 handle _ =>
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   687
                               ((Q2eeqQ3 RS meta_eq_to_obj_eq) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   688
                                RS ((thA RS meta_eq_to_obj_eq) RS trans))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   689
                                RS eq_reflection
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   690
                  val impth = implies_intr_list ants1 QeeqQ3
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   691
                  val impth1 = impth RS meta_eq_to_obj_eq
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   692
                  (* Need to abstract *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   693
                  val ant_th = U.itlist2 (PGEN tych) args vstrl impth1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   694
              in ant_th COMP thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   695
              end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   696
             fun q_eliminate (thm,imp,sign) =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   697
              let val (vlist,imp_body) = strip_all imp
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   698
                  val (ants,Q) = dest_impl imp_body
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   699
              in if (pbeta_redex Q) (length vlist)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   700
                 then pq_eliminate (thm,sign,vlist,imp_body,Q)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   701
                 else 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   702
                 let val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   703
                     val ants1 = map tych ants
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   704
                     val mss' = add_prems(mss, map ASSUME ants1)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   705
                     val Q_eeq_Q1 = Thm.rewrite_cterm(false,true,false) mss' 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   706
                                                     prover (tych Q)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   707
                      handle _ => reflexive (tych Q)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   708
                     val lhs_eeq_lhs2 = implies_intr_list ants1 Q_eeq_Q1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   709
                     val lhs_eq_lhs2 = lhs_eeq_lhs2 RS meta_eq_to_obj_eq
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   710
                     val ant_th = forall_intr_list(map tych vlist)lhs_eq_lhs2
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   711
                 in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   712
                 ant_th COMP thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   713
              end end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   714
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   715
             fun eliminate thm = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   716
               case (rep_thm thm)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   717
               of {prop = (Const("==>",_) $ imp $ _), sign, ...} =>
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   718
                   eliminate
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   719
                    (if not(is_all imp)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   720
                     then uq_eliminate (thm,imp,sign)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   721
                     else q_eliminate (thm,imp,sign))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   722
                            (* Assume that the leading constant is ==,   *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   723
                | _ => thm  (* if it is not a ==>                        *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   724
         in Some(eliminate (rename thm))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   725
         end handle _ => None
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   726
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   727
        fun restrict_prover mss thm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   728
          let val dummy = say "restrict_prover:"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   729
              val cntxt = rev(prems_of_mss mss)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   730
              val dummy = print_thms "cntxt:" cntxt
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   731
              val {prop = Const("==>",_) $ (Const("Trueprop",_) $ A) $ _,
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   732
                   sign,...} = rep_thm thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   733
              fun genl tm = let val vlist = gen_rems (op aconv)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   734
                                           (add_term_frees(tm,[]), globals)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   735
                            in U.itlist Forall vlist tm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   736
                            end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   737
              (*--------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   738
               * This actually isn't quite right, since it will think that
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   739
               * not-fully applied occs. of "f" in the context mean that the
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   740
               * current call is nested. The real solution is to pass in a
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   741
               * term "f v1..vn" which is a pattern that any full application
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   742
               * of "f" will match.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   743
               *-------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   744
              val func_name = #1(dest_Const func)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   745
              fun is_func (Const (name,_)) = (name = func_name)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   746
		| is_func _                = false
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   747
              val rcontext = rev cntxt
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   748
              val cncl = HOLogic.dest_Trueprop o #prop o rep_thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   749
              val antl = case rcontext of [] => [] 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   750
                         | _   => [S.list_mk_conj(map cncl rcontext)]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   751
              val TC = genl(S.list_mk_imp(antl, A))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   752
              val dummy = print_cterms "func:" [cterm_of sign func]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   753
              val dummy = print_cterms "TC:" 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   754
		              [cterm_of sign (HOLogic.mk_Trueprop TC)]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   755
              val dummy = tc_list := (TC :: !tc_list)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   756
              val nestedp = is_some (S.find_term is_func TC)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   757
              val dummy = if nestedp then say "nested" else say "not_nested"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   758
              val dummy = term_ref := ([func,TC]@(!term_ref))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   759
              val th' = if nestedp then raise RULES_ERR{func = "solver", 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   760
                                                      mesg = "nested function"}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   761
                        else let val cTC = cterm_of sign 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   762
			                      (HOLogic.mk_Trueprop TC)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   763
                             in case rcontext of
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   764
                                [] => SPEC_ALL(ASSUME cTC)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   765
                               | _ => MP (SPEC_ALL (ASSUME cTC)) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   766
                                         (LIST_CONJ rcontext)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   767
                             end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   768
              val th'' = th' RS thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   769
          in Some (th'')
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   770
          end handle _ => None
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   771
    in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   772
    (if (is_cong thm) then cong_prover else restrict_prover) mss thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   773
    end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   774
    val ctm = cprop_of th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   775
    val th1 = Thm.rewrite_cterm(false,true,false) (add_congs(mss_of [cut_lemma'], congs))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   776
                            prover ctm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   777
    val th2 = equal_elim th1 th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   778
 in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   779
 (th2, filter (not o restricted) (!tc_list))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   780
 end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   781
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   782
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   783
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   784
fun prove (ptm,tac) = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   785
    #1 (freeze_thaw (prove_goalw_cterm [] ptm (fn _ => [tac])));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   786
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   787
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents:
diff changeset
   788
end; (* Rules *)