src/Pure/thm.ML
author wenzelm
Fri, 17 Jul 2009 23:11:40 +0200
changeset 32035 8e77b6a250d5
parent 32032 a6a6e8031c14
child 32059 7991cdf10a54
permissions -rw-r--r--
tuned/modernized Envir.subst_XXX;
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
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
29269
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 29003
diff changeset
     3
    Author:     Makarius
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
     4
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
     5
The very core of Isabelle's Meta Logic: certified types and terms,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
     6
derivations, theorems, framework rules (including lifting and
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
     7
resolution), oracles.
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 ->
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
    15
   {thy_ref: theory_ref,
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    16
    T: typ,
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
    17
    maxidx: int,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    18
    sorts: sort OrdList.T}
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
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    22
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    23
  (*certified terms*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    24
  type cterm
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
    25
  exception CTERM of string * cterm list
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
    26
  val rep_cterm: cterm ->
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
    27
   {thy_ref: theory_ref,
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    28
    t: term,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    29
    T: typ,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    30
    maxidx: int,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    31
    sorts: sort OrdList.T}
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    32
  val crep_cterm: cterm ->
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    33
    {thy_ref: theory_ref, t: term, T: ctyp, maxidx: int, sorts: sort OrdList.T}
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    34
  val theory_of_cterm: cterm -> theory
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    35
  val term_of: cterm -> term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    36
  val cterm_of: theory -> term -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    37
  val ctyp_of_term: cterm -> ctyp
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    38
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
    39
  (*theorems*)
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    40
  type thm
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
    41
  type conv = cterm -> thm
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
    42
  type attribute = Context.generic * thm -> Context.generic * thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    43
  val rep_thm: thm ->
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
    44
   {thy_ref: theory_ref,
28017
4919bd124a58 type Properties.T;
wenzelm
parents: 27336
diff changeset
    45
    tags: Properties.T,
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    46
    maxidx: int,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    47
    shyps: sort OrdList.T,
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    48
    hyps: term OrdList.T,
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    49
    tpairs: (term * term) list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    50
    prop: term}
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    51
  val crep_thm: thm ->
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
    52
   {thy_ref: theory_ref,
28017
4919bd124a58 type Properties.T;
wenzelm
parents: 27336
diff changeset
    53
    tags: Properties.T,
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    54
    maxidx: int,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    55
    shyps: sort OrdList.T,
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
    56
    hyps: cterm OrdList.T,
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    57
    tpairs: (cterm * cterm) list,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    58
    prop: cterm}
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
    59
  exception THM of string * int * thm list
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    60
  val theory_of_thm: thm -> theory
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    61
  val prop_of: thm -> term
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    62
  val tpairs_of: thm -> (term * term) list
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    63
  val concl_of: thm -> term
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    64
  val prems_of: thm -> term list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    65
  val nprems_of: thm -> int
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    66
  val cprop_of: thm -> cterm
18145
6757627acf59 renamed Thm.cgoal_of to Thm.cprem_of;
wenzelm
parents: 18127
diff changeset
    67
  val cprem_of: thm -> int -> cterm
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
    68
  val transfer: theory -> thm -> thm
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
    69
  val weaken: cterm -> thm -> thm
28624
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
    70
  val weaken_sorts: sort list -> cterm -> cterm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    71
  val extra_shyps: thm -> sort list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    72
  val strip_shyps: thm -> thm
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    73
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    74
  (*meta rules*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    75
  val assume: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    76
  val implies_intr: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    77
  val implies_elim: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    78
  val forall_intr: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    79
  val forall_elim: cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    80
  val reflexive: cterm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    81
  val symmetric: thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    82
  val transitive: thm -> thm -> thm
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
    83
  val beta_conversion: bool -> conv
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
    84
  val eta_conversion: conv
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
    85
  val eta_long_conversion: conv
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    86
  val abstract_rule: string -> cterm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    87
  val combination: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    88
  val equal_intr: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    89
  val equal_elim: thm -> thm -> thm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    90
  val flexflex_rule: thm -> thm Seq.seq
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
    91
  val generalize: string list * string list -> int -> thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    92
  val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
    93
  val instantiate_cterm: (ctyp * ctyp) list * (cterm * cterm) list -> cterm -> cterm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    94
  val trivial: cterm -> thm
31944
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
    95
  val of_class: ctyp * class -> thm
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
    96
  val unconstrainT: ctyp -> thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    97
  val dest_state: thm * int -> (term * term) list * term list * term * term
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
    98
  val lift_rule: cterm -> thm -> thm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
    99
  val incr_indexes: int -> thm -> thm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   100
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   101
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   102
signature THM =
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   103
sig
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   104
  include BASIC_THM
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   105
  val dest_ctyp: ctyp -> ctyp list
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   106
  val dest_comb: cterm -> cterm * cterm
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   107
  val dest_fun: cterm -> cterm
20580
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   108
  val dest_arg: cterm -> cterm
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   109
  val dest_fun2: cterm -> cterm
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   110
  val dest_arg1: cterm -> cterm
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   111
  val dest_abs: string option -> cterm -> cterm * cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   112
  val capply: cterm -> cterm -> cterm
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   113
  val cabs: cterm -> cterm -> cterm
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   114
  val adjust_maxidx_cterm: int -> cterm -> cterm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   115
  val incr_indexes_cterm: int -> cterm -> cterm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   116
  val match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   117
  val first_order_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   118
  val fold_terms: (term -> 'a -> 'a) -> thm -> 'a -> 'a
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   119
  val terms_of_tpairs: (term * term) list -> term list
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   120
  val full_prop_of: thm -> term
19881
47937afefdc9 added hyps_of;
wenzelm
parents: 19861
diff changeset
   121
  val maxidx_of: thm -> int
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   122
  val maxidx_thm: thm -> int -> int
19881
47937afefdc9 added hyps_of;
wenzelm
parents: 19861
diff changeset
   123
  val hyps_of: thm -> term list
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   124
  val no_prems: thm -> bool
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   125
  val major_prem_of: thm -> term
28675
fb68c0767004 renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents: 28648
diff changeset
   126
  val axiom: theory -> string -> thm
fb68c0767004 renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents: 28648
diff changeset
   127
  val axioms_of: theory -> (string * thm) list
28017
4919bd124a58 type Properties.T;
wenzelm
parents: 27336
diff changeset
   128
  val get_tags: thm -> Properties.T
4919bd124a58 type Properties.T;
wenzelm
parents: 27336
diff changeset
   129
  val map_tags: (Properties.T -> Properties.T) -> thm -> thm
23781
ab793a6ddf9f Added function norm_proof for normalizing the proof term
berghofe
parents: 23657
diff changeset
   130
  val norm_proof: thm -> thm
20261
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   131
  val adjust_maxidx_thm: int -> thm -> thm
20002
09ac655904a9 varifyT: no longer pervasive;
wenzelm
parents: 19910
diff changeset
   132
  val varifyT: thm -> thm
09ac655904a9 varifyT: no longer pervasive;
wenzelm
parents: 19910
diff changeset
   133
  val varifyT': (string * sort) list -> thm -> ((string * sort) * indexname) list * thm
19881
47937afefdc9 added hyps_of;
wenzelm
parents: 19861
diff changeset
   134
  val freezeT: thm -> thm
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   135
  val assumption: int -> thm -> thm Seq.seq
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   136
  val eq_assumption: int -> thm -> thm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   137
  val rotate_rule: int -> int -> thm -> thm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   138
  val permute_prems: int -> int -> thm -> thm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   139
  val rename_params_rule: string list * int -> thm -> thm
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   140
  val compose_no_flatten: bool -> thm * int -> int -> thm -> thm Seq.seq
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   141
  val bicompose: bool -> bool * thm * int -> int -> thm -> thm Seq.seq
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   142
  val biresolution: bool -> (bool * thm) list -> int -> thm -> thm Seq.seq
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   143
  val rename_boundvars: term -> term -> thm -> thm
28978
f3e37d78b4f7 future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents: 28874
diff changeset
   144
  val future: thm future -> cterm -> thm
29432
5bb5551bef03 added pending_groups -- accumulates task groups of local derivations only;
wenzelm
parents: 29288
diff changeset
   145
  val pending_groups: thm -> Task_Queue.group list -> Task_Queue.group list
30713
b1a87e3971a3 status_of: need to include local promises as well!
wenzelm
parents: 30711
diff changeset
   146
  val status_of: thm -> {oracle: bool, unfinished: bool, failed: bool}
28814
463c9e9111ae clarified Thm.proof_body_of vs. Thm.proof_of;
wenzelm
parents: 28804
diff changeset
   147
  val proof_body_of: thm -> proof_body
463c9e9111ae clarified Thm.proof_body_of vs. Thm.proof_of;
wenzelm
parents: 28804
diff changeset
   148
  val proof_of: thm -> proof
29003
d8d3cbbb6fcc renamed force_proof to join_proof;
wenzelm
parents: 28996
diff changeset
   149
  val join_proof: thm -> unit
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   150
  val get_name: thm -> string
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31944
diff changeset
   151
  val put_name: string -> thm -> thm
28330
7e803c392342 added dest_deriv, removed external type deriv;
wenzelm
parents: 28321
diff changeset
   152
  val extern_oracles: theory -> xstring list
30288
a32700e45ab3 Thm.add_oracle interface: replaced old bstring by binding;
wenzelm
parents: 29636
diff changeset
   153
  val add_oracle: binding * ('a -> cterm) -> theory -> (string * ('a -> thm)) * theory
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   154
end;
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   155
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   156
structure Thm:> THM =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   157
struct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   158
22237
bb9b1c8a8a95 old-fashioned abstype ctyp/cterm/thm prevents accidental equality tests;
wenzelm
parents: 21975
diff changeset
   159
structure Pt = Proofterm;
bb9b1c8a8a95 old-fashioned abstype ctyp/cterm/thm prevents accidental equality tests;
wenzelm
parents: 21975
diff changeset
   160
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   161
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   162
(*** Certified terms and types ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   163
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   164
(** certified types **)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   165
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   166
datatype ctyp = Ctyp of
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   167
 {thy_ref: theory_ref,
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   168
  T: typ,
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   169
  maxidx: int,
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   170
  sorts: sort OrdList.T};
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   171
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   172
fun rep_ctyp (Ctyp args) = args;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   173
fun theory_of_ctyp (Ctyp {thy_ref, ...}) = Theory.deref thy_ref;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   174
fun typ_of (Ctyp {T, ...}) = T;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   175
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   176
fun ctyp_of thy raw_T =
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   177
  let
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   178
    val T = Sign.certify_typ thy raw_T;
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   179
    val maxidx = Term.maxidx_of_typ T;
26640
92e6d3ec91bd simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents: 26631
diff changeset
   180
    val sorts = Sorts.insert_typ T [];
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   181
  in Ctyp {thy_ref = Theory.check_thy thy, T = T, maxidx = maxidx, sorts = sorts} end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   182
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   183
fun dest_ctyp (Ctyp {thy_ref, T = Type (s, Ts), maxidx, sorts}) =
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   184
      map (fn T => Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts}) Ts
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   185
  | dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []);
