src/HOL/HOL.thy
author ballarin
Mon Mar 08 12:16:57 2004 +0100 (2004-03-08)
changeset 14444 24724afce166
parent 14430 5cb24165a2e1
child 14565 c6dc17aab88a
permissions -rw-r--r--
Added documentation for transitivity solver setup.
clasohm@923
     1
(*  Title:      HOL/HOL.thy
clasohm@923
     2
    ID:         $Id$
wenzelm@11750
     3
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
wenzelm@12386
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@11750
     5
*)
clasohm@923
     6
wenzelm@11750
     7
header {* The basis of Higher-Order Logic *}
clasohm@923
     8
wenzelm@7357
     9
theory HOL = CPure
paulson@11451
    10
files ("HOL_lemmas.ML") ("cladata.ML") ("blastdata.ML") ("simpdata.ML"):
clasohm@923
    11
wenzelm@2260
    12
wenzelm@11750
    13
subsection {* Primitive logic *}
wenzelm@11750
    14
wenzelm@11750
    15
subsubsection {* Core syntax *}
wenzelm@2260
    16
wenzelm@12338
    17
classes type < logic
wenzelm@12338
    18
defaultsort type
wenzelm@3947
    19
wenzelm@12338
    20
global
clasohm@923
    21
wenzelm@7357
    22
typedecl bool
clasohm@923
    23
clasohm@923
    24
arities
wenzelm@12338
    25
  bool :: type
wenzelm@12338
    26
  fun :: (type, type) type
clasohm@923
    27
wenzelm@11750
    28
judgment
wenzelm@11750
    29
  Trueprop      :: "bool => prop"                   ("(_)" 5)
clasohm@923
    30
wenzelm@11750
    31
consts
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
wenzelm@11432
    38
  The           :: "('a => bool) => 'a"
wenzelm@7357
    39
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
wenzelm@7357
    40
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
wenzelm@7357
    41
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
wenzelm@7357
    42
  Let           :: "['a, 'a => 'b] => 'b"
clasohm@923
    43
wenzelm@7357
    44
  "="           :: "['a, 'a] => bool"               (infixl 50)
wenzelm@7357
    45
  &             :: "[bool, bool] => bool"           (infixr 35)
wenzelm@7357
    46
  "|"           :: "[bool, bool] => bool"           (infixr 30)
wenzelm@7357
    47
  -->           :: "[bool, bool] => bool"           (infixr 25)
clasohm@923
    48
wenzelm@10432
    49
local
wenzelm@10432
    50
wenzelm@2260
    51
wenzelm@11750
    52
subsubsection {* Additional concrete syntax *}
wenzelm@2260
    53
wenzelm@4868
    54
nonterminals
clasohm@923
    55
  letbinds  letbind
clasohm@923
    56
  case_syn  cases_syn
clasohm@923
    57
clasohm@923
    58
syntax
wenzelm@12650
    59
  "_not_equal"  :: "['a, 'a] => bool"                    (infixl "~=" 50)
wenzelm@11432
    60
  "_The"        :: "[pttrn, bool] => 'a"                 ("(3THE _./ _)" [0, 10] 10)
clasohm@923
    61
wenzelm@7357
    62
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
wenzelm@7357
    63
  ""            :: "letbind => letbinds"                 ("_")
wenzelm@7357
    64
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
wenzelm@7357
    65
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" 10)
clasohm@923
    66
wenzelm@9060
    67
  "_case_syntax":: "['a, cases_syn] => 'b"               ("(case _ of/ _)" 10)
wenzelm@9060
    68
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
wenzelm@7357
    69
  ""            :: "case_syn => cases_syn"               ("_")
wenzelm@9060
    70
  "_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
clasohm@923
    71
clasohm@923
    72
translations
wenzelm@7238
    73
  "x ~= y"                == "~ (x = y)"
nipkow@13764
    74
  "THE x. P"              == "The (%x. P)"
clasohm@923
    75
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
nipkow@1114
    76
  "let x = a in e"        == "Let a (%x. e)"
clasohm@923
    77
nipkow@13763
    78
print_translation {*
nipkow@13763
    79
(* To avoid eta-contraction of body: *)
nipkow@13763
    80
[("The", fn [Abs abs] =>
nipkow@13763
    81
     let val (x,t) = atomic_abs_tr' abs
nipkow@13763
    82
     in Syntax.const "_The" $ x $ t end)]
nipkow@13763
    83
*}
nipkow@13763
    84
wenzelm@12633
    85
syntax (output)
wenzelm@11687
    86
  "="           :: "['a, 'a] => bool"                    (infix 50)
wenzelm@12650
    87
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "~=" 50)
wenzelm@2260
    88
wenzelm@12114
    89
syntax (xsymbols)
wenzelm@11687
    90
  Not           :: "bool => bool"                        ("\<not> _" [40] 40)
wenzelm@11687
    91
  "op &"        :: "[bool, bool] => bool"                (infixr "\<and>" 35)
wenzelm@11687
    92
  "op |"        :: "[bool, bool] => bool"                (infixr "\<or>" 30)
wenzelm@12114
    93
  "op -->"      :: "[bool, bool] => bool"                (infixr "\<longrightarrow>" 25)
wenzelm@12650
    94
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "\<noteq>" 50)
wenzelm@11687
    95
  "ALL "        :: "[idts, bool] => bool"                ("(3\<forall>_./ _)" [0, 10] 10)
wenzelm@11687
    96
  "EX "         :: "[idts, bool] => bool"                ("(3\<exists>_./ _)" [0, 10] 10)
wenzelm@11687
    97
  "EX! "        :: "[idts, bool] => bool"                ("(3\<exists>!_./ _)" [0, 10] 10)
wenzelm@11687
    98
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ \<Rightarrow>/ _)" 10)
schirmer@14361
    99
(*"_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ \<orelse> _")*)
wenzelm@2372
   100
wenzelm@12114
   101
syntax (xsymbols output)
wenzelm@12650
   102
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "\<noteq>" 50)
wenzelm@3820
   103
wenzelm@6340
   104
syntax (HTML output)
wenzelm@11687
   105
  Not           :: "bool => bool"                        ("\<not> _" [40] 40)
wenzelm@6340
   106
wenzelm@7238
   107
syntax (HOL)
wenzelm@7357
   108
  "ALL "        :: "[idts, bool] => bool"                ("(3! _./ _)" [0, 10] 10)
wenzelm@7357
   109
  "EX "         :: "[idts, bool] => bool"                ("(3? _./ _)" [0, 10] 10)
wenzelm@7357
   110
  "EX! "        :: "[idts, bool] => bool"                ("(3?! _./ _)" [0, 10] 10)
wenzelm@7238
   111
wenzelm@7238
   112
wenzelm@11750
   113
subsubsection {* Axioms and basic definitions *}
wenzelm@2260
   114
wenzelm@7357
   115
axioms
wenzelm@7357
   116
  eq_reflection: "(x=y) ==> (x==y)"
clasohm@923
   117
wenzelm@7357
   118
  refl:         "t = (t::'a)"
wenzelm@7357
   119
  subst:        "[| s = t; P(s) |] ==> P(t::'a)"
paulson@6289
   120
wenzelm@7357
   121
  ext:          "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
wenzelm@11750
   122
    -- {* Extensionality is built into the meta-logic, and this rule expresses *}
wenzelm@11750
   123
    -- {* a related property.  It is an eta-expanded version of the traditional *}
wenzelm@11750
   124
    -- {* rule, and similar to the ABS rule of HOL *}
paulson@6289
   125
wenzelm@11432
   126
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
clasohm@923
   127
wenzelm@7357
   128
  impI:         "(P ==> Q) ==> P-->Q"
wenzelm@7357
   129
  mp:           "[| P-->Q;  P |] ==> Q"
clasohm@923
   130
clasohm@923
   131
defs
wenzelm@7357
   132
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
wenzelm@7357
   133
  All_def:      "All(P)    == (P = (%x. True))"
paulson@11451
   134
  Ex_def:       "Ex(P)     == !Q. (!x. P x --> Q) --> Q"
wenzelm@7357
   135
  False_def:    "False     == (!P. P)"
wenzelm@7357
   136
  not_def:      "~ P       == P-->False"
wenzelm@7357
   137
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
wenzelm@7357
   138
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
wenzelm@7357
   139
  Ex1_def:      "Ex1(P)    == ? x. P(x) & (! y. P(y) --> y=x)"
clasohm@923
   140
