src/Pure/thm.ML
author wenzelm
Sat, 15 Oct 2005 00:09:20 +0200
changeset 17868 5a12b1b5990f
parent 17708 6c6ecafd8c0e
child 18035 eaae44affc9e
permissions -rw-r--r--
tuned comment;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     1
(*  Title:      Pure/thm.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
     4
    Copyright   1994  University of Cambridge
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
     5
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
     6
The very core of Isabelle's Meta Logic: certified types and terms,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
     7
meta theorems, meta rules (including lifting and resolution).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
    10
signature BASIC_THM =
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
    11
  sig
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    12
  (*certified types*)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    13
  type ctyp
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    14
  val rep_ctyp: ctyp ->
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    15
   {thy: theory,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    16
    sign: theory,       (*obsolete*)
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    17
    T: typ,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    18
    sorts: sort list}
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    19
  val theory_of_ctyp: ctyp -> theory
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    20
  val typ_of: ctyp -> typ
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    21
  val ctyp_of: theory -> typ -> ctyp
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    22
  val read_ctyp: theory -> string -> ctyp
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    23
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    24
  (*certified terms*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    25
  type cterm
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    26
  exception CTERM of string
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
    27
  val rep_cterm: cterm ->
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    28
   {thy: theory,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    29
    sign: theory,       (*obsolete*)
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    30
    t: term,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    31
    T: typ,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    32
    maxidx: int,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    33
    sorts: sort list}
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
    34
  val crep_cterm: cterm ->
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
    35
    {thy: theory, sign: theory, t: term, T: ctyp, maxidx: int, sorts: sort list}
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    36
  val theory_of_cterm: cterm -> theory
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    37
  val sign_of_cterm: cterm -> theory    (*obsolete*)
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    38
  val term_of: cterm -> term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    39
  val cterm_of: theory -> term -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    40
  val ctyp_of_term: cterm -> ctyp
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    41
  val read_cterm: theory -> string * typ -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    42
  val adjust_maxidx: cterm -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    43
  val read_def_cterm:
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    44
    theory * (indexname -> typ option) * (indexname -> sort option) ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    45
    string list -> bool -> string * typ -> cterm * (indexname * typ) list
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    46
  val read_def_cterms:
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    47
    theory * (indexname -> typ option) * (indexname -> sort option) ->
4281
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
    48
    string list -> bool -> (string * typ)list
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
    49
    -> cterm list * (indexname * typ)list
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    50
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    51
  type tag              (* = string * string list *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    52
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    53
  (*meta theorems*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    54
  type thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    55
  val rep_thm: thm ->
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    56
   {thy: theory,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    57
    sign: theory,       (*obsolete*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    58
    der: bool * Proofterm.proof,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    59
    maxidx: int,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    60
    shyps: sort list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    61
    hyps: term list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    62
    tpairs: (term * term) list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    63
    prop: term}
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    64
  val crep_thm: thm ->
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    65
   {thy: theory,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    66
    sign: theory,       (*obsolete*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    67
    der: bool * Proofterm.proof,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    68
    maxidx: int,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    69
    shyps: sort list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    70
    hyps: cterm list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    71
    tpairs: (cterm * cterm) list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    72
    prop: cterm}
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
    73
  exception THM of string * int * thm list
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    74
  type 'a attribute     (* = 'a * thm -> 'a * thm *)
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    75
  val eq_thm: thm * thm -> bool
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    76
  val eq_thms: thm list * thm list -> bool
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    77
  val theory_of_thm: thm -> theory
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    78
  val sign_of_thm: thm -> theory    (*obsolete*)
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    79
  val prop_of: thm -> term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    80
  val proof_of: thm -> Proofterm.proof
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    81
  val tpairs_of: thm -> (term * term) list
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    82
  val concl_of: thm -> term
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    83
  val prems_of: thm -> term list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    84
  val nprems_of: thm -> int
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    85
  val cprop_of: thm -> cterm
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    86
  val transfer: theory -> thm -> thm
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
    87
  val weaken: cterm -> thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    88
  val extra_shyps: thm -> sort list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    89
  val strip_shyps: thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    90
  val get_axiom_i: theory -> string -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    91
  val get_axiom: theory -> xstring -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    92
  val def_name: string -> string
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    93
  val get_def: theory -> xstring -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    94
  val axioms_of: theory -> (string * thm) list
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    95
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    96
  (*meta rules*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    97
  val assume: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    98
  val implies_intr: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    99
  val implies_elim: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   100
  val forall_intr: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   101
  val forall_elim: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   102
  val reflexive: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   103
  val symmetric: thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   104
  val transitive: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   105
  val beta_conversion: bool -> cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   106
  val eta_conversion: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   107
  val abstract_rule: string -> cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   108
  val combination: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   109
  val equal_intr: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   110
  val equal_elim: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   111
  val flexflex_rule: thm -> thm Seq.seq
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   112
  val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   113
  val trivial: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   114
  val class_triv: theory -> class -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   115
  val varifyT: thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   116
  val varifyT': (string * sort) list -> thm -> thm * ((string * sort) * indexname) list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   117
  val freezeT: thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   118
  val dest_state: thm * int -> (term * term) list * term list * term * term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   119
  val lift_rule: (thm * int) -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   120
  val incr_indexes: int -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   121
  val assumption: int -> thm -> thm Seq.seq
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   122
  val eq_assumption: int -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   123
  val rotate_rule: int -> int -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   124
  val permute_prems: int -> int -> thm -> thm
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   125
  val rename_params_rule: string list * int -> thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   126
  val bicompose: bool -> bool * thm * int -> int -> thm -> thm Seq.seq
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   127
  val biresolution: bool -> (bool * thm) list -> int -> thm -> thm Seq.seq
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   128
  val invoke_oracle: theory -> xstring -> theory * Object.T -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   129
  val invoke_oracle_i: theory -> string -> theory * Object.T -> thm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   130
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   131
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   132
signature THM =
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   133
sig
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   134
  include BASIC_THM
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   135
  val dest_ctyp: ctyp -> ctyp list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   136
  val dest_comb: cterm -> cterm * cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   137
  val dest_abs: string option -> cterm -> cterm * cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   138
  val capply: cterm -> cterm -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   139
  val cabs: cterm -> cterm -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   140
  val major_prem_of: thm -> term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   141
  val no_prems: thm -> bool
17345
9ea1e2179786 added simple_fact;
wenzelm
parents: 17221
diff changeset
   142
  val no_attributes: 'a -> 'a * 'b list
9ea1e2179786 added simple_fact;
wenzelm
parents: 17221
diff changeset
   143
  val simple_fact: 'a -> ('a * 'b list) list
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   144
  val apply_attributes: ('a * thm) * 'a attribute list -> 'a * thm
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   145
  val applys_attributes: ('a * thm list) * 'a attribute list -> 'a * thm list
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   146
  val terms_of_tpairs: (term * term) list -> term list
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   147
  val full_prop_of: thm -> term
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   148
  val get_name_tags: thm -> string * tag list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   149
  val put_name_tags: string * tag list -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   150
  val name_of_thm: thm -> string
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   151
  val tags_of_thm: thm -> tag list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   152
  val name_thm: string * thm -> thm
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   153
  val compress: thm -> thm
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   154
  val adjust_maxidx_thm: thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   155
  val rename_boundvars: term -> term -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   156
  val cterm_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   157
  val cterm_first_order_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   158
  val cterm_incr_indexes: int -> cterm -> cterm
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   159
end;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   160
3550
2c833cb21f8d added dest_mss, merge_mss;
wenzelm
parents: 3529
diff changeset
   161
structure Thm: THM =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   162
struct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   163
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   164
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   165
(*** Certified terms and types ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   166
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   167
(** collect occurrences of sorts -- unless all sorts non-empty **)
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   168
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   169
fun may_insert_typ_sorts thy T = if Sign.all_sorts_nonempty thy then I else Sorts.insert_typ T;
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   170
fun may_insert_term_sorts thy t = if Sign.all_sorts_nonempty thy then I else Sorts.insert_term t;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   171
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   172
(*NB: type unification may invent new sorts*)
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   173
fun may_insert_env_sorts thy (env as Envir.Envir {iTs, ...}) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   174
  if Sign.all_sorts_nonempty thy then I
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   175
  else Vartab.fold (fn (_, (_, T)) => Sorts.insert_typ T) iTs;
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   176
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   177
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   178
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   179
(** certified types **)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   180
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   181
datatype ctyp = Ctyp of {thy_ref: theory_ref, T: typ, sorts: sort list};
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   182
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   183
fun rep_ctyp (Ctyp {thy_ref, T, sorts}) =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   184
  let val thy = Theory.deref thy_ref
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   185
  in {thy = thy, sign = thy, T = T, sorts = sorts} end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   186
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   187
fun theory_of_ctyp (Ctyp {thy_ref, ...}) = Theory.deref thy_ref;
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   188
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   189
fun typ_of (Ctyp {T, ...}) = T;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   190
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   191
fun ctyp_of thy raw_T =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   192
  let val T = Sign.certify_typ thy raw_T
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   193
  in Ctyp {thy_ref = Theory.self_ref thy, T = T, sorts = may_insert_typ_sorts thy T []} end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   194
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   195
fun read_ctyp thy s =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   196
  let val T = Sign.read_typ (thy, K NONE) s
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   197
  in Ctyp {thy_ref = Theory.self_ref thy, T = T, sorts = may_insert_typ_sorts thy T []} end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   198
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   199
fun dest_ctyp (Ctyp {thy_ref, T = Type (s, Ts), sorts}) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   200
      map (fn T => Ctyp {thy_ref = thy_ref, T = T, sorts = sorts}) Ts
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   201
  | dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []);
15087
666f89fbb860 - optimized nodup_vars check in capply
berghofe
parents: 14828
diff changeset
   202
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   203
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   204
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   205
(** certified terms **)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   206
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   207
(*certified terms with checked typ, maxidx, and sorts*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   208
datatype cterm = Cterm of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   209
 {thy_ref: theory_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   210
  t: term,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   211
  T: typ,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   212
  maxidx: int,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   213
  sorts: sort list};
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   214
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   215
exception CTERM of string;
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   216
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   217
fun rep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   218
  let val thy =  Theory.deref thy_ref
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   219
  in {thy = thy, sign = thy, t = t, T = T, maxidx = maxidx, sorts = sorts} end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   220
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   221
fun crep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   222
  let val thy = Theory.deref thy_ref in
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   223
   {thy = thy, sign = thy, t = t, T = Ctyp {thy_ref = thy_ref, T = T, sorts = sorts},
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   224
    maxidx = maxidx, sorts = sorts}
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   225
  end;
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
   226
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   227
fun theory_of_cterm (Cterm {thy_ref, ...}) = Theory.deref thy_ref;
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   228
val sign_of_cterm = theory_of_cterm;
9461
8645b0413366 added sign_of_cterm;
wenzelm
parents: 9031
diff changeset
   229
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   230
fun term_of (Cterm {t, ...}) = t;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   231
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   232
fun ctyp_of_term (Cterm {thy_ref, T, sorts, ...}) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   233
  Ctyp {thy_ref = thy_ref, T = T, sorts = sorts};
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   234
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   235
fun cterm_of thy tm =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   236
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   237
    val (t, T, maxidx) = Sign.certify_term (Sign.pp thy) thy tm;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   238
    val sorts = may_insert_term_sorts thy t [];
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   239
  in Cterm {thy_ref = Theory.self_ref thy, t = t, T = T, maxidx = maxidx, sorts = sorts} end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   240
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   241
fun merge_thys0 (Cterm {thy_ref = r1, ...}) (Cterm {thy_ref = r2, ...}) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   242
  Theory.merge_refs (r1, r2);
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   243
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   244
(*Destruct application in cterms*)
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   245
fun dest_comb (Cterm {t = t $ u, T, thy_ref, maxidx, sorts}) =
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   246
      let val A = Term.argument_type_of t in
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   247
        (Cterm {t = t, T = A --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   248
         Cterm {t = u, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts})
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   249
      end
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   250
  | dest_comb _ = raise CTERM "dest_comb";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   251
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   252
(*Destruct abstraction in cterms*)
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   253
fun dest_abs a (Cterm {t = Abs (x, T, t), T = Type ("fun", [_, U]), thy_ref, maxidx, sorts}) =
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   254
      let val (y', t') = Term.dest_abs (if_none a x, T, t) in
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   255
        (Cterm {t = Free (y', T), T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   256
          Cterm {t = t', T = U, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts})
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   257
      end
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   258
  | dest_abs _ _ = raise CTERM "dest_abs";
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   259
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   260
(*Makes maxidx precise: it is often too big*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   261
fun adjust_maxidx (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   262
  if maxidx = ~1 then ct
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   263
  else Cterm {thy_ref = thy_ref, t = t, T = T, maxidx = maxidx_of_term t, sorts = sorts};
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1659
diff changeset
   264
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   265
(*Form cterm out of a function and an argument*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   266
fun capply
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   267
  (cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...})
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   268
  (cx as Cterm {t = x, T, maxidx = maxidx2, sorts = sorts2, ...}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   269
    if T = dty then
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   270
      Cterm {thy_ref = merge_thys0 cf cx,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   271
        t = f $ x,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   272
        T = rty,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   273
        maxidx = Int.max (maxidx1, maxidx2),
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   274
        sorts = Sorts.union sorts1 sorts2}
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   275
      else raise CTERM "capply: types don't agree"
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   276
  | capply _ _ = raise CTERM "capply: first arg is not a function"
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   277
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   278
fun cabs
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   279
  (ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...})
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   280
  (ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   281
    let val t = lambda t1 t2 handle TERM _ => raise CTERM "cabs: first arg is not a variable" in
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   282
      Cterm {thy_ref = merge_thys0 ct1 ct2,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   283
        t = t, T = T1 --> T2,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   284
        maxidx = Int.max (maxidx1, maxidx2),
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   285
        sorts = Sorts.union sorts1 sorts2}
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   286
    end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   287
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   288
(*Matching of cterms*)
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   289
fun gen_cterm_match match
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   290
    (ct1 as Cterm {t = t1, maxidx = maxidx1, sorts = sorts1, ...},
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   291
     ct2 as Cterm {t = t2, maxidx = maxidx2, sorts = sorts2, ...}) =
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   292
  let
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   293
    val thy_ref = merge_thys0 ct1 ct2;
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17184
diff changeset
   294
    val (Tinsts, tinsts) = match (Theory.deref thy_ref) (t1, t2);
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   295
    val maxidx = Int.max (maxidx1, maxidx2);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   296
    val sorts = Sorts.union sorts1 sorts2;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   297
    fun mk_cTinst (ixn, (S, T)) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   298
      (Ctyp {T = TVar (ixn, S), thy_ref = thy_ref, sorts = sorts},
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   299
       Ctyp {T = T, thy_ref = thy_ref, sorts = sorts});
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   300
    fun mk_ctinst (ixn, (T, t)) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   301
      let val T = Envir.typ_subst_TVars Tinsts T in
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   302
        (Cterm {t = Var (ixn, T), T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   303
         Cterm {t = t, T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts})
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   304
      end;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   305
  in (Vartab.fold (cons o mk_cTinst) Tinsts [], Vartab.fold (cons o mk_ctinst) tinsts []) end;
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   306
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   307
val cterm_match = gen_cterm_match Pattern.match;
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   308
val cterm_first_order_match = gen_cterm_match Pattern.first_order_match;
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   309
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   310
(*Incrementing indexes*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   311
fun cterm_incr_indexes i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   312
  if i < 0 then raise CTERM "negative increment"
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   313
  else if i = 0 then ct
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   314
  else Cterm {thy_ref = thy_ref, t = Logic.incr_indexes ([], i) t,
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   315
    T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts};
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   316
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   317
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   318
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   319
(** read cterms **)   (*exception ERROR*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   320
4281
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   321
(*read terms, infer types, certify terms*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   322
fun read_def_cterms (thy, types, sorts) used freeze sTs =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   323
  let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   324
    val (ts', tye) = Sign.read_def_terms (thy, types, sorts) used freeze sTs;
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   325
    val cts = map (cterm_of thy) ts'
2979
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   326
      handle TYPE (msg, _, _) => error msg
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   327
           | TERM (msg, _) => error msg;
4281
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   328
  in (cts, tye) end;
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   329
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   330
(*read term, infer types, certify term*)
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   331
fun read_def_cterm args used freeze aT =
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   332
  let val ([ct],tye) = read_def_cterms args used freeze [aT]
6c6073b13600 Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents: 4270
diff changeset
   333
  in (ct,tye) end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   334
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   335
fun read_cterm thy = #1 o read_def_cterm (thy, K NONE, K NONE) [] true;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   336
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   337
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   338
(*tags provide additional comment, apart from the axiom/theorem name*)
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   339
type tag = string * string list;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   340
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   341
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   342
(*** Meta theorems ***)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   343
11518
5f2616a1c10a Replaced old derivations by proof terms.
berghofe
parents: 10767
diff changeset
   344
structure Pt = Proofterm;
5f2616a1c10a Replaced old derivations by proof terms.
berghofe
parents: 10767
diff changeset
   345
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   346
datatype thm = Thm of
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   347
 {thy_ref: theory_ref,         (*dynamic reference to theory*)
11518
5f2616a1c10a Replaced old derivations by proof terms.
berghofe
parents: 10767
diff changeset
   348
  der: bool * Pt.proof,        (*derivation*)
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
   349
  maxidx: int,                 (*maximum index of any Var or TVar*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   350
  shyps: sort list,            (*sort hypotheses as ordered list*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   351
  hyps: term list,             (*hypotheses as ordered list*)
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   352
  tpairs: (term * term) list,  (*flex-flex pairs*)
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
   353
  prop: term};                 (*conclusion*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   354
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   355
(*errors involving theorems*)
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   356
exception THM of string * int * thm list;
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   357
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   358
fun rep_thm (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   359
  let val thy = Theory.deref thy_ref in
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   360
   {thy = thy, sign = thy, der = der, maxidx = maxidx,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   361
    shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   362
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   363
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   364
(*version of rep_thm returning cterms instead of terms*)
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   365
fun crep_thm (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   366
  let
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   367
    val thy = Theory.deref thy_ref;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   368
    fun cterm max t = Cterm {thy_ref = thy_ref, t = t, T = propT, maxidx = max, sorts = shyps};
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   369
  in
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   370
   {thy = thy, sign = thy, der = der, maxidx = maxidx, shyps = shyps,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   371
    hyps = map (cterm ~1) hyps,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   372
    tpairs = map (pairself (cterm maxidx)) tpairs,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   373
    prop = cterm maxidx prop}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   374
  end;
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   375
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   376
fun terms_of_tpairs tpairs = fold_rev (fn (t, u) => cons t o cons u) tpairs [];
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   377
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   378
fun eq_tpairs ((t, u), (t', u')) = t aconv t' andalso u aconv u';
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   379
val union_tpairs = gen_merge_lists eq_tpairs;
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   380
val maxidx_tpairs = fold (fn (t, u) => Term.maxidx_term t #> Term.maxidx_term u);
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   381
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   382
fun attach_tpairs tpairs prop =
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   383
  Logic.list_implies (map Logic.mk_equals tpairs, prop);
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   384
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   385
fun full_prop_of (Thm {tpairs, prop, ...}) = attach_tpairs tpairs prop;
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   386
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   387
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   388
(* merge theories of cterms/thms; raise exception if incompatible *)
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   389
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   390
fun merge_thys1 (Cterm {thy_ref = r1, ...}) (th as Thm {thy_ref = r2, ...}) =
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   391
  Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th]);
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   392
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   393
fun merge_thys2 (th1 as Thm {thy_ref = r1, ...}) (th2 as Thm {thy_ref = r2, ...}) =
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   394
  Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]);
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   395
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   396
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   397
(*attributes subsume any kind of rules or context modifiers*)
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   398
type 'a attribute = 'a * thm -> 'a * thm;
17708
6c6ecafd8c0e abstract_rule: tuned exception msgs;
wenzelm
parents: 17412
diff changeset
   399
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   400
fun no_attributes x = (x, []);
17345
9ea1e2179786 added simple_fact;
wenzelm
parents: 17221
diff changeset
   401
fun simple_fact x = [(x, [])];
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   402
fun apply_attributes (x_th, atts) = Library.apply atts x_th;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   403
fun applys_attributes (x_ths, atts) = foldl_map (Library.apply atts) x_ths;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   404
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   405
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   406
(* hyps *)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   407
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   408
val insert_hyps = OrdList.insert Term.fast_term_ord;
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   409
val remove_hyps = OrdList.remove Term.fast_term_ord;
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   410
val union_hyps = OrdList.union Term.fast_term_ord;
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   411
val eq_set_hyps = OrdList.eq_set Term.fast_term_ord;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   412
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   413
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   414
(* eq_thm(s) *)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   415
3994
0343230ec85c eq_thm (from drule.ML);
wenzelm
parents: 3971
diff changeset
   416
fun eq_thm (th1, th2) =
0343230ec85c eq_thm (from drule.ML);
wenzelm
parents: 3971
diff changeset
   417
  let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   418
    val {thy = thy1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, prop = prop1, ...} =
9031
8f75b9ce2f06 fixed Thm.eq_thm: use Sign.joinable;
wenzelm
parents: 8854
diff changeset
   419
      rep_thm th1;
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   420
    val {thy = thy2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, prop = prop2, ...} =
9031
8f75b9ce2f06 fixed Thm.eq_thm: use Sign.joinable;
wenzelm
parents: 8854
diff changeset
   421
      rep_thm th2;
3994
0343230ec85c eq_thm (from drule.ML);
wenzelm
parents: 3971
diff changeset
   422
  in
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   423
    Context.joinable (thy1, thy2) andalso
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   424
    Sorts.eq_set (shyps1, shyps2) andalso
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   425
    eq_set_hyps (hyps1, hyps2) andalso
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   426
    equal_lists eq_tpairs (tpairs1, tpairs2) andalso
3994
0343230ec85c eq_thm (from drule.ML);
wenzelm
parents: 3971
diff changeset
   427
    prop1 aconv prop2
0343230ec85c eq_thm (from drule.ML);
wenzelm
parents: 3971
diff changeset
   428
  end;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   429
16135
c66545fe72bf added eq_thms;
wenzelm
parents: 16024
diff changeset
   430
val eq_thms = Library.equal_lists eq_thm;
c66545fe72bf added eq_thms;
wenzelm
parents: 16024
diff changeset
   431
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   432
fun theory_of_thm (Thm {thy_ref, ...}) = Theory.deref thy_ref;
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   433
val sign_of_thm = theory_of_thm;
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   434
12803
37131c76dff6 added prop_of: thm -> term (at last!);
wenzelm
parents: 12500
diff changeset
   435
fun prop_of (Thm {prop, ...}) = prop;
13528
d14fb18343cb added proof_of;
wenzelm
parents: 12982
diff changeset
   436
fun proof_of (Thm {der = (_, proof), ...}) = proof;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   437
fun tpairs_of (Thm {tpairs, ...}) = tpairs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   438
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   439
val concl_of = Logic.strip_imp_concl o prop_of;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   440
val prems_of = Logic.strip_imp_prems o prop_of;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   441
fun nprems_of th = Logic.count_prems (prop_of th, 0);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   442
val no_prems = equal 0 o nprems_of;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   443
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   444
fun major_prem_of th =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   445
  (case prems_of th of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   446
    prem :: _ => Logic.strip_assums_concl prem
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   447
  | [] => raise THM ("major_prem_of: rule with no premises", 0, [th]));
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   448
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   449
(*the statement of any thm is a cterm*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   450
fun cprop_of (Thm {thy_ref, maxidx, shyps, prop, ...}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   451
  Cterm {thy_ref = thy_ref, maxidx = maxidx, T = propT, t = prop, sorts = shyps};
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   452
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   453
(*explicit transfer to a super theory*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   454
fun transfer thy' thm =
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   455
  let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   456
    val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop} = thm;
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   457
    val thy = Theory.deref thy_ref;
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   458
  in
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   459
    if not (subthy (thy, thy')) then
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   460
      raise THM ("transfer: not a super theory", 0, [thm])
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   461
    else if eq_thy (thy, thy') then thm
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   462
    else
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   463
      Thm {thy_ref = Theory.self_ref thy',
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   464
        der = der,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   465
        maxidx = maxidx,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   466
        shyps = shyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   467
        hyps = hyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   468
        tpairs = tpairs,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   469
        prop = prop}
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   470
  end;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   471
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   472
(*explicit weakening: maps |- B to A |- B*)
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   473
fun weaken raw_ct th =
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   474
  let
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   475
    val ct as Cterm {t = A, T, sorts, maxidx = maxidxA, ...} = adjust_maxidx raw_ct;
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   476
    val Thm {der, maxidx, shyps, hyps, tpairs, prop, ...} = th;
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   477
  in
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   478
    if T <> propT then
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   479
      raise THM ("weaken: assumptions must have type prop", 0, [])
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   480
    else if maxidxA <> ~1 then
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   481
      raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, [])
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   482
    else
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   483
      Thm {thy_ref = merge_thys1 ct th,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   484
        der = der,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   485
        maxidx = maxidx,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   486
        shyps = Sorts.union sorts shyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   487
        hyps = insert_hyps A hyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   488
        tpairs = tpairs,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   489
        prop = prop}
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   490
  end;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   491
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   492
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   493
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   494
(** sort contexts of theorems **)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   495
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   496
fun present_sorts (Thm {hyps, tpairs, prop, ...}) =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   497
  fold (fn (t, u) => Sorts.insert_term t o Sorts.insert_term u) tpairs
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   498
    (Sorts.insert_terms hyps (Sorts.insert_term prop []));
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   499
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   500
(*remove extra sorts that are non-empty by virtue of type signature information*)
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   501
fun strip_shyps (thm as Thm {shyps = [], ...}) = thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   502
  | strip_shyps (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   503
      let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   504
        val thy = Theory.deref thy_ref;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   505
        val shyps' =
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   506
          if Sign.all_sorts_nonempty thy then []
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   507
          else
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   508
            let
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   509
              val present = present_sorts thm;
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   510
              val extra = Sorts.subtract present shyps;
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   511
              val witnessed = map #2 (Sign.witness_sorts thy present extra);
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   512
            in Sorts.subtract witnessed shyps end;
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   513
      in
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   514
        Thm {thy_ref = thy_ref, der = der, maxidx = maxidx,
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   515
          shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop}
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   516
      end;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   517
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   518
(*dangling sort constraints of a thm*)
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   519
fun extra_shyps (th as Thm {shyps, ...}) = Sorts.subtract (present_sorts th) shyps;
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   520
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   521
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   522
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   523
(** Axioms **)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   524
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   525
(*look up the named axiom in the theory or its ancestors*)
15672
32aea1e31eb8 added get_axiom_i, invoke_oracle_i;
wenzelm
parents: 15574
diff changeset
   526
fun get_axiom_i theory name =
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   527
  let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   528
    fun get_ax thy =
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17345
diff changeset
   529
      Symtab.lookup (#2 (#axioms (Theory.rep_theory thy))) name
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   530
      |> Option.map (fn prop =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   531
          Thm {thy_ref = Theory.self_ref thy,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   532
            der = Pt.infer_derivs' I (false, Pt.axm_proof name prop),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   533
            maxidx = maxidx_of_term prop,
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   534
            shyps = may_insert_term_sorts thy prop [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   535
            hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   536
            tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   537
            prop = prop});
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   538
  in
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   539
    (case get_first get_ax (theory :: Theory.ancestors_of theory) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
   540
      SOME thm => thm
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
   541
    | NONE => raise THEORY ("No axiom " ^ quote name, [theory]))
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   542
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   543
16352
d7f9978e5752 axioms: NameSpace.table;
wenzelm
parents: 16287
diff changeset
   544
fun get_axiom thy =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   545
  get_axiom_i thy o NameSpace.intern (Theory.axiom_space thy);
15672
32aea1e31eb8 added get_axiom_i, invoke_oracle_i;
wenzelm
parents: 15574
diff changeset
   546
6368
ba5e97a20b12 added def_name;
wenzelm
parents: 6089
diff changeset
   547
fun def_name name = name ^ "_def";
ba5e97a20b12 added def_name;
wenzelm
parents: 6089
diff changeset
   548
fun get_def thy = get_axiom thy o def_name;
4847
ea7d7a65e4e9 tuned get_ax (uses ancestry);
wenzelm
parents: 4820
diff changeset
   549
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   550
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   551
(*return additional axioms of this theory node*)
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   552
fun axioms_of thy =
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   553
  map (fn (s, _) => (s, get_axiom thy s))
16352
d7f9978e5752 axioms: NameSpace.table;
wenzelm
parents: 16287
diff changeset
   554
    (Symtab.dest (#2 (#axioms (Theory.rep_theory thy))));
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   555
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   556
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   557
(* name and tags -- make proof objects more readable *)
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   558
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12803
diff changeset
   559
fun get_name_tags (Thm {hyps, prop, der = (_, prf), ...}) =
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12803
diff changeset
   560
  Pt.get_name_tags hyps prop prf;
4018
09b77900af0f added name_of_thm;
wenzelm
parents: 3994
diff changeset
   561
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   562
fun put_name_tags x (Thm {thy_ref, der = (ora, prf), maxidx,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   563
      shyps, hyps, tpairs = [], prop}) = Thm {thy_ref = thy_ref,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   564
        der = (ora, Pt.thm_proof (Theory.deref thy_ref) x hyps prop prf),
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   565
        maxidx = maxidx, shyps = shyps, hyps = hyps, tpairs = [], prop = prop}
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   566
  | put_name_tags _ thm =
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   567
      raise THM ("put_name_tags: unsolved flex-flex constraints", 0, [thm]);
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   568
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   569
val name_of_thm = #1 o get_name_tags;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   570
val tags_of_thm = #2 o get_name_tags;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   571
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   572
fun name_thm (name, thm) = put_name_tags (name, tags_of_thm thm) thm;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   573
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   574
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   575
(*Compression of theorems -- a separate rule, not integrated with the others,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   576
  as it could be slow.*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   577
fun compress (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
16991
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   578
  let val thy = Theory.deref thy_ref in
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   579
    Thm {thy_ref = thy_ref,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   580
      der = der,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   581
      maxidx = maxidx,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   582
      shyps = shyps,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   583
      hyps = map (Compress.term thy) hyps,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   584
      tpairs = map (pairself (Compress.term thy)) tpairs,
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   585
      prop = Compress.term thy prop}
39f5760f72d7 Compress.term;
wenzelm
parents: 16945
diff changeset
   586
  end;
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   587
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   588
fun adjust_maxidx_thm (Thm {thy_ref, der, shyps, hyps, tpairs, prop, ...}) =
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   589
  Thm {thy_ref = thy_ref,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   590
    der = der,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   591
    maxidx = maxidx_tpairs tpairs (maxidx_of_term prop),
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   592
    shyps = shyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   593
    hyps = hyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   594
    tpairs = tpairs,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   595
    prop = prop};
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   596
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   597
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   598
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   599
(*** Meta rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   600
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   601
(** primitive rules **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   602
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   603
(*The assumption rule A |- A*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   604
fun assume raw_ct =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   605
  let val Cterm {thy_ref, t = prop, T, maxidx, sorts} = adjust_maxidx raw_ct in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   606
    if T <> propT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   607
      raise THM ("assume: assumptions must have type prop", 0, [])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   608
    else if maxidx <> ~1 then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   609
      raise THM ("assume: assumptions may not contain schematic variables", maxidx, [])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   610
    else Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   611
      der = Pt.infer_derivs' I (false, Pt.Hyp prop),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   612
      maxidx = ~1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   613
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   614
      hyps = [prop],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   615
      tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   616
      prop = prop}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   617
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   618
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   619
(*Implication introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   620
    [A]
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   621
     :
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   622
     B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   623
  -------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   624
  A ==> B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   625
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   626
fun implies_intr
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   627
    (ct as Cterm {t = A, T, maxidx = maxidxA, sorts, ...})
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   628
    (th as Thm {der, maxidx, hyps, shyps, tpairs, prop, ...}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   629
  if T <> propT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   630
    raise THM ("implies_intr: assumptions must have type prop", 0, [th])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   631
  else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   632
    Thm {thy_ref = merge_thys1 ct th,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   633
      der = Pt.infer_derivs' (Pt.implies_intr_proof A) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   634
      maxidx = Int.max (maxidxA, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   635
      shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   636
      hyps = remove_hyps A hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   637
      tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   638
      prop = implies $ A $ prop};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   639
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   640
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   641
(*Implication elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   642
  A ==> B    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   643
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   644
        B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   645
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   646
fun implies_elim thAB thA =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   647
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   648
    val Thm {maxidx = maxA, der = derA, hyps = hypsA, shyps = shypsA, tpairs = tpairsA,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   649
      prop = propA, ...} = thA
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   650
    and Thm {der, maxidx, hyps, shyps, tpairs, prop, ...} = thAB;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   651
    fun err () = raise THM ("implies_elim: major premise", 0, [thAB, thA]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   652
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   653
    case prop of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   654
      imp $ A $ B =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   655
        if imp = Term.implies andalso A aconv propA then
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   656
          Thm {thy_ref = merge_thys2 thAB thA,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   657
            der = Pt.infer_derivs (curry Pt.%%) der derA,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   658
            maxidx = Int.max (maxA, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   659
            shyps = Sorts.union shypsA shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   660
            hyps = union_hyps hypsA hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   661
            tpairs = union_tpairs tpairsA tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   662
            prop = B}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   663
        else err ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   664
    | _ => err ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   665
  end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   666
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   667
(*Forall introduction.  The Free or Var x must not be free in the hypotheses.
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   668
    [x]
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   669
     :
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   670
     A
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   671
  ------
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   672
  !!x. A
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   673
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   674
fun forall_intr
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   675
    (ct as Cterm {t = x, T, sorts, ...})
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   676
    (th as Thm {der, maxidx, shyps, hyps, tpairs, prop, ...}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   677
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   678
    fun result a =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   679
      Thm {thy_ref = merge_thys1 ct th,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   680
        der = Pt.infer_derivs' (Pt.forall_intr_proof x a) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   681
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   682
        shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   683
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   684
        tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   685
        prop = all T $ Abs (a, T, abstract_over (x, prop))};
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   686
    fun check_occs x ts =
16847
8fc160b12e73 invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents: 16725
diff changeset
   687
      if exists (fn t => Logic.occs (x, t)) ts then
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   688
        raise THM("forall_intr: variable free in assumptions", 0, [th])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   689
      else ();
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   690
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   691
    case x of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   692
      Free (a, _) => (check_occs x hyps; check_occs x (terms_of_tpairs tpairs); result a)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   693
    | Var ((a, _), _) => (check_occs x (terms_of_tpairs tpairs); result a)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   694
    | _ => raise THM ("forall_intr: not a variable", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   695
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   696
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   697
(*Forall elimination
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   698
  !!x. A
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   699
  ------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   700
  A[t/x]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   701
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   702
fun forall_elim
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   703
    (ct as Cterm {t, T, maxidx = maxt, sorts, ...})
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   704
    (th as Thm {der, maxidx, shyps, hyps, tpairs, prop, ...}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   705
  (case prop of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   706
    Const ("all", Type ("fun", [Type ("fun", [qary, _]), _])) $ A =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   707
      if T <> qary then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   708
        raise THM ("forall_elim: type mismatch", 0, [th])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   709
      else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   710
        Thm {thy_ref = merge_thys1 ct th,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   711
          der = Pt.infer_derivs' (Pt.% o rpair (SOME t)) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   712
          maxidx = Int.max (maxidx, maxt),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   713
          shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   714
          hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   715
          tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   716
          prop = Term.betapply (A, t)}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   717
  | _ => raise THM ("forall_elim: not quantified", 0, [th]));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   718
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   719
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   720
(* Equality *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   721
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   722
(*Reflexivity
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   723
  t == t
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   724
*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   725
fun reflexive (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   726
  Thm {thy_ref = thy_ref,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   727
    der = Pt.infer_derivs' I (false, Pt.reflexive),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   728
    maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   729
    shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   730
    hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   731
    tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   732
    prop = Logic.mk_equals (t, t)};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   733
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   734
(*Symmetry
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   735
  t == u
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   736
  ------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   737
  u == t
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   738
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   739
fun symmetric (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   740
  (case prop of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   741
    (eq as Const ("==", Type (_, [T, _]))) $ t $ u =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   742
      Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   743
        der = Pt.infer_derivs' Pt.symmetric der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   744
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   745
        shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   746
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   747
        tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   748
        prop = eq $ u $ t}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   749
    | _ => raise THM ("symmetric", 0, [th]));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   750
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   751
(*Transitivity
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   752
  t1 == u    u == t2
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   753
  ------------------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   754
       t1 == t2
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   755
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
fun transitive th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   757
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   758
    val Thm {der = der1, maxidx = max1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   759
      prop = prop1, ...} = th1
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   760
    and Thm {der = der2, maxidx = max2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   761
      prop = prop2, ...} = th2;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   762
    fun err msg = raise THM ("transitive: " ^ msg, 0, [th1, th2]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   763
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   764
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   765
      ((eq as Const ("==", Type (_, [T, _]))) $ t1 $ u, Const ("==", _) $ u' $ t2) =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   766
        if not (u aconv u') then err "middle term"
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   767
        else
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   768
          Thm {thy_ref = merge_thys2 th1 th2,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   769
            der = Pt.infer_derivs (Pt.transitive u T) der1 der2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   770
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   771
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   772
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   773
            tpairs = union_tpairs tpairs1 tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   774
            prop = eq $ t1 $ t2}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   775
     | _ =>  err "premises"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   776
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   777
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   778
(*Beta-conversion
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   779
  (%x. t)(u) == t[u/x]
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   780
  fully beta-reduces the term if full = true
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   781
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   782
fun beta_conversion full (Cterm {thy_ref, t, T, maxidx, sorts}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   783
  let val t' =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   784
    if full then Envir.beta_norm t
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   785
    else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   786
      (case t of Abs (_, _, bodt) $ u => subst_bound (u, bodt)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   787
      | _ => raise THM ("beta_conversion: not a redex", 0, []));
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   788
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   789
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   790
      der = Pt.infer_derivs' I (false, Pt.reflexive),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   791
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   792
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   793
      hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   794
      tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   795
      prop = Logic.mk_equals (t, t')}
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   796
  end;
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   797
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   798
fun eta_conversion (Cterm {thy_ref, t, T, maxidx, sorts}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   799
  Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   800
    der = Pt.infer_derivs' I (false, Pt.reflexive),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   801
    maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   802
    shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   803
    hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   804
    tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   805
    prop = Logic.mk_equals (t, Pattern.eta_contract t)};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   806
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   807
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   808
  The bound variable will be named "a" (since x will be something like x320)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   809
      t == u
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   810
  --------------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   811
  %x. t == %x. u
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   812
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   813
fun abstract_rule a
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   814
    (Cterm {t = x, T, sorts, ...})
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   815
    (th as Thm {thy_ref, der, maxidx, hyps, shyps, tpairs, prop}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   816
  let
17708
6c6ecafd8c0e abstract_rule: tuned exception msgs;
wenzelm
parents: 17412
diff changeset
   817
    val string_of = Sign.string_of_term (Theory.deref thy_ref);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   818
    val (t, u) = Logic.dest_equals prop
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   819
      handle TERM _ => raise THM ("abstract_rule: premise not an equality", 0, [th]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   820
    val result =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   821
      Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   822
        der = Pt.infer_derivs' (Pt.abstract_rule x a) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   823
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   824
        shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   825
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   826
        tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   827
        prop = Logic.mk_equals
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   828
          (Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))};
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   829
    fun check_occs x ts =
16847
8fc160b12e73 invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents: 16725
diff changeset
   830
      if exists (fn t => Logic.occs (x, t)) ts then
17708
6c6ecafd8c0e abstract_rule: tuned exception msgs;
wenzelm
parents: 17412
diff changeset
   831
        raise THM ("abstract_rule: variable free in assumptions " ^ string_of x, 0, [th])
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   832
      else ();
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   833
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   834
    case x of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   835
      Free _ => (check_occs x hyps; check_occs x (terms_of_tpairs tpairs); result)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   836
    | Var _ => (check_occs x (terms_of_tpairs tpairs); result)
17708
6c6ecafd8c0e abstract_rule: tuned exception msgs;
wenzelm
parents: 17412
diff changeset
   837
    | _ => raise THM ("abstract_rule: not a variable " ^ string_of x, 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   838
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   839
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   840
(*The combination rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   841
  f == g  t == u
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   842
  --------------
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   843
    f t == g u
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   844
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   845
fun combination th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   846
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   847
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   848
      prop = prop1, ...} = th1
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   849
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   850
      prop = prop2, ...} = th2;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   851
    fun chktypes fT tT =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   852
      (case fT of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   853
        Type ("fun", [T1, T2]) =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   854
          if T1 <> tT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   855
            raise THM ("combination: types", 0, [th1, th2])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   856
          else ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   857
      | _ => raise THM ("combination: not function type", 0, [th1, th2]));
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   858
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   859
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   860
      (Const ("==", Type ("fun", [fT, _])) $ f $ g,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   861
       Const ("==", Type ("fun", [tT, _])) $ t $ u) =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   862
        (chktypes fT tT;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   863
          Thm {thy_ref = merge_thys2 th1 th2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   864
            der = Pt.infer_derivs (Pt.combination f g t u fT) der1 der2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   865
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   866
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   867
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   868
            tpairs = union_tpairs tpairs1 tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   869
            prop = Logic.mk_equals (f $ t, g $ u)})
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   870
     | _ => raise THM ("combination: premises", 0, [th1, th2])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   871
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   872
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   873
(*Equality introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   874
  A ==> B  B ==> A
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   875
  ----------------
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   876
       A == B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   877
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   878
fun equal_intr th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   879
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   880
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   881
      prop = prop1, ...} = th1
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   882
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   883
      prop = prop2, ...} = th2;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   884
    fun err msg = raise THM ("equal_intr: " ^ msg, 0, [th1, th2]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   885
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   886
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   887
      (Const("==>", _) $ A $ B, Const("==>", _) $ B' $ A') =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   888
        if A aconv A' andalso B aconv B' then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   889
          Thm {thy_ref = merge_thys2 th1 th2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   890
            der = Pt.infer_derivs (Pt.equal_intr A B) der1 der2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   891
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   892
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   893
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   894
            tpairs = union_tpairs tpairs1 tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   895
            prop = Logic.mk_equals (A, B)}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   896
        else err "not equal"
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   897
    | _ =>  err "premises"
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   898
  end;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   899
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   900
(*The equal propositions rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   901
  A == B  A
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   902
  ---------
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   903
      B
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   904
*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   905
fun equal_elim th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   906
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   907
    val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   908
      tpairs = tpairs1, prop = prop1, ...} = th1
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   909
    and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   910
      tpairs = tpairs2, prop = prop2, ...} = th2;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   911
    fun err msg = raise THM ("equal_elim: " ^ msg, 0, [th1, th2]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   912
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   913
    case prop1 of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   914
      Const ("==", _) $ A $ B =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   915
        if prop2 aconv A then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   916
          Thm {thy_ref = merge_thys2 th1 th2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   917
            der = Pt.infer_derivs (Pt.equal_elim A B) der1 der2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   918
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   919
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   920
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   921
            tpairs = union_tpairs tpairs1 tpairs2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   922
            prop = B}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   923
        else err "not equal"
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   924
     | _ =>  err"major premise"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   925
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   926
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   927
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   928
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   929
(**** Derived rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   930
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   931
(*Smash unifies the list of term pairs leaving no flex-flex pairs.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   932
  Instantiates the theorem and deletes trivial tpairs.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   933
  Resulting sequence may contain multiple elements if the tpairs are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   934
    not all flex-flex. *)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   935
fun flexflex_rule (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   936
  Unify.smash_unifiers (Theory.deref thy_ref, Envir.empty maxidx, tpairs)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   937
  |> Seq.map (fn env =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   938
      if Envir.is_empty env then th
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   939
      else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   940
        let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   941
          val tpairs' = tpairs |> map (pairself (Envir.norm_term env))
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   942
            (*remove trivial tpairs, of the form t==t*)
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   943
            |> filter_out (op aconv);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   944
          val prop' = Envir.norm_term env prop;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   945
        in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   946
          Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   947
            der = Pt.infer_derivs' (Pt.norm_proof' env) der,
16711
2c1f9640b744 tuned maxidx;
wenzelm
parents: 16679
diff changeset
   948
            maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'),
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   949
            shyps = may_insert_env_sorts (Theory.deref thy_ref) env shyps,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   950
            hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   951
            tpairs = tpairs',
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   952
            prop = prop'}
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   953
        end);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   954
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   955
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   956
(*Instantiation of Vars
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   957
           A
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   958
  --------------------
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   959
  A[t1/v1, ..., tn/vn]
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   960
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   961
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
   962
local
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
   963
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   964
fun pretty_typing thy t T =
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   965
  Pretty.block [Sign.pretty_term thy t, Pretty.str " ::", Pretty.brk 1, Sign.pretty_typ thy T];
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15672
diff changeset
   966
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   967
fun add_inst (ct, cu) (thy_ref, sorts) =
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
   968
  let
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   969
    val Cterm {t = t, T = T, ...} = ct
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   970
    and Cterm {t = u, T = U, sorts = sorts_u, ...} = cu;
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   971
    val thy_ref' = Theory.merge_refs (thy_ref, merge_thys0 ct cu);
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   972
    val sorts' = Sorts.union sorts_u sorts;
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
   973
  in
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   974
    (case t of Var v =>
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   975
      if T = U then ((v, u), (thy_ref', sorts'))
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   976
      else raise TYPE (Pretty.string_of (Pretty.block
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   977
       [Pretty.str "instantiate: type conflict",
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   978
        Pretty.fbrk, pretty_typing (Theory.deref thy_ref') t T,
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   979
        Pretty.fbrk, pretty_typing (Theory.deref thy_ref') u U]), [T, U], [t, u])
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   980
    | _ => raise TYPE (Pretty.string_of (Pretty.block
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   981
       [Pretty.str "instantiate: not a variable",
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   982
        Pretty.fbrk, Sign.pretty_term (Theory.deref thy_ref') t]), [], [t]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   983
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   984
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   985
fun add_instT (cT, cU) (thy_ref, sorts) =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   986
  let
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   987
    val Ctyp {T, thy_ref = thy_ref1, ...} = cT
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   988
    and Ctyp {T = U, thy_ref = thy_ref2, sorts = sorts_U, ...} = cU;
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   989
    val thy_ref' = Theory.merge_refs (thy_ref, Theory.merge_refs (thy_ref1, thy_ref2));
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   990
    val thy' = Theory.deref thy_ref';
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   991
    val sorts' = Sorts.union sorts_U sorts;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   992
  in
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
   993
    (case T of TVar (v as (_, S)) =>
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17184
diff changeset
   994
      if Sign.of_sort thy' (U, S) then ((v, U), (thy_ref', sorts'))
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   995
      else raise TYPE ("Type not of sort " ^ Sign.string_of_sort thy' S, [U], [])
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   996
    | _ => raise TYPE (Pretty.string_of (Pretty.block
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15672
diff changeset
   997
        [Pretty.str "instantiate: not a type variable",
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   998
         Pretty.fbrk, Sign.pretty_typ thy' T]), [T], []))
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   999
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1000
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1001
in
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1002
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1003
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...].
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1004
  Instantiates distinct Vars by terms of same type.
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1005
  Does NOT normalize the resulting theorem!*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1006
fun instantiate ([], []) th = th
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1007
  | instantiate (instT, inst) th =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1008
      let
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1009
        val Thm {thy_ref, der, hyps, shyps, tpairs, prop, ...} = th;
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1010
        val (inst', (instT', (thy_ref', shyps'))) =
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1011
          (thy_ref, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT;
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1012
        val subst = Term.instantiate (instT', inst');
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1013
        val prop' = subst prop;
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1014
        val tpairs' = map (pairself subst) tpairs;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1015
      in
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1016
        if has_duplicates (fn ((v, _), (v', _)) => Term.eq_var (v, v')) inst' then
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1017
          raise THM ("instantiate: variables not distinct", 0, [th])
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1018
        else if has_duplicates (fn ((v, _), (v', _)) => Term.eq_tvar (v, v')) instT' then
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1019
          raise THM ("instantiate: type variables not distinct", 0, [th])
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1020
        else
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1021
          Thm {thy_ref = thy_ref',
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1022
            der = Pt.infer_derivs' (Pt.instantiate (instT', inst')) der,
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1023
            maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'),
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1024
            shyps = shyps',
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1025
            hyps = hyps,
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1026
            tpairs = tpairs',
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1027
            prop = prop'}
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1028
      end
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1029
      handle TYPE (msg, _, _) => raise THM (msg, 0, [th]);
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1030
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1031
end;
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1032
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1033
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1034
(*The trivial implication A ==> A, justified by assume and forall rules.
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1035
  A can contain Vars, not so for assume!*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1036
fun trivial (Cterm {thy_ref, t =A, T, maxidx, sorts}) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1037
  if T <> propT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1038
    raise THM ("trivial: the term must have type prop", 0, [])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1039
  else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1040
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1041
      der = Pt.infer_derivs' I (false, Pt.AbsP ("H", NONE, Pt.PBound 0)),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1042
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1043
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1044
      hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1045
      tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1046
      prop = implies $ A $ A};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1047
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
  1048
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
  1049
fun class_triv thy c =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1050
  let val Cterm {thy_ref, t, maxidx, sorts, ...} =
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
  1051
    cterm_of thy (Logic.mk_inclass (TVar (("'a", 0), [c]), c))
6368
ba5e97a20b12 added def_name;
wenzelm
parents: 6089
diff changeset
  1052
      handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1053
  in
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1054
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1055
      der = Pt.infer_derivs' I (false, Pt.PAxm ("ProtoPure.class_triv:" ^ c, t, SOME [])),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1056
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1057
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1058
      hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1059
      tpairs = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1060
      prop = t}
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1061
  end;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1062
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1063
6786
0af1797d5315 varifyT': observe additional 'fixed' tfrees;
wenzelm
parents: 6539
diff changeset
  1064
(* Replace all TFrees not fixed or in the hyps by new TVars *)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1065
fun varifyT' fixed (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
12500
0a6667d65e9b varifyT' returns newly introduces variables;
wenzelm
parents: 11692
diff changeset
  1066
  let
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15672
diff changeset
  1067
    val tfrees = foldr add_term_tfrees fixed hyps;
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1068
    val prop1 = attach_tpairs tpairs prop;
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1069
    val (prop2, al) = Type.varify (prop1, tfrees);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1070
    val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1071
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1072
    (Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1073
      der = Pt.infer_derivs' (Pt.varify_proof prop tfrees) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1074
      maxidx = Int.max (0, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1075
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1076
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1077
      tpairs = rev (map Logic.dest_equals ts),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1078
      prop = prop3}, al)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1079
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1080
12500
0a6667d65e9b varifyT' returns newly introduces variables;
wenzelm
parents: 11692
diff changeset
  1081
val varifyT = #1 o varifyT' [];
6786
0af1797d5315 varifyT': observe additional 'fixed' tfrees;
wenzelm
parents: 6539
diff changeset
  1082
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1083
(* Replace all TVars by new TFrees *)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1084
fun freezeT (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1085
  let
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1086
    val prop1 = attach_tpairs tpairs prop;
16287
7a03b4b4df67 Type.freeze;
wenzelm
parents: 16135
diff changeset
  1087
    val prop2 = Type.freeze prop1;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1088
    val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1089
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1090
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1091
      der = Pt.infer_derivs' (Pt.freezeT prop1) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1092
      maxidx = maxidx_of_term prop2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1093
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1094
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1095
      tpairs = rev (map Logic.dest_equals ts),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1096
      prop = prop3}
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1097
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1098
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1099
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1100
(*** Inference rules for tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1101
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1102
(*Destruct proof state into constraints, other goals, goal(i), rest *)
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1103
fun dest_state (state as Thm{prop,tpairs,...}, i) =
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1104
  (case  Logic.strip_prems(i, [], prop) of
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1105
      (B::rBs, C) => (tpairs, rev rBs, B, C)
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1106
    | _ => raise THM("dest_state", i, [state]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1107
  handle TERM _ => raise THM("dest_state", i, [state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1108
309
3751567696bf restored the signature constraint :THM
lcp
parents: 305
diff changeset
  1109
(*Increment variables and parameters of orule as required for
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1110
  resolution with goal i of state. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1111
fun lift_rule (state, i) orule =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1112
  let
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
  1113
    val Thm {shyps = sshyps, prop = sprop, maxidx = smax, ...} = state;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1114
    val (Bi :: _, _) = Logic.strip_prems (i, [], sprop)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1115
      handle TERM _ => raise THM ("lift_rule", i, [orule, state]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1116
    val (lift_abs, lift_all) = Logic.lift_fns (Bi, smax + 1);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1117
    val (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = orule;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1118
    val (As, B) = Logic.strip_horn prop;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1119
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1120
    Thm {thy_ref = merge_thys2 state orule,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1121
      der = Pt.infer_derivs' (Pt.lift_proof Bi (smax + 1) prop) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1122
      maxidx = maxidx + smax + 1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1123
      shyps = Sorts.union sshyps shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1124
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1125
      tpairs = map (pairself lift_abs) tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1126
      prop = Logic.list_implies (map lift_all As, lift_all B)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1127
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1128
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
  1129
fun incr_indexes i (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1130
  if i < 0 then raise THM ("negative increment", 0, [thm])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1131
  else if i = 0 then thm
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1132
  else
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
  1133
    Thm {thy_ref = thy_ref,
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1134
      der = Pt.infer_derivs'
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1135
        (Pt.map_proof_terms (Logic.incr_indexes ([], i)) (Logic.incr_tvar i)) der,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1136
      maxidx = maxidx + i,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1137
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1138
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1139
      tpairs = map (pairself (Logic.incr_indexes ([], i))) tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1140
      prop = Logic.incr_indexes ([], i) prop};
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
  1141
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1142
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1143
fun assumption i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1144
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1145
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1146
    val thy = Theory.deref thy_ref;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1147
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1148
    fun newth n (env as Envir.Envir {maxidx, ...}, tpairs) =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1149
      Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1150
        der = Pt.infer_derivs'
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1151
          ((if Envir.is_empty env then I else (Pt.norm_proof' env)) o
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1152
            Pt.assumption_proof Bs Bi n) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1153
        maxidx = maxidx,
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1154
        shyps = may_insert_env_sorts thy env shyps,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1155
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1156
        tpairs =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1157
          if Envir.is_empty env then tpairs
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1158
          else map (pairself (Envir.norm_term env)) tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1159
        prop =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1160
          if Envir.is_empty env then (*avoid wasted normalizations*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1161
            Logic.list_implies (Bs, C)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1162
          else (*normalize the new rule fully*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1163
            Envir.norm_term env (Logic.list_implies (Bs, C))};
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1164
    fun addprfs [] _ = Seq.empty
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1165
      | addprfs ((t, u) :: apairs) n = Seq.make (fn () => Seq.pull
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1166
          (Seq.mapp (newth n)
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1167
            (Unify.unifiers (thy, Envir.empty maxidx, (t, u) :: tpairs))
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1168
            (addprfs apairs (n + 1))))
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1169
  in addprfs (Logic.assum_pairs (~1, Bi)) 1 end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1170
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1171
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1172
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1173
fun eq_assumption i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1174
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1175
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1176
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1177
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1178
    (case find_index (op aconv) (Logic.assum_pairs (~1, Bi)) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1179
      ~1 => raise THM ("eq_assumption", 0, [state])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1180
    | n =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1181
        Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1182
          der = Pt.infer_derivs' (Pt.assumption_proof Bs Bi (n + 1)) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1183
          maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1184
          shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1185
          hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1186
          tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1187
          prop = Logic.list_implies (Bs, C)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1188
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1189
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1190
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1191
(*For rotate_tac: fast rotation of assumptions of subgoal i*)
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1192
fun rotate_rule k i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1193
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1194
    val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1195
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1196
    val params = Term.strip_all_vars Bi
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1197
    and rest   = Term.strip_all_body Bi;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1198
    val asms   = Logic.strip_imp_prems rest
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1199
    and concl  = Logic.strip_imp_concl rest;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1200
    val n = length asms;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1201
    val m = if k < 0 then n + k else k;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1202
    val Bi' =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1203
      if 0 = m orelse m = n then Bi
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1204
      else if 0 < m andalso m < n then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1205
        let val (ps, qs) = splitAt (m, asms)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1206
        in list_all (params, Logic.list_implies (qs @ ps, concl)) end
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1207
      else raise THM ("rotate_rule", k, [state]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1208
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1209
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1210
      der = Pt.infer_derivs' (Pt.rotate_proof Bs Bi m) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1211
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1212
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1213
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1214
      tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1215
      prop = Logic.list_implies (Bs @ [Bi'], C)}
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1216
  end;
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1217
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1218
7248
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1219
(*Rotates a rule's premises to the left by k, leaving the first j premises
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1220
  unchanged.  Does nothing if k=0 or if k equals n-j, where n is the
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1221
  number of premises.  Useful with etac and underlies defer_tac*)
7248
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1222
fun permute_prems j k rl =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1223
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1224
    val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop} = rl;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1225
    val prems = Logic.strip_imp_prems prop
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1226
    and concl = Logic.strip_imp_concl prop;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1227
    val moved_prems = List.drop (prems, j)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1228
    and fixed_prems = List.take (prems, j)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1229
      handle Subscript => raise THM ("permute_prems: j", j, [rl]);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1230
    val n_j = length moved_prems;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1231
    val m = if k < 0 then n_j + k else k;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1232
    val prop' =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1233
      if 0 = m orelse m = n_j then prop
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1234
      else if 0 < m andalso m < n_j then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1235
        let val (ps, qs) = splitAt (m, moved_prems)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1236
        in Logic.list_implies (fixed_prems @ qs @ ps, concl) end
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
  1237
      else raise THM ("permute_prems: k", k, [rl]);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1238
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1239
    Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1240
      der = Pt.infer_derivs' (Pt.permute_prems_prf prems j m) der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1241
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1242
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1243
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1244
      tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1245
      prop = prop'}
7248
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1246
  end;
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1247
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 7070
diff changeset
  1248
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1249
(** User renaming of parameters in a subgoal **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1250
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1251
(*Calls error rather than raising an exception because it is intended
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1252
  for top-level use -- exception handling would not make sense here.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1253
  The names in cs, if distinct, are used for the innermost parameters;
17868
5a12b1b5990f tuned comment;
wenzelm
parents: 17708
diff changeset
  1254
  preceding parameters may be renamed to make all params distinct.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1255
fun rename_params_rule (cs, i) state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1256
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1257
    val Thm {thy_ref, der, maxidx, shyps, hyps, ...} = state;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1258
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1259
    val iparams = map #1 (Logic.strip_params Bi);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1260
    val short = length iparams - length cs;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1261
    val newnames =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1262
      if short < 0 then error "More names than abstractions!"
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1263
      else variantlist (Library.take (short, iparams), cs) @ cs;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1264
    val freenames = map (#1 o dest_Free) (term_frees Bi);
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1265
    val newBi = Logic.list_rename_params (newnames, Bi);
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1266
  in
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1267
    case findrep cs of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1268
      c :: _ => (warning ("Can't rename.  Bound variables not distinct: " ^ c); state)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1269
    | [] =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1270
      (case cs inter_string freenames of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1271
        a :: _ => (warning ("Can't rename.  Bound/Free variable clash: " ^ a); state)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1272
      | [] =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1273
        Thm {thy_ref = thy_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1274
          der = der,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1275
          maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1276
          shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1277
          hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1278
          tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1279
          prop = Logic.list_implies (Bs @ [newBi], C)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1280
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1281
12982
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1282
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1283
(*** Preservation of bound variable names ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1284
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1285
fun rename_boundvars pat obj (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) =
12982
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1286
  (case Term.rename_abs pat obj prop of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
  1287
    NONE => thm
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
  1288
  | SOME prop' => Thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
  1289
      {thy_ref = thy_ref,
12982
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1290
       der = der,
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1291
       maxidx = maxidx,
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1292
       hyps = hyps,
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1293
       shyps = shyps,
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1294
       tpairs = tpairs,
12982
34a07757634d moved match_bvs, match_bvars, renAbs to term.ML;
wenzelm
parents: 12923
diff changeset
  1295
       prop = prop'});
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
  1296
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1297
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1298
(* strip_apply f (A, B) strips off all assumptions/parameters from A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1299
   introduced by lifting over B, and applies f to remaining part of A*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1300
fun strip_apply f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1301
  let fun strip(Const("==>",_)$ A1 $ B1,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1302
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1303
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1304
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1305
        | strip(A,_) = f A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1306
  in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1307
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1308
(*Use the alist to rename all bound variables and some unknowns in a term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1309
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1310
  Preserves unknowns in tpairs and on lhs of dpairs. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1311
fun rename_bvs([],_,_,_) = I
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1312
  | rename_bvs(al,dpairs,tpairs,B) =
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
  1313
    let val vars = foldr add_term_vars []
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
  1314
                        (map fst dpairs @ map fst tpairs @ map snd tpairs)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1315
        (*unknowns appearing elsewhere be preserved!*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1316
        val vids = map (#1 o #1 o dest_Var) vars;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1317
        fun rename(t as Var((x,i),T)) =
17184
3d80209e9a53 use AList operations;
wenzelm
parents: 16991
diff changeset
  1318
                (case AList.lookup (op =) al x of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
  1319
                   SOME(y) => if x mem_string vids orelse y mem_string vids then t
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1320
                              else Var((y,i),T)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
  1321
                 | NONE=> t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1322
          | rename(Abs(x,T,t)) =
17184
3d80209e9a53 use AList operations;
wenzelm
parents: 16991
diff changeset
  1323
              Abs (if_none (AList.lookup (op =) al x) x, T, rename t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1324
          | rename(f$t) = rename f $ rename t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1325
          | rename(t) = t;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1326
        fun strip_ren Ai = strip_apply rename (Ai,B)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1327
    in strip_ren end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1328
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1329
(*Function to rename bounds/unknowns in the argument, lifted over B*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1330
fun rename_bvars(dpairs, tpairs, B) =
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
  1331
        rename_bvs(foldr Term.match_bvars [] dpairs, dpairs, tpairs, B);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1332