15087
666f89fbb860 - optimized nodup_vars check in capply
berghofe
parents: 14828
diff changeset
   186
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   187
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   188
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   189
(** certified terms **)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   190
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   191
(*certified terms with checked typ, maxidx, and sorts*)
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   192
datatype cterm = Cterm of
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   193
 {thy_ref: theory_ref,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   194
  t: term,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   195
  T: typ,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   196
  maxidx: int,
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   197
  sorts: sort OrdList.T};
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   198
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   199
exception CTERM of string * cterm list;
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   200
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   201
fun rep_cterm (Cterm args) = args;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   202
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   203
fun crep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) =
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   204
  {thy_ref = thy_ref, t = t, maxidx = maxidx, sorts = sorts,
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   205
    T = Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts}};
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
   206
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   207
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
   208
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
   209
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   210
fun ctyp_of_term (Cterm {thy_ref, T, maxidx, sorts, ...}) =
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   211
  Ctyp {thy_ref = thy_ref, T = T, maxidx = maxidx, sorts = sorts};
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   212
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   213
fun cterm_of thy tm =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   214
  let
18969
49aa2c8791ba removed obsolete sign_of_cterm;
wenzelm
parents: 18944
diff changeset
   215
    val (t, T, maxidx) = Sign.certify_term thy tm;