wenzelm@7357
   141
axioms
wenzelm@7357
   142
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
wenzelm@7357
   143
  True_or_False:  "(P=True) | (P=False)"
clasohm@923
   144
clasohm@923
   145
defs
wenzelm@7357
   146
  Let_def:      "Let s f == f(s)"
paulson@11451
   147
  if_def:       "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)"
wenzelm@5069
   148
skalberg@14223
   149
finalconsts
skalberg@14223
   150
  "op ="
skalberg@14223
   151
  "op -->"
skalberg@14223
   152
  The
skalberg@14223
   153
  arbitrary
nipkow@3320
   154
wenzelm@11750
   155
subsubsection {* Generic algebraic operations *}
wenzelm@4868
   156
wenzelm@12338
   157
axclass zero < type
wenzelm@12338
   158
axclass one < type
wenzelm@12338
   159
axclass plus < type
wenzelm@12338
   160
axclass minus < type
wenzelm@12338
   161
axclass times < type
wenzelm@12338
   162
axclass inverse < type
wenzelm@11750
   163
wenzelm@11750
   164
global
wenzelm@11750
   165
wenzelm@11750
   166
consts
wenzelm@11750
   167
  "0"           :: "'a::zero"                       ("0")
wenzelm@11750
   168
  "1"           :: "'a::one"                        ("1")
wenzelm@11750
   169
  "+"           :: "['a::plus, 'a]  => 'a"          (infixl 65)
wenzelm@11750
   170
  -             :: "['a::minus, 'a] => 'a"          (infixl 65)
wenzelm@11750
   171
  uminus        :: "['a::minus] => 'a"              ("- _" [81] 80)
wenzelm@11750
   172
  *             :: "['a::times, 'a] => 'a"          (infixl 70)
wenzelm@11750
   173
wenzelm@13456
   174
syntax
wenzelm@13456
   175
  "_index1"  :: index    ("\<^sub>1")
wenzelm@13456
   176
translations
wenzelm@13456
   177
  (index) "\<^sub>1" == "_index 1"
wenzelm@13456
   178
wenzelm@11750
   179
local
wenzelm@11750
   180
wenzelm@11750
   181
typed_print_translation {*
wenzelm@11750
   182
  let
wenzelm@11750
   183
    fun tr' c = (c, fn show_sorts => fn T => fn ts =>
wenzelm@11750
   184
      if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match
wenzelm@11750
   185
      else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T);
wenzelm@11750
   186
  in [tr' "0", tr' "1"] end;
wenzelm@11750
   187
*} -- {* show types that are presumably too general *}
wenzelm@11750
   188
wenzelm@11750
   189
wenzelm@11750
   190
consts
wenzelm@11750
   191
  abs           :: "'a::minus => 'a"
wenzelm@11750
   192
  inverse       :: "'a::inverse => 'a"
wenzelm@11750
   193
  divide        :: "['a::inverse, 'a] => 'a"        (infixl "'/" 70)
wenzelm@11750
   194
wenzelm@11750
   195
syntax (xsymbols)
wenzelm@11750
   196
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
wenzelm@11750
   197
syntax (HTML output)
wenzelm@11750
   198
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
wenzelm@11750
   199
wenzelm@11750
   200
wenzelm@11750
   201
subsection {* Theory and package setup *}
wenzelm@11750
   202
wenzelm@11750
   203
subsubsection {* Basic lemmas *}
wenzelm@4868
   204
nipkow@9736
   205
use "HOL_lemmas.ML"
wenzelm@11687
   206
theorems case_split = case_split_thm [case_names True False]
wenzelm@9869
   207
wenzelm@12386
   208
wenzelm@12386
   209
subsubsection {* Intuitionistic Reasoning *}
wenzelm@12386
   210
wenzelm@12386
   211
lemma impE':
wenzelm@12937
   212
  assumes 1: "P --> Q"
wenzelm@12937
   213
    and 2: "Q ==> R"
wenzelm@12937
   214
    and 3: "P --> Q ==> P"
wenzelm@12937
   215
  shows R
wenzelm@12386
   216
proof -
wenzelm@12386
   217
  from 3 and 1 have P .
wenzelm@12386
   218
  with 1 have Q by (rule impE)
wenzelm@12386
   219
  with 2 show R .
wenzelm@12386
   220
qed
wenzelm@12386
   221
wenzelm@12386
   222
lemma allE':
wenzelm@12937
   223
  assumes 1: "ALL x. P x"
wenzelm@12937
   224
    and 2: "P x ==> ALL x. P x ==> Q"
wenzelm@12937
   225
  shows Q
wenzelm@12386
   226
proof -
wenzelm@12386
   227
  from 1 have "P x" by (rule spec)
wenzelm@12386
   228
  from this and 1 show Q by (rule 2)
wenzelm@12386
   229
qed
wenzelm@12386
   230
wenzelm@12937
   231
lemma notE':
wenzelm@12937
   232
  assumes 1: "~ P"
wenzelm@12937
   233
    and 2: "~ P ==> P"
wenzelm@12937
   234
  shows R
wenzelm@12386
   235
proof -
wenzelm@12386
   236
  from 2 and 1 have P .
wenzelm@12386
   237
  with 1 show R by (rule notE)
wenzelm@12386
   238
qed
wenzelm@12386
   239
wenzelm@12386
   240
lemmas [CPure.elim!] = disjE iffE FalseE conjE exE
wenzelm@12386
   241
  and [CPure.intro!] = iffI conjI impI TrueI notI allI refl
wenzelm@12386
   242
  and [CPure.elim 2] = allE notE' impE'
wenzelm@12386
   243
  and [CPure.intro] = exI disjI2 disjI1
wenzelm@12386
   244
wenzelm@12386
   245
lemmas [trans] = trans
wenzelm@12386
   246
  and [sym] = sym not_sym
wenzelm@12386
   247
  and [CPure.elim?] = iffD1 iffD2 impE
wenzelm@11750
   248
wenzelm@11438
   249
wenzelm@11750
   250
subsubsection {* Atomizing meta-level connectives *}
wenzelm@11750
   251
wenzelm@11750
   252
lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)"
wenzelm@12003
   253
proof
wenzelm@9488
   254
  assume "!!x. P x"
wenzelm@10383
   255
  show "ALL x. P x" by (rule allI)
wenzelm@9488
   256
next
wenzelm@9488
   257
  assume "ALL x. P x"
wenzelm@10383
   258
  thus "!!x. P x" by (rule allE)
wenzelm@9488
   259
qed
wenzelm@9488
   260
wenzelm@11750
   261
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
wenzelm@12003
   262
proof
wenzelm@9488
   263
  assume r: "A ==> B"
wenzelm@10383
   264
  show "A --> B" by (rule impI) (rule r)
wenzelm@9488
   265
next
wenzelm@9488
   266
  assume "A --> B" and A
wenzelm@10383
   267
  thus B by (rule mp)
wenzelm@9488
   268
qed
wenzelm@9488
   269
wenzelm@11750
   270
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
wenzelm@12003
   271
proof
wenzelm@10432
   272
  assume "x == y"
wenzelm@10432
   273
  show "x = y" by (unfold prems) (rule refl)
wenzelm@10432
   274
next
wenzelm@10432
   275
  assume "x = y"
wenzelm@10432
   276
  thus "x == y" by (rule eq_reflection)
wenzelm@10432
   277
qed
wenzelm@10432
   278
wenzelm@12023
   279
lemma atomize_conj [atomize]:
wenzelm@12023
   280
  "(!!C. (A ==> B ==> PROP C) ==> PROP C) == Trueprop (A & B)"
wenzelm@12003
   281
proof
wenzelm@11953
   282
  assume "!!C. (A ==> B ==> PROP C) ==> PROP C"
wenzelm@11953
   283
  show "A & B" by (rule conjI)
wenzelm@11953
   284
next
wenzelm@11953
   285
  fix C
wenzelm@11953
   286
  assume "A & B"
wenzelm@11953
   287
  assume "A ==> B ==> PROP C"
wenzelm@11953
   288
  thus "PROP C"
wenzelm@11953
   289
  proof this
wenzelm@11953
   290
    show A by (rule conjunct1)
wenzelm@11953
   291
    show B by (rule conjunct2)
wenzelm@11953
   292
  qed
wenzelm@11953
   293
qed
wenzelm@11953
   294
wenzelm@12386
   295
lemmas [symmetric, rulify] = atomize_all atomize_imp
wenzelm@12386
   296
