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