src/HOL/HOL.thy
author wenzelm
Mon, 05 Aug 2002 21:16:36 +0200
changeset 13456 42601eb7553f
parent 13438 527811f00c56
child 13550 5a176b8dda84
permissions -rw-r--r--
special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     1
(*  Title:      HOL/HOL.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     3
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     5
*)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     6
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     7
header {* The basis of Higher-Order Logic *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
     9
theory HOL = CPure
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
    10
files ("HOL_lemmas.ML") ("cladata.ML") ("blastdata.ML") ("simpdata.ML"):
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    11
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    12
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    13
subsection {* Primitive logic *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    14
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    15
subsubsection {* Core syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    16
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    17
classes type < logic
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    18
defaultsort type
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    19
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    20
global
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    21
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    22
typedecl bool
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    23
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    24
arities
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    25
  bool :: type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    26
  fun :: (type, type) type
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    27
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    28
judgment
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    29
  Trueprop      :: "bool => prop"                   ("(_)" 5)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    30
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    31
consts
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    32
  Not           :: "bool => bool"                   ("~ _" [40] 40)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    33
  True          :: bool
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    34
  False         :: bool
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    35
  If            :: "[bool, 'a, 'a] => 'a"           ("(if (_)/ then (_)/ else (_))" 10)
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    36
  arbitrary     :: 'a
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    37
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    38
  The           :: "('a => bool) => 'a"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    39
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    40
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    41
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    42
  Let           :: "['a, 'a => 'b] => 'b"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    43
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    44
  "="           :: "['a, 'a] => bool"               (infixl 50)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    45
  &             :: "[bool, bool] => bool"           (infixr 35)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    46
  "|"           :: "[bool, bool] => bool"           (infixr 30)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    47
  -->           :: "[bool, bool] => bool"           (infixr 25)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    48
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    49
local
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    50
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    51
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    52
subsubsection {* Additional concrete syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    53
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
    54
nonterminals
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    55
  letbinds  letbind
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    56
  case_syn  cases_syn
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    57
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    58
syntax
12650
fbc17f1e746b "_not_equal" dummy constant;
wenzelm
parents: 12633
diff changeset
    59
  "_not_equal"  :: "['a, 'a] => bool"                    (infixl "~=" 50)
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    60
  "_The"        :: "[pttrn, bool] => 'a"                 ("(3THE _./ _)" [0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    61
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    62
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    63
  ""            :: "letbind => letbinds"                 ("_")
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    64
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    65
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    66
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
    67
  "_case_syntax":: "['a, cases_syn] => 'b"               ("(case _ of/ _)" 10)
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
    68
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    69
  ""            :: "case_syn => cases_syn"               ("_")
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
    70
  "_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    71
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    72
translations
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
    73
  "x ~= y"                == "~ (x = y)"
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    74
  "THE x. P"              == "The (%x. P)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    75
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
1114
c8dfb56a7e95 Prod is now a parent of Lfp.
nipkow
parents: 1068
diff changeset
    76
  "let x = a in e"        == "Let a (%x. e)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    77
12633
ad9277743664 tuned ``syntax (output)'';
wenzelm
parents: 12436
diff changeset
    78
syntax (output)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    79
  "="           :: "['a, 'a] => bool"                    (infix 50)
12650
fbc17f1e746b "_not_equal" dummy constant;
wenzelm
parents: 12633
diff changeset
    80
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "~=" 50)
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    81
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
    82
syntax (xsymbols)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    83
  Not           :: "bool => bool"                        ("\<not> _" [40] 40)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    84
  "op &"        :: "[bool, bool] => bool"                (infixr "\<and>" 35)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    85
  "op |"        :: "[bool, bool] => bool"                (infixr "\<or>" 30)
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
    86
  "op -->"      :: "[bool, bool] => bool"                (infixr "\<longrightarrow>" 25)
12650
fbc17f1e746b "_not_equal" dummy constant;
wenzelm
parents: 12633
diff changeset
    87
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "\<noteq>" 50)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    88
  "ALL "        :: "[idts, bool] => bool"                ("(3\<forall>_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    89
  "EX "         :: "[idts, bool] => bool"                ("(3\<exists>_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    90
  "EX! "        :: "[idts, bool] => bool"                ("(3\<exists>!_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    91
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ \<Rightarrow>/ _)" 10)
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
    92
(*"_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ \\<orelse> _")*)
2372
a2999e19703b fixed alternative quantifier symbol syntax;
wenzelm
parents: 2368
diff changeset
    93
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
    94
syntax (xsymbols output)
12650
fbc17f1e746b "_not_equal" dummy constant;
wenzelm
parents: 12633
diff changeset
    95
  "_not_equal"  :: "['a, 'a] => bool"                    (infix "\<noteq>" 50)
3820
46b255e140dc fixed infix syntax;
wenzelm
parents: 3370
diff changeset
    96
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
    97
syntax (HTML output)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
    98
  Not           :: "bool => bool"                        ("\<not> _" [40] 40)
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
    99
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   100
syntax (HOL)
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   101
  "ALL "        :: "[idts, bool] => bool"                ("(3! _./ _)" [0, 10] 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   102
  "EX "         :: "[idts, bool] => bool"                ("(3? _./ _)" [0, 10] 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   103
  "EX! "        :: "[idts, bool] => bool"                ("(3?! _./ _)" [0, 10] 10)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   104
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   105
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   106
subsubsection {* Axioms and basic definitions *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
   107
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   108
axioms
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   109
  eq_reflection: "(x=y) ==> (x==y)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   111
  refl:         "t = (t::'a)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   112
  subst:        "[| s = t; P(s) |] ==> P(t::'a)"
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   113
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   114
  ext:          "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   115
    -- {* Extensionality is built into the meta-logic, and this rule expresses *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   116
    -- {* a related property.  It is an eta-expanded version of the traditional *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   117
    -- {* rule, and similar to the ABS rule of HOL *}
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   118
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
   119
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   120
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   121
  impI:         "(P ==> Q) ==> P-->Q"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   122
  mp:           "[| P-->Q;  P |] ==> Q"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   123
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   124
defs
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   125
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   126
  All_def:      "All(P)    == (P = (%x. True))"
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   127
  Ex_def:       "Ex(P)     == !Q. (!x. P x --> Q) --> Q"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   128
  False_def:    "False     == (!P. P)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   129
  not_def:      "~ P       == P-->False"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   130
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   131
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   132
  Ex1_def:      "Ex1(P)    == ? x. P(x) & (! y. P(y) --> y=x)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   133
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   134
axioms
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   135
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   136
  True_or_False:  "(P=True) | (P=False)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   137
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   138
defs
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   139
  Let_def:      "Let s f == f(s)"
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   140
  if_def:       "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)"
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4868
diff changeset
   141
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   142
  arbitrary_def:  "False ==> arbitrary == (THE x. False)"
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   143
    -- {* @{term arbitrary} is completely unspecified, but is made to appear as a
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   144
    definition syntactically *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   145
3320
3a5e4930fb77 Added `arbitrary'
nipkow
parents: 3248
diff changeset
   146
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   147
subsubsection {* Generic algebraic operations *}
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   148
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   149
axclass zero < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   150
axclass one < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   151
axclass plus < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   152
axclass minus < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   153
axclass times < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   154
axclass inverse < type
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   155
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   156
global
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   157
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   158
consts
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   159
  "0"           :: "'a::zero"                       ("0")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   160
  "1"           :: "'a::one"                        ("1")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   161
  "+"           :: "['a::plus, 'a]  => 'a"          (infixl 65)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   162
  -             :: "['a::minus, 'a] => 'a"          (infixl 65)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   163
  uminus        :: "['a::minus] => 'a"              ("- _" [81] 80)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   164
  *             :: "['a::times, 'a] => 'a"          (infixl 70)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   165
13456
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   166
syntax
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   167
  "_index1"  :: index    ("\<^sub>1")
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   168
translations
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   169
  (index) "\<^sub>1" == "_index 1"
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   170
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   171
local
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   172
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   173
typed_print_translation {*
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   174
  let
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   175
    fun tr' c = (c, fn show_sorts => fn T => fn ts =>
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   176
      if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   177
      else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T);
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   178
  in [tr' "0", tr' "1"] end;
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   179
*} -- {* show types that are presumably too general *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   180
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   181
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   182
consts
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   183
  abs           :: "'a::minus => 'a"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   184
  inverse       :: "'a::inverse => 'a"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   185
  divide        :: "['a::inverse, 'a] => 'a"        (infixl "'/" 70)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   186
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   187
syntax (xsymbols)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   188
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   189
syntax (HTML output)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   190
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   191
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   192
axclass plus_ac0 < plus, zero
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   193
  commute: "x + y = y + x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   194
  assoc:   "(x + y) + z = x + (y + z)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   195
  zero:    "0 + x = x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   196
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   197
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   198
subsection {* Theory and package setup *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   199
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   200
subsubsection {* Basic lemmas *}
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   201
9736
332fab43628f Fixed rulify.
nipkow
parents: 9713
diff changeset
   202
use "HOL_lemmas.ML"
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   203
theorems case_split = case_split_thm [case_names True False]
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   204
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   205
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   206
subsubsection {* Intuitionistic Reasoning *}
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   207
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   208
lemma impE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   209
  assumes 1: "P --> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   210
    and 2: "Q ==> R"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   211
    and 3: "P --> Q ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   212
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   213
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   214
  from 3 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   215
  with 1 have Q by (rule impE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   216
  with 2 show R .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   217
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   218
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   219
lemma allE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   220
  assumes 1: "ALL x. P x"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   221
    and 2: "P x ==> ALL x. P x ==> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   222
  shows Q
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   223
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   224
  from 1 have "P x" by (rule spec)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   225
  from this and 1 show Q by (rule 2)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   226
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   227
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   228
lemma notE':
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   229
  assumes 1: "~ P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   230
    and 2: "~ P ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   231
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   232
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   233
  from 2 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   234
  with 1 show R by (rule notE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   235
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   236
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   237
lemmas [CPure.elim!] = disjE iffE FalseE conjE exE
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   238
  and [CPure.intro!] = iffI conjI impI TrueI notI allI refl
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   239
  and [CPure.elim 2] = allE notE' impE'
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   240
  and [CPure.intro] = exI disjI2 disjI1
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   241
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   242
lemmas [trans] = trans
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   243
  and [sym] = sym not_sym
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   244
  and [CPure.elim?] = iffD1 iffD2 impE
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   245
11438
3d9222b80989 declare trans [trans] (*overridden in theory Calculation*);
wenzelm
parents: 11432
diff changeset
   246
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   247
subsubsection {* Atomizing meta-level connectives *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   248
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   249
lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   250
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   251
  assume "!!x. P x"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   252
  show "ALL x. P x" by (rule allI)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   253
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   254
  assume "ALL x. P x"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   255
  thus "!!x. P x" by (rule allE)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   256
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   257
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   258
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   259
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   260
  assume r: "A ==> B"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   261
  show "A --> B" by (rule impI) (rule r)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   262
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   263
  assume "A --> B" and A
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   264
  thus B by (rule mp)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   265
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   266
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   267
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   268
proof
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   269
  assume "x == y"
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   270
  show "x = y" by (unfold prems) (rule refl)
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   271
next
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   272
  assume "x = y"
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   273
  thus "x == y" by (rule eq_reflection)
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   274
qed
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   275
12023
wenzelm
parents: 12003
diff changeset
   276
lemma atomize_conj [atomize]:
wenzelm
parents: 12003
diff changeset
   277
  "(!!C. (A ==> B ==> PROP C) ==> PROP C) == Trueprop (A & B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   278
proof
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   279
  assume "!!C. (A ==> B ==> PROP C) ==> PROP C"
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   280
  show "A & B" by (rule conjI)
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   281
next
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   282
  fix C
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   283
  assume "A & B"
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   284
  assume "A ==> B ==> PROP C"
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   285
  thus "PROP C"
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   286
  proof this
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   287
    show A by (rule conjunct1)
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   288
    show B by (rule conjunct2)
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   289
  qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   290
qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   291
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   292
lemmas [symmetric, rulify] = atomize_all atomize_imp
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   293
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   294
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   295
subsubsection {* Classical Reasoner setup *}
9529
d9434a9277a4 lemmas atomize = all_eq imp_eq;
wenzelm
parents: 9488
diff changeset
   296
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   297
use "cladata.ML"
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   298
setup hypsubst_setup
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   299
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   300
ML_setup {*
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   301
  Context.>> (ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac));
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   302
*}
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   303
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   304
setup Classical.setup
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   305
setup clasetup
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   306
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   307
lemmas [intro?] = ext
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   308
  and [elim?] = ex1_implies_ex
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   309
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   310
use "blastdata.ML"
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   311
setup Blast.setup
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   312
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   313
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   314
subsubsection {* Simplifier setup *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   315
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   316
lemma meta_eq_to_obj_eq: "x == y ==> x = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   317
proof -
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   318
  assume r: "x == y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   319
  show "x = y" by (unfold r) (rule refl)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   320
qed
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   321
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   322
lemma eta_contract_eq: "(%s. f s) = f" ..
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   323
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   324
lemma simp_thms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   325
  shows not_not: "(~ ~ P) = P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   326
  and
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   327
    "(P ~= Q) = (P = (~Q))"
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   328
    "(P | ~P) = True"    "(~P | P) = True"
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   329
    "((~P) = (~Q)) = (P=Q)"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   330
    "(x = x) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   331
    "(~True) = False"  "(~False) = True"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   332
    "(~P) ~= P"  "P ~= (~P)"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   333
    "(True=P) = P"  "(P=True) = P"  "(False=P) = (~P)"  "(P=False) = (~P)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   334
    "(True --> P) = P"  "(False --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   335
    "(P --> True) = True"  "(P --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   336
    "(P --> False) = (~P)"  "(P --> ~P) = (~P)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   337
    "(P & True) = P"  "(True & P) = P"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   338
    "(P & False) = False"  "(False & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   339
    "(P & P) = P"  "(P & (P & Q)) = (P & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   340
    "(P & ~P) = False"    "(~P & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   341
    "(P | True) = True"  "(True | P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   342
    "(P | False) = P"  "(False | P) = P"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   343
    "(P | P) = P"  "(P | (P | Q)) = (P | Q)" and
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   344
    "(ALL x. P) = P"  "(EX x. P) = P"  "EX x. x=t"  "EX x. t=x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   345
    -- {* needed for the one-point-rule quantifier simplification procs *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   346
    -- {* essential for termination!! *} and
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   347
    "!!P. (EX x. x=t & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   348
    "!!P. (EX x. t=x & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   349
    "!!P. (ALL x. x=t --> P(x)) = P(t)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   350
    "!!P. (ALL x. t=x --> P(x)) = P(t)"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   351
  by (blast, blast, blast, blast, blast, rules+)
13421
8fcdf4a26468 simplified locale predicates;
wenzelm
parents: 13412
diff changeset
   352
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   353
lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   354
  by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   355
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   356
lemma ex_simps:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   357
  "!!P Q. (EX x. P x & Q)   = ((EX x. P x) & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   358
  "!!P Q. (EX x. P & Q x)   = (P & (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   359
  "!!P Q. (EX x. P x | Q)   = ((EX x. P x) | Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   360
  "!!P Q. (EX x. P | Q x)   = (P | (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   361
  "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   362
  "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   363
  -- {* Miniscoping: pushing in existential quantifiers. *}
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   364
  by (rules | blast)+
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   365
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   366
lemma all_simps:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   367
  "!!P Q. (ALL x. P x & Q)   = ((ALL x. P x) & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   368
  "!!P Q. (ALL x. P & Q x)   = (P & (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   369
  "!!P Q. (ALL x. P x | Q)   = ((ALL x. P x) | Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   370
  "!!P Q. (ALL x. P | Q x)   = (P | (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   371
  "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   372
  "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   373
  -- {* Miniscoping: pushing in universal quantifiers. *}
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   374
  by (rules | blast)+
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   375
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   376
lemma eq_ac:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   377
  shows eq_commute: "(a=b) = (b=a)"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   378
    and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   379
    and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (rules, blast+)
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   380
lemma neq_commute: "(a~=b) = (b~=a)" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   381
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   382
lemma conj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   383
  shows conj_commute: "(P&Q) = (Q&P)"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   384
    and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by rules+
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   385
lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   386
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   387
lemma disj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   388
  shows disj_commute: "(P|Q) = (Q|P)"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   389
    and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by rules+
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   390
lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   391
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   392
lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   393
lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   394
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   395
lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   396
lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   397
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   398
lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   399
lemma imp_conjL: "((P&Q) -->R)  = (P --> (Q --> R))" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   400
lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   401
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   402
text {* These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   403
lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   404
lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   405
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   406
lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   407
lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   408
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   409
lemma de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   410
lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   411
lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   412
lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   413
lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   414
lemma disj_not2: "(P | ~Q) = (Q --> P)"  -- {* changes orientation :-( *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   415
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   416
lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   417
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   418
lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   419
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   420
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   421
lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   422
  -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   423
  -- {* cases boil down to the same thing. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   424
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   425
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   426
lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   427
lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   428
lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   429
lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   430
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   431
lemma ex_disj_distrib: "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))" by rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   432
lemma all_conj_distrib: "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))" by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   433
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   434
text {*
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   435
  \medskip The @{text "&"} congruence rule: not included by default!
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   436
  May slow rewrite proofs down by as much as 50\% *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   437
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   438
lemma conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   439
    "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   440
  by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   441
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   442
lemma rev_conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   443
    "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   444
  by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   445
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   446
text {* The @{text "|"} congruence rule: not included by default! *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   447
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   448
lemma disj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   449
    "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   450
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   451
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   452
lemma eq_sym_conv: "(x = y) = (y = x)"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   453
  by rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   454
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   455
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   456
text {* \medskip if-then-else rules *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   457
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   458
lemma if_True: "(if True then x else y) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   459
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   460
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   461
lemma if_False: "(if False then x else y) = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   462
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   463
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   464
lemma if_P: "P ==> (if P then x else y) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   465
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   466
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   467
lemma if_not_P: "~P ==> (if P then x else y) = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   468
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   469
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   470
lemma split_if: "P (if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   471
  apply (rule case_split [of Q])
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   472
   apply (subst if_P)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   473
    prefer 3 apply (subst if_not_P)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   474
     apply blast+
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   475
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   476
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   477
lemma split_if_asm: "P (if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   478
  apply (subst split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   479
  apply blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   480
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   481
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   482
lemmas if_splits = split_if split_if_asm
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   483
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   484
lemma if_def2: "(if Q then x else y) = ((Q --> x) & (~ Q --> y))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   485
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   486
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   487
lemma if_cancel: "(if c then x else x) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   488
  apply (subst split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   489
  apply blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   490
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   491
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   492
lemma if_eq_cancel: "(if x = y then y else x) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   493
  apply (subst split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   494
  apply blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   495
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   496
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   497
lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   498
  -- {* This form is useful for expanding @{text if}s on the RIGHT of the @{text "==>"} symbol. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   499
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   500
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   501
lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   502
  -- {* And this form is useful for expanding @{text if}s on the LEFT. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   503
  apply (subst split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   504
  apply blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   505
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   506
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   507
lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) rules
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   508
lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) rules
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   509
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   510
use "simpdata.ML"
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   511
setup Simplifier.setup
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   512
setup "Simplifier.method_setup Splitter.split_modifiers" setup simpsetup
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   513
setup Splitter.setup setup Clasimp.setup
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   514
13438
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   515
text{*Needs only HOL-lemmas:*}
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   516
lemma mk_left_commute:
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   517
  assumes a: "\<And>x y z. f (f x y) z = f x (f y z)" and
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   518
          c: "\<And>x y. f x y = f y x"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   519
  shows "f x (f y z) = f y (f x z)"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   520
by(rule trans[OF trans[OF c a] arg_cong[OF c, of "f y"]])
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   521
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   522
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   523
subsubsection {* Generic cases and induction *}
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   524
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   525
constdefs
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   526
  induct_forall :: "('a => bool) => bool"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   527
  "induct_forall P == \<forall>x. P x"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   528
  induct_implies :: "bool => bool => bool"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   529
  "induct_implies A B == A --> B"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   530
  induct_equal :: "'a => 'a => bool"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   531
  "induct_equal x y == x = y"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   532
  induct_conj :: "bool => bool => bool"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   533
  "induct_conj A B == A & B"
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   534
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   535
lemma induct_forall_eq: "(!!x. P x) == Trueprop (induct_forall (\<lambda>x. P x))"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   536
  by (simp only: atomize_all induct_forall_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   537
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   538
lemma induct_implies_eq: "(A ==> B) == Trueprop (induct_implies A B)"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   539
  by (simp only: atomize_imp induct_implies_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   540
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   541
lemma induct_equal_eq: "(x == y) == Trueprop (induct_equal x y)"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   542
  by (simp only: atomize_eq induct_equal_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   543
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   544
lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   545
    induct_conj (induct_forall A) (induct_forall B)"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   546
  by (unfold induct_forall_def induct_conj_def) rules
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   547
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   548
lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   549
    induct_conj (induct_implies C A) (induct_implies C B)"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   550
  by (unfold induct_implies_def induct_conj_def) rules
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   551
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   552
lemma induct_conj_curry: "(induct_conj A B ==> C) == (A ==> B ==> C)"
12354
5f5ee25513c5 setup "rules" method;
wenzelm
parents: 12338
diff changeset
   553
  by (simp only: atomize_imp atomize_eq induct_conj_def) (rules intro: equal_intr_rule)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   554
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   555
lemma induct_impliesI: "(A ==> B) ==> induct_implies A B"
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   556
  by (simp add: induct_implies_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   557
12161
ea4fbf26a945 lemmas induct_atomize = atomize_conj ...;
wenzelm
parents: 12114
diff changeset
   558
lemmas induct_atomize = atomize_conj induct_forall_eq induct_implies_eq induct_equal_eq
ea4fbf26a945 lemmas induct_atomize = atomize_conj ...;
wenzelm
parents: 12114
diff changeset
   559
lemmas induct_rulify1 [symmetric, standard] = induct_forall_eq induct_implies_eq induct_equal_eq
ea4fbf26a945 lemmas induct_atomize = atomize_conj ...;
wenzelm
parents: 12114
diff changeset
   560
lemmas induct_rulify2 = induct_forall_def induct_implies_def induct_equal_def induct_conj_def
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   561
lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   562
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   563
hide const induct_forall induct_implies induct_equal induct_conj
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   564
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   565
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   566
text {* Method setup. *}
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   567
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   568
ML {*
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   569
  structure InductMethod = InductMethodFun
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   570
  (struct
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   571
    val dest_concls = HOLogic.dest_concls;
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   572
    val cases_default = thm "case_split";
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   573
    val local_impI = thm "induct_impliesI";
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   574
    val conjI = thm "conjI";
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   575
    val atomize = thms "induct_atomize";
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   576
    val rulify1 = thms "induct_rulify1";
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
   577
    val rulify2 = thms "induct_rulify2";
12240
0760eda193c4 induct method: localize rews for rule;
wenzelm
parents: 12161
diff changeset
   578
    val localize = [Thm.symmetric (thm "induct_implies_def")];
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   579
  end);
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   580
*}
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   581
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   582
setup InductMethod.setup
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   583
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
   584
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   585
subsection {* Order signatures and orders *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   586
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   587
axclass
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   588
  ord < type
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   589
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   590
syntax
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   591
  "op <"        :: "['a::ord, 'a] => bool"             ("op <")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   592
  "op <="       :: "['a::ord, 'a] => bool"             ("op <=")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   593
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   594
global
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   595
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   596
consts
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   597
  "op <"        :: "['a::ord, 'a] => bool"             ("(_/ < _)"  [50, 51] 50)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   598
  "op <="       :: "['a::ord, 'a] => bool"             ("(_/ <= _)" [50, 51] 50)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   599
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   600
local
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   601
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
   602
syntax (xsymbols)
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   603
  "op <="       :: "['a::ord, 'a] => bool"             ("op \<le>")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   604
  "op <="       :: "['a::ord, 'a] => bool"             ("(_/ \<le> _)"  [50, 51] 50)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   605
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   606
(*Tell blast about overloading of < and <= to reduce the risk of
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   607
  its applying a rule for the wrong type*)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   608
ML {*
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   609
Blast.overloaded ("op <" , domain_type);
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   610
Blast.overloaded ("op <=", domain_type);
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   611
*}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   612
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   613
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   614
subsubsection {* Monotonicity *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   615
13412
666137b488a4 predicate defs via locales;
wenzelm
parents: 12937
diff changeset
   616
locale mono =
666137b488a4 predicate defs via locales;
wenzelm
parents: 12937
diff changeset
   617
  fixes f
666137b488a4 predicate defs via locales;
wenzelm
parents: 12937
diff changeset
   618
  assumes mono: "A <= B ==> f A <= f B"
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   619
13421
8fcdf4a26468 simplified locale predicates;
wenzelm
parents: 13412
diff changeset
   620
lemmas monoI [intro?] = mono.intro
13412
666137b488a4 predicate defs via locales;
wenzelm
parents: 12937
diff changeset
   621
  and monoD [dest?] = mono.mono
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   622
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   623
constdefs
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   624
  min :: "['a::ord, 'a] => 'a"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   625
  "min a b == (if a <= b then a else b)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   626
  max :: "['a::ord, 'a] => 'a"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   627
  "max a b == (if a <= b then b else a)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   628
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   629
lemma min_leastL: "(!!x. least <= x) ==> min least x = least"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   630
  by (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   631
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   632
lemma min_of_mono:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   633
    "ALL x y. (f x <= f y) = (x <= y) ==> min (f m) (f n) = f (min m n)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   634
  by (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   635
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   636
lemma max_leastL: "(!!x. least <= x) ==> max least x = x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   637
  by (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   638
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   639
lemma max_of_mono:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   640
    "ALL x y. (f x <= f y) = (x <= y) ==> max (f m) (f n) = f (max m n)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   641
  by (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   642
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   643
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   644
subsubsection "Orders"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   645
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   646
axclass order < ord
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   647
  order_refl [iff]: "x <= x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   648
  order_trans: "x <= y ==> y <= z ==> x <= z"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   649
  order_antisym: "x <= y ==> y <= x ==> x = y"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   650
  order_less_le: "(x < y) = (x <= y & x ~= y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   651
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   652
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   653
text {* Reflexivity. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   654
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   655
lemma order_eq_refl: "!!x::'a::order. x = y ==> x <= y"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   656
    -- {* This form is useful with the classical reasoner. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   657
  apply (erule ssubst)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   658
  apply (rule order_refl)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   659
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   660
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   661
lemma order_less_irrefl [simp]: "~ x < (x::'a::order)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   662
  by (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   663
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   664
lemma order_le_less: "((x::'a::order) <= y) = (x < y | x = y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   665
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   666
  apply (simp add: order_less_le)
12256
wenzelm
parents: 12240
diff changeset
   667
  apply blast
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   668
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   669
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   670
lemmas order_le_imp_less_or_eq = order_le_less [THEN iffD1, standard]
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   671
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   672
lemma order_less_imp_le: "!!x::'a::order. x < y ==> x <= y"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   673
  by (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   674
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   675
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   676
text {* Asymmetry. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   677
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   678
lemma order_less_not_sym: "(x::'a::order) < y ==> ~ (y < x)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   679
  by (simp add: order_less_le order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   680
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   681
lemma order_less_asym: "x < (y::'a::order) ==> (~P ==> y < x) ==> P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   682
  apply (drule order_less_not_sym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   683
  apply (erule contrapos_np)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   684
  apply simp
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   685
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   686
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   687
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   688
text {* Transitivity. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   689
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   690
lemma order_less_trans: "!!x::'a::order. [| x < y; y < z |] ==> x < z"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   691
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   692
  apply (blast intro: order_trans order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   693
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   694
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   695
lemma order_le_less_trans: "!!x::'a::order. [| x <= y; y < z |] ==> x < z"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   696
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   697
  apply (blast intro: order_trans order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   698
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   699
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   700
lemma order_less_le_trans: "!!x::'a::order. [| x < y; y <= z |] ==> x < z"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   701
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   702
  apply (blast intro: order_trans order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   703
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   704
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   705
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   706
text {* Useful for simplification, but too risky to include by default. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   707
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   708
lemma order_less_imp_not_less: "(x::'a::order) < y ==>  (~ y < x) = True"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   709
  by (blast elim: order_less_asym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   710
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   711
lemma order_less_imp_triv: "(x::'a::order) < y ==>  (y < x --> P) = True"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   712
  by (blast elim: order_less_asym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   713
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   714
lemma order_less_imp_not_eq: "(x::'a::order) < y ==>  (x = y) = False"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   715
  by auto
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   716
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   717
lemma order_less_imp_not_eq2: "(x::'a::order) < y ==>  (y = x) = False"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   718
  by auto
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   719
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   720
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   721
text {* Other operators. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   722
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   723
lemma min_leastR: "(!!x::'a::order. least <= x) ==> min x least = least"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   724
  apply (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   725
  apply (blast intro: order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   726
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   727
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   728
lemma max_leastR: "(!!x::'a::order. least <= x) ==> max x least = x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   729
  apply (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   730
  apply (blast intro: order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   731
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   732
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   733
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   734
subsubsection {* Least value operator *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   735
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   736
constdefs
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   737
  Least :: "('a::ord => bool) => 'a"               (binder "LEAST " 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   738
  "Least P == THE x. P x & (ALL y. P y --> x <= y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   739
    -- {* We can no longer use LeastM because the latter requires Hilbert-AC. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   740
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   741
lemma LeastI2:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   742
  "[| P (x::'a::order);
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   743
      !!y. P y ==> x <= y;
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   744
      !!x. [| P x; ALL y. P y --> x \<le> y |] ==> Q x |]
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   745
   ==> Q (Least P)"
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   746
  apply (unfold Least_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   747
  apply (rule theI2)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   748
    apply (blast intro: order_antisym)+
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   749
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   751
lemma Least_equality:
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   752
    "[| P (k::'a::order); !!x. P x ==> k <= x |] ==> (LEAST x. P x) = k"
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   753
  apply (simp add: Least_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   754
  apply (rule the_equality)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   755
  apply (auto intro!: order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   756
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   757
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   758
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   759
subsubsection "Linear / total orders"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   760
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   761
axclass linorder < order
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   762
  linorder_linear: "x <= y | y <= x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   763
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   764
lemma linorder_less_linear: "!!x::'a::linorder. x<y | x=y | y<x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   765
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   766
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   767
  apply blast
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   768
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   769
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   770
lemma linorder_cases [case_names less equal greater]:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   771
    "((x::'a::linorder) < y ==> P) ==> (x = y ==> P) ==> (y < x ==> P) ==> P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   772
  apply (insert linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   773
  apply blast
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   774
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   775
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   776
lemma linorder_not_less: "!!x::'a::linorder. (~ x < y) = (y <= x)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   777
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   778
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   779
  apply (blast intro: order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   780
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   781
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   782
lemma linorder_not_le: "!!x::'a::linorder. (~ x <= y) = (y < x)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   783
  apply (simp add: order_less_le)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   784
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   785
  apply (blast intro: order_antisym)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   786
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   787
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   788
lemma linorder_neq_iff: "!!x::'a::linorder. (x ~= y) = (x<y | y<x)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   789
  apply (cut_tac x = x and y = y in linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   790
  apply auto
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   791
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   792
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   793
lemma linorder_neqE: "x ~= (y::'a::linorder) ==> (x < y ==> R) ==> (y < x ==> R) ==> R"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   794
  apply (simp add: linorder_neq_iff)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   795
  apply blast
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   796
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   797
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   798
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   799
subsubsection "Min and max on (linear) orders"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   800
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   801
lemma min_same [simp]: "min (x::'a::order) x = x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   802
  by (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   803
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   804
lemma max_same [simp]: "max (x::'a::order) x = x"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   805
  by (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   806
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   807
lemma le_max_iff_disj: "!!z::'a::linorder. (z <= max x y) = (z <= x | z <= y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   808
  apply (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   809
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   810
  apply (blast intro: order_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   811
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   812
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   813
lemma le_maxI1: "(x::'a::linorder) <= max x y"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   814
  by (simp add: le_max_iff_disj)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   815
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   816
lemma le_maxI2: "(y::'a::linorder) <= max x y"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   817
    -- {* CANNOT use with @{text "[intro!]"} because blast will give PROOF FAILED. *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   818
  by (simp add: le_max_iff_disj)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   819
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   820
lemma less_max_iff_disj: "!!z::'a::linorder. (z < max x y) = (z < x | z < y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   821
  apply (simp add: max_def order_le_less)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   822
  apply (insert linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   823
  apply (blast intro: order_less_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   824
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   825
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   826
lemma max_le_iff_conj [simp]:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   827
    "!!z::'a::linorder. (max x y <= z) = (x <= z & y <= z)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   828
  apply (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   829
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   830
  apply (blast intro: order_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   831
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   832
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   833
lemma max_less_iff_conj [simp]:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   834
    "!!z::'a::linorder. (max x y < z) = (x < z & y < z)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   835
  apply (simp add: order_le_less max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   836
  apply (insert linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   837
  apply (blast intro: order_less_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   838
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   839
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   840
lemma le_min_iff_conj [simp]:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   841
    "!!z::'a::linorder. (z <= min x y) = (z <= x & z <= y)"
12892
wenzelm
parents: 12650
diff changeset
   842
    -- {* @{text "[iff]"} screws up a @{text blast} in MiniML *}
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   843
  apply (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   844
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   845
  apply (blast intro: order_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   846
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   847
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   848
lemma min_less_iff_conj [simp]:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   849
    "!!z::'a::linorder. (z < min x y) = (z < x & z < y)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   850
  apply (simp add: order_le_less min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   851
  apply (insert linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   852
  apply (blast intro: order_less_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   853
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   854
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   855
lemma min_le_iff_disj: "!!z::'a::linorder. (min x y <= z) = (x <= z | y <= z)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   856
  apply (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   857
  apply (insert linorder_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   858
  apply (blast intro: order_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   859
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   860
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   861
lemma min_less_iff_disj: "!!z::'a::linorder. (min x y < z) = (x < z | y < z)"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   862
  apply (simp add: min_def order_le_less)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   863
  apply (insert linorder_less_linear)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   864
  apply (blast intro: order_less_trans)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   865
  done
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   866
13438
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   867
declare order_less_irrefl [iff]
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   868
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   869
lemma max_assoc: "!!x::'a::linorder. max (max x y) z = max x (max y z)"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   870
apply(simp add:max_def)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   871
apply(rule conjI)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   872
apply(blast intro:order_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   873
apply(simp add:linorder_not_le)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   874
apply(blast dest: order_less_trans order_le_less_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   875
done
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   876
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   877
lemma max_commute: "!!x::'a::linorder. max x y = max y x"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   878
apply(simp add:max_def)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   879
apply(rule conjI)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   880
apply(blast intro:order_antisym)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   881
apply(simp add:linorder_not_le)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   882
apply(blast dest: order_less_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   883
done
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   884
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   885
lemmas max_ac = max_assoc max_commute
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   886
                mk_left_commute[of max,OF max_assoc max_commute]
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   887
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   888
lemma min_assoc: "!!x::'a::linorder. min (min x y) z = min x (min y z)"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   889
apply(simp add:min_def)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   890
apply(rule conjI)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   891
apply(blast intro:order_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   892
apply(simp add:linorder_not_le)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   893
apply(blast dest: order_less_trans order_le_less_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   894
done
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   895
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   896
lemma min_commute: "!!x::'a::linorder. min x y = min y x"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   897
apply(simp add:min_def)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   898
apply(rule conjI)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   899
apply(blast intro:order_antisym)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   900
apply(simp add:linorder_not_le)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   901
apply(blast dest: order_less_trans)
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   902
done
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   903
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   904
lemmas min_ac = min_assoc min_commute
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   905
                mk_left_commute[of min,OF min_assoc min_commute]
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   906
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   907
declare order_less_irrefl [iff del]
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   908
declare order_less_irrefl [simp]
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
   909
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   910
lemma split_min:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   911
    "P (min (i::'a::linorder) j) = ((i <= j --> P(i)) & (~ i <= j --> P(j)))"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   912
  by (simp add: min_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   913
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   914
lemma split_max:
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   915
    "P (max (i::'a::linorder) j) = ((i <= j --> P(j)) & (~ i <= j --> P(i)))"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   916
  by (simp add: max_def)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   917
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   918
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   919
subsubsection "Bounded quantifiers"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   920
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   921
syntax
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   922
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3ALL _<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   923
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3EX _<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   924
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3ALL _<=_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   925
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3EX _<=_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   926
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
   927
syntax (xsymbols)
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   928
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   929
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   930
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   931
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   932
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   933
syntax (HOL)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   934
  "_lessAll" :: "[idt, 'a, bool] => bool"   ("(3! _<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   935
  "_lessEx"  :: "[idt, 'a, bool] => bool"   ("(3? _<_./ _)"  [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   936
  "_leAll"   :: "[idt, 'a, bool] => bool"   ("(3! _<=_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   937
  "_leEx"    :: "[idt, 'a, bool] => bool"   ("(3? _<=_./ _)" [0, 0, 10] 10)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   938
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   939
translations
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   940
 "ALL x<y. P"   =>  "ALL x. x < y --> P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   941
 "EX x<y. P"    =>  "EX x. x < y  & P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   942
 "ALL x<=y. P"  =>  "ALL x. x <= y --> P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   943
 "EX x<=y. P"   =>  "EX x. x <= y & P"
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   944
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   945
end