wenzelm@11750
   297
wenzelm@11750
   298
subsubsection {* Classical Reasoner setup *}
wenzelm@9529
   299
wenzelm@10383
   300
use "cladata.ML"
wenzelm@10383
   301
setup hypsubst_setup
wenzelm@11977
   302
wenzelm@12386
   303
ML_setup {*
wenzelm@12386
   304
  Context.>> (ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac));
wenzelm@12386
   305
*}
wenzelm@11977
   306
wenzelm@10383
   307
setup Classical.setup
wenzelm@10383
   308
setup clasetup
wenzelm@10383
   309
wenzelm@12386
   310
lemmas [intro?] = ext
wenzelm@12386
   311
  and [elim?] = ex1_implies_ex
wenzelm@11977
   312
wenzelm@9869
   313
use "blastdata.ML"
wenzelm@9869
   314
setup Blast.setup
wenzelm@4868
   315
wenzelm@11750
   316
wenzelm@11750
   317
subsubsection {* Simplifier setup *}
wenzelm@11750
   318
wenzelm@12281
   319
lemma meta_eq_to_obj_eq: "x == y ==> x = y"
wenzelm@12281
   320
proof -
wenzelm@12281
   321
  assume r: "x == y"
wenzelm@12281
   322
  show "x = y" by (unfold r) (rule refl)
wenzelm@12281
   323
qed
wenzelm@12281
   324
wenzelm@12281
   325
lemma eta_contract_eq: "(%s. f s) = f" ..
wenzelm@12281
   326
wenzelm@12281
   327
lemma simp_thms:
wenzelm@12937
   328
  shows not_not: "(~ ~ P) = P"
wenzelm@12937
   329
  and
berghofe@12436
   330
    "(P ~= Q) = (P = (~Q))"
berghofe@12436
   331
    "(P | ~P) = True"    "(~P | P) = True"
berghofe@12436
   332
    "((~P) = (~Q)) = (P=Q)"
wenzelm@12281
   333
    "(x = x) = True"
wenzelm@12281
   334
    "(~True) = False"  "(~False) = True"
berghofe@12436
   335
    "(~P) ~= P"  "P ~= (~P)"
wenzelm@12281
   336
    "(True=P) = P"  "(P=True) = P"  "(False=P) = (~P)"  "(P=False) = (~P)"
wenzelm@12281
   337
    "(True --> P) = P"  "(False --> P) = True"
wenzelm@12281
   338
    "(P --> True) = True"  "(P --> P) = True"
wenzelm@12281
   339
    "(P --> False) = (~P)"  "(P --> ~P) = (~P)"
wenzelm@12281
   340
    "(P & True) = P"  "(True & P) = P"
wenzelm@12281
   341
    "(P & False) = False"  "(False & P) = False"
wenzelm@12281
   342
    "(P & P) = P"  "(P & (P & Q)) = (P & Q)"
wenzelm@12281
   343
    "(P & ~P) = False"    "(~P & P) = False"
wenzelm@12281
   344
    "(P | True) = True"  "(True | P) = True"
wenzelm@12281
   345
    "(P | False) = P"  "(False | P) = P"
berghofe@12436
   346
    "(P | P) = P"  "(P | (P | Q)) = (P | Q)" and
wenzelm@12281
   347
    "(ALL x. P) = P"  "(EX x. P) = P"  "EX x. x=t"  "EX x. t=x"
wenzelm@12281
   348
    -- {* needed for the one-point-rule quantifier simplification procs *}
wenzelm@12281
   349
    -- {* essential for termination!! *} and
wenzelm@12281
   350
    "!!P. (EX x. x=t & P(x)) = P(t)"
wenzelm@12281
   351
    "!!P. (EX x. t=x & P(x)) = P(t)"
wenzelm@12281
   352
    "!!P. (ALL x. x=t --> P(x)) = P(t)"
wenzelm@12937
   353
    "!!P. (ALL x. t=x --> P(x)) = P(t)"
berghofe@12436
   354
  by (blast, blast, blast, blast, blast, rules+)
wenzelm@13421
   355
wenzelm@12281
   356
lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
wenzelm@12354
   357
  by rules
wenzelm@12281
   358
wenzelm@12281
   359
lemma ex_simps:
wenzelm@12281
   360
  "!!P Q. (EX x. P x & Q)   = ((EX x. P x) & Q)"
wenzelm@12281
   361
  "!!P Q. (EX x. P & Q x)   = (P & (EX x. Q x))"
wenzelm@12281
   362
  "!!P Q. (EX x. P x | Q)   = ((EX x. P x) | Q)"
wenzelm@12281
   363
  "!!P Q. (EX x. P | Q x)   = (P | (EX x. Q x))"
wenzelm@12281
   364
  "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
wenzelm@12281
   365
  "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
wenzelm@12281
   366
  -- {* Miniscoping: pushing in existential quantifiers. *}
berghofe@12436
   367
  by (rules | blast)+
wenzelm@12281
   368
wenzelm@12281
   369
lemma all_simps:
wenzelm@12281
   370
  "!!P Q. (ALL x. P x & Q)   = ((ALL x. P x) & Q)"
wenzelm@12281
   371
  "!!P Q. (ALL x. P & Q x)   = (P & (ALL x. Q x))"
wenzelm@12281
   372
  "!!P Q. (ALL x. P x | Q)   = ((ALL x. P x) | Q)"
wenzelm@12281
   373
  "!!P Q. (ALL x. P | Q x)   = (P | (ALL x. Q x))"
wenzelm@12281
   374
  "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
wenzelm@12281
   375
  "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
wenzelm@12281
   376
  -- {* Miniscoping: pushing in universal quantifiers. *}
berghofe@12436
   377
  by (rules | blast)+
wenzelm@12281
   378
paulson@14201
   379
lemma disj_absorb: "(A | A) = A"
paulson@14201
   380
  by blast
paulson@14201
   381
paulson@14201
   382
lemma disj_left_absorb: "(A | (A | B)) = (A | B)"
paulson@14201
   383
  by blast
paulson@14201
   384
paulson@14201
   385
lemma conj_absorb: "(A & A) = A"
paulson@14201
   386
  by blast
paulson@14201
   387
paulson@14201
   388
lemma conj_left_absorb: "(A & (A & B)) = (A & B)"
paulson@14201
   389
  by blast
paulson@14201
   390
wenzelm@12281
   391
lemma eq_ac:
wenzelm@12937
   392
  shows eq_commute: "(a=b) = (b=a)"
wenzelm@12937
   393
    and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
wenzelm@12937
   394
    and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (rules, blast+)
berghofe@12436
   395
lemma neq_commute: "(a~=b) = (b~=a)" by rules
wenzelm@12281
   396
wenzelm@12281
   397
lemma conj_comms:
wenzelm@12937
   398
  shows conj_commute: "(P&Q) = (Q&P)"
wenzelm@12937
   399
    and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by rules+
berghofe@12436
   400
lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by rules
wenzelm@12281
   401
wenzelm@12281
   402
lemma disj_comms:
wenzelm@12937
   403
  shows disj_commute: "(P|Q) = (Q|P)"
wenzelm@12937
   404
    and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by rules+
berghofe@12436
   405
lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by rules
wenzelm@12281
   406
berghofe@12436
   407
lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by rules
berghofe@12436
   408
lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by rules
wenzelm@12281
   409
berghofe@12436
   410
lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by rules
berghofe@12436
   411
lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by rules
wenzelm@12281
   412
berghofe@12436
   413
lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by rules
berghofe@12436
   414
lemma imp_conjL: "((P&Q) -->R)  = (P --> (Q --> R))" by rules
berghofe@12436
   415
lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by rules
wenzelm@12281
   416
wenzelm@12281
   417
text {* These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}. *}
wenzelm@12281
   418
lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
wenzelm@12281
   419
lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
wenzelm@12281
   420
wenzelm@12281
   421
lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
wenzelm@12281
   422
lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" by blast
wenzelm@12281
   423
berghofe@12436
   424
lemma de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by rules
wenzelm@12281
   425
lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
wenzelm@12281
   426
lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
wenzelm@12281
   427
lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
wenzelm@12281
   428
lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
wenzelm@12281
   429
