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