src/Pure/drule.ML
author wenzelm
Mon, 09 Mar 1998 16:08:06 +0100
changeset 4691 b159f5d98ceb
parent 4679 24917efb31b5
child 4713 bea2ab2e360b
permissions -rw-r--r--
Syntax.indexname;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
     1
(*  Title:      Pure/drule.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1993  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
3766
8e1794c4e81b moved theory stuff (add_defs etc.) to theory.ML;
wenzelm
parents: 3653
diff changeset
     6
Derived rules and other operations on theorems.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
     9
infix 0 RS RSN RL RLN MRS MRL COMP;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
signature DRULE =
3766
8e1794c4e81b moved theory stuff (add_defs etc.) to theory.ML;
wenzelm
parents: 3653
diff changeset
    12
sig
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    13
  val dest_implies      : cterm -> cterm * cterm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    14
  val skip_flexpairs	: cterm -> cterm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    15
  val strip_imp_prems	: cterm -> cterm list
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    16
  val cprems_of		: thm -> cterm list
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    17
  val read_insts	:
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    18
          Sign.sg -> (indexname -> typ option) * (indexname -> sort option)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    19
                  -> (indexname -> typ option) * (indexname -> sort option)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    20
                  -> string list -> (string*string)list
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    21
                  -> (indexname*ctyp)list * (cterm*cterm)list
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    22
  val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    23
  val forall_intr_list	: cterm list -> thm -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    24
  val forall_intr_frees	: thm -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    25
  val forall_intr_vars	: thm -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    26
  val forall_elim_list	: cterm list -> thm -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    27
  val forall_elim_var	: int -> thm -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    28
  val forall_elim_vars	: int -> thm -> thm
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
    29
  val freeze_thaw	: thm -> thm * (thm -> thm)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    30
  val implies_elim_list	: thm -> thm list -> thm
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    31
  val implies_intr_list	: cterm list -> thm -> thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    32
  val zero_var_indexes	: thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    33
  val standard		: thm -> thm
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
    34
  val rotate_prems      : int -> thm -> thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    35
  val assume_ax		: theory -> string -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    36
  val RSN		: thm * (int * thm) -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    37
  val RS		: thm * thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    38
  val RLN		: thm list * (int * thm list) -> thm list
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    39
  val RL		: thm list * thm list -> thm list
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    40
  val MRS		: thm list * thm -> thm
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    41
  val MRL		: thm list list * thm list -> thm list
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    42
  val compose		: thm * int * thm -> thm list
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    43
  val COMP		: thm * thm -> thm
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    44
  val read_instantiate_sg: Sign.sg -> (string*string)list -> thm -> thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    45
  val read_instantiate	: (string*string)list -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    46
  val cterm_instantiate	: (cterm*cterm)list -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    47
  val weak_eq_thm	: thm * thm -> bool
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    48
  val eq_thm_sg		: thm * thm -> bool
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    49
  val size_of_thm	: thm -> int
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    50
  val reflexive_thm	: thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    51
  val symmetric_thm	: thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    52
  val transitive_thm	: thm
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    53
  val refl_implies      : thm
4679
24917efb31b5 Reorganized simplifier. May now reorient rules.
nipkow
parents: 4610
diff changeset
    54
  val symmetric_fun     : thm -> thm
3575
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
    55
  val rewrite_rule_aux	: (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm
3555
5a720f6b9f38 added rewrite_thm;
wenzelm
parents: 3530
diff changeset
    56
  val rewrite_thm	: bool * bool -> (meta_simpset -> thm -> thm option)
5a720f6b9f38 added rewrite_thm;
wenzelm
parents: 3530
diff changeset
    57
	-> meta_simpset -> thm -> thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    58
  val rewrite_goals_rule_aux: (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    59
  val rewrite_goal_rule	: bool * bool -> (meta_simpset -> thm -> thm option)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    60
        -> meta_simpset -> int -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    61
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    62
  val equal_abs_elim	: cterm  -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    63
  val equal_abs_elim_list: cterm list -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    64
  val flexpair_abs_elim_list: cterm list -> thm -> thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    65
  val asm_rl		: thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    66
  val cut_rl		: thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    67
  val revcut_rl		: thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    68
  val thin_rl		: thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    69
  val triv_forall_equality: thm
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
    70
  val swap_prems_rl     : thm
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    71
  val equal_intr_rule   : thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
    72
  val instantiate': ctyp option list -> cterm option list -> thm -> thm
3766
8e1794c4e81b moved theory stuff (add_defs etc.) to theory.ML;
wenzelm
parents: 3653
diff changeset
    73
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    74
1499
01fdd1ea6324 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    75
structure Drule : DRULE =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    76
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    77
3991
4cb2f2422695 ProtoPure.thy;
wenzelm
parents: 3766
diff changeset
    78
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    79
(** some cterm->cterm operations: much faster than calling cterm_of! **)
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    80
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    81
(** SAME NAMES as in structure Logic: use compound identifiers! **)
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    82
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1596
diff changeset
    83
(*dest_implies for cterms. Note T=prop below*)
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    84
fun dest_implies ct =
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    85
    case term_of ct of 
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    86
	(Const("==>", _) $ _ $ _) => 
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    87
	    let val (ct1,ct2) = dest_comb ct
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    88
	    in  (#2 (dest_comb ct1), ct2)  end	     
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    89
      | _ => raise TERM ("dest_implies", [term_of ct]) ;
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1596
diff changeset
    90
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1596
diff changeset
    91
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    92
(*Discard flexflex pairs; return a cterm*)
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    93
fun skip_flexpairs ct =
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    94
    case term_of ct of
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    95
	(Const("==>", _) $ (Const("=?=",_)$_$_) $ _) =>
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
    96
	    skip_flexpairs (#2 (dest_implies ct))
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    97
      | _ => ct;
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    98
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
    99
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   100
fun strip_imp_prems ct =
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   101
    let val (cA,cB) = dest_implies ct
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   102
    in  cA :: strip_imp_prems cB  end
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
   103
    handle TERM _ => [];
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
   104
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   105
(* A1==>...An==>B  goes to B, where B is not an implication *)
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   106
fun strip_imp_concl ct =
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   107
    case term_of ct of (Const("==>", _) $ _ $ _) => 
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   108
	strip_imp_concl (#2 (dest_comb ct))
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   109
  | _ => ct;
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   110
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
   111
(*The premises of a theorem, as a cterm list*)
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   112
val cprems_of = strip_imp_prems o skip_flexpairs o cprop_of;
708
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
   113
8422e50adce0 Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents: 668
diff changeset
   114
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   115
(** reading of instantiations **)
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   116
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   117
fun absent ixn =
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   118
  error("No such variable in term: " ^ Syntax.string_of_vname ixn);
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   119
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   120
fun inst_failure ixn =
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   121
  error("Instantiation of " ^ Syntax.string_of_vname ixn ^ " fails");
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   122
4281
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   123
fun read_insts sign (rtypes,rsorts) (types,sorts) used insts =
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   124
let val {tsig,...} = Sign.rep_sg sign
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   125
    fun split([],tvs,vs) = (tvs,vs)
4691
b159f5d98ceb Syntax.indexname;
wenzelm
parents: 4679
diff changeset
   126
      | split((sv,st)::l,tvs,vs) = (case Symbol.explode sv of
b159f5d98ceb Syntax.indexname;
wenzelm
parents: 4679
diff changeset
   127
                  "'"::cs => split(l,(Syntax.indexname cs,st)::tvs,vs)
b159f5d98ceb Syntax.indexname;
wenzelm
parents: 4679
diff changeset
   128
                | cs => split(l,tvs,(Syntax.indexname cs,st)::vs));
4281
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   129
    val (tvs,vs) = split(insts,[],[]);
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   130
    fun readT((a,i),st) =
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   131
        let val ixn = ("'" ^ a,i);
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   132
            val S = case rsorts ixn of Some S => S | None => absent ixn;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   133
            val T = Sign.read_typ (sign,sorts) st;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   134
        in if Type.typ_instance(tsig,T,TVar(ixn,S)) then (ixn,T)
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   135
           else inst_failure ixn
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   136
        end
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   137
    val tye = map readT tvs;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   138
    fun mkty(ixn,st) = (case rtypes ixn of
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   139
                          Some T => (ixn,(st,typ_subst_TVars tye T))
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   140
                        | None => absent ixn);
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   141
    val ixnsTs = map mkty vs;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   142
    val ixns = map fst ixnsTs
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   143
    and sTs  = map snd ixnsTs
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   144
    val (cts,tye2) = read_def_cterms(sign,types,sorts) used false sTs;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   145
    fun mkcVar(ixn,T) =
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   146
        let val U = typ_subst_TVars tye2 T
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   147
        in cterm_of sign (Var(ixn,U)) end
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   148
    val ixnTs = ListPair.zip(ixns, map snd sTs)
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   149
in (map (fn (ixn,T) => (ixn,ctyp_of sign T)) (tye2 @ tye),
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   150
    ListPair.zip(map mkcVar ixnTs,cts))
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   151
end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   152
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   153
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   154
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   155
     Used for establishing default types (of variables) and sorts (of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   156
     type variables) when reading another term.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   157
     Index -1 indicates that a (T)Free rather than a (T)Var is wanted.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   158
***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   159
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   160
fun types_sorts thm =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   161
    let val {prop,hyps,...} = rep_thm thm;
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   162
        val big = list_comb(prop,hyps); (* bogus term! *)
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   163
        val vars = map dest_Var (term_vars big);
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   164
        val frees = map dest_Free (term_frees big);
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   165
        val tvars = term_tvars big;
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   166
        val tfrees = term_tfrees big;
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   167
        fun typ(a,i) = if i<0 then assoc(frees,a) else assoc(vars,(a,i));
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   168
        fun sort(a,i) = if i<0 then assoc(tfrees,a) else assoc(tvars,(a,i));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   169
    in (typ,sort) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   170
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   171
(** Standardization of rules **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   172
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   173
(*Generalization over a list of variables, IGNORING bad ones*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   174
fun forall_intr_list [] th = th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   175
  | forall_intr_list (y::ys) th =
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   176
        let val gth = forall_intr_list ys th
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   177
        in  forall_intr y gth   handle THM _ =>  gth  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   178
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   179
(*Generalization over all suitable Free variables*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   180
fun forall_intr_frees th =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   181
    let val {prop,sign,...} = rep_thm th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   182
    in  forall_intr_list
4440
9ed4098074bc adapted to new sort function;
wenzelm
parents: 4313
diff changeset
   183
         (map (cterm_of sign) (sort (make_ord atless) (term_frees prop)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   184
         th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   185
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   186
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   187
(*Replace outermost quantified variable by Var of given index.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   188
    Could clash with Vars already present.*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   189
fun forall_elim_var i th =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   190
    let val {prop,sign,...} = rep_thm th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   191
    in case prop of
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   192
          Const("all",_) $ Abs(a,T,_) =>
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   193
              forall_elim (cterm_of sign (Var((a,i), T)))  th
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   194
        | _ => raise THM("forall_elim_var", i, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   195
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   196
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
(*Repeat forall_elim_var until all outer quantifiers are removed*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   198
fun forall_elim_vars i th =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
    forall_elim_vars i (forall_elim_var i th)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   200
        handle THM _ => th;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   201
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   202
(*Specialization over a list of cterms*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   203
fun forall_elim_list cts th = foldr (uncurry forall_elim) (rev cts, th);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   204
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   205
(* maps [A1,...,An], B   to   [| A1;...;An |] ==> B  *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   206
fun implies_intr_list cAs th = foldr (uncurry implies_intr) (cAs,th);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   207
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   208
(* maps [| A1;...;An |] ==> B and [A1,...,An]   to   B *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   209
fun implies_elim_list impth ths = foldl (uncurry implies_elim) (impth,ths);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   210
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   211
(*Reset Var indexes to zero, renaming to preserve distinctness*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   212
fun zero_var_indexes th =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   213
    let val {prop,sign,...} = rep_thm th;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   214
        val vars = term_vars prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   215
        val bs = foldl add_new_id ([], map (fn Var((a,_),_)=>a) vars)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   216
        val inrs = add_term_tvars(prop,[]);
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   217
        val nms' = rev(foldl add_new_id ([], map (#1 o #1) inrs));
2266
82aef6857c5b Replaced map...~~ by ListPair.map
paulson
parents: 2180
diff changeset
   218
        val tye = ListPair.map (fn ((v,rs),a) => (v, TVar((a,0),rs)))
82aef6857c5b Replaced map...~~ by ListPair.map
paulson
parents: 2180
diff changeset
   219
	             (inrs, nms')
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   220
        val ctye = map (fn (v,T) => (v,ctyp_of sign T)) tye;
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   221
        fun varpairs([],[]) = []
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   222
          | varpairs((var as Var(v,T)) :: vars, b::bs) =
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   223
                let val T' = typ_subst_TVars tye T
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   224
                in (cterm_of sign (Var(v,T')),
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   225
                    cterm_of sign (Var((b,0),T'))) :: varpairs(vars,bs)
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   226
                end
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   227
          | varpairs _ = raise TERM("varpairs", []);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   228
    in instantiate (ctye, varpairs(vars,rev bs)) th end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   229
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   230
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   231
(*Standard form of object-rule: no hypotheses, Frees, or outer quantifiers;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   232
    all generality expressed by Vars having index 0.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   233
fun standard th =
1218
59ed8ef1a3a1 modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents: 1194
diff changeset
   234
  let val {maxidx,...} = rep_thm th
1237
45ac644b0052 adapted to new version of shyps-stuff;
wenzelm
parents: 1218
diff changeset
   235
  in
1218
59ed8ef1a3a1 modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents: 1194
diff changeset
   236
    th |> implies_intr_hyps
1412
2ab32768c996 Now "standard" compresses theorems (for sharing).
paulson
parents: 1241
diff changeset
   237
       |> forall_intr_frees |> forall_elim_vars (maxidx + 1)
1439
1f5949a43e82 improved printing of errors in 'defs';
wenzelm
parents: 1435
diff changeset
   238
       |> Thm.strip_shyps |> Thm.implies_intr_shyps
1412
2ab32768c996 Now "standard" compresses theorems (for sharing).
paulson
parents: 1241
diff changeset
   239
       |> zero_var_indexes |> Thm.varifyT |> Thm.compress
1218
59ed8ef1a3a1 modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents: 1194
diff changeset
   240
  end;
59ed8ef1a3a1 modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents: 1194
diff changeset
   241
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   242
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   243
(*Convert all Vars in a theorem to Frees.  Also return a function for 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   244
  reversing that operation.  DOES NOT WORK FOR TYPE VARIABLES.
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   245
  Similar code in type/freeze_thaw*)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   246
fun freeze_thaw th =
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   247
  let val fth = freezeT th
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   248
      val {prop,sign,...} = rep_thm fth
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   249
      val used = add_term_names (prop, [])
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   250
      and vars = term_vars prop
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   251
      fun newName (Var(ix,_), (pairs,used)) = 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   252
	    let val v = variant used (string_of_indexname ix)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   253
	    in  ((ix,v)::pairs, v::used)  end;
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   254
      val (alist, _) = foldr newName (vars, ([], used))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   255
      fun mk_inst (Var(v,T)) = 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   256
	  (cterm_of sign (Var(v,T)),
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   257
	   cterm_of sign (Free(the (assoc(alist,v)), T)))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   258
      val insts = map mk_inst vars
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   259
      fun thaw th' = 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   260
	  th' |> forall_intr_list (map #2 insts)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   261
	      |> forall_elim_list (map #1 insts)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   262
  in  (instantiate ([],insts) fth, thaw)  end;
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   263
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   264
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   265
(*Rotates a rule's premises to the left by k.  Does nothing if k=0 or
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   266
  if k equals the number of premises.  Useful, for instance, with etac.
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   267
  Similar to tactic/defer_tac*)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   268
fun rotate_prems k rl = 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   269
    let val (rl',thaw) = freeze_thaw rl
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   270
	val hyps = strip_imp_prems (adjust_maxidx (cprop_of rl'))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   271
	val hyps' = List.drop(hyps, k)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   272
    in  implies_elim_list rl' (map assume hyps)
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   273
        |> implies_intr_list (hyps' @ List.take(hyps, k))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   274
        |> thaw |> varifyT
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   275
    end;
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   276
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   277
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   278
(*Assume a new formula, read following the same conventions as axioms.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   279
  Generalizes over Free variables,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   280
  creates the assumption, and then strips quantifiers.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   281
  Example is [| ALL x:?A. ?P(x) |] ==> [| ?P(?a) |]
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   282
             [ !(A,P,a)[| ALL x:A. P(x) |] ==> [| P(a) |] ]    *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   283
fun assume_ax thy sP =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   284
    let val sign = sign_of thy
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   285
        val prop = Logic.close_form (term_of (read_cterm sign (sP, propT)))
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   286
    in forall_elim_vars 0 (assume (cterm_of sign prop))  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   287
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   288
(*Resolution: exactly one resolvent must be produced.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   289
fun tha RSN (i,thb) =
4270
957c887b89b5 changed Sequence interface (now Seq, in seq.ML);
wenzelm
parents: 4057
diff changeset
   290
  case Seq.chop (2, biresolution false [(false,tha)] i thb) of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   291
      ([th],_) => th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   292
    | ([],_)   => raise THM("RSN: no unifiers", i, [tha,thb])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   293
    |      _   => raise THM("RSN: multiple unifiers", i, [tha,thb]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   294
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   295
(*resolution: P==>Q, Q==>R gives P==>R. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   296
fun tha RS thb = tha RSN (1,thb);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   297
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   298
(*For joining lists of rules*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   299
fun thas RLN (i,thbs) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   300
  let val resolve = biresolution false (map (pair false) thas) i
4270
957c887b89b5 changed Sequence interface (now Seq, in seq.ML);
wenzelm
parents: 4057
diff changeset
   301
      fun resb thb = Seq.list_of (resolve thb) handle THM _ => []
2672
85d7e800d754 Replaced "flat" by the Basis Library function List.concat
paulson
parents: 2266
diff changeset
   302
  in  List.concat (map resb thbs)  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   303
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   304
fun thas RL thbs = thas RLN (1,thbs);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   305
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   306
(*Resolve a list of rules against bottom_rl from right to left;
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   307
  makes proof trees*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   308
fun rls MRS bottom_rl =
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   309
  let fun rs_aux i [] = bottom_rl
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   310
        | rs_aux i (rl::rls) = rl RSN (i, rs_aux (i+1) rls)
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   311
  in  rs_aux 1 rls  end;
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   312
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   313
(*As above, but for rule lists*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   314
fun rlss MRL bottom_rls =
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   315
  let fun rs_aux i [] = bottom_rls
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   316
        | rs_aux i (rls::rlss) = rls RLN (i, rs_aux (i+1) rlss)
11
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   317
  in  rs_aux 1 rlss  end;
d0e17c42dbb4 Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents: 0
diff changeset
   318
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   319
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   320
  with no lifting or renaming!  Q may contain ==> or meta-quants
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   321
  ALWAYS deletes premise i *)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   322
fun compose(tha,i,thb) =
4270
957c887b89b5 changed Sequence interface (now Seq, in seq.ML);
wenzelm
parents: 4057
diff changeset
   323
    Seq.list_of (bicompose false (false,tha,0) i thb);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   324
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   325
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   326
fun tha COMP thb =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   327
    case compose(tha,1,thb) of
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   328
        [th] => th
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   329
      | _ =>   raise THM("COMP", 1, [tha,thb]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   330
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   331
(*Instantiate theorem th, reading instantiations under signature sg*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   332
fun read_instantiate_sg sg sinsts th =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   333
    let val ts = types_sorts th;
952
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   334
        val used = add_term_tvarnames(#prop(rep_thm th),[]);
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   335
    in  instantiate (read_insts sg ts ts used sinsts) th  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   336
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   337
(*Instantiate theorem th, reading instantiations under theory of th*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   338
fun read_instantiate sinsts th =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   339
    read_instantiate_sg (#sign (rep_thm th)) sinsts th;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   340
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   341
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   342
(*Left-to-right replacements: tpairs = [...,(vi,ti),...].
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   343
  Instantiates distinct Vars by terms, inferring type instantiations. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   344
local
1435
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1412
diff changeset
   345
  fun add_types ((ct,cu), (sign,tye,maxidx)) =
2152
76d5ed939545 Now uses Int.max instead of max
paulson
parents: 2004
diff changeset
   346
    let val {sign=signt, t=t, T= T, maxidx=maxt,...} = rep_cterm ct
76d5ed939545 Now uses Int.max instead of max
paulson
parents: 2004
diff changeset
   347
        and {sign=signu, t=u, T= U, maxidx=maxu,...} = rep_cterm cu;
76d5ed939545 Now uses Int.max instead of max
paulson
parents: 2004
diff changeset
   348
        val maxi = Int.max(maxidx, Int.max(maxt, maxu));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   349
        val sign' = Sign.merge(sign, Sign.merge(signt, signu))
1435
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1412
diff changeset
   350
        val (tye',maxi') = Type.unify (#tsig(Sign.rep_sg sign')) maxi tye (T,U)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   351
          handle Type.TUNIFY => raise TYPE("add_types", [T,U], [t,u])
1435
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1412
diff changeset
   352
    in  (sign', tye', maxi')  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   353
in
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   354
fun cterm_instantiate ctpairs0 th =
1435
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1412
diff changeset
   355
  let val (sign,tye,_) = foldr add_types (ctpairs0, (#sign(rep_thm th),[],0))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   356
      val tsig = #tsig(Sign.rep_sg sign);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   357
      fun instT(ct,cu) = let val inst = subst_TVars tye
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   358
                         in (cterm_fun inst ct, cterm_fun inst cu) end
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   359
      fun ctyp2 (ix,T) = (ix, ctyp_of sign T)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   360
  in  instantiate (map ctyp2 tye, map instT ctpairs0) th  end
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   361
  handle TERM _ =>
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   362
           raise THM("cterm_instantiate: incompatible signatures",0,[th])
4057
edd8cb346109 propagate exn msg;
wenzelm
parents: 4016
diff changeset
   363
       | TYPE (msg, _, _) => raise THM("cterm_instantiate: " ^ msg, 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   364
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   365
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   366
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   367
(** theorem equality **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   368
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   369
(*Do the two theorems have the same signature?*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   370
fun eq_thm_sg (th1,th2) = Sign.eq_sg(#sign(rep_thm th1), #sign(rep_thm th2));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   371
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   372
(*Useful "distance" function for BEST_FIRST*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   373
val size_of_thm = size_of_term o #prop o rep_thm;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   374
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   375
1194
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   376
(** Mark Staples's weaker version of eq_thm: ignores variable renaming and
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   377
    (some) type variable renaming **)
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   378
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   379
 (* Can't use term_vars, because it sorts the resulting list of variable names.
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   380
    We instead need the unique list noramlised by the order of appearance
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   381
    in the term. *)
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   382
fun term_vars' (t as Var(v,T)) = [t]
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   383
  | term_vars' (Abs(_,_,b)) = term_vars' b
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   384
  | term_vars' (f$a) = (term_vars' f) @ (term_vars' a)
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   385
  | term_vars' _ = [];
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   386
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   387
fun forall_intr_vars th =
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   388
  let val {prop,sign,...} = rep_thm th;
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   389
      val vars = distinct (term_vars' prop);
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   390
  in forall_intr_list (map (cterm_of sign) vars) th end;
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   391
1237
45ac644b0052 adapted to new version of shyps-stuff;
wenzelm
parents: 1218
diff changeset
   392
fun weak_eq_thm (tha,thb) =
1194
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   393
    eq_thm(forall_intr_vars (freezeT tha), forall_intr_vars (freezeT thb));
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   394
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   395
563ecd14c1d8 Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents: 952
diff changeset
   396
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   397
(*** Meta-Rewriting Rules ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   398
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   399
val proto_sign = sign_of ProtoPure.thy;
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   400
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   401
fun read_prop s = read_cterm proto_sign (s, propT);
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   402
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   403
fun store_thm name thm = PureThy.smart_store_thm (name, standard thm);
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   404
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   405
val reflexive_thm =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   406
  let val cx = cterm_of proto_sign (Var(("x",0),TVar(("'a",0),logicS)))
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   407
  in store_thm "reflexive" (Thm.reflexive cx) end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   408
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   409
val symmetric_thm =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   410
  let val xy = read_prop "x::'a::logic == y"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   411
  in store_thm "symmetric" 
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   412
      (Thm.implies_intr_hyps(Thm.symmetric(Thm.assume xy)))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   413
   end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   414
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   415
val transitive_thm =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   416
  let val xy = read_prop "x::'a::logic == y"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   417
      val yz = read_prop "y::'a::logic == z"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   418
      val xythm = Thm.assume xy and yzthm = Thm.assume yz
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   419
  in store_thm "transitive" (Thm.implies_intr yz (Thm.transitive xythm yzthm))
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   420
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   421
4679
24917efb31b5 Reorganized simplifier. May now reorient rules.
nipkow
parents: 4610
diff changeset
   422
fun symmetric_fun thm = thm RS symmetric_thm;
24917efb31b5 Reorganized simplifier. May now reorient rules.
nipkow
parents: 4610
diff changeset
   423
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   424
(** Below, a "conversion" has type cterm -> thm **)
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   425
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   426
val refl_implies = reflexive (cterm_of proto_sign implies);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   427
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   428
(*In [A1,...,An]==>B, rewrite the selected A's only -- for rewrite_goals_tac*)
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 211
diff changeset
   429
(*Do not rewrite flex-flex pairs*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   430
fun goals_conv pred cv =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   431
  let fun gconv i ct =
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   432
        let val (A,B) = dest_implies ct
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   433
            val (thA,j) = case term_of A of
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   434
                  Const("=?=",_)$_$_ => (reflexive A, i)
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   435
                | _ => (if pred i then cv A else reflexive A, i+1)
2004
3411fe560611 New operations on cterms. Now same names as in Logic
paulson
parents: 1906
diff changeset
   436
        in  combination (combination refl_implies thA) (gconv j B) end
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   437
        handle TERM _ => reflexive ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   438
  in gconv 1 end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   439
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   440
(*Use a conversion to transform a theorem*)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   441
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   443
(*rewriting conversion*)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   444
fun rew_conv mode prover mss = rewrite_cterm mode mss prover;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   445
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   446
(*Rewrite a theorem*)
3575
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   447
fun rewrite_rule_aux _ []   th = th
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   448
  | rewrite_rule_aux prover thms th =
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   449
      fconv_rule (rew_conv (true,false) prover (Thm.mss_of thms)) th;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   450
3555
5a720f6b9f38 added rewrite_thm;
wenzelm
parents: 3530
diff changeset
   451
fun rewrite_thm mode prover mss = fconv_rule (rew_conv mode prover mss);
5a720f6b9f38 added rewrite_thm;
wenzelm
parents: 3530
diff changeset
   452
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   453
(*Rewrite the subgoals of a proof state (represented by a theorem) *)
3575
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   454
fun rewrite_goals_rule_aux _ []   th = th
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   455
  | rewrite_goals_rule_aux prover thms th =
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   456
      fconv_rule (goals_conv (K true) (rew_conv (true, true) prover
4e9beacb5339 improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents: 3555
diff changeset
   457
        (Thm.mss_of thms))) th;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   458
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   459
(*Rewrite the subgoal of a proof state (represented by a theorem) *)
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 211
diff changeset
   460
fun rewrite_goal_rule mode prover mss i thm =
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 211
diff changeset
   461
  if 0 < i  andalso  i <= nprems_of thm
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 211
diff changeset
   462
  then fconv_rule (goals_conv (fn j => j=i) (rew_conv mode prover mss)) thm
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 211
diff changeset
   463
  else raise THM("rewrite_goal_rule",i,[thm]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   464
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   465
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   466
(** Derived rules mainly for METAHYPS **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   467
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   468
(*Given the term "a", takes (%x.t)==(%x.u) to t[a/x]==u[a/x]*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   469
fun equal_abs_elim ca eqth =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   470
  let val {sign=signa, t=a, ...} = rep_cterm ca
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   471
      and combth = combination eqth (reflexive ca)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   472
      val {sign,prop,...} = rep_thm eqth
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   473
      val (abst,absu) = Logic.dest_equals prop
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 214
diff changeset
   474
      val cterm = cterm_of (Sign.merge (sign,signa))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   475
  in  transitive (symmetric (beta_conversion (cterm (abst$a))))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   476
           (transitive combth (beta_conversion (cterm (absu$a))))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   477
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   478
  handle THM _ => raise THM("equal_abs_elim", 0, [eqth]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   479
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   480
(*Calling equal_abs_elim with multiple terms*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   481
fun equal_abs_elim_list cts th = foldr (uncurry equal_abs_elim) (rev cts, th);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   482
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   483
local
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   484
  val alpha = TVar(("'a",0), [])     (*  type ?'a::{}  *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   485
  fun err th = raise THM("flexpair_inst: ", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   486
  fun flexpair_inst def th =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   487
    let val {prop = Const _ $ t $ u,  sign,...} = rep_thm th
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   488
        val cterm = cterm_of sign
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   489
        fun cvar a = cterm(Var((a,0),alpha))
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   490
        val def' = cterm_instantiate [(cvar"t", cterm t), (cvar"u", cterm u)]
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   491
                   def
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   492
    in  equal_elim def' th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   493
    end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   494
    handle THM _ => err th | bind => err th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   495
in
3991
4cb2f2422695 ProtoPure.thy;
wenzelm
parents: 3766
diff changeset
   496
val flexpair_intr = flexpair_inst (symmetric ProtoPure.flexpair_def)
4cb2f2422695 ProtoPure.thy;
wenzelm
parents: 3766
diff changeset
   497
and flexpair_elim = flexpair_inst ProtoPure.flexpair_def
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   498
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   499
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   500
(*Version for flexflex pairs -- this supports lifting.*)
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   501
fun flexpair_abs_elim_list cts =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   502
    flexpair_intr o equal_abs_elim_list cts o flexpair_elim;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   503
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   504
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   505
(*** Some useful meta-theorems ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   506
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   507
(*The rule V/V, obtains assumption solving for eresolve_tac*)
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   508
val asm_rl =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   509
  store_thm "asm_rl" (trivial(read_prop "PROP ?psi"));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   510
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   511
(*Meta-level cut rule: [| V==>W; V |] ==> W *)
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   512
val cut_rl =
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   513
  store_thm "cut_rl"
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   514
    (trivial(read_prop "PROP ?psi ==> PROP ?theta"));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   515
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   516
(*Generalized elim rule for one conclusion; cut_rl with reversed premises:
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   517
     [| PROP V;  PROP V ==> PROP W |] ==> PROP W *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   518
val revcut_rl =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   519
  let val V = read_prop "PROP V"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   520
      and VW = read_prop "PROP V ==> PROP W";
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   521
  in
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   522
    store_thm "revcut_rl"
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   523
      (implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V))))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   524
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   525
668
0d0923eb0f0d Pure/drule/thin_rl: new
lcp
parents: 655
diff changeset
   526
(*for deleting an unwanted assumption*)
0d0923eb0f0d Pure/drule/thin_rl: new
lcp
parents: 655
diff changeset
   527
val thin_rl =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   528
  let val V = read_prop "PROP V"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   529
      and W = read_prop "PROP W";
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   530
  in  store_thm "thin_rl" (implies_intr V (implies_intr W (assume W)))
668
0d0923eb0f0d Pure/drule/thin_rl: new
lcp
parents: 655
diff changeset
   531
  end;
0d0923eb0f0d Pure/drule/thin_rl: new
lcp
parents: 655
diff changeset
   532
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   533
(* (!!x. PROP ?V) == PROP ?V       Allows removal of redundant parameters*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   534
val triv_forall_equality =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   535
  let val V  = read_prop "PROP V"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   536
      and QV = read_prop "!!x::'a. PROP V"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   537
      and x  = read_cterm proto_sign ("x", TFree("'a",logicS));
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   538
  in
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   539
    store_thm "triv_forall_equality"
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   540
      (equal_intr (implies_intr QV (forall_elim x (assume QV)))
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   541
        (implies_intr V  (forall_intr x (assume V))))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   542
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   543
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   544
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==>
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   545
   (PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi)
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   546
   `thm COMP swap_prems_rl' swaps the first two premises of `thm'
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   547
*)
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   548
val swap_prems_rl =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   549
  let val cmajor = read_prop "PROP PhiA ==> PROP PhiB ==> PROP Psi";
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   550
      val major = assume cmajor;
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   551
      val cminor1 = read_prop "PROP PhiA";
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   552
      val minor1 = assume cminor1;
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   553
      val cminor2 = read_prop "PROP PhiB";
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   554
      val minor2 = assume cminor2;
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   555
  in store_thm "swap_prems_rl"
1756
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   556
       (implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   557
         (implies_elim (implies_elim major minor1) minor2))))
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   558
  end;
978ee7ededdd Added swap_prems_rl
nipkow
parents: 1703
diff changeset
   559
3653
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   560
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |]
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   561
   ==> PROP ?phi == PROP ?psi
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   562
   Introduction rule for == as a meta-theorem.  
3653
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   563
*)
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   564
val equal_intr_rule =
4610
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   565
  let val PQ = read_prop "PROP phi ==> PROP psi"
b1322be47244 Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents: 4588
diff changeset
   566
      and QP = read_prop "PROP psi ==> PROP phi"
4016
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   567
  in
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   568
    store_thm "equal_intr_rule"
90aebb69c04e eq_thm moved to thm.ML;
wenzelm
parents: 3991
diff changeset
   569
      (implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP))))
3653
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   570
  end;
6d5b3d5ff132 Added Larry's equal_intr_rule
nipkow
parents: 3575
diff changeset
   571
4285
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   572
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   573
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   574
(** instantiate' rule **)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   575
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   576
(* collect vars *)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   577
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   578
val add_tvarsT = foldl_atyps (fn (vs, TVar v) => v ins vs | (vs, _) => vs);
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   579
val add_tvars = foldl_types add_tvarsT;
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   580
val add_vars = foldl_aterms (fn (vs, Var v) => v ins vs | (vs, _) => vs);
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   581
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   582
fun tvars_of thm = rev (add_tvars ([], #prop (Thm.rep_thm thm)));
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   583
fun vars_of thm = rev (add_vars ([], #prop (Thm.rep_thm thm)));
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   584
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   585
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   586
(* instantiate by left-to-right occurrence of variables *)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   587
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   588
fun instantiate' cTs cts thm =
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   589
  let
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   590
    fun err msg =
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   591
      raise TYPE ("instantiate': " ^ msg,
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   592
        mapfilter (apsome Thm.typ_of) cTs,
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   593
        mapfilter (apsome Thm.term_of) cts);
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   594
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   595
    fun inst_of (v, ct) =
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   596
      (Thm.cterm_of (#sign (Thm.rep_cterm ct)) (Var v), ct)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   597
        handle TYPE (msg, _, _) => err msg;
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   598
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   599
    fun zip_vars _ [] = []
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   600
      | zip_vars (_ :: vs) (None :: opt_ts) = zip_vars vs opt_ts
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   601
      | zip_vars (v :: vs) (Some t :: opt_ts) = (v, t) :: zip_vars vs opt_ts
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   602
      | zip_vars [] _ = err "more instantiations than variables in thm";
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   603
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   604
    (*instantiate types first!*)
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   605
    val thm' =
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   606
      if forall is_none cTs then thm
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   607
      else Thm.instantiate (zip_vars (map fst (tvars_of thm)) cTs, []) thm;
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   608
    in
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   609
      if forall is_none cts then thm'
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   610
      else Thm.instantiate ([], map inst_of (zip_vars (vars_of thm') cts)) thm'
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   611
    end;
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   612
05af145a61d4 cleaned signature;
wenzelm
parents: 4281
diff changeset
   613
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   614
end;
252
7532f95d7f44 removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents: 229
diff changeset
   615
1499
01fdd1ea6324 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   616
open Drule;