lemma disj_not2: "(P | ~Q) = (Q --> P)"  -- {* changes orientation :-( *}
wenzelm@12281
   430
  by blast
wenzelm@12281
   431
lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
wenzelm@12281
   432
berghofe@12436
   433
lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by rules
wenzelm@12281
   434
wenzelm@12281
   435
wenzelm@12281
   436
lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
wenzelm@12281
   437
  -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
wenzelm@12281
   438
  -- {* cases boil down to the same thing. *}
wenzelm@12281
   439
  by blast
wenzelm@12281
   440
wenzelm@12281
   441
lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
wenzelm@12281
   442
lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
berghofe@12436
   443
lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by rules
berghofe@12436
   444
lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by rules
wenzelm@12281
   445
berghofe@12436
   446
lemma ex_disj_distrib: "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))" by rules
berghofe@12436
   447
lemma all_conj_distrib: "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))" by rules
wenzelm@12281
   448
wenzelm@12281
   449
text {*
wenzelm@12281
   450
  \medskip The @{text "&"} congruence rule: not included by default!
wenzelm@12281
   451
  May slow rewrite proofs down by as much as 50\% *}
wenzelm@12281
   452
wenzelm@12281
   453
lemma conj_cong:
wenzelm@12281
   454
    "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
wenzelm@12354
   455
  by rules
wenzelm@12281
   456
wenzelm@12281
   457
lemma rev_conj_cong:
wenzelm@12281
   458
    "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
wenzelm@12354
   459
  by rules
wenzelm@12281
   460
wenzelm@12281
   461
text {* The @{text "|"} congruence rule: not included by default! *}
wenzelm@12281
   462
wenzelm@12281
   463
lemma disj_cong:
wenzelm@12281
   464
    "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
wenzelm@12281
   465
  by blast
wenzelm@12281
   466
wenzelm@12281
   467
lemma eq_sym_conv: "(x = y) = (y = x)"
wenzelm@12354
   468
  by rules
wenzelm@12281
   469
wenzelm@12281
   470
wenzelm@12281
   471
text {* \medskip if-then-else rules *}
wenzelm@12281
   472
wenzelm@12281
   473
lemma if_True: "(if True then x else y) = x"
wenzelm@12281
   474
  by (unfold if_def) blast
wenzelm@12281
   475
wenzelm@12281
   476
lemma if_False: "(if False then x else y) = y"
wenzelm@12281
   477
  by (unfold if_def) blast
wenzelm@12281
   478
wenzelm@12281
   479
lemma if_P: "P ==> (if P then x else y) = x"
wenzelm@12281
   480
  by (unfold if_def) blast
wenzelm@12281
   481
wenzelm@12281
   482
lemma if_not_P: "~P ==> (if P then x else y) = y"
wenzelm@12281
   483
  by (unfold if_def) blast
wenzelm@12281
   484
wenzelm@12281
   485
lemma split_if: "P (if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
wenzelm@12281
   486
  apply (rule case_split [of Q])
wenzelm@12281
   487
   apply (subst if_P)
paulson@14208
   488
    prefer 3 apply (subst if_not_P, blast+)
wenzelm@12281
   489
  done
wenzelm@12281
   490
wenzelm@12281
   491
lemma split_if_asm: "P (if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
paulson@14208
   492
by (subst split_if, blast)
wenzelm@12281
   493
wenzelm@12281
   494
lemmas if_splits = split_if split_if_asm
wenzelm@12281
   495
wenzelm@12281
   496
lemma if_def2: "(if Q then x else y) = ((Q --> x) & (~ Q --> y))"
wenzelm@12281
   497
  by (rule split_if)
wenzelm@12281
   498
wenzelm@12281
   499
lemma if_cancel: "(if c then x else x) = x"
paulson@14208
   500
by (subst split_if, blast)
wenzelm@12281
   501
wenzelm@12281
   502
lemma if_eq_cancel: "(if x = y then y else x) = x"
paulson@14208
   503
by (subst split_if, blast)
wenzelm@12281
   504
wenzelm@12281
   505
lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
wenzelm@12281
   506
  -- {* This form is useful for expanding @{text if}s on the RIGHT of the @{text "==>"} symbol. *}
wenzelm@12281
   507
  by (rule split_if)
wenzelm@12281
   508
wenzelm@12281
   509
lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
wenzelm@12281
   510
  -- {* And this form is useful for expanding @{text if}s on the LEFT. *}
paulson@14208
   511
  apply (subst split_if, blast)
wenzelm@12281
   512
  done
wenzelm@12281
   513
berghofe@12436
   514
lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) rules
berghofe@12436
   515
lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) rules
wenzelm@12281
   516
paulson@14201
   517
subsubsection {* Actual Installation of the Simplifier *}
paulson@14201
   518
wenzelm@9869
   519
use "simpdata.ML"
wenzelm@9869
   520
setup Simplifier.setup
wenzelm@9869
   521
setup "Simplifier.method_setup Splitter.split_modifiers" setup simpsetup
wenzelm@9869
   522
setup Splitter.setup setup Clasimp.setup
wenzelm@9869
   523
paulson@14201
   524
declare disj_absorb [simp] conj_absorb [simp] 
paulson@14201
   525
nipkow@13723
   526
lemma ex1_eq[iff]: "EX! x. x = t" "EX! x. t = x"
nipkow@13723
   527
by blast+
nipkow@13723
   528
berghofe@13638
   529
theorem choice_eq: "(ALL x. EX! y. P x y) = (EX! f. ALL x. P x (f x))"
berghofe@13638
   530
  apply (rule iffI)
berghofe@13638
   531
  apply (rule_tac a = "%x. THE y. P x y" in ex1I)
