src/HOL/HOL.thy
author paulson
Tue May 23 18:22:19 2000 +0200 (2000-05-23)
changeset 8940 55bc03d9f168
parent 8800 e3688ef49f12
child 8959 9d793220a46a
permissions -rw-r--r--
new type class "zero" so that 0 can be overloaded
clasohm@923
     1
(*  Title:      HOL/HOL.thy
clasohm@923
     2
    ID:         $Id$
clasohm@923
     3
    Author:     Tobias Nipkow
clasohm@923
     4
    Copyright   1993  University of Cambridge
clasohm@923
     5
wenzelm@2260
     6
Higher-Order Logic.
clasohm@923
     7
*)
clasohm@923
     8
wenzelm@7357
     9
theory HOL = CPure
wenzelm@7357
    10
files ("HOL_lemmas.ML") ("cladata.ML") ("blastdata.ML") ("simpdata.ML"):
clasohm@923
    11
wenzelm@2260
    12
wenzelm@2260
    13
(** Core syntax **)
wenzelm@2260
    14
wenzelm@3947
    15
global
wenzelm@3947
    16
wenzelm@7357
    17
classes "term" < logic
wenzelm@7357
    18
defaultsort "term"
clasohm@923
    19
wenzelm@7357
    20
typedecl bool
clasohm@923
    21
clasohm@923
    22
arities
wenzelm@7357
    23
  bool :: "term"
wenzelm@7357
    24
  fun :: ("term", "term") "term"
clasohm@923
    25
clasohm@923
    26
clasohm@923
    27
consts
clasohm@923
    28
clasohm@923
    29
  (* Constants *)
clasohm@923
    30
wenzelm@7357
    31
  Trueprop      :: "bool => prop"                   ("(_)" 5)
wenzelm@7357
    32
  Not           :: "bool => bool"                   ("~ _" [40] 40)
wenzelm@7357
    33
  True          :: bool
wenzelm@7357
    34
  False         :: bool
wenzelm@7357
    35
  If            :: "[bool, 'a, 'a] => 'a"           ("(if (_)/ then (_)/ else (_))" 10)
wenzelm@3947
    36
  arbitrary     :: 'a
clasohm@923
    37
clasohm@923
    38
  (* Binders *)
clasohm@923
    39
wenzelm@7357
    40
  Eps           :: "('a => bool) => 'a"
wenzelm@7357
    41
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
wenzelm@7357
    42
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
wenzelm@7357
    43
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
wenzelm@7357
    44
  Let           :: "['a, 'a => 'b] => 'b"
clasohm@923
    45
clasohm@923
    46
  (* Infixes *)
clasohm@923
    47
wenzelm@7357
    48
  "="           :: "['a, 'a] => bool"               (infixl 50)
wenzelm@7357
    49
  &             :: "[bool, bool] => bool"           (infixr 35)
wenzelm@7357
    50
  "|"           :: "[bool, bool] => bool"           (infixr 30)
wenzelm@7357
    51
  -->           :: "[bool, bool] => bool"           (infixr 25)
clasohm@923
    52
wenzelm@2260
    53
wenzelm@2260
    54
(* Overloaded Constants *)
wenzelm@2260
    55
paulson@8940
    56
axclass zero  < "term" 
paulson@8940
    57
axclass plus  < "term"
wenzelm@7357
    58
axclass minus < "term"
wenzelm@7357
    59
axclass times < "term"
wenzelm@7357
    60
axclass power < "term"
paulson@3370
    61
wenzelm@2260
    62
consts
paulson@8940
    63
  "0"           :: "('a::zero)"                     ("0")
wenzelm@7357
    64
  "+"           :: "['a::plus, 'a]  => 'a"          (infixl 65)
wenzelm@7357
    65
  -             :: "['a::minus, 'a] => 'a"          (infixl 65)
wenzelm@7357
    66
  uminus        :: "['a::minus] => 'a"              ("- _" [81] 80)
nipkow@8800
    67
  abs		:: "('a::minus) => 'a"
wenzelm@7426
    68
  *             :: "['a::times, 'a] => 'a"          (infixl 70)
paulson@3370
    69
  (*See Nat.thy for "^"*)
wenzelm@2260
    70
wenzelm@3820
    71
wenzelm@7238
    72
wenzelm@2260
    73
(** Additional concrete syntax **)
wenzelm@2260
    74
