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