berghofe@13638
   532
  apply (fast dest!: theI')
berghofe@13638
   533
  apply (fast intro: ext the1_equality [symmetric])
berghofe@13638
   534
  apply (erule ex1E)
berghofe@13638
   535
  apply (rule allI)
berghofe@13638
   536
  apply (rule ex1I)
berghofe@13638
   537
  apply (erule spec)
berghofe@13638
   538
  apply (erule_tac x = "%z. if z = x then y else f z" in allE)
berghofe@13638
   539
  apply (erule impE)
berghofe@13638
   540
  apply (rule allI)
berghofe@13638
   541
  apply (rule_tac P = "xa = x" in case_split_thm)
paulson@14208
   542
  apply (drule_tac [3] x = x in fun_cong, simp_all)
berghofe@13638
   543
  done
berghofe@13638
   544
nipkow@13438
   545
text{*Needs only HOL-lemmas:*}
nipkow@13438
   546
lemma mk_left_commute:
nipkow@13438
   547
  assumes a: "\<And>x y z. f (f x y) z = f x (f y z)" and
nipkow@13438
   548
          c: "\<And>x y. f x y = f y x"
nipkow@13438
   549
  shows "f x (f y z) = f y (f x z)"
nipkow@13438
   550
by(rule trans[OF trans[OF c a] arg_cong[OF c, of "f y"]])
nipkow@13438
   551
wenzelm@11750
   552
wenzelm@11824
   553
subsubsection {* Generic cases and induction *}
wenzelm@11824
   554
wenzelm@11824
   555
constdefs
wenzelm@11989
   556
  induct_forall :: "('a => bool) => bool"
wenzelm@11989
   557
  "induct_forall P == \<forall>x. P x"
wenzelm@11989
   558
  induct_implies :: "bool => bool => bool"
wenzelm@11989
   559
  "induct_implies A B == A --> B"
wenzelm@11989
   560
  induct_equal :: "'a => 'a => bool"
wenzelm@11989
   561
  "induct_equal x y == x = y"
wenzelm@11989
   562
  induct_conj :: "bool => bool => bool"
wenzelm@11989
   563
  "induct_conj A B == A & B"
wenzelm@11824
   564
wenzelm@11989
   565
lemma induct_forall_eq: "(!!x. P x) == Trueprop (induct_forall (\<lambda>x. P x))"
wenzelm@11989
   566
  by (simp only: atomize_all induct_forall_def)
wenzelm@11824
   567
wenzelm@11989
   568
lemma induct_implies_eq: "(A ==> B) == Trueprop (induct_implies A B)"
wenzelm@11989
   569
  by (simp only: atomize_imp induct_implies_def)
wenzelm@11824
   570
wenzelm@11989
   571
lemma induct_equal_eq: "(x == y) == Trueprop (induct_equal x y)"
wenzelm@11989
   572
  by (simp only: atomize_eq induct_equal_def)
wenzelm@11824
   573
wenzelm@11989
   574
lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
wenzelm@11989
   575
    induct_conj (induct_forall A) (induct_forall B)"
wenzelm@12354
   576
  by (unfold induct_forall_def induct_conj_def) rules
wenzelm@11824
   577
wenzelm@11989
   578
lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
wenzelm@11989
   579
    induct_conj (induct_implies C A) (induct_implies C B)"
wenzelm@12354
   580
  by (unfold induct_implies_def induct_conj_def) rules
wenzelm@11989
   581
berghofe@13598
   582
lemma induct_conj_curry: "(induct_conj A B ==> PROP C) == (A ==> B ==> PROP C)"
berghofe@13598
   583
proof
berghofe@13598
   584
  assume r: "induct_conj A B ==> PROP C" and A B
berghofe@13598
   585
  show "PROP C" by (rule r) (simp! add: induct_conj_def)
berghofe@13598
   586
next
berghofe@13598
   587
  assume r: "A ==> B ==> PROP C" and "induct_conj A B"
berghofe@13598
   588
  show "PROP C" by (rule r) (simp! add: induct_conj_def)+
berghofe@13598
   589
qed
wenzelm@11824
   590
wenzelm@11989
   591
lemma induct_impliesI: "(A ==> B) ==> induct_implies A B"
wenzelm@11989
   592
  by (simp add: induct_implies_def)
wenzelm@11824
   593
wenzelm@12161
   594
lemmas induct_atomize = atomize_conj induct_forall_eq induct_implies_eq induct_equal_eq
wenzelm@12161
   595
lemmas induct_rulify1 [symmetric, standard] = induct_forall_eq induct_implies_eq induct_equal_eq
wenzelm@12161
   596
lemmas induct_rulify2 = induct_forall_def induct_implies_def induct_equal_def induct_conj_def
wenzelm@11989
   597
lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
wenzelm@11824
   598
wenzelm@11989
   599
hide const induct_forall induct_implies induct_equal induct_conj
wenzelm@11824
   600
wenzelm@11824
   601
wenzelm@11824
   602
text {* Method setup. *}
wenzelm@11824
   603
wenzelm@11824
   604
ML {*
wenzelm@11824
   605
  structure InductMethod = InductMethodFun
wenzelm@11824
   606
  (struct
wenzelm@11824
   607
    val dest_concls = HOLogic.dest_concls;
wenzelm@11824
   608
    val cases_default = thm "case_split";
wenzelm@11989
   609
    val local_impI = thm "induct_impliesI";
wenzelm@11824
   610
    val conjI = thm "conjI";
wenzelm@11989
   611
    val atomize = thms "induct_atomize";
wenzelm@11989
   612
    val rulify1 = thms "induct_rulify1";
wenzelm@11989
   613
    val rulify2 = thms "induct_rulify2";
wenzelm@12240
   614
    val localize = [Thm.symmetric (thm "induct_implies_def")];
wenzelm@11824
   615
  end);
wenzelm@11824
   616
*}
wenzelm@11824
   617
wenzelm@11824
   618
setup InductMethod.setup
wenzelm@11824
   619
wenzelm@11824
   620
wenzelm@11750
   621
subsection {* Order signatures and orders *}
wenzelm@11750
   622
wenzelm@11750
   623
axclass
wenzelm@12338
   624
  ord < type
wenzelm@11750
   625
wenzelm@11750
   626
syntax
wenzelm@11750
   627
  "op <"        :: "['a::ord, 'a] => bool"             ("op <")
wenzelm@11750
   628
  "op <="       :: "['a::ord, 'a] => bool"             ("op <=")
wenzelm@11750
   629
wenzelm@11750
   630
global
wenzelm@11750
   631
wenzelm@11750
   632
consts
wenzelm@11750
   633
  "op <"        :: "['a::ord, 'a] => bool"             ("(_/ < _)"  [50, 51] 50)
wenzelm@11750
   634
  "op <="       :: "['a::ord, 'a] => bool"             ("(_/ <= _)" [50, 51] 50)
wenzelm@11750
   635
wenzelm@11750
   636
local
wenzelm@11750
   637
wenzelm@12114
   638
syntax (xsymbols)
wenzelm@11750
   639
  "op <="       :: "['a::ord, 'a] => bool"             ("op \<le>")
wenzelm@11750
   640
  "op <="       :: "['a::ord, 'a] => bool"             ("(_/ \<le> _)"  [50, 51] 50)
wenzelm@11750
   641
wenzelm@11750
   642
paulson@14295
   643
lemma Not_eq_iff: "((~P) = (~Q)) = (P = Q)"
paulson@14295
   644
by blast
paulson@14295
   645
wenzelm@11750
   646
subsubsection {* Monotonicity *}
wenzelm@11750
   647
wenzelm@13412
   648
locale mono =
wenzelm@13412
   649
  fixes f
wenzelm@13412
   650
  assumes mono: "A <= B ==> f A <= f B"
wenzelm@11750
   651
wenzelm@13421
   652
lemmas monoI [intro?] = mono.intro
wenzelm@13412
   653
  and monoD [dest?] = mono.mono
wenzelm@11750
   654
wenzelm@11750
   655
constdefs
wenzelm@11750
   656
  min :: "['a::ord, 'a] => 'a"
wenzelm@11750
   657
  "min a b == (if a <= b then a else b)"
wenzelm@11750
   658
  max :: "['a::ord, 'a] => 'a"
wenzelm@11750
   659
  "max a b == (if a <= b then b else a)"
wenzelm@11750
   660
wenzelm@11750
   661
lemma min_leastL: "(!!x. least <= x) ==> min least x = least"
wenzelm@11750
   662
  by (simp add: min_def)
wenzelm@11750
   663
wenzelm@11750
   664
lemma min_of_mono:
wenzelm@11750
   665
    "ALL x y. (f x <= f y) = (x <= y) ==> min (f m) (f n) = f (min m n)"
wenzelm@11750
   666
  by (simp add: min_def)
wenzelm@11750
   667
wenzelm@11750
   668
lemma max_leastL: "(!!x. least <= x) ==> max least x = x"
wenzelm@11750
   669
  by (simp add: max_def)
wenzelm@11750
   670
wenzelm@11750
   671
lemma max_of_mono:
wenzelm@11750
   672
    "ALL x y. (f x <= f y) = (x <= y) ==> max (f m) (f n) = f (max m n)"
wenzelm@11750
   673
  by (simp add: max_def)
wenzelm@11750
   674
wenzelm@11750
   675
wenzelm@11750
   676
subsubsection "Orders"
wenzelm@11750
   677
wenzelm@11750
   678
axclass order < ord
wenzelm@11750
   679
  order_refl [iff]: "x <= x"
wenzelm@11750
   680
  order_trans: "x <= y ==> y <= z ==> x <= z"
wenzelm@11750
   681
  order_antisym: "x <= y ==> y <= x ==> x = y"
wenzelm@11750
   682
  order_less_le: "(x < y) = (x <= y & x ~= y)"
wenzelm@11750
   683
wenzelm@11750
   684
wenzelm@11750
   685
text {* Reflexivity. *}
wenzelm@11750
   686
wenzelm@11750
   687
lemma order_eq_refl: "!!x::'a::order. x = y ==> x <= y"
wenzelm@11750
   688
    -- {* This form is useful with the classical reasoner. *}
wenzelm@11750
   689
  apply (erule ssubst)
wenzelm@11750
   690
  apply (rule order_refl)
wenzelm@11750
   691
  done
wenzelm@11750
   692
nipkow@13553
   693
lemma order_less_irrefl [iff]: "~ x < (x::'a::order)"
wenzelm@11750
   694
  by (simp add: order_less_le)
wenzelm@11750
   695
wenzelm@11750
   696
lemma order_le_less: "((x::'a::order) <= y) = (x < y | x = y)"
wenzelm@11750
   697
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
paulson@14208
   698
  apply (simp add: order_less_le, blast)
wenzelm@11750
   699
  done
wenzelm@11750
   700
wenzelm@11750
   701
lemmas order_le_imp_less_or_eq = order_le_less [THEN iffD1, standard]
wenzelm@11750
   702
wenzelm@11750
   703
lemma order_less_imp_le: "!!x::'a::order. x < y ==> x <= y"
wenzelm@11750
   704
  by (simp add: order_less_le)
wenzelm@11750
   705
wenzelm@11750
   706
wenzelm@11750
   707
text {* Asymmetry. *}
wenzelm@11750
   708
wenzelm@11750
   709
lemma order_less_not_sym: "(x::'a::order) < y ==> ~ (y < x)"
wenzelm@11750
   710
  by (simp add: order_less_le order_antisym)
wenzelm@11750
   711
wenzelm@11750
   712
lemma order_less_asym: "x < (y::'a::order) ==> (~P ==> y < x) ==> P"
wenzelm@11750
   713
  apply (drule order_less_not_sym)
paulson@14208
   714
  apply (erule contrapos_np, simp)
wenzelm@11750
   715
  done
wenzelm@11750
   716
paulson@14295
   717
lemma order_eq_iff: "!!x::'a::order. (x = y) = (x \<le> y & y \<le> x)"  
paulson@14295
   718
by (blast intro: order_antisym)
paulson@14295
   719
wenzelm@11750
   720
wenzelm@11750
   721
text {* Transitivity. *}
wenzelm@11750
   722
wenzelm@11750
   723
lemma order_less_trans: "!!x::'a::order. [| x < y; y < z |] ==> x < z"
wenzelm@11750
   724
  apply (simp add: order_less_le)
wenzelm@11750
   725
  apply (blast intro: order_trans order_antisym)
wenzelm@11750
   726
  done
wenzelm@11750
   727
wenzelm@11750
   728
lemma order_le_less_trans: "!!x::'a::order. [| x <= y; y < z |] ==> x < z"
wenzelm@11750
   729
  apply (simp add: order_less_le)
wenzelm@11750
   730
  apply (blast intro: order_trans order_antisym)
wenzelm@11750
   731
  done
wenzelm@11750
   732
wenzelm@11750
   733
lemma order_less_le_trans: "!!x::'a::order. [| x < y; y <= z |] ==> x < z"
wenzelm@11750
   734
  apply (simp add: order_less_le)
wenzelm@11750
   735
  apply (blast intro: order_trans order_antisym)
wenzelm@11750
   736
  done
wenzelm@11750
   737
wenzelm@11750
   738
wenzelm@11750
   739
text {* Useful for simplification, but too risky to include by default. *}
wenzelm@11750
   740
wenzelm@11750
   741
lemma order_less_imp_not_less: "(x::'a::order) < y ==>  (~ y < x) = True"
wenzelm@11750
   742
  by (blast elim: order_less_asym)
wenzelm@11750
   743
wenzelm@11750
   744
lemma order_less_imp_triv: "(x::'a::order) < y ==>  (y < x --> P) = True"
wenzelm@11750
   745
  by (blast elim: order_less_asym)
wenzelm@11750
   746
wenzelm@11750
   747
lemma order_less_imp_not_eq: "(x::'a::order) < y ==>  (x = y) = False"
wenzelm@11750
   748
  by auto
wenzelm@11750
   749
wenzelm@11750
   750
lemma order_less_imp_not_eq2: "(x::'a::order) < y ==>  (y = x) = False"
wenzelm@11750
   751
  by auto
wenzelm@11750
   752
wenzelm@11750
   753
wenzelm@11750
   754
text {* Other operators. *}
wenzelm@11750
   755
wenzelm@11750
   756
lemma min_leastR: "(!!x::'a::order. least <= x) ==> min x least = least"
wenzelm@11750
   757
  apply (simp add: min_def)
wenzelm@11750
   758
  apply (blast intro: order_antisym)
wenzelm@11750
   759
  done
wenzelm@11750
   760
wenzelm@11750
   761
lemma max_leastR: "(!!x::'a::order. least <= x) ==> max x least = x"
wenzelm@11750
   762
  apply (simp add: max_def)
wenzelm@11750
   763
  apply (blast intro: order_antisym)
wenzelm@11750
   764
  done
wenzelm@11750
   765
wenzelm@11750
   766
wenzelm@11750
   767
subsubsection {* Least value operator *}
wenzelm@11750
   768
wenzelm@11750
   769
constdefs
wenzelm@11750
   770
  Least :: "('a::ord => bool) => 'a"               (binder "LEAST " 10)
wenzelm@11750
   771
  "Least P == THE x. P x & (ALL y. P y --> x <= y)"
wenzelm@11750
   772
    -- {* We can no longer use LeastM because the latter requires Hilbert-AC. *}
wenzelm@11750
   773
wenzelm@11750
   774
lemma LeastI2:
wenzelm@11750
   775
  "[| P (x::'a::order);
wenzelm@11750
   776
      !!y. P y ==> x <= y;
wenzelm@11750
   777
      !!x. [| P x; ALL y. P y --> x \<le> y |] ==> Q x |]
