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