wenzelm@4868
    75
nonterminals
clasohm@923
    76
  letbinds  letbind
clasohm@923
    77
  case_syn  cases_syn
clasohm@923
    78
clasohm@923
    79
syntax
wenzelm@7357
    80
  ~=            :: "['a, 'a] => bool"                    (infixl 50)
wenzelm@7357
    81
  "_Eps"        :: "[pttrn, bool] => 'a"                 ("(3SOME _./ _)" [0, 10] 10)
clasohm@923
    82
clasohm@923
    83
  (* Let expressions *)
clasohm@923
    84
wenzelm@7357
    85
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
wenzelm@7357
    86
  ""            :: "letbind => letbinds"                 ("_")
wenzelm@7357
    87
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
wenzelm@7357
    88
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" 10)
clasohm@923
    89
clasohm@923
    90
  (* Case expressions *)
clasohm@923
    91
wenzelm@7357
    92
  "@case"       :: "['a, cases_syn] => 'b"               ("(case _ of/ _)" 10)
wenzelm@7357
    93
  "@case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
wenzelm@7357
    94
  ""            :: "case_syn => cases_syn"               ("_")
wenzelm@7357
    95
  "@case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
clasohm@923
    96
clasohm@923
    97
translations
wenzelm@7238
    98
  "x ~= y"                == "~ (x = y)"
wenzelm@7238
    99
  "SOME x. P"             == "Eps (%x. P)"
clasohm@923
   100
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
nipkow@1114
   101
  "let x = a in e"        == "Let a (%x. e)"
clasohm@923
   102
wenzelm@3820
   103
syntax ("" output)
wenzelm@7357
   104
  "op ="        :: "['a, 'a] => bool"                    ("(_ =/ _)" [51, 51] 50)
wenzelm@7357
   105
  "op ~="       :: "['a, 'a] => bool"                    ("(_ ~=/ _)" [51, 51] 50)
wenzelm@2260
   106
wenzelm@2260
   107
syntax (symbols)
wenzelm@7357
   108
  Not           :: "bool => bool"                        ("\\<not> _" [40] 40)
wenzelm@7357
   109
  "op &"        :: "[bool, bool] => bool"                (infixr "\\<and>" 35)
wenzelm@7357
   110
  "op |"        :: "[bool, bool] => bool"                (infixr "\\<or>" 30)
wenzelm@7357
   111
  "op -->"      :: "[bool, bool] => bool"                (infixr "\\<midarrow>\\<rightarrow>" 25)
wenzelm@7357
   112
  "op o"        :: "['b => 'c, 'a => 'b, 'a] => 'c"      (infixl "\\<circ>" 55)
wenzelm@7357
   113
  "op ~="       :: "['a, 'a] => bool"                    (infixl "\\<noteq>" 50)
wenzelm@7357
   114
  "_Eps"        :: "[pttrn, bool] => 'a"                 ("(3\\<epsilon>_./ _)" [0, 10] 10)
wenzelm@7357
   115
  "ALL "        :: "[idts, bool] => bool"                ("(3\\<forall>_./ _)" [0, 10] 10)
wenzelm@7357
   116
  "EX "         :: "[idts, bool] => bool"                ("(3\\<exists>_./ _)" [0, 10] 10)
wenzelm@7357
   117
  "EX! "        :: "[idts, bool] => bool"                ("(3\\<exists>!_./ _)" [0, 10] 10)
wenzelm@7357
   118
  "@case1"      :: "['a, 'b] => case_syn"                ("(2_ \\<Rightarrow>/ _)" 10)
wenzelm@7357
   119
(*"@case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ \\<orelse> _")*)
wenzelm@2372
   120
wenzelm@3820
   121
syntax (symbols output)
wenzelm@7357
   122
  "op ~="       :: "['a, 'a] => bool"                    ("(_ \\<noteq>/ _)" [51, 51] 50)
wenzelm@3820
   123
oheimb@6027
   124
syntax (xsymbols)
wenzelm@7357
   125
  "op -->"      :: "[bool, bool] => bool"                (infixr "\\<longrightarrow>" 25)
wenzelm@2260
   126
wenzelm@6340
   127
syntax (HTML output)
wenzelm@7357
   128
  Not           :: "bool => bool"                        ("\\<not> _" [40] 40)
wenzelm@6340
   129
wenzelm@7238
   130