wenzelm@12281
   778
   ==> Q (Least P)"
wenzelm@11750
   779
  apply (unfold Least_def)
wenzelm@11750
   780
  apply (rule theI2)
wenzelm@11750
   781
    apply (blast intro: order_antisym)+
wenzelm@11750
   782
  done
wenzelm@11750
   783
wenzelm@11750
   784
lemma Least_equality:
wenzelm@12281
   785
    "[| P (k::'a::order); !!x. P x ==> k <= x |] ==> (LEAST x. P x) = k"
wenzelm@11750
   786
  apply (simp add: Least_def)
wenzelm@11750
   787
  apply (rule the_equality)
wenzelm@11750
   788
  apply (auto intro!: order_antisym)
wenzelm@11750
   789
  done
wenzelm@11750
   790
wenzelm@11750
   791
wenzelm@11750
   792
subsubsection "Linear / total orders"
wenzelm@11750
   793
wenzelm@11750
   794
axclass linorder < order
wenzelm@11750
   795
  linorder_linear: "x <= y | y <= x"
wenzelm@11750
   796
wenzelm@11750
   797
lemma linorder_less_linear: "!!x::'a::linorder. x<y | x=y | y<x"
wenzelm@11750
   798
  apply (simp add: order_less_le)
paulson@14208
   799
  apply (insert linorder_linear, blast)
wenzelm@11750
   800
  done
wenzelm@11750
   801
paulson@14365
   802
lemma linorder_le_cases [case_names le ge]:
paulson@14365
   803
    "((x::'a::linorder) \<le> y ==> P) ==> (y \<le> x ==> P) ==> P"
paulson@14365
   804
  by (insert linorder_linear, blast)
paulson@14365
   805
wenzelm@11750
   806
lemma linorder_cases [case_names less equal greater]:
wenzelm@11750
   807
    "((x::'a::linorder) < y ==> P) ==> (x = y ==> P) ==> (y < x ==> P) ==> P"
paulson@14365
   808
  by (insert linorder_less_linear, blast)
wenzelm@11750
   809
wenzelm@11750
   810
lemma linorder_not_less: "!!x::'a::linorder. (~ x < y) = (y <= x)"
wenzelm@11750
   811
  apply (simp add: order_less_le)
wenzelm@11750
   812
  apply (insert linorder_linear)
wenzelm@11750
   813
  apply (blast intro: order_antisym)
wenzelm@11750
   814
  done
wenzelm@11750
   815
wenzelm@11750
   816
lemma linorder_not_le: "!!x::'a::linorder. (~ x <= y) = (y < x)"
wenzelm@11750
   817
  apply (simp add: order_less_le)
wenzelm@11750
   818
  apply (insert linorder_linear)
wenzelm@11750
   819
  apply (blast intro: order_antisym)
wenzelm@11750
   820
  done
wenzelm@11750
   821
wenzelm@11750
   822
lemma linorder_neq_iff: "!!x::'a::linorder. (x ~= y) = (x<y | y<x)"
paulson@14208
   823
by (cut_tac x = x and y = y in linorder_less_linear, auto)
wenzelm@11750
   824
wenzelm@11750
   825
lemma linorder_neqE: "x ~= (y::'a::linorder) ==> (x < y ==> R) ==> (y < x ==> R) ==> R"
paulson@14208
   826
by (simp add: linorder_neq_iff, blast)
wenzelm@11750
   827
wenzelm@11750
   828
wenzelm@11750
   829
subsubsection "Min and max on (linear) orders"
wenzelm@11750
   830
wenzelm@11750
   831
lemma min_same [simp]: "min (x::'a::order) x = x"
wenzelm@11750
   832
  by (simp add: min_def)
wenzelm@11750
   833
wenzelm@11750
   834
lemma max_same [simp]: "max (x::'a::order) x = x"
wenzelm@11750
   835
  by (simp add: max_def)
wenzelm@11750
   836
wenzelm@11750
   837
lemma le_max_iff_disj: "!!z::'a::linorder. (z <= max x y) = (z <= x | z <= y)"
wenzelm@11750
   838
  apply (simp add: max_def)