26640
92e6d3ec91bd simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents: 26631
diff changeset
   216
    val sorts = Sorts.insert_term t [];
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   217
  in Cterm {thy_ref = Theory.check_thy 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
   218
20057
058e913bac71 tuned exception handling;
wenzelm
parents: 20002
diff changeset
   219
fun merge_thys0 (Cterm {thy_ref = r1, t = t1, ...}) (Cterm {thy_ref = r2, t = t2, ...}) =
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
   220
  Theory.merge_refs (r1, r2);
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   221
20580
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   222
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   223
(* destructors *)
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   224
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   225
fun dest_comb (ct as Cterm {t = c $ a, T, thy_ref, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   226
      let val A = Term.argument_type_of c 0 in
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   227
        (Cterm {t = c, T = A --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts},
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   228
         Cterm {t = a, 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
   229
      end
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   230
  | dest_comb ct = raise CTERM ("dest_comb", [ct]);
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   231
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   232
fun dest_fun (ct as Cterm {t = c $ _, T, thy_ref, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   233
      let val A = Term.argument_type_of c 0
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   234
      in Cterm {t = c, T = A --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts} end
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   235
  | dest_fun ct = raise CTERM ("dest_fun", [ct]);
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   236
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   237
fun dest_arg (ct as Cterm {t = c $ a, T = _, thy_ref, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   238
      let val A = Term.argument_type_of c 0
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   239
      in Cterm {t = a, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts} end
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   240
  | dest_arg ct = raise CTERM ("dest_arg", [ct]);
20580
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   241
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   242
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   243
fun dest_fun2 (Cterm {t = c $ a $ b, T, thy_ref, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   244
      let
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   245
        val A = Term.argument_type_of c 0;
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   246
        val B = Term.argument_type_of c 1;
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   247
      in Cterm {t = c, T = A --> B --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts} end
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   248
  | dest_fun2 ct = raise CTERM ("dest_fun2", [ct]);
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   249
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   250
fun dest_arg1 (Cterm {t = c $ a $ _, T = _, thy_ref, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   251
      let val A = Term.argument_type_of c 0
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   252
      in Cterm {t = a, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts} end
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   253
  | dest_arg1 ct = raise CTERM ("dest_arg1", [ct]);
20673
27738ccd0700 added dest_binop;
wenzelm
parents: 20580
diff changeset
   254
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   255
fun dest_abs a (ct as
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   256
        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
   257
      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
   258
        (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
   259
          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
   260
      end
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   261
  | dest_abs _ ct = raise CTERM ("dest_abs", [ct]);
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   262
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   263
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   264
(* constructors *)
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   265
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   266
fun capply
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   267
  (cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...})
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   268
  (cx as Cterm {t = x, T, maxidx = maxidx2, sorts = sorts2, ...}) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   269
    if T = dty then
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   270
      Cterm {thy_ref = merge_thys0 cf cx,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   271
        t = f $ x,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   272
        T = rty,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   273
        maxidx = Int.max (maxidx1, maxidx2),
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   274
        sorts = Sorts.union sorts1 sorts2}
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   275
      else raise CTERM ("capply: types don't agree", [cf, cx])
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
   276
  | capply cf cx = raise CTERM ("capply: first arg is not a function", [cf, cx]);
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   277
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   278
fun cabs
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   279
  (ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...})
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   280
  (ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) =
21975
1152dc45d591 Term.lambda: abstract over arbitrary closed terms;
wenzelm
parents: 21798
diff changeset
   281
    let val t = Term.lambda t1 t2 in
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   282
      Cterm {thy_ref = merge_thys0 ct1 ct2,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   283
        t = t, T = T1 --> T2,
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   284
        maxidx = Int.max (maxidx1, maxidx2),
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   285
        sorts = Sorts.union sorts1 sorts2}
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   286
    end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   287
20580
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   288
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   289
(* indexes *)
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   290
20580
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   291
fun adjust_maxidx_cterm i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   292
  if maxidx = i then ct
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   293
  else if maxidx < i then
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   294
    Cterm {maxidx = i, thy_ref = thy_ref, t = t, T = T, sorts = sorts}
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   295
  else
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   296
    Cterm {maxidx = Int.max (maxidx_of_term t, i), thy_ref = thy_ref, t = t, T = T, sorts = sorts};
6fb75df09253 added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents: 20548
diff changeset
   297
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   298
fun incr_indexes_cterm i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   299
  if i < 0 then raise CTERM ("negative increment", [ct])
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   300
  else if i = 0 then ct
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   301
  else Cterm {thy_ref = thy_ref, t = Logic.incr_indexes ([], i) t,
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   302
    T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts};
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   303
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   304
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   305
(* matching *)
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   306
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   307
local
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   308
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   309
fun gen_match match
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   310
    (ct1 as Cterm {t = t1, sorts = sorts1, ...},
20815
ccf18b899c8d cterm_match: avoid recalculation of maxidx;
wenzelm
parents: 20673
diff changeset
   311
     ct2 as Cterm {t = t2, sorts = sorts2, maxidx = maxidx2, ...}) =
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   312
  let
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   313
    val thy = Theory.deref (merge_thys0 ct1 ct2);
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   314
    val (Tinsts, tinsts) = match thy (t1, t2) (Vartab.empty, Vartab.empty);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   315
    val sorts = Sorts.union sorts1 sorts2;
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   316
    fun mk_cTinst ((a, i), (S, T)) =
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   317
      (Ctyp {T = TVar ((a, i), S), thy_ref = Theory.check_thy thy, maxidx = i, sorts = sorts},
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   318
       Ctyp {T = T, thy_ref = Theory.check_thy thy, maxidx = maxidx2, sorts = sorts});
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   319
    fun mk_ctinst ((x, i), (T, t)) =
32035
8e77b6a250d5 tuned/modernized Envir.subst_XXX;
wenzelm
parents: 32032
diff changeset
   320
      let val T = Envir.subst_type Tinsts T in
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   321
        (Cterm {t = Var ((x, i), T), T = T, thy_ref = Theory.check_thy thy,
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   322
          maxidx = i, sorts = sorts},
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   323
         Cterm {t = t, T = T, thy_ref = Theory.check_thy thy, maxidx = maxidx2, sorts = sorts})
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   324
      end;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   325
  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
   326
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   327
in
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   328
22909
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   329
val match = gen_match Pattern.match;
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   330
val first_order_match = gen_match Pattern.first_order_match;
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   331
7de3b0ac4189 added dest_fun/fun2/arg1;
wenzelm
parents: 22685
diff changeset
   332
end;
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   333
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   334
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   335
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   336
(*** Derivations and Theorems ***)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   337
28356
ac4498f95d1c abtract types: plain datatype with opaque signature matching;
wenzelm
parents: 28354
diff changeset
   338
datatype thm = Thm of
28378
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   339
 deriv *                                        (*derivation*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   340
 {thy_ref: theory_ref,                          (*dynamic reference to theory*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   341
  tags: Properties.T,                           (*additional annotations/comments*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   342
  maxidx: int,                                  (*maximum index of any Var or TVar*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   343
  shyps: sort OrdList.T,                        (*sort hypotheses*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   344
  hyps: term OrdList.T,                         (*hypotheses*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   345
  tpairs: (term * term) list,                   (*flex-flex pairs*)
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   346
  prop: term}                                   (*conclusion*)
28624
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   347
and deriv = Deriv of
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   348
 {max_promise: serial,
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   349
  open_promises: (serial * thm future) OrdList.T,
28978
f3e37d78b4f7 future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents: 28874
diff changeset
   350
  promises: (serial * thm future) OrdList.T,
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   351
  body: Pt.proof_body};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   352
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
   353
type conv = cterm -> thm;
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
   354
22365
ce62a5f6954c moved some non-kernel material to more_thm.ML;
wenzelm
parents: 22237
diff changeset
   355
(*attributes subsume any kind of rules or context modifiers*)
ce62a5f6954c moved some non-kernel material to more_thm.ML;
wenzelm
parents: 22237
diff changeset
   356
type attribute = Context.generic * thm -> Context.generic * thm;
ce62a5f6954c moved some non-kernel material to more_thm.ML;
wenzelm
parents: 22237
diff changeset
   357
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   358
(*errors involving theorems*)
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   359
exception THM of string * int * thm list;
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
   360
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   361
fun rep_thm (Thm (_, args)) = args;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   362
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   363
fun crep_thm (Thm (_, {thy_ref, tags, maxidx, shyps, hyps, tpairs, prop})) =
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   364
  let fun cterm max t = Cterm {thy_ref = thy_ref, t = t, T = propT, maxidx = max, sorts = shyps} in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   365
   {thy_ref = thy_ref, tags = tags, maxidx = maxidx, shyps = shyps,
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   366
    hyps = map (cterm ~1) hyps,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   367
    tpairs = map (pairself (cterm maxidx)) tpairs,
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   368
    prop = cterm maxidx prop}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   369
  end;
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   370
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   371
fun fold_terms f (Thm (_, {tpairs, prop, hyps, ...})) =
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   372
  fold (fn (t, u) => f t #> f u) tpairs #> f prop #> fold f hyps;
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   373
16725
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   374
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
   375
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   376
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
   377
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
   378
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
   379
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   380
fun attach_tpairs tpairs prop =
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   381
  Logic.list_implies (map Logic.mk_equals tpairs, prop);
597830f91930 added full_prop_of: includes tpairs;
wenzelm
parents: 16711
diff changeset
   382
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   383
fun full_prop_of (Thm (_, {tpairs, prop, ...})) = attach_tpairs tpairs prop;
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   384
29269
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 29003
diff changeset
   385
val union_hyps = OrdList.union TermOrd.fast_term_ord;
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 29003
diff changeset
   386
val insert_hyps = OrdList.insert TermOrd.fast_term_ord;
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 29003
diff changeset
   387
val remove_hyps = OrdList.remove TermOrd.fast_term_ord;
22365
ce62a5f6954c moved some non-kernel material to more_thm.ML;
wenzelm
parents: 22237
diff changeset
   388
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   389
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   390
(* merge theories of cterms/thms -- trivial absorption only *)
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   391
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   392
fun merge_thys1 (Cterm {thy_ref = r1, ...}) (th as Thm (_, {thy_ref = r2, ...})) =
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
   393
  Theory.merge_refs (r1, r2);
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   394
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   395
fun merge_thys2 (th1 as Thm (_, {thy_ref = r1, ...})) (th2 as Thm (_, {thy_ref = r2, ...})) =
23601
3a40294140f0 added type conv;
wenzelm
parents: 23493
diff changeset
   396
  Theory.merge_refs (r1, r2);
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   397
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   398
22365
ce62a5f6954c moved some non-kernel material to more_thm.ML;
wenzelm
parents: 22237
diff changeset
   399
(* basic components *)
16135
c66545fe72bf added eq_thms;
wenzelm
parents: 16024
diff changeset
   400
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   401
val theory_of_thm = Theory.deref o #thy_ref o rep_thm;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   402
val maxidx_of = #maxidx o rep_thm;
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   403
fun maxidx_thm th i = Int.max (maxidx_of th, i);
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   404
val hyps_of = #hyps o rep_thm;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   405
val prop_of = #prop o rep_thm;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   406
val tpairs_of = #tpairs o rep_thm;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   407
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   408
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
   409
val prems_of = Logic.strip_imp_prems o prop_of;
21576
8c11b1ce2f05 simplified Logic.count_prems;
wenzelm
parents: 21437
diff changeset
   410
val nprems_of = Logic.count_prems o prop_of;
19305
5c16895d548b avoid polymorphic equality;
wenzelm
parents: 19230
diff changeset
   411
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
   412
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   413
fun major_prem_of th =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   414
  (case prems_of th of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   415
    prem :: _ => Logic.strip_assums_concl prem
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   416
  | [] => 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
   417
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   418
(*the statement of any thm is a cterm*)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   419
fun cprop_of (Thm (_, {thy_ref, maxidx, shyps, prop, ...})) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   420
  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
   421
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   422
fun cprem_of (th as Thm (_, {thy_ref, maxidx, shyps, prop, ...})) i =
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
   423
  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
   424
    t = Logic.nth_prem (i, prop) handle TERM _ => raise THM ("cprem_of", i, [th])};
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
   425
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   426
(*explicit transfer to a super theory*)
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   427
fun transfer thy' thm =
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   428
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   429
    val Thm (der, {thy_ref, tags, maxidx, shyps, hyps, tpairs, prop}) = thm;
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   430
    val thy = Theory.deref thy_ref;
26665
2e363edf7578 Theory.eq_thy;
wenzelm
parents: 26640
diff changeset
   431
    val _ = Theory.subthy (thy, thy') orelse raise THM ("transfer: not a super theory", 0, [thm]);
2e363edf7578 Theory.eq_thy;
wenzelm
parents: 26640
diff changeset
   432
    val is_eq = Theory.eq_thy (thy, thy');
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   433
    val _ = Theory.check_thy thy;
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   434
  in
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   435
    if is_eq then thm
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   436
    else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   437
      Thm (der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   438
       {thy_ref = Theory.check_thy thy',
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   439
        tags = tags,
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   440
        maxidx = maxidx,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   441
        shyps = shyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   442
        hyps = hyps,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   443
        tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   444
        prop = prop})
3895
b2463861c86a added transfer: theory -> thm -> thm;
wenzelm
parents: 3893
diff changeset
   445
  end;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   446
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   447
(*explicit weakening: maps |- B to A |- B*)
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   448
fun weaken raw_ct th =
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   449
  let
20261
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   450
    val ct as Cterm {t = A, T, sorts, maxidx = maxidxA, ...} = adjust_maxidx_cterm ~1 raw_ct;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   451
    val Thm (der, {tags, maxidx, shyps, hyps, tpairs, prop, ...}) = th;
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   452
  in
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   453
    if T <> propT then
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   454
      raise THM ("weaken: assumptions must have type prop", 0, [])
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   455
    else if maxidxA <> ~1 then
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   456
      raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, [])
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   457
    else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   458
      Thm (der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   459
       {thy_ref = merge_thys1 ct th,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   460
        tags = tags,
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   461
        maxidx = maxidx,
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   462
        shyps = Sorts.union sorts shyps,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
   463
        hyps = insert_hyps A hyps,
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   464
        tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   465
        prop = prop})
16945
5d3ae25673a8 added weaken, adjust_maxidx_thm;
wenzelm
parents: 16884
diff changeset
   466
  end;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   467
28624
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   468
fun weaken_sorts raw_sorts ct =
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   469
  let
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   470
    val Cterm {thy_ref, t, T, maxidx, sorts} = ct;
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   471
    val thy = Theory.deref thy_ref;
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   472
    val more_sorts = Sorts.make (map (Sign.certify_sort thy) raw_sorts);
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   473
    val sorts' = Sorts.union sorts more_sorts;
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   474
  in Cterm {thy_ref = Theory.check_thy thy, t = t, T = T, maxidx = maxidx, sorts = sorts'} end;
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   475
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   476
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   477
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   478
(** sort contexts of theorems **)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   479
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   480
(*remove extra sorts that are witnessed by type signature information*)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   481
fun strip_shyps (thm as Thm (_, {shyps = [], ...})) = thm
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   482
  | strip_shyps (thm as Thm (der, {thy_ref, tags, maxidx, shyps, hyps, tpairs, prop})) =
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   483
      let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   484
        val thy = Theory.deref thy_ref;
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   485
        val present =
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   486
          (fold_terms o fold_types o fold_atyps)
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   487
            (fn T as TFree (_, S) => insert (eq_snd op =) (T, S)
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   488
              | T as TVar (_, S) => insert (eq_snd op =) (T, S)) thm [];
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   489
        val extra = fold (Sorts.remove_sort o #2) present shyps;
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   490
        val witnessed = Sign.witness_sorts thy present extra;
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   491
        val extra' = fold (Sorts.remove_sort o #2) witnessed extra
28624
d983515e5cdf added weaken_sorts;
wenzelm
parents: 28446
diff changeset
   492
          |> Sorts.minimal_sorts (Sign.classes_of thy);
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   493
        val shyps' = fold (Sorts.insert_sort o #2) present extra';
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   494
      in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   495
        Thm (der, {thy_ref = Theory.check_thy thy, tags = tags, maxidx = maxidx,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   496
          shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop})
7642
40d912f78db8 removed implies_intr_shyps;
wenzelm
parents: 7534
diff changeset
   497
      end;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   498
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   499
(*dangling sort constraints of a thm*)
31947
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   500
fun extra_shyps (th as Thm (_, {shyps, ...})) =
7daee3bed3af clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents: 31945
diff changeset
   501
  Sorts.subtract (fold_terms Sorts.insert_term th []) shyps;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   502
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   503
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   504
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   505
(** derivations **)
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   506
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   507
fun make_deriv max_promise open_promises promises oracles thms proof =
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   508
  Deriv {max_promise = max_promise, open_promises = open_promises, promises = promises,
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   509
    body = PBody {oracles = oracles, thms = thms, proof = proof}};
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   510
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   511
val empty_deriv = make_deriv ~1 [] [] [] [] Pt.MinProof;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   512
28330
7e803c392342 added dest_deriv, removed external type deriv;
wenzelm
parents: 28321
diff changeset
   513
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
   514
(* inference rules *)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   515
28378
60cc0359363d promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents: 28364
diff changeset
   516
fun promise_ord ((i, _), (j, _)) = int_ord (j, i);
28330
7e803c392342 added dest_deriv, removed external type deriv;
wenzelm
parents: 28321
diff changeset
   517
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   518
fun deriv_rule2 f
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   519
    (Deriv {max_promise = max1, open_promises = open_ps1, promises = ps1,
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   520
      body = PBody {oracles = oras1, thms = thms1, proof = prf1}})
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   521
    (Deriv {max_promise = max2, open_promises = open_ps2, promises = ps2,
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   522
      body = PBody {oracles = oras2, thms = thms2, proof = prf2}}) =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   523
  let
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   524
    val max = Int.max (max1, max2);
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   525
    val open_ps = OrdList.union promise_ord open_ps1 open_ps2;
28330
7e803c392342 added dest_deriv, removed external type deriv;
wenzelm
parents: 28321
diff changeset
   526
    val ps = OrdList.union promise_ord ps1 ps2;
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   527
    val oras = Pt.merge_oracles oras1 oras2;
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   528
    val thms = Pt.merge_thms thms1 thms2;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   529
    val prf =
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   530
      (case ! Pt.proofs of
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   531
        2 => f prf1 prf2
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   532
      | 1 => MinProof
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   533
      | 0 => MinProof
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   534
      | i => error ("Illegal level of detail for proof objects: " ^ string_of_int i));
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   535
  in make_deriv max open_ps ps oras thms prf end;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   536
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   537
fun deriv_rule1 f = deriv_rule2 (K f) empty_deriv;
28996
01918abaa9e7 refined type deriv: replaced all_promises by max_promise (dependency limit) and open_promises (potentially unfinished/failed promises);
wenzelm
parents: 28992
diff changeset
   538
fun deriv_rule0 prf = deriv_rule1 I (make_deriv ~1 [] [] [] [] prf);
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   539
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   540
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   541
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   542
(** Axioms **)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   543
28675
fb68c0767004 renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents: 28648
diff changeset
   544
fun axiom theory name =
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   545
  let
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   546
    fun get_ax thy =
22685
fc4ef3807fb9 removed obsolete read_ctyp, read_def_cterm;
wenzelm
parents: 22596
diff changeset
   547
      Symtab.lookup (Theory.axiom_table thy) name
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   548
      |> Option.map (fn prop =>
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   549
           let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   550
             val der = deriv_rule0 (Pt.axm_proof name prop);
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   551
             val maxidx = maxidx_of_term prop;
26640
92e6d3ec91bd simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents: 26631
diff changeset
   552
             val shyps = Sorts.insert_term prop [];
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   553
           in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   554
             Thm (der, {thy_ref = Theory.check_thy thy, tags = [],
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   555
               maxidx = maxidx, shyps = shyps, hyps = [], tpairs = [], prop = prop})
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   556
           end);
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   557
  in
16425
2427be27cc60 accomodate identification of type Sign.sg and theory;
wenzelm
parents: 16352
diff changeset
   558
    (case get_first get_ax (theory :: Theory.ancestors_of theory) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
   559
      SOME thm => thm
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15454
diff changeset
   560
    | NONE => raise THEORY ("No axiom " ^ quote name, [theory]))
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   561
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   562
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   563
(*return additional axioms of this theory node*)
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   564
fun axioms_of thy =
28675
fb68c0767004 renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents: 28648
diff changeset
   565
  map (fn s => (s, axiom thy s)) (Symtab.keys (Theory.axiom_table thy));
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   566
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   567
28804
5d3b1df16353 refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents: 28675
diff changeset
   568
(* tags *)
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   569
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   570
val get_tags = #tags o rep_thm;
6089
4d2d5556b4f9 signature BASIC_THM;
wenzelm
parents: 5624
diff changeset
   571
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   572
fun map_tags f (Thm (der, {thy_ref, tags, maxidx, shyps, hyps, tpairs, prop})) =
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   573
  Thm (der, {thy_ref = thy_ref, tags = f tags, maxidx = maxidx,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   574
    shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   575
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   576
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   577
fun norm_proof (Thm (der, args as {thy_ref, ...})) =
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   578
  let
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   579
    val thy = Theory.deref thy_ref;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   580
    val der' = deriv_rule1 (Pt.rew_proof thy) der;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   581
    val _ = Theory.check_thy thy;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   582
  in Thm (der', args) end;
23781
ab793a6ddf9f Added function norm_proof for normalizing the proof term
berghofe
parents: 23657
diff changeset
   583
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   584
fun adjust_maxidx_thm i (th as Thm (der, {thy_ref, tags, maxidx, shyps, hyps, tpairs, prop})) =
20261
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   585
  if maxidx = i then th
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   586
  else if maxidx < i then
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   587
    Thm (der, {maxidx = i, thy_ref = thy_ref, tags = tags, shyps = shyps,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   588
      hyps = hyps, tpairs = tpairs, prop = prop})
20261
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   589
  else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   590
    Thm (der, {maxidx = Int.max (maxidx_tpairs tpairs (maxidx_of_term prop), i), thy_ref = thy_ref,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   591
      tags = tags, shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop});
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   592
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   593
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   594
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   595
(*** Meta rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   596
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   597
(** primitive rules **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   598
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   599
(*The assumption rule A |- A*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   600
fun assume raw_ct =
20261
af51389aa756 adjust_maxidx: pass explicit lower bound;
wenzelm
parents: 20071
diff changeset
   601
  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
   602
    if T <> propT then
19230
3342e7554b77 Shortened the exception messages from assume.
mengj
parents: 19012
diff changeset
   603
      raise THM ("assume: prop", 0, [])
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   604
    else if maxidx <> ~1 then
19230
3342e7554b77 Shortened the exception messages from assume.
mengj
parents: 19012
diff changeset
   605
      raise THM ("assume: variables", maxidx, [])
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   606
    else Thm (deriv_rule0 (Pt.Hyp prop),
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   607
     {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   608
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   609
      maxidx = ~1,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   610
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   611
      hyps = [prop],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   612
      tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   613
      prop = prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   614
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   615
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   616
(*Implication introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   617
    [A]
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   618
     :
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   619
     B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   620
  -------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   621
  A ==> B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   622
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   623
fun implies_intr
16679
abd1461fa288 dest_ctyp: raise exception for non-constructor;
wenzelm
parents: 16656
diff changeset
   624
    (ct as Cterm {t = A, T, maxidx = maxidxA, sorts, ...})
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   625
    (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
   626
  if T <> propT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   627
    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
   628
  else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   629
    Thm (deriv_rule1 (Pt.implies_intr_proof A) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   630
     {thy_ref = merge_thys1 ct th,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   631
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   632
      maxidx = Int.max (maxidxA, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   633
      shyps = Sorts.union sorts shyps,
28354
c5fe7372ae4e explicit type OrdList.T;
wenzelm
parents: 28330
diff changeset
   634
      hyps = remove_hyps A hyps,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   635
      tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   636
      prop = Logic.mk_implies (A, prop)});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   637
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   638
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   639
(*Implication elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   640
  A ==> B    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   641
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   642
        B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   643
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   644
fun implies_elim thAB thA =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   645
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   646
    val Thm (derA, {maxidx = maxA, hyps = hypsA, shyps = shypsA, tpairs = tpairsA,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   647
      prop = propA, ...}) = thA
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   648
    and Thm (der, {maxidx, hyps, shyps, tpairs, prop, ...}) = thAB;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   649
    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
   650
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   651
    case prop of
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   652
      Const ("==>", _) $ A $ B =>
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
   653
        if A aconv propA then
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   654
          Thm (deriv_rule2 (curry Pt.%%) der derA,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   655
           {thy_ref = merge_thys2 thAB thA,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   656
            tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   657
            maxidx = Int.max (maxA, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   658
            shyps = Sorts.union shypsA shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   659
            hyps = union_hyps hypsA hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   660
            tpairs = union_tpairs tpairsA tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   661
            prop = B})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   662
        else err ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   663
    | _ => err ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   664
  end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   665
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   666
(*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
   667
    [x]
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   668
     :
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   669
     A
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   670
  ------
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   671
  !!x. A
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   672
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   673
fun forall_intr
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   674
    (ct as Cterm {t = x, T, sorts, ...})
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   675
    (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
   676
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   677
    fun result a =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   678
      Thm (deriv_rule1 (Pt.forall_intr_proof x a) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   679
       {thy_ref = merge_thys1 ct th,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   680
        tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   681
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   682
        shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   683
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   684
        tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   685
        prop = Term.all T $ Abs (a, T, abstract_over (x, prop))});
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   686
    fun check_occs a x ts =
16847
8fc160b12e73 invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents: 16725
diff changeset
   687
      if exists (fn t => Logic.occs (x, t)) ts then
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   688
        raise THM ("forall_intr: variable " ^ quote a ^ " free in assumptions", 0, [th])
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   689
      else ();
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   690
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   691
    case x of
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   692
      Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result a)
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   693
    | Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result a)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   694
    | _ => raise THM ("forall_intr: not a variable", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   695
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   696
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   697
(*Forall elimination
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   698
  !!x. A
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   699
  ------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   700
  A[t/x]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   701
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   702
fun forall_elim
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   703
    (ct as Cterm {t, T, maxidx = maxt, sorts, ...})
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   704
    (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
   705
  (case prop of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   706
    Const ("all", Type ("fun", [Type ("fun", [qary, _]), _])) $ A =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   707
      if T <> qary then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   708
        raise THM ("forall_elim: type mismatch", 0, [th])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   709
      else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   710
        Thm (deriv_rule1 (Pt.% o rpair (SOME t)) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   711
         {thy_ref = merge_thys1 ct th,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   712
          tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   713
          maxidx = Int.max (maxidx, maxt),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   714
          shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   715
          hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   716
          tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   717
          prop = Term.betapply (A, t)})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   718
  | _ => raise THM ("forall_elim: not quantified", 0, [th]));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   719
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   720
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   721
(* Equality *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   722
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   723
(*Reflexivity
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   724
  t == t
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   725
*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   726
fun reflexive (ct as Cterm {thy_ref, t, T, maxidx, sorts}) =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   727
  Thm (deriv_rule0 Pt.reflexive,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   728
   {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   729
    tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   730
    maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   731
    shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   732
    hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   733
    tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   734
    prop = Logic.mk_equals (t, t)});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   735
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   736
(*Symmetry
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   737
  t == u
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   738
  ------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   739
  u == t
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   740
*)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   741
fun symmetric (th as Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...})) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   742
  (case prop of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   743
    (eq as Const ("==", Type (_, [T, _]))) $ t $ u =>
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   744
      Thm (deriv_rule1 Pt.symmetric der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   745
       {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   746
        tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   747
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   748
        shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   749
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   750
        tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   751
        prop = eq $ u $ t})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   752
    | _ => raise THM ("symmetric", 0, [th]));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   753
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   754
(*Transitivity
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   755
  t1 == u    u == t2
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   756
  ------------------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   757
       t1 == t2
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   758
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   759
fun transitive th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   760
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   761
    val Thm (der1, {maxidx = max1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   762
      prop = prop1, ...}) = th1
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   763
    and Thm (der2, {maxidx = max2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   764
      prop = prop2, ...}) = th2;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   765
    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
   766
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   767
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   768
      ((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
   769
        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
   770
        else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   771
          Thm (deriv_rule2 (Pt.transitive u T) der1 der2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   772
           {thy_ref = merge_thys2 th1 th2,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   773
            tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   774
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   775
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   776
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   777
            tpairs = union_tpairs tpairs1 tpairs2,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   778
            prop = eq $ t1 $ t2})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   779
     | _ =>  err "premises"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   780
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   781
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   782
(*Beta-conversion
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
   783
  (%x. t)(u) == t[u/x]
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   784
  fully beta-reduces the term if full = true
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   785
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   786
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
   787
  let val t' =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   788
    if full then Envir.beta_norm t
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   789
    else
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   790
      (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
   791
      | _ => raise THM ("beta_conversion: not a redex", 0, []));
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   792
  in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   793
    Thm (deriv_rule0 Pt.reflexive,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   794
     {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   795
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   796
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   797
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   798
      hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   799
      tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   800
      prop = Logic.mk_equals (t, t')})
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   801
  end;
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
   802
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   803
fun eta_conversion (Cterm {thy_ref, t, T, maxidx, sorts}) =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   804
  Thm (deriv_rule0 Pt.reflexive,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   805
   {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   806
    tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   807
    maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   808
    shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   809
    hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   810
    tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   811
    prop = Logic.mk_equals (t, Envir.eta_contract t)});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   812
23493
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   813
fun eta_long_conversion (Cterm {thy_ref, t, T, maxidx, sorts}) =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   814
  Thm (deriv_rule0 Pt.reflexive,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   815
   {thy_ref = thy_ref,
23493
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   816
    tags = [],
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   817
    maxidx = maxidx,
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   818
    shyps = sorts,
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   819
    hyps = [],
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   820
    tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   821
    prop = Logic.mk_equals (t, Pattern.eta_long [] t)});
23493
a056eefb76e5 added eta_long_conversion;
wenzelm
parents: 23296
diff changeset
   822
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   823
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   824
  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
   825
      t == u
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   826
  --------------
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   827
  %x. t == %x. u
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   828
*)
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   829
fun abstract_rule a
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   830
    (Cterm {t = x, T, sorts, ...})
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   831
    (th as Thm (der, {thy_ref, maxidx, hyps, shyps, tpairs, prop, ...})) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   832
  let
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   833
    val (t, u) = Logic.dest_equals prop
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   834
      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
   835
    val result =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   836
      Thm (deriv_rule1 (Pt.abstract_rule x a) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   837
       {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   838
        tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   839
        maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   840
        shyps = Sorts.union sorts shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   841
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   842
        tpairs = tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   843
        prop = Logic.mk_equals
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   844
          (Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))});
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   845
    fun check_occs a x ts =
16847
8fc160b12e73 invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents: 16725
diff changeset
   846
      if exists (fn t => Logic.occs (x, t)) ts then
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   847
        raise THM ("abstract_rule: variable " ^ quote a ^ " free in assumptions", 0, [th])
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   848
      else ();
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   849
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   850
    case x of
21798
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   851
      Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result)
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   852
    | Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result)
a1399df6ecf3 tuned error messages;
wenzelm
parents: 21646
diff changeset
   853
    | _ => raise THM ("abstract_rule: not a variable", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   854
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   855
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   856
(*The combination rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   857
  f == g  t == u
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   858
  --------------
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   859
    f t == g u
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   860
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
fun combination th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   862
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   863
    val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   864
      prop = prop1, ...}) = th1
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   865
    and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   866
      prop = prop2, ...}) = th2;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   867
    fun chktypes fT tT =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   868
      (case fT of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   869
        Type ("fun", [T1, T2]) =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   870
          if T1 <> tT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   871
            raise THM ("combination: types", 0, [th1, th2])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   872
          else ()
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   873
      | _ => 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
   874
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   875
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   876
      (Const ("==", Type ("fun", [fT, _])) $ f $ g,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   877
       Const ("==", Type ("fun", [tT, _])) $ t $ u) =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   878
        (chktypes fT tT;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   879
          Thm (deriv_rule2 (Pt.combination f g t u fT) der1 der2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   880
           {thy_ref = merge_thys2 th1 th2,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   881
            tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   882
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   883
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   884
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   885
            tpairs = union_tpairs tpairs1 tpairs2,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   886
            prop = Logic.mk_equals (f $ t, g $ u)}))
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   887
     | _ => raise THM ("combination: premises", 0, [th1, th2])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   888
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   889
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   890
(*Equality introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   891
  A ==> B  B ==> A
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   892
  ----------------
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   893
       A == B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   894
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   895
fun equal_intr th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   896
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   897
    val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   898
      prop = prop1, ...}) = th1
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   899
    and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   900
      prop = prop2, ...}) = th2;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   901
    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
   902
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   903
    case (prop1, prop2) of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   904
      (Const("==>", _) $ A $ B, Const("==>", _) $ B' $ A') =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   905
        if A aconv A' andalso B aconv B' then
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   906
          Thm (deriv_rule2 (Pt.equal_intr A B) der1 der2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   907
           {thy_ref = merge_thys2 th1 th2,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   908
            tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   909
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   910
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   911
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   912
            tpairs = union_tpairs tpairs1 tpairs2,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   913
            prop = Logic.mk_equals (A, B)})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   914
        else err "not equal"
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   915
    | _ =>  err "premises"
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   916
  end;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   917
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   918
(*The equal propositions rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   919
  A == B  A
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   920
  ---------
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   921
      B
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   922
*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   923
fun equal_elim th1 th2 =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   924
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   925
    val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   926
      tpairs = tpairs1, prop = prop1, ...}) = th1
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   927
    and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   928
      tpairs = tpairs2, prop = prop2, ...}) = th2;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   929
    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
   930
  in
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   931
    case prop1 of
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   932
      Const ("==", _) $ A $ B =>
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   933
        if prop2 aconv A then
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   934
          Thm (deriv_rule2 (Pt.equal_elim A B) der1 der2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   935
           {thy_ref = merge_thys2 th1 th2,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
   936
            tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   937
            maxidx = Int.max (max1, max2),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   938
            shyps = Sorts.union shyps1 shyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   939
            hyps = union_hyps hyps1 hyps2,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   940
            tpairs = union_tpairs tpairs1 tpairs2,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   941
            prop = B})
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   942
        else err "not equal"
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   943
     | _ =>  err"major premise"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   944
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   945
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   946
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   947
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   948
(**** Derived rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   949
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   950
(*Smash unifies the list of term pairs leaving no flex-flex pairs.
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   951
  Instantiates the theorem and deletes trivial tpairs.  Resulting
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   952
  sequence may contain multiple elements if the tpairs are not all
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   953
  flex-flex.*)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   954
fun flexflex_rule (th as Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...})) =
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   955
  let val thy = Theory.deref thy_ref in
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   956
    Unify.smash_unifiers thy tpairs (Envir.empty maxidx)
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   957
    |> Seq.map (fn env =>
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   958
        if Envir.is_empty env then th
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   959
        else
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   960
          let
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   961
            val tpairs' = tpairs |> map (pairself (Envir.norm_term env))
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   962
              (*remove trivial tpairs, of the form t==t*)
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   963
              |> filter_out (op aconv);
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   964
            val der' = deriv_rule1 (Pt.norm_proof' env) der;
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   965
            val prop' = Envir.norm_term env prop;
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   966
            val maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop');
26640
92e6d3ec91bd simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents: 26631
diff changeset
   967
            val shyps = Envir.insert_sorts env shyps;
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   968
          in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   969
            Thm (der', {thy_ref = Theory.check_thy thy, tags = [], maxidx = maxidx,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   970
              shyps = shyps, hyps = hyps, tpairs = tpairs', prop = prop'})
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   971
          end)
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
   972
  end;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
   973
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   974
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   975
(*Generalization of fixed variables
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   976
           A
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   977
  --------------------
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   978
  A[?'a/'a, ?x/x, ...]
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   979
*)
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   980
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   981
fun generalize ([], []) _ th = th
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   982
  | generalize (tfrees, frees) idx th =
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   983
      let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
   984
        val Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...}) = th;
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   985
        val _ = idx <= maxidx andalso raise THM ("generalize: bad index", idx, [th]);
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   986
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   987
        val bad_type = if null tfrees then K false else
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   988
          Term.exists_subtype (fn TFree (a, _) => member (op =) tfrees a | _ => false);
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   989
        fun bad_term (Free (x, T)) = bad_type T orelse member (op =) frees x
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   990
          | bad_term (Var (_, T)) = bad_type T
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   991
          | bad_term (Const (_, T)) = bad_type T
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   992
          | bad_term (Abs (_, T, t)) = bad_type T orelse bad_term t
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   993
          | bad_term (t $ u) = bad_term t orelse bad_term u
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   994
          | bad_term (Bound _) = false;
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   995
        val _ = exists bad_term hyps andalso
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   996
          raise THM ("generalize: variable free in assumptions", 0, [th]);
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   997
31977
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31947
diff changeset
   998
        val gen = Term_Subst.generalize (tfrees, frees) idx;
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
   999
        val prop' = gen prop;
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1000
        val tpairs' = map (pairself gen) tpairs;
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1001
        val maxidx' = maxidx_tpairs tpairs' (maxidx_of_term prop');
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1002
      in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1003
        Thm (deriv_rule1 (Pt.generalize (tfrees, frees) idx) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1004
         {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1005
          tags = [],
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1006
          maxidx = maxidx',
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1007
          shyps = shyps,
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1008
          hyps = hyps,
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1009
          tpairs = tpairs',
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1010
          prop = prop'})
19910
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1011
      end;
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1012
2b4a222fef3c added generalize rule;
wenzelm
parents: 19881
diff changeset
  1013
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1014
(*Instantiation of schematic variables
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1015
           A
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1016
  --------------------
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1017
  A[t1/v1, ..., tn/vn]
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1018
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1019
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1020
local
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1021
26939
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1022
fun pretty_typing thy t T = Pretty.block
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1023
  [Syntax.pretty_term_global thy t, Pretty.str " ::", Pretty.brk 1, Syntax.pretty_typ_global thy T];
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15672
diff changeset
  1024
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1025
fun add_inst (ct, cu) (thy_ref, sorts) =
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1026
  let
26939
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1027
    val Cterm {t = t, T = T, ...} = ct;
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1028
    val Cterm {t = u, T = U, sorts = sorts_u, maxidx = maxidx_u, ...} = cu;
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1029
    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
  1030
    val sorts' = Sorts.union sorts_u sorts;
3967
edd5ff9371f8 sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents: 3895
diff changeset
  1031
  in
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1032
    (case t of Var v =>
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
  1033
      if T = U then ((v, (u, maxidx_u)), (thy_ref', sorts'))
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1034
      else raise TYPE (Pretty.string_of (Pretty.block
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1035
       [Pretty.str "instantiate: type conflict",
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1036
        Pretty.fbrk, pretty_typing (Theory.deref thy_ref') t T,
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1037
        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
  1038
    | _ => raise TYPE (Pretty.string_of (Pretty.block
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1039
       [Pretty.str "instantiate: not a variable",
26939
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1040
        Pretty.fbrk, Syntax.pretty_term_global (Theory.deref thy_ref') t]), [], [t]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1041
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1042
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1043
fun add_instT (cT, cU) (thy_ref, sorts) =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1044
  let
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1045
    val Ctyp {T, thy_ref = thy_ref1, ...} = cT
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
  1046
    and Ctyp {T = U, thy_ref = thy_ref2, sorts = sorts_U, maxidx = maxidx_U, ...} = cU;
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
  1047
    val thy' = Theory.deref (Theory.merge_refs (thy_ref, Theory.merge_refs (thy_ref1, thy_ref2)));
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1048
    val sorts' = Sorts.union sorts_U sorts;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1049
  in
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1050
    (case T of TVar (v as (_, S)) =>
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
  1051
      if Sign.of_sort thy' (U, S) then ((v, (U, maxidx_U)), (Theory.check_thy thy', sorts'))
26939
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1052
      else raise TYPE ("Type not of sort " ^ Syntax.string_of_sort_global thy' S, [U], [])
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1053
    | _ => raise TYPE (Pretty.string_of (Pretty.block
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15672
diff changeset
  1054
        [Pretty.str "instantiate: not a type variable",
26939
1035c89b4c02 moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents: 26832
diff changeset
  1055
         Pretty.fbrk, Syntax.pretty_typ_global thy' T]), [T], []))
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1056
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1057
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1058
in
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1059
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1060
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...].
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1061
  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
  1062
  Does NOT normalize the resulting theorem!*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1063
fun instantiate ([], []) th = th
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1064
  | instantiate (instT, inst) th =
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1065
      let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1066
        val Thm (der, {thy_ref, hyps, shyps, tpairs, prop, ...}) = th;
16884
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1067
        val (inst', (instT', (thy_ref', shyps'))) =
1678a796b6b2 tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents: 16847
diff changeset
  1068
          (thy_ref, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT;
31977
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31947
diff changeset
  1069
        val subst = Term_Subst.instantiate_maxidx (instT', inst');
20512
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
  1070
        val (prop', maxidx1) = subst prop ~1;
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
  1071
        val (tpairs', maxidx') =
a041c2afb52e ctyp: maintain maxidx;
wenzelm
parents: 20348
diff changeset
  1072
          fold_map (fn (t, u) => fn i => subst t i ||>> subst u) tpairs maxidx1;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1073
      in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1074
        Thm (deriv_rule1 (fn d => Pt.instantiate (map (apsnd #1) instT', map (apsnd #1) inst') d) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1075
         {thy_ref = thy_ref',
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1076
          tags = [],
20545
4c1068697159 instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents: 20512
diff changeset
  1077
          maxidx = maxidx',
4c1068697159 instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents: 20512
diff changeset
  1078
          shyps = shyps',
4c1068697159 instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents: 20512
diff changeset
  1079
          hyps = hyps,
4c1068697159 instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents: 20512
diff changeset
  1080
          tpairs = tpairs',
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1081
          prop = prop'})
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1082
      end
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1083
      handle TYPE (msg, _, _) => raise THM (msg, 0, [th]);
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1084
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1085
fun instantiate_cterm ([], []) ct = ct
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1086
  | instantiate_cterm (instT, inst) ct =
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1087
      let
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1088
        val Cterm {thy_ref, t, T, sorts, ...} = ct;
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1089
        val (inst', (instT', (thy_ref', sorts'))) =
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1090
          (thy_ref, sorts) |> fold_map add_inst inst ||> fold_map add_instT instT;
31977
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31947
diff changeset
  1091
        val subst = Term_Subst.instantiate_maxidx (instT', inst');
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31947
diff changeset
  1092
        val substT = Term_Subst.instantiateT_maxidx instT';
22584
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1093
        val (t', maxidx1) = subst t ~1;
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1094
        val (T', maxidx') = substT T maxidx1;
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1095
      in Cterm {thy_ref = thy_ref', t = t', T = T', sorts = sorts', maxidx = maxidx'} end
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1096
      handle TYPE (msg, _, _) => raise CTERM (msg, [ct]);
d0f0f37ec346 improved exception CTERM;
wenzelm
parents: 22573
diff changeset
  1097
6928
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1098
end;
9b4cd97b459d improved error msgs of instantiate;
wenzelm
parents: 6899
diff changeset
  1099
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1100
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1101
(*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
  1102
  A can contain Vars, not so for assume!*)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1103
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
  1104
  if T <> propT then
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1105
    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
  1106
  else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1107
    Thm (deriv_rule0 (Pt.AbsP ("H", NONE, Pt.PBound 0)),
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1108
     {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1109
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1110
      maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1111
      shyps = sorts,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1112
      hyps = [],
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1113
      tpairs = [],
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1114
      prop = Logic.mk_implies (A, A)});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1115
31944
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1116
(*Axiom-scheme reflecting signature contents
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1117
        T :: c
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1118
  -------------------
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1119
  OFCLASS(T, c_class)
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1120
*)
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1121
fun of_class (cT, raw_c) =
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
  1122
  let
31944
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1123
    val Ctyp {thy_ref, T, ...} = cT;
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1124
    val thy = Theory.deref thy_ref;
31903
c5221dbc40f6 added pro-forma proof constructor Inclass;
wenzelm
parents: 30717
diff changeset
  1125
    val c = Sign.certify_class thy raw_c;
31944
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1126
    val Cterm {t = prop, maxidx, sorts, ...} = cterm_of thy (Logic.mk_of_class (T, c));
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1127
  in
31944
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1128
    if Sign.of_sort thy (T, [c]) then
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1129
      Thm (deriv_rule0 (Pt.OfClass (T, c)),
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1130
       {thy_ref = Theory.check_thy thy,
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1131
        tags = [],
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1132
        maxidx = maxidx,
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1133
        shyps = sorts,
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1134
        hyps = [],
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1135
        tpairs = [],
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1136
        prop = prop})
c8a35979a5bc clarified Thm.of_class/of_sort/class_triv;
wenzelm
parents: 31943
diff changeset
  1137
    else raise THM ("of_class: type not of class " ^ Syntax.string_of_sort_global thy [c], 0, [])
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1138
  end;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1139
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1140
(*Internalize sort constraints of type variable*)
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1141
fun unconstrainT
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1142
    (Ctyp {thy_ref = thy_ref1, T, ...})
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1143
    (th as Thm (_, {thy_ref = thy_ref2, maxidx, shyps, hyps, tpairs, prop, ...})) =
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1144
  let
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1145
    val ((x, i), S) = Term.dest_TVar T handle TYPE _ =>
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1146
      raise THM ("unconstrainT: not a type variable", 0, [th]);
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1147
    val T' = TVar ((x, i), []);
20548
8ef25fe585a8 renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents: 20545
diff changeset
  1148
    val unconstrain = Term.map_types (Term.map_atyps (fn U => if U = T then T' else U));
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31905
diff changeset
  1149
    val constraints = map (curry Logic.mk_of_class T') S;
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1150
  in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1151
    Thm (deriv_rule0 (Pt.PAxm ("Pure.unconstrainT", prop, SOME [])),
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1152
     {thy_ref = Theory.merge_refs (thy_ref1, thy_ref2),
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1153
      tags = [],
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1154
      maxidx = Int.max (maxidx, i),
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1155
      shyps = Sorts.remove_sort S shyps,
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1156
      hyps = hyps,
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1157
      tpairs = map (pairself unconstrain) tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1158
      prop = Logic.list_implies (constraints, unconstrain prop)})
19505
0b345cf953c4 added unconstrainT;
wenzelm
parents: 19475
diff changeset
  1159
  end;
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1160
6786
0af1797d5315 varifyT': observe additional 'fixed' tfrees;
wenzelm
parents: 6539
diff changeset
  1161
(* Replace all TFrees not fixed or in the hyps by new TVars *)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1162
fun varifyT' fixed (Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...})) =
12500
0a6667d65e9b varifyT' returns newly introduces variables;
wenzelm
parents: 11692
diff changeset
  1163
  let
29272
fb3ccf499df5 use regular Term.add_XXX etc.;
wenzelm
parents: 29269
diff changeset
  1164
    val tfrees = fold Term.add_tfrees hyps fixed;
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1165
    val prop1 = attach_tpairs tpairs prop;
21116
be58cded79da fixed type signature of Type.varify
haftmann
parents: 20972
diff changeset
  1166
    val (al, prop2) = Type.varify tfrees prop1;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1167
    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
  1168
  in
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1169
    (al, Thm (deriv_rule1 (Pt.varify_proof prop tfrees) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1170
     {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1171
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1172
      maxidx = Int.max (0, maxidx),
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1173
      shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1174
      hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1175
      tpairs = rev (map Logic.dest_equals ts),
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1176
      prop = prop3}))
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1177
  end;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1178
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1179
val varifyT = #2 o varifyT' [];
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1180
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1181
(* Replace all TVars by new TFrees *)
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1182
fun freezeT (Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...})) =
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1183
  let
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1184
    val prop1 = attach_tpairs tpairs prop;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1185
    val prop2 = Type.freeze prop1;
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1186
    val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2);
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1187
  in
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1188
    Thm (deriv_rule1 (Pt.freezeT prop1) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1189
     {thy_ref = thy_ref,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1190
      tags = [],
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1191
      maxidx = maxidx_of_term prop2,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1192
      shyps = shyps,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1193
      hyps = hyps,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1194
      tpairs = rev (map Logic.dest_equals ts),
18127
9f03d8a9a81b Thm.varifyT': natural argument order;
wenzelm
parents: 18035
diff changeset
  1195
      prop = prop3})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1196
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1197
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1198
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1199
(*** Inference rules for tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1200
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1201
(*Destruct proof state into constraints, other goals, goal(i), rest *)
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1202
fun dest_state (state as Thm (_, {prop,tpairs,...}), i) =
13658
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1203
  (case  Logic.strip_prems(i, [], prop) of
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1204
      (B::rBs, C) => (tpairs, rev rBs, B, C)
c9ad3e64ddcf Changed handling of flex-flex constraints: now stored in separate
berghofe
parents: 13642
diff changeset
  1205
    | _ => raise THM("dest_state", i, [state]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1206
  handle TERM _ => raise THM("dest_state", i, [state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1207
309
3751567696bf restored the signature constraint :THM
lcp
parents: 305
diff changeset
  1208
(*Increment variables and parameters of orule as required for
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1209
  resolution with a goal.*)
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1210
fun lift_rule goal orule =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1211
  let
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1212
    val Cterm {t = gprop, T, maxidx = gmax, sorts, ...} = goal;
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1213
    val inc = gmax + 1;
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1214
    val lift_abs = Logic.lift_abs inc gprop;
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1215
    val lift_all = Logic.lift_all inc gprop;
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1216
    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
  1217
    val (As, B) = Logic.strip_horn prop;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1218
  in
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1219
    if T <> propT then raise THM ("lift_rule: the term must have type prop", 0, [])
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1220
    else
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1221
      Thm (deriv_rule1 (Pt.lift_proof gprop inc prop) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1222
       {thy_ref = merge_thys1 goal orule,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1223
        tags = [],
18035
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1224
        maxidx = maxidx + inc,
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1225
        shyps = Sorts.union shyps sorts,  (*sic!*)
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1226
        hyps = hyps,
eaae44affc9e added cgoal_of;
wenzelm
parents: 17868
diff changeset
  1227
        tpairs = map (pairself lift_abs) tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1228
        prop = Logic.list_implies (map lift_all As, lift_all B)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1229
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1230
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1231
fun incr_indexes i (thm as Thm (der, {thy_ref, maxidx, shyps, hyps, tpairs, prop, ...})) =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1232
  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
  1233
  else if i = 0 then thm
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1234
  else
32027
9dd548810ed1 tuned incr_indexes;
wenzelm
parents: 31977
diff changeset
  1235
    Thm (deriv_rule1 (Pt.incr_indexes i) der,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1236
     {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1237
      tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1238
      maxidx = maxidx + i,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1239
      shyps = shyps,
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 = map (pairself (Logic.incr_indexes ([], i))) tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1242
      prop = Logic.incr_indexes ([], i) prop});
10416
5b33e732e459 - Moved rewriting functions to meta_simplifier.ML
berghofe
parents: 10348
diff changeset
  1243
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1244
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1245
fun assumption i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1246
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1247
    val Thm (der, {thy_ref, maxidx, shyps, hyps, prop, ...}) = state;
16656
18b0cb22057d ctyp: added 'sorts' field;
wenzelm
parents: 16601
diff changeset
  1248
    val thy = Theory.deref thy_ref;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1249
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
32032
a6a6e8031c14 tuned/modernized Envir operations;
wenzelm
parents: 32027
diff changeset
  1250
    fun newth n (env, tpairs) =
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1251
      Thm (deriv_rule1
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1252
          ((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
  1253
            Pt.assumption_proof Bs Bi n) der,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1254
       {tags = [],
32032
a6a6e8031c14 tuned/modernized Envir operations;
wenzelm
parents: 32027
diff changeset
  1255
        maxidx = Envir.maxidx_of env,
26640
92e6d3ec91bd simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents: 26631
diff changeset
  1256
        shyps = Envir.insert_sorts env shyps,
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1257
        hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1258
        tpairs =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1259
          if Envir.is_empty env then tpairs
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1260
          else map (pairself (Envir.norm_term env)) tpairs,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1261
        prop =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1262
          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
  1263
            Logic.list_implies (Bs, C)
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1264
          else (*normalize the new rule fully*)
24143
90a9a6fe0d01 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 23781
diff changeset
  1265
            Envir.norm_term env (Logic.list_implies (Bs, C)),
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1266
        thy_ref = Theory.check_thy thy});
30554
73f8bd5f0af8 substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents: 30466
diff changeset
  1267
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1268
    val (close, asms, concl) = Logic.assum_problems (~1, Bi);
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1269
    val concl' = close concl;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1270
    fun addprfs [] _ = Seq.empty
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1271
      | addprfs (asm :: rest) n = Seq.make (fn () => Seq.pull
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1272
          (Seq.mapp (newth n)
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1273
            (if Term.could_unify (asm, concl) then
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1274
              (Unify.unifiers (thy, Envir.empty maxidx, (close asm, concl') :: tpairs))
30554
73f8bd5f0af8 substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents: 30466
diff changeset
  1275
             else Seq.empty)
73f8bd5f0af8 substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents: 30466
diff changeset
  1276
            (addprfs rest (n + 1))))
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1277
  in addprfs asms 1 end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1278
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1279
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1280
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1281
fun eq_assumption i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1282
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1283
    val Thm (der, {thy_ref, maxidx, shyps, hyps, prop, ...}) = state;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1284
    val (tpairs, Bs, Bi, C) = dest_state (state, i);
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1285
    val (_, asms, concl) = Logic.assum_problems (~1, Bi);
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1286
  in
30556
7be15917f3fa eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents: 30554
diff changeset
  1287
    (case find_index (fn asm => Pattern.aeconv (asm, concl)) asms of
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1288
      ~1 => raise THM ("eq_assumption", 0, [state])
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1289
    | n =>
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1290
        Thm (deriv_rule1 (Pt.assumption_proof Bs Bi (n + 1)) der,
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1291
         {thy_ref = thy_ref,
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21576
diff changeset
  1292
          tags = [],
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1293
          maxidx = maxidx,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1294
          shyps = shyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1295
          hyps = hyps,
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1296
          tpairs = tpairs,
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1297
          prop = Logic.list_implies (Bs, C)}))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1298
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1299
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1300
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1301
(*For rotate_tac: fast rotation of assumptions of subgoal i*)
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1302
fun rotate_rule k i state =
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1303
  let
28321
9f4499bf9384 type thm: fully internal derivation, no longer exported;
wenzelm
parents: 28290
diff changeset
  1304
    val Thm (der, {thy_ref, maxidx, shyps, hyps, prop, ...}) = state;
16601
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1305
    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
  1306
    val params = Term.strip_all_vars Bi
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1307
    and rest   = Term.strip_all_body Bi;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1308
    val asms   = Logic.strip_imp_prems rest
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1309
    and concl  = Logic.strip_imp_concl rest;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1310
    val n = length asms;
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1311
    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
  1312
    val Bi' =
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1313
      if 0 = m orelse m = n then Bi
ee8eefade568 more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents: 16425
diff changeset
  1314
      else if 0 < m andalso m < n the