syntax (HOL)
wenzelm@7357
   131
  "_Eps"        :: "[pttrn, bool] => 'a"                 ("(3@ _./ _)" [0, 10] 10)
wenzelm@7357
   132
  "ALL "        :: "[idts, bool] => bool"                ("(3! _./ _)" [0, 10] 10)
wenzelm@7357
   133
  "EX "         :: "[idts, bool] => bool"                ("(3? _./ _)" [0, 10] 10)
wenzelm@7357
   134
  "EX! "        :: "[idts, bool] => bool"                ("(3?! _./ _)" [0, 10] 10)
wenzelm@7238
   135
wenzelm@7238
   136
wenzelm@6340
   137
wenzelm@2260
   138
(** Rules and definitions **)
wenzelm@2260
   139
wenzelm@3947
   140
local
wenzelm@3947
   141
wenzelm@7357
   142
axioms
clasohm@923
   143
wenzelm@7357
   144
  eq_reflection: "(x=y) ==> (x==y)"
clasohm@923
   145
clasohm@923
   146
  (* Basic Rules *)
clasohm@923
   147
wenzelm@7357
   148
  refl:         "t = (t::'a)"
wenzelm@7357
   149
  subst:        "[| s = t; P(s) |] ==> P(t::'a)"
paulson@6289
   150
paulson@6289
   151
  (*Extensionality is built into the meta-logic, and this rule expresses
paulson@6289
   152
    a related property.  It is an eta-expanded version of the traditional
paulson@6289
   153
    rule, and similar to the ABS rule of HOL.*)
wenzelm@7357
   154
  ext:          "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
paulson@6289
   155
wenzelm@7357
   156
  selectI:      "P (x::'a) ==> P (@x. P x)"
clasohm@923
   157
wenzelm@7357
   158
  impI:         "(P ==> Q) ==> P-->Q"
wenzelm@7357
   159
  mp:           "[| P-->Q;  P |] ==> Q"
clasohm@923
   160
clasohm@923
   161
defs
clasohm@923
   162
wenzelm@7357
   163
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
wenzelm@7357
   164
  All_def:      "All(P)    == (P = (%x. True))"
wenzelm@7357
   165
  Ex_def:       "Ex(P)     == P(@x. P(x))"
wenzelm@7357
   166
  False_def:    "False     == (!P. P)"
wenzelm@7357
   167
  not_def:      "~ P       == P-->False"
wenzelm@7357
   168
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
wenzelm@7357
   169
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
wenzelm@7357
   170
  Ex1_def:      "Ex1(P)    == ? x. P(x) & (! y. P(y) --> y=x)"
clasohm@923
   171
wenzelm@7357
   172
axioms
clasohm@923
   173
  (* Axioms *)
clasohm@923
   174
wenzelm@7357
   175
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
wenzelm@7357
   176
  True_or_False:  "(P=True) | (P=False)"
clasohm@923
   177
clasohm@923
   178
defs
wenzelm@5069
   179
  (*misc definitions*)
wenzelm@7357
   180
  Let_def:      "Let s f == f(s)"
wenzelm@7357
   181
  if_def:       "If P x y == @z::'a. (P=True --> z=x) & (P=False --> z=y)"
wenzelm@5069
   182
wenzelm@5069
   183
  (*arbitrary is completely unspecified, but is made to appear as a
wenzelm@5069
   184
    definition syntactically*)
wenzelm@7357
   185
  arbitrary_def:  "False ==> arbitrary == (@x. False)"
clasohm@923
   186
nipkow@3320
   187
wenzelm@4868
   188
wenzelm@7357
   189
(* theory and package setup *)
wenzelm@4868
   190
wenzelm@7357
   191
use "HOL_lemmas.ML"	setup attrib_setup
wenzelm@7357
   192
use "cladata.ML"	setup Classical.setup setup clasetup
wenzelm@7357
   193
use "blastdata.ML"	setup Blast.setup
wenzelm@8473
   194
use "simpdata.ML"	setup Simplifier.setup
wenzelm@8473
   195
			setup "Simplifier.method_setup Splitter.split_modifiers"
wenzelm@8640
   196
			setup simpsetup setup cong_attrib_setup
wenzelm@8640
   197
                        setup Splitter.setup setup Clasimp.setup setup iff_attrib_setup
wenzelm@4868
   198
wenzelm@4868
   199
clasohm@923
   200
end