wenzelm@11750
   839
  apply (insert linorder_linear)
wenzelm@11750
   840
  apply (blast intro: order_trans)
wenzelm@11750
   841
  done
wenzelm@11750
   842
wenzelm@11750
   843
lemma le_maxI1: "(x::'a::linorder) <= max x y"
wenzelm@11750
   844
  by (simp add: le_max_iff_disj)
wenzelm@11750
   845
wenzelm@11750
   846
lemma le_maxI2: "(y::'a::linorder) <= max x y"
wenzelm@11750
   847
    -- {* CANNOT use with @{text "[intro!]"} because blast will give PROOF FAILED. *}
wenzelm@11750
   848
  by (simp add: le_max_iff_disj)
wenzelm@11750
   849
wenzelm@11750
   850
lemma less_max_iff_disj: "!!z::'a::linorder. (z < max x y) = (z < x | z < y)"
wenzelm@11750
   851
  apply (simp add: max_def order_le_less)
wenzelm@11750
   852
  apply (insert linorder_less_linear)
wenzelm@11750
   853
  apply (blast intro: order_less_trans)
wenzelm@11750
   854
  done
wenzelm@11750
   855
wenzelm@11750
   856
lemma max_le_iff_conj [simp]:
wenzelm@11750
   857
    "!!z::'a::linorder. (max x y <= z) = (x <= z & y <= z)"
wenzelm@11750
   858
  apply (simp add: max_def)
wenzelm@11750
   859
  apply (insert linorder_linear)
wenzelm@11750
   860
  apply (blast intro: order_trans)
wenzelm@11750
   861
  done
wenzelm@11750
   862
wenzelm@11750
   863
lemma max_less_iff_conj [simp]:
wenzelm@11750
   864
    "!!z::'a::linorder. (max x y < z) = (x < z & y < z)"
wenzelm@11750
   865
  apply (simp add: order_le_less max_def)
wenzelm@11750
   866
  apply (insert linorder_less_linear)
wenzelm@11750
   867
  apply (blast intro: order_less_trans)
wenzelm@11750
   868
  done
wenzelm@11750
   869
wenzelm@11750
   870
lemma le_min_iff_conj [simp]:
wenzelm@11750
   871
    "!!z::'a::linorder. (z <= min x y) = (z <= x & z <= y)"
wenzelm@12892
   872
    -- {* @{text "[iff]"} screws up a @{text blast} in MiniML *}
wenzelm@11750
   873
  apply (simp add: min_def)
wenzelm@11750
   874
  apply (insert linorder_linear)
wenzelm@11750
   875
  apply (blast intro: order_trans)
wenzelm@11750
   876
  done
wenzelm@11750
   877
wenzelm@11750
   878
lemma min_less_iff_conj [simp]:
wenzelm@11750
   879
    "!!z::'a::linorder. (z < min x y) = (z < x & z < y)"
wenzelm@11750
   880
  apply (simp add: order_le_less min_def)
wenzelm@11750
   881
  apply (insert linorder_less_linear)
wenzelm@11750
   882
  apply (blast intro: order_less_trans)
wenzelm@11750
   883
  done
wenzelm@11750
   884
wenzelm@11750
   885
lemma min_le_iff_disj: "!!z::'a::linorder. (min x y <= z) = (x <= z | y <= z)"
wenzelm@11750
   886
  apply (simp add: min_def)
wenzelm@11750
   887
  apply (insert linorder_linear)
wenzelm@11750
   888
  apply (blast intro: order_trans)
wenzelm@11750
   889
  done
wenzelm@11750
   890
wenzelm@11750
   891
lemma min_less_iff_disj: "!!z::'a::linorder. (min x y < z) = (x < z | y < z)"
wenzelm@11750
   892
  apply (simp add: min_def order_le_less)
wenzelm@11750
   893
  apply (insert linorder_less_linear)
wenzelm@11750
   894
  apply (blast intro: order_less_trans)
wenzelm@11750
   895
  done
wenzelm@11750
   896
nipkow@13438
   897
lemma max_assoc: "!!x::'a::linorder. max (max x y) z = max x (max y z)"
nipkow@13438
   898
apply(simp add:max_def)
nipkow@13438
   899
apply(rule conjI)
nipkow@13438
   900
apply(blast intro:order_trans)
nipkow@13438
   901
apply(simp add:linorder_not_le)
nipkow@13438
   902
apply(blast dest: order_less_trans order_le_less_trans)
nipkow@13438
   903
done
nipkow@13438
   904
nipkow@13438
   905
lemma max_commute: "!!x::'a::linorder. max x y = max y x"
nipkow@13438
   906
apply(simp add:max_def)
nipkow@13438
   907
apply(rule conjI)
nipkow@13438
   908
apply(blast intro:order_antisym)
nipkow@13438
   909
apply(simp add:linorder_not_le)
nipkow@13438
   910
apply(blast dest: order_less_trans)
nipkow@13438
   911
done
nipkow@13438
   912
nipkow@13438
   913
lemmas max_ac = max_assoc max_commute
nipkow@13438
   914
                mk_left_commute[of max,OF max_assoc max_commute]
nipkow@13438
   915
nipkow@13438
   916
lemma min_assoc: "!!x::'a::linorder. min (min x y) z = min x (min y z)"
nipkow@13438
   917
apply(simp add:min_def)
nipkow@13438
   918
apply(rule conjI)
nipkow@13438
   919
apply(blast intro:order_trans)
nipkow@13438
   920
apply(simp add:linorder_not_le)
nipkow@13438
   921
apply(blast dest: order_less_trans order_le_less_trans)
nipkow@13438
   922
done
nipkow@13438
   923
nipkow@13438
   924
lemma min_commute: "!!x::'a::linorder. min x y = min y x"
nipkow@13438
   925
apply(simp add:min_def)
nipkow@13438
   926
apply(rule conjI)
nipkow@13438
   927
apply(blast intro:order_antisym)
nipkow@13438
   928
apply(simp add:linorder_not_le)
nipkow@13438
   929
apply(blast dest: order_less_trans)
nipkow@13438
   930
done
nipkow@13438
   931
nipkow@13438
   932
lemmas min_ac = min_assoc min_commute
nipkow@13438
   933
                mk_left_commute[of min,OF min_assoc min_commute]
nipkow@13438
   934
wenzelm@11750
   935
lemma split_min:
wenzelm@11750
   936
    "P (min (i::'a::linorder) j) = ((i <= j --> P(i)) & (~ i <= j --> P(j)))"
wenzelm@11750
   937
  by (simp add: min_def)
wenzelm@11750
   938
wenzelm@11750
   939
lemma split_max:
wenzelm@11750
   940
    "P (max (i::'a::linorder) j) = ((i <= j --> P(j)) & (~ i <= j --> P(i)))"
wenzelm@11750
   941
  by (simp add: max_def)
wenzelm@11750
   942
wenzelm@11750
   943
ballarin@14398
   944
subsubsection {* Transitivity rules for calculational reasoning *}
ballarin@14398
   945
ballarin@14398
   946
ballarin@14398
   947
lemma order_neq_le_trans: "a ~= b ==> (a::'a::order) <= b ==> a < b"
ballarin@14398
   948
  by (simp add: order_less_le)
ballarin@14398
   949
ballarin@14398
   950
lemma order_le_neq_trans: "(a::'a::order) <= b ==> a ~= b ==> a < b"
ballarin@14398
   951
  by (simp add: order_less_le)
ballarin@14398
   952
ballarin@14398
   953
lemma order_less_asym': "(a::'a::order) < b ==> b < a ==> P"
ballarin@14398
   954
  by (rule order_less_asym)
ballarin@14398
   955
ballarin@14398
   956
ballarin@14444
   957
subsubsection {* Setup of transitivity reasoner as Solver *}
ballarin@14398
   958
ballarin@14398
   959
lemma less_imp_neq: "[| (x::'a::order) < y |] ==> x ~= y"
ballarin@14398
   960
  by (erule contrapos_pn, erule subst, rule order_less_irrefl)
ballarin@14398
   961
ballarin@14398
   962
lemma eq_neq_eq_imp_neq: "[| x = a ; a ~= b; b = y |] ==> x ~= y"
ballarin@14398
   963
  by (erule subst, erule ssubst, assumption)
ballarin@14398
   964
ballarin@14398
   965
