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