src/Pure/thm.ML
author paulson
Tue, 22 Jul 1997 11:14:18 +0200
changeset 3538 ed9de44032e0
parent 3529 31186470665f
child 3550 2c833cb21f8d
permissions -rw-r--r--
Removal of the tactical STATE
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
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
     6
The core of Isabelle's Meta Logic: certified types and terms, meta
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
     7
theorems, meta rules (including resolution and simplification).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
    10
signature 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
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    14
  val rep_ctyp          : ctyp -> {sign: Sign.sg, T: typ}
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    15
  val typ_of            : ctyp -> typ
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    16
  val ctyp_of           : Sign.sg -> typ -> ctyp
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    17
  val read_ctyp         : Sign.sg -> string -> ctyp
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    18
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    19
  (*certified terms*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    20
  type cterm
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    21
  exception CTERM of string
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    22
  val rep_cterm         : cterm -> {sign: Sign.sg, t: term, T: typ,
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    23
                                    maxidx: int}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    24
  val term_of           : cterm -> term
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    25
  val cterm_of          : Sign.sg -> term -> cterm
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    26
  val ctyp_of_term      : cterm -> ctyp
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    27
  val read_cterm        : Sign.sg -> string * typ -> cterm
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
    28
  val read_cterms       : Sign.sg -> string list * typ list -> cterm list
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    29
  val cterm_fun         : (term -> term) -> (cterm -> cterm)
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    30
  val dest_comb         : cterm -> cterm * cterm
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    31
  val dest_abs          : cterm -> cterm * cterm
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1659
diff changeset
    32
  val adjust_maxidx     : cterm -> cterm
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
    33
  val capply            : cterm -> cterm -> cterm
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
    34
  val cabs              : cterm -> cterm -> cterm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    35
  val read_def_cterm    :
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    36
    Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    37
    string list -> bool -> string * typ -> cterm * (indexname * typ) list
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    38
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    39
  (*theories*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    40
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    41
  (*proof terms [must DUPLICATE declaration as a specification]*)
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    42
  datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    43
  val keep_derivs       : deriv_kind ref
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    44
  datatype rule = 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    45
      MinProof                          
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    46
    | Oracle of theory * Sign.sg * exn
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    47
    | Axiom               of theory * string
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    48
    | Theorem             of string       
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    49
    | Assume              of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    50
    | Implies_intr        of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    51
    | Implies_intr_shyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    52
    | Implies_intr_hyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    53
    | Implies_elim 
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    54
    | Forall_intr         of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    55
    | Forall_elim         of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    56
    | Reflexive           of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    57
    | Symmetric 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    58
    | Transitive
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    59
    | Beta_conversion     of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    60
    | Extensional
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    61
    | Abstract_rule       of string * cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    62
    | Combination
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    63
    | Equal_intr
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    64
    | Equal_elim
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    65
    | Trivial             of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    66
    | Lift_rule           of cterm * int 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    67
    | Assumption          of int * Envir.env option
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    68
    | Rotate_rule         of int * int
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    69
    | Instantiate         of (indexname * ctyp) list * (cterm * cterm) list
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    70
    | Bicompose           of bool * bool * int * int * Envir.env
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    71
    | Flexflex_rule       of Envir.env            
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    72
    | Class_triv          of theory * class       
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    73
    | VarifyT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    74
    | FreezeT
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    75
    | RewriteC            of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    76
    | CongC               of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    77
    | Rewrite_cterm       of cterm
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
    78
    | Rename_params_rule  of string list * int;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    79
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    80
  type deriv   (* = rule mtree *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    81
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    82
  (*meta theorems*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    83
  type thm
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    84
  exception THM of string * int * thm list
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    85
  val rep_thm           : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    86
                                  shyps: sort list, hyps: term list, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    87
                                  prop: term}
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    88
  val crep_thm          : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    89
                                  shyps: sort list, hyps: cterm list, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
    90
                                  prop: cterm}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    91
  val stamps_of_thm     : thm -> string ref list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    92
  val tpairs_of         : thm -> (term * term) list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    93
  val prems_of          : thm -> term list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    94
  val nprems_of         : thm -> int
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    95
  val concl_of          : thm -> term
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    96
  val cprop_of          : thm -> cterm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    97
  val extra_shyps       : thm -> sort list
3061
25b2a895f864 improved tmp comment;
wenzelm
parents: 3037
diff changeset
    98
  val force_strip_shyps : bool ref      (* FIXME tmp (since 1995/08/01) *)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    99
  val strip_shyps       : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   100
  val implies_intr_shyps: thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   101
  val get_axiom         : theory -> string -> thm
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   102
  val name_thm          : string * thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   103
  val axioms_of         : theory -> (string * thm) list
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   104
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   105
  (*meta rules*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   106
  val assume            : cterm -> thm
1416
f59857e32972 Commented the datatype declaration of thm.
paulson
parents: 1394
diff changeset
   107
  val compress          : thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   108
  val implies_intr      : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   109
  val implies_elim      : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   110
  val forall_intr       : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   111
  val forall_elim       : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   112
  val flexpair_def      : thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   113
  val reflexive         : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   114
  val symmetric         : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   115
  val transitive        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   116
  val beta_conversion   : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   117
  val extensional       : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   118
  val abstract_rule     : string -> cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   119
  val combination       : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   120
  val equal_intr        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   121
  val equal_elim        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   122
  val implies_intr_hyps : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   123
  val flexflex_rule     : thm -> thm Sequence.seq
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   124
  val instantiate       :
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   125
    (indexname * ctyp) list * (cterm * cterm) list -> thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   126
  val trivial           : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   127
  val class_triv        : theory -> class -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   128
  val varifyT           : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   129
  val freezeT           : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   130
  val dest_state        : thm * int ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   131
    (term * term) list * term list * term * term
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   132
  val lift_rule         : (thm * int) -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   133
  val assumption        : int -> thm -> thm Sequence.seq
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   134
  val eq_assumption     : int -> thm -> thm
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   135
  val rotate_rule       : int -> int -> thm -> thm
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   136
  val rename_params_rule: string list * int -> thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   137
  val bicompose         : bool -> bool * thm * int ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   138
    int -> thm -> thm Sequence.seq
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   139
  val biresolution      : bool -> (bool * thm) list ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   140
    int -> thm -> thm Sequence.seq
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   141
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   142
  (*meta simplification*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   143
  type meta_simpset
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   144
  exception SIMPLIFIER of string * thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   145
  val empty_mss         : meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   146
  val add_simps         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   147
  val del_simps         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   148
  val mss_of            : thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   149
  val add_congs         : meta_simpset * thm list -> meta_simpset
2626
373daa468a74 added del_congs
oheimb
parents: 2620
diff changeset
   150
  val del_congs         : meta_simpset * thm list -> meta_simpset
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   151
  val add_simprocs	: meta_simpset *
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   152
    (Sign.sg * term * (Sign.sg -> term -> thm option) * stamp) list -> meta_simpset
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   153
  val del_simprocs	: meta_simpset *
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   154
    (Sign.sg * term * (Sign.sg -> term -> thm option) * stamp) list -> meta_simpset
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   155
  val add_prems         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   156
  val prems_of_mss      : meta_simpset -> thm list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   157
  val set_mk_rews       : meta_simpset * (thm -> thm list) -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   158
  val mk_rews_of_mss    : meta_simpset -> thm -> thm list
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   159
  val set_termless      : meta_simpset * (term * term -> bool) -> meta_simpset
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   160
  val trace_simp        : bool ref
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   161
  val rewrite_cterm     : bool * bool -> meta_simpset ->
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   162
                          (meta_simpset -> thm -> thm option) -> cterm -> thm
1539
f21c8fab7c3c Addition of oracles
paulson
parents: 1529
diff changeset
   163
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   164
  val invoke_oracle     : theory * Sign.sg * exn -> thm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   165
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   166
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
   167
structure Thm : THM =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   168
struct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   169
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   170
(*** Certified terms and types ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   171
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   172
(** certified types **)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   173
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   174
(*certified typs under a signature*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   175
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   176
datatype ctyp = Ctyp of {sign: Sign.sg, T: typ};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   177
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   178
fun rep_ctyp (Ctyp args) = args;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   179
fun typ_of (Ctyp {T, ...}) = T;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   180
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   181
fun ctyp_of sign T =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   182
  Ctyp {sign = sign, T = Sign.certify_typ sign T};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   183
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   184
fun read_ctyp sign s =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   185
  Ctyp {sign = sign, T = Sign.read_typ (sign, K None) s};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   186
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   187
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   188
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   189
(** certified terms **)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   190
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   191
(*certified terms under a signature, with checked typ and maxidx of Vars*)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   192
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   193
datatype cterm = Cterm of {sign: Sign.sg, t: term, T: typ, maxidx: int};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   194
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   195
fun rep_cterm (Cterm args) = args;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   196
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
   197
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   198
fun ctyp_of_term (Cterm {sign, T, ...}) = Ctyp {sign=sign, T=T};
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   199
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   200
(*create a cterm by checking a "raw" term with respect to a signature*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   201
fun cterm_of sign tm =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   202
  let val (t, T, maxidx) = Sign.certify_term sign tm
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   203
  in  Cterm {sign = sign, t = t, T = T, maxidx = maxidx}
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   204
  end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   205
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   206
fun cterm_fun f (Cterm {sign, t, ...}) = cterm_of sign (f t);
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   207
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   208
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   209
exception CTERM of string;
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   210
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   211
(*Destruct application in cterms*)
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   212
fun dest_comb (Cterm{sign, T, maxidx, t = A $ B}) =
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   213
      let val typeA = fastype_of A;
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   214
          val typeB =
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   215
            case typeA of Type("fun",[S,T]) => S
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   216
                        | _ => error "Function type expected in dest_comb";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   217
      in
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   218
      (Cterm {sign=sign, maxidx=maxidx, t=A, T=typeA},
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   219
       Cterm {sign=sign, maxidx=maxidx, t=B, T=typeB})
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   220
      end
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   221
  | dest_comb _ = raise CTERM "dest_comb";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   222
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   223
(*Destruct abstraction in cterms*)
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   224
fun dest_abs (Cterm {sign, T as Type("fun",[_,S]), maxidx, t=Abs(x,ty,M)}) = 
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   225
      let val (y,N) = variant_abs (x,ty,M)
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   226
      in (Cterm {sign = sign, T = ty, maxidx = 0, t = Free(y,ty)},
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   227
          Cterm {sign = sign, T = S, maxidx = maxidx, t = N})
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   228
      end
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   229
  | dest_abs _ = raise CTERM "dest_abs";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   230
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   231
(*Makes maxidx precise: it is often too big*)
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   232
fun adjust_maxidx (ct as Cterm {sign, T, t, maxidx, ...}) =
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   233
  if maxidx = ~1 then ct 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   234
  else  Cterm {sign = sign, T = T, maxidx = maxidx_of_term t, t = t};
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1659
diff changeset
   235
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   236
(*Form cterm out of a function and an argument*)
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   237
fun capply (Cterm {t=f, sign=sign1, T=Type("fun",[dty,rty]), maxidx=maxidx1})
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   238
           (Cterm {t=x, sign=sign2, T, maxidx=maxidx2}) =
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   239
      if T = dty then Cterm{t=f$x, sign=Sign.merge(sign1,sign2), T=rty,
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   240
                            maxidx=Int.max(maxidx1, maxidx2)}
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   241
      else raise CTERM "capply: types don't agree"
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   242
  | capply _ _ = raise CTERM "capply: first arg is not a function"
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   243
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   244
fun cabs (Cterm {t=Free(a,ty), sign=sign1, T=T1, maxidx=maxidx1})
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   245
         (Cterm {t=t2, sign=sign2, T=T2, maxidx=maxidx2}) =
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   246
      Cterm {t=absfree(a,ty,t2), sign=Sign.merge(sign1,sign2),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   247
             T = ty --> T2, maxidx=Int.max(maxidx1, maxidx2)}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   248
  | cabs _ _ = raise CTERM "cabs: first arg is not a free variable";
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   249
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   250
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   251
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   252
(** read cterms **)   (*exception ERROR*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   253
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   254
(*read term, infer types, certify term*)
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   255
fun read_def_cterm (sign, types, sorts) used freeze (a, T) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   256
  let
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   257
    val T' = Sign.certify_typ sign T
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   258
      handle TYPE (msg, _, _) => error msg;
623
ca9f5dbab880 added print_msg;
clasohm
parents: 622
diff changeset
   259
    val ts = Syntax.read (#syn (Sign.rep_sg sign)) T' a;
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   260
    val (_, t', tye) =
959
35c2e5e114c4 removed print_msg parameter of infer_types
clasohm
parents: 949
diff changeset
   261
          Sign.infer_types sign types sorts used freeze (ts, T');
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   262
    val ct = cterm_of sign t'
2979
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   263
      handle TYPE (msg, _, _) => error msg
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   264
           | TERM (msg, _) => error msg;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   265
  in (ct, tye) end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   266
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   267
fun read_cterm sign = #1 o read_def_cterm (sign, K None, K None) [] true;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   268
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   269
(*read a list of terms, matching them against a list of expected types.
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   270
  NO disambiguation of alternative parses via type-checking -- it is just
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   271
  not practical.*)
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   272
fun read_cterms sign (bs, Ts) =
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   273
  let
2979
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   274
    val {tsig, syn, ...} = Sign.rep_sg sign;
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   275
    fun read (b, T) =
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   276
      (case Syntax.read syn T b of
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   277
        [t] => t
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   278
      | _  => error ("Error or ambiguity in parsing of " ^ b));
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   279
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   280
    val prt = setmp Syntax.show_brackets true (Sign.pretty_term sign);
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   281
    val prT = Sign.pretty_typ sign;
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   282
    val (us, _) =
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   283
      Type.infer_types prt prT tsig (Sign.const_type sign)
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   284
        (K None) (K None) [] true (map (Sign.certify_typ sign) Ts)
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   285
        (ListPair.map read (bs, Ts));
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   286
  in map (cterm_of sign) us end
db6941221197 improved type check error messages;
wenzelm
parents: 2962
diff changeset
   287
  handle TYPE (msg, _, _) => error msg
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   288
       | TERM (msg, _) => error msg;
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   289
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   290
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   291
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   292
(*** Derivations ***)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   293
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   294
(*Names of rules in derivations.  Includes logically trivial rules, if 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   295
  executed in ML.*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   296
datatype rule = 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   297
    MinProof                            (*for building minimal proof terms*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   298
  | Oracle              of theory * Sign.sg * exn       (*oracles*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   299
(*Axioms/theorems*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   300
  | Axiom               of theory * string
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   301
  | Theorem             of string
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   302
(*primitive inferences and compound versions of them*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   303
  | Assume              of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   304
  | Implies_intr        of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   305
  | Implies_intr_shyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   306
  | Implies_intr_hyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   307
  | Implies_elim 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   308
  | Forall_intr         of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   309
  | Forall_elim         of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   310
  | Reflexive           of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   311
  | Symmetric 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   312
  | Transitive
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   313
  | Beta_conversion     of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   314
  | Extensional
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   315
  | Abstract_rule       of string * cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   316
  | Combination
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   317
  | Equal_intr
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   318
  | Equal_elim
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   319
(*derived rules for tactical proof*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   320
  | Trivial             of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   321
        (*For lift_rule, the proof state is not a premise.
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   322
          Use cterm instead of thm to avoid mutual recursion.*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   323
  | Lift_rule           of cterm * int 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   324
  | Assumption          of int * Envir.env option (*includes eq_assumption*)
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   325
  | Rotate_rule         of int * int
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   326
  | Instantiate         of (indexname * ctyp) list * (cterm * cterm) list
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   327
  | Bicompose           of bool * bool * int * int * Envir.env
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   328
  | Flexflex_rule       of Envir.env            (*identifies unifier chosen*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   329
(*other derived rules*)
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   330
  | Class_triv          of theory * class
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   331
  | VarifyT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   332
  | FreezeT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   333
(*for the simplifier*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   334
  | RewriteC            of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   335
  | CongC               of cterm
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   336
  | Rewrite_cterm       of cterm
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   337
(*Logical identities, recorded since they are part of the proof process*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   338
  | Rename_params_rule  of string list * int;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   339
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   340
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   341
type deriv = rule mtree;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   342
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   343
datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   344
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   345
val keep_derivs = ref MinDeriv;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   346
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   347
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   348
(*Build a minimal derivation.  Keep oracles; suppress atomic inferences;
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   349
  retain Theorems or their underlying links; keep anything else*)
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   350
fun squash_derivs [] = []
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   351
  | squash_derivs (der::ders) =
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   352
     (case der of
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   353
          Join (Oracle _, _) => der :: squash_derivs ders
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   354
        | Join (Theorem _, [der']) => if !keep_derivs=ThmDeriv 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   355
                                      then der :: squash_derivs ders
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   356
                                      else squash_derivs (der'::ders)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   357
        | Join (Axiom _, _) => if !keep_derivs=ThmDeriv 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   358
                               then der :: squash_derivs ders
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   359
                               else squash_derivs ders
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   360
        | Join (_, [])      => squash_derivs ders
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   361
        | _                 => der :: squash_derivs ders);
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   362
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   363
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   364
(*Ensure sharing of the most likely derivation, the empty one!*)
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   365
val min_infer = Join (MinProof, []);
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   366
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   367
(*Make a minimal inference*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   368
fun make_min_infer []    = min_infer
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   369
  | make_min_infer [der] = der
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   370
  | make_min_infer ders  = Join (MinProof, ders);
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   371
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   372
fun infer_derivs (rl, [])   = Join (rl, [])
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   373
  | infer_derivs (rl, ders) =
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   374
    if !keep_derivs=FullDeriv then Join (rl, ders)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   375
    else make_min_infer (squash_derivs ders);
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   376
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   377
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   378
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   379
(*** Meta theorems ***)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   380
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   381
datatype thm = Thm of
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   382
  {sign: Sign.sg,               (*signature for hyps and prop*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   383
   der: deriv,                  (*derivation*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   384
   maxidx: int,                 (*maximum index of any Var or TVar*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   385
   shyps: sort list,            (*sort hypotheses*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   386
   hyps: term list,             (*hypotheses*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   387
   prop: term};                 (*conclusion*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   388
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   389
fun rep_thm (Thm args) = args;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   390
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   391
(*Version of rep_thm returning cterms instead of terms*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   392
fun crep_thm (Thm {sign, der, maxidx, shyps, hyps, prop}) =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   393
  let fun ctermf max t = Cterm{sign=sign, t=t, T=propT, maxidx=max};
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   394
  in {sign=sign, der=der, maxidx=maxidx, shyps=shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   395
      hyps = map (ctermf ~1) hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   396
      prop = ctermf maxidx prop}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   397
  end;
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   398
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   399
(*errors involving theorems*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
exception THM of string * int * thm list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   401
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   402
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   403
val stamps_of_thm = #stamps o Sign.rep_sg o #sign o rep_thm;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   404
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   405
(*merge signatures of two theorems; raise exception if incompatible*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   406
fun merge_thm_sgs (th1, th2) =
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   407
  Sign.merge (pairself (#sign o rep_thm) (th1, th2))
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   408
    handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]);
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   409
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   410
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   411
(*maps object-rule to tpairs*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   412
fun tpairs_of (Thm {prop, ...}) = #1 (Logic.strip_flexpairs prop);
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   413
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   414
(*maps object-rule to premises*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   415
fun prems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   416
  Logic.strip_imp_prems (Logic.skip_flexpairs prop);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   417
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   418
(*counts premises in a rule*)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   419
fun nprems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   420
  Logic.count_prems (Logic.skip_flexpairs prop, 0);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   421
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   422
(*maps object-rule to conclusion*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   423
fun concl_of (Thm {prop, ...}) = Logic.strip_imp_concl prop;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   424
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   425
(*the statement of any thm is a cterm*)
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   426
fun cprop_of (Thm {sign, maxidx, prop, ...}) =
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   427
  Cterm {sign = sign, maxidx = maxidx, T = propT, t = prop};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   428
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   429
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   430
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   431
(** sort contexts of theorems **)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   432
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   433
(* basic utils *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   434
2163
4d43e7486164 tuned fix_shyps a little bit more;
wenzelm
parents: 2147
diff changeset
   435
(*accumulate sorts suppressing duplicates; these are coded low levelly
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   436
  to improve efficiency a bit*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   437
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   438
fun add_typ_sorts (Type (_, Ts), Ss) = add_typs_sorts (Ts, Ss)
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   439
  | add_typ_sorts (TFree (_, S), Ss) = ins_sort(S,Ss)
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   440
  | add_typ_sorts (TVar (_, S), Ss) = ins_sort(S,Ss)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   441
and add_typs_sorts ([], Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   442
  | add_typs_sorts (T :: Ts, Ss) = add_typs_sorts (Ts, add_typ_sorts (T, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   443
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   444
fun add_term_sorts (Const (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   445
  | add_term_sorts (Free (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   446
  | add_term_sorts (Var (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   447
  | add_term_sorts (Bound _, Ss) = Ss
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   448
  | add_term_sorts (Abs (_,T,t), Ss) = add_term_sorts (t, add_typ_sorts (T,Ss))
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   449
  | add_term_sorts (t $ u, Ss) = add_term_sorts (t, add_term_sorts (u, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   450
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   451
fun add_terms_sorts ([], Ss) = Ss
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   452
  | add_terms_sorts (t::ts, Ss) = add_terms_sorts (ts, add_term_sorts (t,Ss));
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   453
1258
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   454
fun env_codT (Envir.Envir {iTs, ...}) = map snd iTs;
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   455
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   456
fun add_env_sorts (env, Ss) =
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   457
  add_terms_sorts (map snd (Envir.alist_of env),
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   458
    add_typs_sorts (env_codT env, Ss));
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   459
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   460
fun add_thm_sorts (Thm {hyps, prop, ...}, Ss) =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   461
  add_terms_sorts (hyps, add_term_sorts (prop, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   462
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   463
fun add_thms_shyps ([], Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   464
  | add_thms_shyps (Thm {shyps, ...} :: ths, Ss) =
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   465
      add_thms_shyps (ths, union_sort(shyps,Ss));
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   466
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   467
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   468
(*get 'dangling' sort constraints of a thm*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   469
fun extra_shyps (th as Thm {shyps, ...}) =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   470
  shyps \\ add_thm_sorts (th, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   471
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   472
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   473
(* fix_shyps *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   474
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   475
(*preserve sort contexts of rule premises and substituted types*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   476
fun fix_shyps thms Ts thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   477
  let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   478
    val Thm {sign, der, maxidx, hyps, prop, ...} = thm;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   479
    val shyps =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   480
      add_thm_sorts (thm, add_typs_sorts (Ts, add_thms_shyps (thms, [])));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   481
  in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   482
    Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   483
         der = der,             (*No new derivation, as other rules call this*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   484
         maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   485
         shyps = shyps, hyps = hyps, prop = prop}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   486
  end;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   487
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   488
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   489
(* strip_shyps *)       (* FIXME improve? (e.g. only minimal extra sorts) *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   490
3061
25b2a895f864 improved tmp comment;
wenzelm
parents: 3037
diff changeset
   491
val force_strip_shyps = ref true;  (* FIXME tmp (since 1995/08/01) *)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   492
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   493
(*remove extra sorts that are known to be syntactically non-empty*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   494
fun strip_shyps thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   495
  let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   496
    val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   497
    val sorts = add_thm_sorts (thm, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   498
    val maybe_empty = not o Sign.nonempty_sort sign sorts;
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
   499
    val shyps' = filter (fn S => mem_sort(S,sorts) orelse maybe_empty S) shyps;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   500
  in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   501
    Thm {sign = sign, der = der, maxidx = maxidx,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   502
         shyps =
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   503
         (if eq_set_sort (shyps',sorts) orelse 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   504
             not (!force_strip_shyps) then shyps'
3061
25b2a895f864 improved tmp comment;
wenzelm
parents: 3037
diff changeset
   505
          else    (* FIXME tmp (since 1995/08/01) *)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   506
              (warning ("Removed sort hypotheses: " ^
2962
97ae96c72d8c Sorts.str_of_sort;
wenzelm
parents: 2792
diff changeset
   507
                        commas (map Sorts.str_of_sort (shyps' \\ sorts)));
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   508
               warning "Let's hope these sorts are non-empty!";
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   509
           sorts)),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   510
      hyps = hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   511
      prop = prop}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   512
  end;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   513
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   514
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   515
(* implies_intr_shyps *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   516
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   517
(*discharge all extra sort hypotheses*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   518
fun implies_intr_shyps thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   519
  (case extra_shyps thm of
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   520
    [] => thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   521
  | xshyps =>
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   522
      let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   523
        val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
2182
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2177
diff changeset
   524
        val shyps' = ins_sort (logicS, shyps \\ xshyps);
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   525
        val used_names = foldr add_term_tfree_names (prop :: hyps, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   526
        val names =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   527
          tl (variantlist (replicate (length xshyps + 1) "'", used_names));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   528
        val tfrees = map (TFree o rpair logicS) names;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   529
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   530
        fun mk_insort (T, S) = map (Logic.mk_inclass o pair T) S;
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
   531
        val sort_hyps = List.concat (map2 mk_insort (tfrees, xshyps));
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   532
      in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   533
        Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   534
             der = infer_derivs (Implies_intr_shyps, [der]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   535
             maxidx = maxidx, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   536
             shyps = shyps',
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   537
             hyps = hyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   538
             prop = Logic.list_implies (sort_hyps, prop)}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   539
      end);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   540
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   541
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   542
(** Axioms **)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   543
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   544
(*look up the named axiom in the theory*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   545
fun get_axiom theory name =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   546
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   547
    fun get_ax [] = raise Match
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   548
      | get_ax (thy :: thys) =
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   549
          let val {sign, new_axioms, parents, ...} = rep_theory thy
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   550
          in case Symtab.lookup (new_axioms, name) of
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   551
                Some t => fix_shyps [] []
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   552
                           (Thm {sign = sign, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   553
                                 der = infer_derivs (Axiom(theory,name), []),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   554
                                 maxidx = maxidx_of_term t,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   555
                                 shyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   556
                                 hyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   557
                                 prop = t})
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   558
              | None => get_ax parents handle Match => get_ax thys
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   559
          end;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   560
  in
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   561
    get_ax [theory] handle Match
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   562
      => raise THEORY ("get_axiom: no axiom " ^ quote name, [theory])
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   563
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   564
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   565
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   566
(*return additional axioms of this theory node*)
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   567
fun axioms_of thy =
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   568
  map (fn (s, _) => (s, get_axiom thy s))
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   569
    (Symtab.dest (#new_axioms (rep_theory thy)));
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   570
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   571
(*Attach a label to a theorem to make proof objects more readable*)
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   572
fun name_thm (name, th as Thm {sign, der, maxidx, shyps, hyps, prop}) = 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   573
    Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   574
         der = Join (Theorem name, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   575
         maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   576
         shyps = shyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   577
         hyps = hyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   578
         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.*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   583
fun compress (Thm {sign, der, maxidx, shyps, hyps, prop}) = 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   584
    Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   585
         der = der,     (*No derivation recorded!*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   586
         maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   587
         shyps = shyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   588
         hyps = map Term.compress_term hyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   589
         prop = Term.compress_term prop};
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   590
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   591
2509
0a7169d89b7a added termless parameter;
wenzelm
parents: 2386
diff changeset
   592
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   593
(*** Meta rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   594
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   595
(*Check that term does not contain same var with different typing/sorting.
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   596
  If this check must be made, recalculate maxidx in hope of preventing its
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   597
  recurrence.*)
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   598
fun nodup_Vars (thm as Thm{sign, der, maxidx, shyps, hyps, prop}) s =
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   599
  (Sign.nodup_Vars prop; 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   600
   Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   601
         der = der,     
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   602
         maxidx = maxidx_of_term prop,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   603
         shyps = shyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   604
         hyps = hyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   605
         prop = prop})
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   606
  handle TYPE(msg,Ts,ts) => raise TYPE(s^": "^msg,Ts,ts);
1495
b8b54847c77f Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents: 1493
diff changeset
   607
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   608
(** 'primitive' rules **)
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   609
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   610
(*discharge all assumptions t from ts*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   611
val disch = gen_rem (op aconv);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   612
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   613
(*The assumption rule A|-A in a theory*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   614
fun assume ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   615
  let val {sign, t=prop, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   616
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   617
        raise THM("assume: assumptions must have type prop", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   618
      else if maxidx <> ~1 then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   619
        raise THM("assume: assumptions may not contain scheme variables",
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   620
                  maxidx, [])
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   621
      else Thm{sign   = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   622
               der    = infer_derivs (Assume ct, []), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   623
               maxidx = ~1, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   624
               shyps  = add_term_sorts(prop,[]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   625
               hyps   = [prop], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   626
               prop   = prop}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   627
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   628
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   629
(*Implication introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   630
    [A]
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   631
     :
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   632
     B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   633
  -------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   634
  A ==> B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   635
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   636
fun implies_intr cA (thB as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   637
  let val {sign=signA, t=A, T, maxidx=maxidxA} = rep_cterm cA
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   638
  in  if T<>propT then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   639
        raise THM("implies_intr: assumptions must have type prop", 0, [thB])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   640
      else fix_shyps [thB] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   641
        (Thm{sign = Sign.merge (sign,signA),  
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   642
             der = infer_derivs (Implies_intr cA, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   643
             maxidx = Int.max(maxidxA, maxidx),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   644
             shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   645
             hyps = disch(hyps,A),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   646
             prop = implies$A$prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   647
      handle TERM _ =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   648
        raise THM("implies_intr: incompatible signatures", 0, [thB])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   649
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   650
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   651
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   652
(*Implication elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   653
  A ==> B    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   654
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   655
        B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   656
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   657
fun implies_elim thAB thA : thm =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   658
    let val Thm{maxidx=maxA, der=derA, hyps=hypsA, prop=propA,...} = thA
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   659
        and Thm{sign, der, maxidx, hyps, prop,...} = thAB;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   660
        fun err(a) = raise THM("implies_elim: "^a, 0, [thAB,thA])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   661
    in  case prop of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   662
            imp$A$B =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   663
                if imp=implies andalso  A aconv propA
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   664
                then fix_shyps [thAB, thA] []
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   665
                       (Thm{sign= merge_thm_sgs(thAB,thA),
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   666
                            der = infer_derivs (Implies_elim, [der,derA]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   667
                            maxidx = Int.max(maxA,maxidx),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   668
                            shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   669
                            hyps = union_term(hypsA,hyps),  (*dups suppressed*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   670
                            prop = B})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   671
                else err("major premise")
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   672
          | _ => err("major premise")
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   673
    end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   674
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   675
(*Forall introduction.  The Free or Var x must not be free in the hypotheses.
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   676
    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   677
  -----
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   678
  !!x.A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   679
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   680
fun forall_intr cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   681
  let val x = term_of cx;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   682
      fun result(a,T) = fix_shyps [th] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   683
        (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   684
             der = infer_derivs (Forall_intr cx, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   685
             maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   686
             shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   687
             hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   688
             prop = all(T) $ Abs(a, T, abstract_over (x,prop))})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   689
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   690
        Free(a,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   691
          if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   692
          then  raise THM("forall_intr: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   693
          else  result(a,T)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   694
      | Var((a,_),T) => result(a,T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   695
      | _ => raise THM("forall_intr: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   696
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   697
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   698
(*Forall elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   699
  !!x.A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   700
  ------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   701
  A[t/x]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   702
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   703
fun forall_elim ct (th as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   704
  let val {sign=signt, t, T, maxidx=maxt} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   705
  in  case prop of
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   706
        Const("all",Type("fun",[Type("fun",[qary,_]),_])) $ A =>
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   707
          if T<>qary then
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   708
              raise THM("forall_elim: type mismatch", 0, [th])
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   709
          else let val thm = fix_shyps [th] []
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   710
                    (Thm{sign= Sign.merge(sign,signt),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   711
                         der = infer_derivs (Forall_elim ct, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   712
                         maxidx = Int.max(maxidx, maxt),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   713
                         shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   714
                         hyps = hyps,  
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   715
                         prop = betapply(A,t)})
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   716
               in if maxt >= 0 andalso maxidx >= 0
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   717
                  then nodup_Vars thm "forall_elim" 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   718
                  else thm (*no new Vars: no expensive check!*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   719
               end
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   720
      | _ => raise THM("forall_elim: not quantified", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   721
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   722
  handle TERM _ =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   723
         raise THM("forall_elim: incompatible signatures", 0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   724
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   725
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   726
(* Equality *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   727
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   728
(* Definition of the relation =?= *)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   729
val flexpair_def = fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   730
  (Thm{sign= Sign.proto_pure, 
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   731
       der = Join(Axiom(pure_thy, "flexpair_def"), []),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   732
       shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   733
       hyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   734
       maxidx = 0,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   735
       prop = term_of (read_cterm Sign.proto_pure
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   736
                       ("(?t =?= ?u) == (?t == ?u::?'a::{})", propT))});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   737
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   738
(*The reflexivity rule: maps  t   to the theorem   t==t   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   739
fun reflexive ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   740
  let val {sign, t, T, maxidx} = rep_cterm ct
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   741
  in  fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   742
       (Thm{sign= sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   743
            der = infer_derivs (Reflexive ct, []),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   744
            shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   745
            hyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   746
            maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   747
            prop = Logic.mk_equals(t,t)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   748
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   749
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   750
(*The symmetry rule
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   751
  t==u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   752
  ----
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   753
  u==t
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   754
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   755
fun symmetric (th as Thm{sign,der,maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   757
      (eq as Const("==",_)) $ t $ u =>
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   758
        (*no fix_shyps*)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   759
          Thm{sign = sign,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   760
              der = infer_derivs (Symmetric, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   761
              maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   762
              shyps = shyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   763
              hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   764
              prop = eq$u$t}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   765
    | _ => raise THM("symmetric", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   766
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   767
(*The transitive rule
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   768
  t1==u    u==t2
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   769
  --------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   770
      t1==t2
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   771
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   772
fun transitive th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   773
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   774
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   775
      fun err(msg) = raise THM("transitive: "^msg, 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   776
  in case (prop1,prop2) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   777
       ((eq as Const("==",_)) $ t1 $ u, Const("==",_) $ u' $ t2) =>
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
   778
          if not (u aconv u') then err"middle term"
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
   779
          else let val thm =      
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   780
              fix_shyps [th1, th2] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   781
                (Thm{sign= merge_thm_sgs(th1,th2), 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   782
                     der = infer_derivs (Transitive, [der1, der2]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   783
                     maxidx = Int.max(max1,max2), 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   784
                     shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   785
                     hyps = union_term(hyps1,hyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   786
                     prop = eq$t1$t2})
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   787
                 in if max1 >= 0 andalso max2 >= 0
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   788
                    then nodup_Vars thm "transitive" 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   789
                    else thm (*no new Vars: no expensive check!*)
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   790
                 end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   791
     | _ =>  err"premises"
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   792
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   793
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   794
(*Beta-conversion: maps (%x.t)(u) to the theorem (%x.t)(u) == t[u/x] *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   795
fun beta_conversion ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   796
  let val {sign, t, T, maxidx} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   797
  in  case t of
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   798
          Abs(_,_,bodt) $ u => fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   799
            (Thm{sign = sign,  
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   800
                 der = infer_derivs (Beta_conversion ct, []),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   801
                 maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   802
                 shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   803
                 hyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   804
                 prop = Logic.mk_equals(t, subst_bound (u,bodt))})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   805
        | _ =>  raise THM("beta_conversion: not a redex", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   806
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   807
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   808
(*The extensionality rule   (proviso: x not free in f, g, or hypotheses)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   809
  f(x) == g(x)
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   810
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   811
     f == g
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   812
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   813
fun extensional (th as Thm{sign, der, maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   814
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   815
    (Const("==",_)) $ (f$x) $ (g$y) =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   816
      let fun err(msg) = raise THM("extensional: "^msg, 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   817
      in (if x<>y then err"different variables" else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   818
          case y of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   819
                Free _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   820
                  if exists (apl(y, Logic.occs)) (f::g::hyps)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   821
                  then err"variable free in hyps or functions"    else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   822
              | Var _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   823
                  if Logic.occs(y,f)  orelse  Logic.occs(y,g)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   824
                  then err"variable free in functions"   else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   825
              | _ => err"not a variable");
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   826
          (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   827
          Thm{sign = sign,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   828
              der = infer_derivs (Extensional, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   829
              maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   830
              shyps = shyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   831
              hyps = hyps, 
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   832
              prop = Logic.mk_equals(f,g)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   833
      end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   834
 | _ =>  raise THM("extensional: premise", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   835
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   836
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   837
  The bound variable will be named "a" (since x will be something like x320)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   838
     t == u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   839
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   840
  %x.t == %x.u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   841
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   842
fun abstract_rule a cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   843
  let val x = term_of cx;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   844
      val (t,u) = Logic.dest_equals prop
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   845
            handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   846
                raise THM("abstract_rule: premise not an equality", 0, [th])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   847
      fun result T = fix_shyps [th] []
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   848
          (Thm{sign = sign,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   849
               der = infer_derivs (Abstract_rule (a,cx), [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   850
               maxidx = maxidx, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   851
               shyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   852
               hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   853
               prop = Logic.mk_equals(Abs(a, T, abstract_over (x,t)),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   854
                                      Abs(a, T, abstract_over (x,u)))})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   855
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   856
        Free(_,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   857
         if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   858
         then raise THM("abstract_rule: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   859
         else result T
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   860
      | Var(_,T) => result T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
      | _ => raise THM("abstract_rule: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   862
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   863
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   864
(*The combination rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   865
  f == g  t == u
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   866
  --------------
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   867
   f(t) == g(u)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   868
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   869
fun combination th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   870
  let val Thm{der=der1, maxidx=max1, shyps=shyps1, hyps=hyps1, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   871
              prop=prop1,...} = th1
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   872
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   873
              prop=prop2,...} = th2
1836
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   874
      fun chktypes (f,t) =
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   875
            (case fastype_of f of
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   876
                Type("fun",[T1,T2]) => 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   877
                    if T1 <> fastype_of t then
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   878
                         raise THM("combination: types", 0, [th1,th2])
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   879
                    else ()
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   880
                | _ => raise THM("combination: not function type", 0, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   881
                                 [th1,th2]))
1495
b8b54847c77f Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents: 1493
diff changeset
   882
  in case (prop1,prop2)  of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   883
       (Const("==",_) $ f $ g, Const("==",_) $ t $ u) =>
1836
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   884
          let val _   = chktypes (f,t)
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   885
              val thm = (*no fix_shyps*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   886
                        Thm{sign = merge_thm_sgs(th1,th2), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   887
                            der = infer_derivs (Combination, [der1, der2]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   888
                            maxidx = Int.max(max1,max2), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   889
                            shyps = union_sort(shyps1,shyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   890
                            hyps = union_term(hyps1,hyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   891
                            prop = Logic.mk_equals(f$t, g$u)}
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   892
          in if max1 >= 0 andalso max2 >= 0
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   893
             then nodup_Vars thm "combination" 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   894
             else thm (*no new Vars: no expensive check!*)  
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   895
          end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   896
     | _ =>  raise THM("combination: premises", 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   897
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   898
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   899
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   900
(* Equality introduction
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   901
  A ==> B  B ==> A
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   902
  ----------------
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   903
       A == B
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   904
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   905
fun equal_intr th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   906
  let val Thm{der=der1,maxidx=max1, shyps=shyps1, hyps=hyps1, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   907
              prop=prop1,...} = th1
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   908
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   909
              prop=prop2,...} = th2;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   910
      fun err(msg) = raise THM("equal_intr: "^msg, 0, [th1,th2])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   911
  in case (prop1,prop2) of
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   912
       (Const("==>",_) $ A $ B, Const("==>",_) $ B' $ A')  =>
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   913
          if A aconv A' andalso B aconv B'
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   914
          then
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   915
            (*no fix_shyps*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   916
              Thm{sign = merge_thm_sgs(th1,th2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   917
                  der = infer_derivs (Equal_intr, [der1, der2]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   918
                  maxidx = Int.max(max1,max2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   919
                  shyps = union_sort(shyps1,shyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   920
                  hyps = union_term(hyps1,hyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   921
                  prop = Logic.mk_equals(A,B)}
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   922
          else err"not equal"
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   923
     | _ =>  err"premises"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   924
  end;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   925
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   926
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   927
(*The equal propositions rule
3529
31186470665f tuned warning;
wenzelm
parents: 3410
diff changeset
   928
  A == B  A
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   929
  ---------
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   930
      B
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   931
*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   932
fun equal_elim th1 th2 =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   933
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   934
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   935
      fun err(msg) = raise THM("equal_elim: "^msg, 0, [th1,th2])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   936
  in  case prop1  of
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   937
       Const("==",_) $ A $ B =>
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   938
          if not (prop2 aconv A) then err"not equal"  else
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   939
            fix_shyps [th1, th2] []
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   940
              (Thm{sign= merge_thm_sgs(th1,th2), 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   941
                   der = infer_derivs (Equal_elim, [der1, der2]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   942
                   maxidx = Int.max(max1,max2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   943
                   shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   944
                   hyps = union_term(hyps1,hyps2),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   945
                   prop = B})
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   946
     | _ =>  err"major premise"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   947
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   948
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   949
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   950
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   951
(**** Derived rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   952
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
   953
(*Discharge all hypotheses.  Need not verify cterms or call fix_shyps.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   954
  Repeated hypotheses are discharged only once;  fold cannot do this*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   955
fun implies_intr_hyps (Thm{sign, der, maxidx, shyps, hyps=A::As, prop}) =
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   956
      implies_intr_hyps (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   957
            (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   958
                 der = infer_derivs (Implies_intr_hyps, [der]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   959
                 maxidx = maxidx, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   960
                 shyps = shyps,
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   961
                 hyps = disch(As,A),  
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   962
                 prop = implies$A$prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   963
  | implies_intr_hyps th = th;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   964
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   965
(*Smash" unifies the list of term pairs leaving no flex-flex pairs.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   966
  Instantiates the theorem and deletes trivial tpairs.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   967
  Resulting sequence may contain multiple elements if the tpairs are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   968
    not all flex-flex. *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   969
fun flexflex_rule (th as Thm{sign, der, maxidx, hyps, prop,...}) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   970
  let fun newthm env =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   971
          if Envir.is_empty env then th
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   972
          else
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   973
          let val (tpairs,horn) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   974
                        Logic.strip_flexpairs (Envir.norm_term env prop)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   975
                (*Remove trivial tpairs, of the form t=t*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   976
              val distpairs = filter (not o op aconv) tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   977
              val newprop = Logic.list_flexpairs(distpairs, horn)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   978
          in  fix_shyps [th] (env_codT env)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   979
                (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   980
                     der = infer_derivs (Flexflex_rule env, [der]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   981
                     maxidx = maxidx_of_term newprop, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   982
                     shyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   983
                     hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
   984
                     prop = newprop})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   985
          end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   986
      val (tpairs,_) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   987
  in Sequence.maps newthm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   988
            (Unify.smash_unifiers(sign, Envir.empty maxidx, tpairs))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   989
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   990
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   991
(*Instantiation of Vars
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   992
           A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   993
  -------------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   994
  A[t1/v1,....,tn/vn]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   995
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   996
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   997
(*Check that all the terms are Vars and are distinct*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   998
fun instl_ok ts = forall is_Var ts andalso null(findrep ts);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   999
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1000
(*For instantiate: process pair of cterms, merge theories*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1001
fun add_ctpair ((ct,cu), (sign,tpairs)) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1002
  let val {sign=signt, t=t, T= T, ...} = rep_cterm ct
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1003
      and {sign=signu, t=u, T= U, ...} = rep_cterm cu
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1004
  in  if T=U  then (Sign.merge(sign, Sign.merge(signt, signu)), (t,u)::tpairs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1005
      else raise TYPE("add_ctpair", [T,U], [t,u])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1006
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1007
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1008
fun add_ctyp ((v,ctyp), (sign',vTs)) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1009
  let val {T,sign} = rep_ctyp ctyp
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1010
  in (Sign.merge(sign,sign'), (v,T)::vTs) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1011
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1012
(*Left-to-right replacements: ctpairs = [...,(vi,ti),...].
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1013
  Instantiates distinct Vars by terms of same type.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1014
  Normalizes the new theorem! *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1015
fun instantiate ([], []) th = th
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1016
  | instantiate (vcTs,ctpairs)  (th as Thm{sign,der,maxidx,hyps,prop,...}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1017
  let val (newsign,tpairs) = foldr add_ctpair (ctpairs, (sign,[]));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1018
      val (newsign,vTs) = foldr add_ctyp (vcTs, (newsign,[]));
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1019
      val newprop =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1020
            Envir.norm_term (Envir.empty 0)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1021
              (subst_atomic tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1022
               (Type.inst_term_tvars(#tsig(Sign.rep_sg newsign),vTs) prop))
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1023
      val newth =
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1024
            fix_shyps [th] (map snd vTs)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1025
              (Thm{sign = newsign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1026
                   der = infer_derivs (Instantiate(vcTs,ctpairs), [der]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1027
                   maxidx = maxidx_of_term newprop, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1028
                   shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1029
                   hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1030
                   prop = newprop})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1031
  in  if not(instl_ok(map #1 tpairs))
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1032
      then raise THM("instantiate: variables not distinct", 0, [th])
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1033
      else if not(null(findrep(map #1 vTs)))
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1034
      then raise THM("instantiate: type variables not distinct", 0, [th])
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1035
      else nodup_Vars newth "instantiate"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1036
  end
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1037
  handle TERM _ =>
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1038
           raise THM("instantiate: incompatible signatures",0,[th])
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1039
       | TYPE (msg,_,_) => raise THM("instantiate: type conflict: " ^ msg, 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1040
				     0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1041
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1042
(*The trivial implication A==>A, justified by assume and forall rules.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1043
  A can contain Vars, not so for assume!   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1044
fun trivial ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1045
  let val {sign, t=A, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1046
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1047
            raise THM("trivial: the term must have type prop", 0, [])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1048
      else fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1049
        (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1050
             der = infer_derivs (Trivial ct, []), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1051
             maxidx = maxidx, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1052
             shyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1053
             hyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1054
             prop = implies$A$A})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1055
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1056
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
  1057
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *)
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1058
fun class_triv thy c =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1059
  let val sign = sign_of thy;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1060
      val Cterm {t, maxidx, ...} =
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1061
          cterm_of sign (Logic.mk_inclass (TVar (("'a", 0), [c]), c))
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1062
            handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1063
  in
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1064
    fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1065
      (Thm {sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1066
            der = infer_derivs (Class_triv(thy,c), []), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1067
            maxidx = maxidx, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1068
            shyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1069
            hyps = [], 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1070
            prop = t})
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1071
  end;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1072
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1073
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1074
(* Replace all TFrees not in the hyps by new TVars *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1075
fun varifyT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1076
  let val tfrees = foldr add_term_tfree_names (hyps,[])
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1077
  in let val thm = (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1078
    Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1079
        der = infer_derivs (VarifyT, [der]), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1080
        maxidx = Int.max(0,maxidx), 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1081
        shyps = shyps, 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1082
        hyps = hyps,
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1083
        prop = Type.varify(prop,tfrees)}
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1084
     in nodup_Vars thm "varifyT" end
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1085
(* this nodup_Vars check can be removed if thms are guaranteed not to contain
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1086
duplicate TVars with differnt sorts *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1087
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1088
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1089
(* Replace all TVars by new TFrees *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1090
fun freezeT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
3410
98f59f455d57 freezeT now refers to Type.freeze_thaw
paulson
parents: 3061
diff changeset
  1091
  let val (prop',_) = Type.freeze_thaw prop
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1092
  in (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1093
    Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1094
        der = infer_derivs (FreezeT, [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1095
        maxidx = maxidx_of_term prop',
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1096
        shyps = shyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1097
        hyps = hyps,
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1098
        prop = prop'}
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1099
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1100
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1101
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1102
(*** Inference rules for tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1103
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1104
(*Destruct proof state into constraints, other goals, goal(i), rest *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1105
fun dest_state (state as Thm{prop,...}, i) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1106
  let val (tpairs,horn) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1107
  in  case  Logic.strip_prems(i, [], horn) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1108
          (B::rBs, C) => (tpairs, rev rBs, B, C)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1109
        | _ => raise THM("dest_state", i, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1110
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1111
  handle TERM _ => raise THM("dest_state", i, [state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1112
309
3751567696bf restored the signature constraint :THM
lcp
parents: 305
diff changeset
  1113
(*Increment variables and parameters of orule as required for
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1114
  resolution with goal i of state. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1115
fun lift_rule (state, i) orule =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1116
  let val Thm{shyps=sshyps, prop=sprop, maxidx=smax, sign=ssign,...} = state
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1117
      val (Bi::_, _) = Logic.strip_prems(i, [], Logic.skip_flexpairs sprop)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1118
        handle TERM _ => raise THM("lift_rule", i, [orule,state])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1119
      val ct_Bi = Cterm {sign=ssign, maxidx=smax, T=propT, t=Bi}
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1120
      val (lift_abs,lift_all) = Logic.lift_fns(Bi,smax+1)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1121
      val (Thm{sign, der, maxidx,shyps,hyps,prop}) = orule
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1122
      val (tpairs,As,B) = Logic.strip_horn prop
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1123
  in  (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1124
      Thm{sign = merge_thm_sgs(state,orule),
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1125
          der = infer_derivs (Lift_rule(ct_Bi, i), [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1126
          maxidx = maxidx+smax+1,
2177
8b365a3a6ed1 Changed some mem, ins and union calls to be monomorphic
paulson
parents: 2163
diff changeset
  1127
          shyps=union_sort(sshyps,shyps), 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1128
          hyps=hyps, 
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1129
          prop = Logic.rule_of (map (pairself lift_abs) tpairs,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1130
                                map lift_all As,    
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1131
                                lift_all B)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1132
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1133
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1134
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1135
fun assumption i state =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1136
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1137
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1138
      fun newth (env as Envir.Envir{maxidx, ...}, tpairs) =
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1139
        fix_shyps [state] (env_codT env)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1140
          (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1141
               der = infer_derivs (Assumption (i, Some env), [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1142
               maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1143
               shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1144
               hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1145
               prop = 
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1146
               if Envir.is_empty env then (*avoid wasted normalizations*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1147
                   Logic.rule_of (tpairs, Bs, C)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1148
               else (*normalize the new rule fully*)
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1149
                   Envir.norm_term env (Logic.rule_of (tpairs, Bs, C))});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1150
      fun addprfs [] = Sequence.null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1151
        | addprfs ((t,u)::apairs) = Sequence.seqof (fn()=> Sequence.pull
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1152
             (Sequence.mapp newth
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1153
                (Unify.unifiers(sign,Envir.empty maxidx, (t,u)::tpairs))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1154
                (addprfs apairs)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1155
  in  addprfs (Logic.assum_pairs Bi)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1156
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1157
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1158
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1159
fun eq_assumption i state =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1160
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1161
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1162
  in  if exists (op aconv) (Logic.assum_pairs Bi)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1163
      then fix_shyps [state] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1164
             (Thm{sign = sign, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1165
                  der = infer_derivs (Assumption (i,None), [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1166
                  maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1167
                  shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1168
                  hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1169
                  prop = Logic.rule_of(tpairs, Bs, C)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1170
      else  raise THM("eq_assumption", 0, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1171
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1172
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1173
2671
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1174
(*For rotate_tac: fast rotation of assumptions of subgoal i*)
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1175
fun rotate_rule k i state =
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1176
  let val Thm{sign,der,maxidx,hyps,prop,shyps} = state;
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1177
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1178
      val params = Logic.strip_params Bi
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1179
      and asms   = Logic.strip_assums_hyp Bi
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1180
      and concl  = Logic.strip_assums_concl Bi
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1181
      val n      = length asms
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1182
      fun rot m  = if 0=m orelse m=n then Bi
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1183
		   else if 0<m andalso m<n 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1184
		   then list_all 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1185
			   (params, 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1186
			    Logic.list_implies(List.drop(asms, m) @ 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1187
					       List.take(asms, m),
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1188
					       concl))
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1189
		   else raise THM("rotate_rule", m, [state])
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1190
  in  Thm{sign = sign, 
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1191
	  der = infer_derivs (Rotate_rule (k,i), [der]),
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1192
	  maxidx = maxidx,
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1193
	  shyps = shyps,
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1194
	  hyps = hyps,
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1195
	  prop = Logic.rule_of(tpairs, Bs@[rot (if k<0 then n+k else k)], C)}
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1196
  end;
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1197
510d94c71dda Introduction of rotate_rule
paulson
parents: 2626
diff changeset
  1198
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1199
(** User renaming of parameters in a subgoal **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1200
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1201
(*Calls error rather than raising an exception because it is intended
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1202
  for top-level use -- exception handling would not make sense here.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1203
  The names in cs, if distinct, are used for the innermost parameters;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1204
   preceding parameters may be renamed to make all params distinct.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1205
fun rename_params_rule (cs, i) state =
3037
99ed078e6ae7 rename_params_rule used to check if the new name clashed with a free name in
nipkow
parents: 3012
diff changeset
  1206
  let val Thm{sign,der,maxidx,hyps,...} = state
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1207
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1208
      val iparams = map #1 (Logic.strip_params Bi)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1209
      val short = length iparams - length cs
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1210
      val newnames =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1211
            if short<0 then error"More names than abstractions!"
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1212
            else variantlist(take (short,iparams), cs) @ cs
3037
99ed078e6ae7 rename_params_rule used to check if the new name clashed with a free name in
nipkow
parents: 3012
diff changeset
  1213
      val freenames = map (#1 o dest_Free) (term_frees Bi)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1214
      val newBi = Logic.list_rename_params (newnames, Bi)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1215
  in
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1216
  case findrep cs of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1217
     c::_ => error ("Bound variables not distinct: " ^ c)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1218
   | [] => (case cs inter_string freenames of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1219
       a::_ => error ("Bound/Free variable clash: " ^ a)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1220
     | [] => fix_shyps [state] []
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1221
                (Thm{sign = sign,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1222
                     der = infer_derivs (Rename_params_rule(cs,i), [der]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1223
                     maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1224
                     shyps = [],
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1225
                     hyps = hyps,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1226
                     prop = Logic.rule_of(tpairs, Bs@[newBi], C)}))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1227
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1228
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1229
(*** Preservation of bound variable names ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1230
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1231
(*Scan a pair of terms; while they are similar,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1232
  accumulate corresponding bound vars in "al"*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1233
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
1195
686e3eb613b9 match_bvs no longer puts a name in the alist if it is null ("")
lcp
parents: 1160
diff changeset
  1234
      match_bvs(s, t, if x="" orelse y="" then al
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1235
                                          else (x,y)::al)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1236
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1237
  | match_bvs(_,_,al) = al;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1238
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1239
(* strip abstractions created by parameters *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1240
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1241
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1242
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1243
(* strip_apply f A(,B) strips off all assumptions/parameters from A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1244
   introduced by lifting over B, and applies f to remaining part of A*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1245
fun strip_apply f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1246
  let fun strip(Const("==>",_)$ A1 $ B1,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1247
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1248
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1249
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1250
        | strip(A,_) = f A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1251
  in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1252
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1253
(*Use the alist to rename all bound variables and some unknowns in a term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1254
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1255
  Preserves unknowns in tpairs and on lhs of dpairs. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1256
fun rename_bvs([],_,_,_) = I
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1257
  | rename_bvs(al,dpairs,tpairs,B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1258
    let val vars = foldr add_term_vars
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1259
                        (map fst dpairs @ map fst tpairs @ map snd tpairs, [])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1260
        (*unknowns appearing elsewhere be preserved!*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1261
        val vids = map (#1 o #1 o dest_Var) vars;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1262
        fun rename(t as Var((x,i),T)) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1263
                (case assoc(al,x) of
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1264
                   Some(y) => if x mem_string vids orelse y mem_string vids then t
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1265
                              else Var((y,i),T)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1266
                 | None=> t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1267
          | rename(Abs(x,T,t)) =
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1268
              Abs(case assoc_string(al,x) of Some(y) => y | None => x,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1269
                  T, rename t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1270
          | rename(f$t) = rename f $ rename t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1271
          | rename(t) = t;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1272
        fun strip_ren Ai = strip_apply rename (Ai,B)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1273
    in strip_ren end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1274
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1275
(*Function to rename bounds/unknowns in the argument, lifted over B*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1276
fun rename_bvars(dpairs, tpairs, B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1277
        rename_bvs(foldr match_bvars (dpairs,[]), dpairs, tpairs, B);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1278
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1279
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1280
(*** RESOLUTION ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1281
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1282
(** Lifting optimizations **)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1283
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1284
(*strip off pairs of assumptions/parameters in parallel -- they are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1285
  identical because of lifting*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1286
fun strip_assums2 (Const("==>", _) $ _ $ B1,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1287
                   Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1288
  | strip_assums2 (Const("all",_)$Abs(a,T,t1),
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1289
                   Const("all",_)$Abs(_,_,t2)) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1290
      let val (B1,B2) = strip_assums2 (t1,t2)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1291
      in  (Abs(a,T,B1), Abs(a,T,B2))  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1292
  | strip_assums2 BB = BB;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1293
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1294
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1295
(*Faster normalization: skip assumptions that were lifted over*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1296
fun norm_term_skip env 0 t = Envir.norm_term env t
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1297
  | norm_term_skip env n (Const("all",_)$Abs(a,T,t)) =
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1298
        let val Envir.Envir{iTs, ...} = env
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1299
            val T' = typ_subst_TVars iTs T
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1300
            (*Must instantiate types of parameters because they are flattened;
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1301
              this could be a NEW parameter*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1302
        in  all T' $ Abs(a, T', norm_term_skip env n t)  end
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1303
  | norm_term_skip env n (Const("==>", _) $ A $ B) =
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1304
        implies $ A $ norm_term_skip env (n-1) B
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1305
  | norm_term_skip env n t = error"norm_term_skip: too few assumptions??";
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1306
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1307
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1308
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1309
  Unifies B with Bi, replacing subgoal i    (1 <= i <= n)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1310
  If match then forbid instantiations in proof state
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1311
  If lifted then shorten the dpair using strip_assums2.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1312
  If eres_flg then simultaneously proves A1 by assumption.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1313
  nsubgoal is the number of new subgoals (written m above).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1314
  Curried so that resolution calls dest_state only once.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1315
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1316
local open Sequence; exception COMPOSE
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1317
in
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1318
fun bicompose_aux match (state, (stpairs, Bs, Bi, C), lifted)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1319
                        (eres_flg, orule, nsubgoal) =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1320
 let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1321
     and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps, 
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1322
             prop=rprop,...} = orule
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1323
         (*How many hyps to skip over during normalization*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1324
     and nlift = Logic.count_prems(strip_all_body Bi,
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1325
                                   if eres_flg then ~1 else 0)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
  1326
     val sign = merge_thm_sgs(state,orule);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1327
     (** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1328
     fun addth As ((env as Envir.Envir {maxidx, ...}, tpairs), thq) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1329
       let val normt = Envir.norm_term env;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1330
           (*perform minimal copying here by examining env*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1331
           val normp =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1332
             if Envir.is_empty env then (tpairs, Bs @ As, C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1333
             else
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1334
             let val ntps = map (pairself normt) tpairs
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1335
             in if Envir.above (smax, env) then
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1336
                  (*no assignments in state; normalize the rule only*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1337
                  if lifted
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1338
                  then (ntps, Bs @ map (norm_term_skip env nlift) As, C)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1339
                  else (ntps, Bs @ map normt As, C)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1340
                else if match then raise COMPOSE
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1341
                else (*normalize the new rule fully*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1342
                  (ntps, map normt (Bs @ As), normt C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1343
             end
1258
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
  1344
           val th = (*tuned fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1345
             Thm{sign = sign,
2386
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1346
                 der = infer_derivs (Bicompose(match, eres_flg,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1347
                                               1 + length Bs, nsubgoal, env),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1348
                                     [rder,sder]),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1349
                 maxidx = maxidx,
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1350
                 shyps = add_env_sorts (env, union_sort(rshyps,sshyps)),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1351
                 hyps = union_term(rhyps,shyps),
58f8ff014009 fixed warning;
wenzelm
parents: 2266
diff changeset
  1352
                 prop = Logic.rule_of normp}
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1353
        in  cons(th, thq)  end  handle COMPOSE => thq
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1354
     val (rtpairs,rhorn) = Logic.strip_flexpairs(rprop);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1355
     val (rAs,B) = Logic.strip_prems(nsubgoal, [], rhorn)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1356
       handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1357
     (*Modify assumptions, deleting n-th if n>0 for e-resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1358
     fun newAs(As0, n, dpairs, tpairs) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1359
       let val As1 = if !Logic.auto_rename orelse not lifted then As0
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1360
                     else map (rename_bvars(dpairs,tpairs,B)) As0
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1361
       in (map (Logic.flatten_params n) As1)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1362
          handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1363
          raise THM("bicompose: 1st premise", 0, [orule])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1364
       end;
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1365
     val env = Envir.empty(Int.max(rmax,smax));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1366
     val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1367
     val dpairs = BBi :: (rtpairs@stpairs);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1368
     (*elim-resolution: try each assumption in turn.  Initially n=1*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1369
     fun tryasms (_, _, []) = null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1370
       | tryasms (As, n, (t,u)::apairs) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1371
          (case pull(Unify.unifiers(sign, env, (t,u)::dpairs))  of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1372
               None                   => tryasms (As, n+1, apairs)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1373
             | cell as Some((_,tpairs),_) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1374
                   its_right (addth (newAs(As, n, [BBi,(u,t)], tpairs)))