ML_setup {*
ballarin@14398
   966
ballarin@14398
   967
structure Trans_Tac = Trans_Tac_Fun (
ballarin@14398
   968
  struct
ballarin@14398
   969
    val less_reflE = thm "order_less_irrefl" RS thm "notE";
ballarin@14398
   970
    val le_refl = thm "order_refl";
ballarin@14398
   971
    val less_imp_le = thm "order_less_imp_le";
ballarin@14398
   972
    val not_lessI = thm "linorder_not_less" RS thm "iffD2";
ballarin@14398
   973
    val not_leI = thm "linorder_not_le" RS thm "iffD2";
ballarin@14398
   974
    val not_lessD = thm "linorder_not_less" RS thm "iffD1";
ballarin@14398
   975
    val not_leD = thm "linorder_not_le" RS thm "iffD1";
ballarin@14398
   976
    val eqI = thm "order_antisym";
ballarin@14398
   977
    val eqD1 = thm "order_eq_refl";
ballarin@14398
   978
    val eqD2 = thm "sym" RS thm "order_eq_refl";
ballarin@14398
   979
    val less_trans = thm "order_less_trans";
ballarin@14398
   980
    val less_le_trans = thm "order_less_le_trans";
ballarin@14398
   981
    val le_less_trans = thm "order_le_less_trans";
ballarin@14398
   982
    val le_trans = thm "order_trans";
ballarin@14398
   983
    val le_neq_trans = thm "order_le_neq_trans";
ballarin@14398
   984
    val neq_le_trans = thm "order_neq_le_trans";
ballarin@14398
   985
    val less_imp_neq = thm "less_imp_neq";
ballarin@14398
   986
    val eq_neq_eq_imp_neq = thm "eq_neq_eq_imp_neq";
ballarin@14398
   987
ballarin@14398
   988
    fun decomp_gen sort sign (Trueprop $ t) =
ballarin@14398
   989
      let fun of_sort t = Sign.of_sort sign (type_of t, sort)
ballarin@14398
   990
      fun dec (Const ("Not", _) $ t) = (
ballarin@14398
   991
              case dec t of
ballarin@14398
   992
                None => None
ballarin@14398
   993
              | Some (t1, rel, t2) => Some (t1, "~" ^ rel, t2))
ballarin@14398
   994
            | dec (Const ("op =",  _) $ t1 $ t2) = 
ballarin@14398
   995
                if of_sort t1
ballarin@14398
   996
                then Some (t1, "=", t2)
ballarin@14398
   997
                else None
ballarin@14398
   998
            | dec (Const ("op <=",  _) $ t1 $ t2) = 
ballarin@14398
   999
                if of_sort t1
ballarin@14398
  1000
                then Some (t1, "<=", t2)
ballarin@14398
  1001
                else None
ballarin@14398
  1002
            | dec (Const ("op <",  _) $ t1 $ t2) = 
ballarin@14398
  1003
                if of_sort t1
ballarin@14398
  1004
                then Some (t1, "<", t2)
ballarin@14398
  1005
                else None
ballarin@14398
  1006
            | dec _ = None
ballarin@14398
  1007
      in dec t end;
ballarin@14398
  1008
ballarin@14398
  1009
    val decomp_part = decomp_gen ["HOL.order"];
ballarin@14398
  1010
    val decomp_lin = decomp_gen ["HOL.linorder"];
ballarin@14398
  1011
ballarin@14398
  1012
  end);  (* struct *)
ballarin@14398
  1013
ballarin@14398
  1014
Context.>> (fn thy => (simpset_ref_of thy :=
ballarin@14398
  1015
  simpset_of thy
ballarin@14398
  1016
    addSolver (mk_solver "Trans_linear" (fn _ => Trans_Tac.linear_tac))
ballarin@14398
  1017
    addSolver (mk_solver "Trans_partial" (fn _ => Trans_Tac.partial_tac));
ballarin@14444
  1018
  (* Adding the transitivity reasoners also as safe solvers showed a slight
ballarin@14444
  1019
     speed up, but the reasoning strength appears to be not higher (at least
ballarin@14444
  1020
     no breaking of additional proofs in the entire HOL distribution, as
ballarin@14444
  1021
     of 5 March 2004, was observed). *)
ballarin@14398
  1022
  thy))
ballarin@14398
  1023
*}
ballarin@14398
  1024
ballarin@14398
  1025
(* Optional methods
ballarin@14398
  1026
ballarin@14398
  1027
method_setup trans_partial =
ballarin@14398
  1028
  {* Method.no_args (Method.SIMPLE_METHOD' HEADGOAL (trans_tac_partial)) *}
ballarin@14398
  1029
  {* simple transitivity reasoner *}	    
ballarin@14398
  1030
method_setup trans_linear =
ballarin@14398
  1031
  {* Method.no_args (Method.SIMPLE_METHOD' HEADGOAL (trans_tac_linear)) *}
ballarin@14398
  1032
  {* simple transitivity reasoner *}
ballarin@14398
  1033
*)
ballarin@14398
  1034
ballarin@14444
  1035
(*
ballarin@14444
  1036
declare order.order_refl [simp del] order_less_irrefl [simp del]
ballarin@14444
  1037
*)
ballarin@14444
  1038
wenzelm@11750
  1039
subsubsection "Bounded quantifiers"
wenzelm@11750
  1040
wenzelm@11750
  1041
syntax
wenzelm@11750
  1042
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3ALL _<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1043
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3EX _<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1044
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3ALL _<=_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1045
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3EX _<=_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1046
wenzelm@12114
  1047
syntax (xsymbols)
wenzelm@11750
  1048
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1049
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1050
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1051
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1052
wenzelm@11750
  1053
syntax (HOL)
wenzelm@11750
  1054
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3! _<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1055
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3? _<_./ _)"  [0, 0, 10] 10)
wenzelm@11750
  1056
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3! _<=_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1057
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3? _<=_./ _)" [0, 0, 10] 10)
wenzelm@11750
  1058
wenzelm@11750
  1059
translations
wenzelm@11750
  1060
 "ALL x<y. P"   =>  "ALL x. x < y --> P"
wenzelm@11750
  1061
 "EX x<y. P"    =>  "EX x. x < y  & P"
wenzelm@11750
  1062
 "ALL x<=y. P"  =>  "ALL x. x <= y --> P"
wenzelm@11750
  1063
 "EX x<=y. P"   =>  "EX x. x <= y & P"
wenzelm@11750
  1064
kleing@14357
  1065
print_translation {*
kleing@14357
  1066
let
kleing@14357
  1067
  fun all_tr' [Const ("_bound",_) $ Free (v,_), 
kleing@14357
  1068
               Const("op -->",_) $ (Const ("op <",_) $ (Const ("_bound",_) $ Free (v',_)) $ n ) $ P] = 
kleing@14357
  1069
  (if v=v' then Syntax.const "_lessAll" $ Syntax.mark_bound v' $ n $ P else raise Match)
kleing@14357
  1070
kleing@14357
  1071
  | all_tr' [Const ("_bound",_) $ Free (v,_), 
kleing@14357
  1072
               Const("op -->",_) $ (Const ("op <=",_) $ (Const ("_bound",_) $ Free (v',_)) $ n ) $ P] = 
kleing@14357
  1073
  (if v=v' then Syntax.const "_leAll" $ Syntax.mark_bound v' $ n $ P else raise Match);
kleing@14357
  1074
kleing@14357
  1075
  fun ex_tr' [Const ("_bound",_) $ Free (v,_), 
kleing@14357
  1076
               Const("op &",_) $ (Const ("op <",_) $ (Const ("_bound",_) $ Free (v',_)) $ n ) $ P] = 
kleing@14357
  1077
  (if v=v' then Syntax.const "_lessEx" $ Syntax.mark_bound v' $ n $ P else raise Match)
kleing@14357
  1078
kleing@14357
  1079
  | ex_tr' [Const ("_bound",_) $ Free (v,_), 
kleing@14357
  1080
               Const("op &",_) $ (Const ("op <=",_) $ (Const ("_bound",_) $ Free (v',_)) $ n ) $ P] = 
kleing@14357
  1081
  (if v=v' then Syntax.const "_leEx" $ Syntax.mark_bound v' $ n $ P else raise Match)
kleing@14357
  1082
in
kleing@14357
  1083
[("ALL ", all_tr'), ("EX ", ex_tr')]
clasohm@923
  1084
end
kleing@14357
  1085
*}
kleing@14357
  1086
kleing@14357
  1087
end