src/HOL/OrderedGroup.thy
author haftmann
Fri Mar 10 15:33:48 2006 +0100 (2006-03-10)
changeset 19233 77ca20b0ed77
parent 17085 5b57f995a179
child 19404 9bf2cdc9e8e8
permissions -rw-r--r--
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
wenzelm@14770
     1
(*  Title:   HOL/OrderedGroup.thy
obua@14738
     2
    ID:      $Id$
avigad@16775
     3
    Author:  Gertrud Bauer, Steven Obua, Lawrence C Paulson, and Markus Wenzel,
avigad@16775
     4
             with contributions by Jeremy Avigad
obua@14738
     5
*)
obua@14738
     6
obua@14738
     7
header {* Ordered Groups *}
obua@14738
     8
nipkow@15131
     9
theory OrderedGroup
nipkow@15140
    10
imports Inductive LOrder
haftmann@16417
    11
uses "../Provers/Arith/abel_cancel.ML"
nipkow@15131
    12
begin
obua@14738
    13
obua@14738
    14
text {*
obua@14738
    15
  The theory of partially ordered groups is taken from the books:
obua@14738
    16
  \begin{itemize}
obua@14738
    17
  \item \emph{Lattice Theory} by Garret Birkhoff, American Mathematical Society 1979 
obua@14738
    18
  \item \emph{Partially Ordered Algebraic Systems}, Pergamon Press 1963
obua@14738
    19
  \end{itemize}
obua@14738
    20
  Most of the used notions can also be looked up in 
obua@14738
    21
  \begin{itemize}
wenzelm@14770
    22
  \item \url{http://www.mathworld.com} by Eric Weisstein et. al.
obua@14738
    23
  \item \emph{Algebra I} by van der Waerden, Springer.
obua@14738
    24
  \end{itemize}
obua@14738
    25
*}
obua@14738
    26
obua@14738
    27
subsection {* Semigroups, Groups *}
obua@14738
    28
 
obua@14738
    29
axclass semigroup_add \<subseteq> plus
obua@14738
    30
  add_assoc: "(a + b) + c = a + (b + c)"
obua@14738
    31
obua@14738
    32
axclass ab_semigroup_add \<subseteq> semigroup_add
obua@14738
    33
  add_commute: "a + b = b + a"
obua@14738
    34
obua@14738
    35
lemma add_left_commute: "a + (b + c) = b + (a + (c::'a::ab_semigroup_add))"
obua@14738
    36
  by (rule mk_left_commute [of "op +", OF add_assoc add_commute])
obua@14738
    37
obua@14738
    38
theorems add_ac = add_assoc add_commute add_left_commute
obua@14738
    39
obua@14738
    40
axclass semigroup_mult \<subseteq> times
obua@14738
    41
  mult_assoc: "(a * b) * c = a * (b * c)"
obua@14738
    42
obua@14738
    43
axclass ab_semigroup_mult \<subseteq> semigroup_mult
obua@14738
    44
  mult_commute: "a * b = b * a"
obua@14738
    45
obua@14738
    46
lemma mult_left_commute: "a * (b * c) = b * (a * (c::'a::ab_semigroup_mult))"
obua@14738
    47
  by (rule mk_left_commute [of "op *", OF mult_assoc mult_commute])
obua@14738
    48
obua@14738
    49
theorems mult_ac = mult_assoc mult_commute mult_left_commute
obua@14738
    50
obua@14738
    51
axclass comm_monoid_add \<subseteq> zero, ab_semigroup_add
obua@14738
    52
  add_0[simp]: "0 + a = a"
obua@14738
    53
obua@14738
    54
axclass monoid_mult \<subseteq> one, semigroup_mult
obua@14738
    55
  mult_1_left[simp]: "1 * a  = a"
obua@14738
    56
  mult_1_right[simp]: "a * 1 = a"
obua@14738
    57
obua@14738
    58
axclass comm_monoid_mult \<subseteq> one, ab_semigroup_mult
obua@14738
    59
  mult_1: "1 * a = a"
obua@14738
    60
obua@14738
    61
instance comm_monoid_mult \<subseteq> monoid_mult
obua@14738
    62
by (intro_classes, insert mult_1, simp_all add: mult_commute, auto)
obua@14738
    63
obua@14738
    64
axclass cancel_semigroup_add \<subseteq> semigroup_add
obua@14738
    65
  add_left_imp_eq: "a + b = a + c \<Longrightarrow> b = c"
obua@14738
    66
  add_right_imp_eq: "b + a = c + a \<Longrightarrow> b = c"
obua@14738
    67
obua@14738
    68
axclass cancel_ab_semigroup_add \<subseteq> ab_semigroup_add
obua@14738
    69
  add_imp_eq: "a + b = a + c \<Longrightarrow> b = c"
obua@14738
    70
obua@14738
    71
instance cancel_ab_semigroup_add \<subseteq> cancel_semigroup_add
obua@14738
    72
proof
obua@14738
    73
  {
obua@14738
    74
    fix a b c :: 'a
obua@14738
    75
    assume "a + b = a + c"
obua@14738
    76
    thus "b = c" by (rule add_imp_eq)
obua@14738
    77
  }
obua@14738
    78
  note f = this
obua@14738
    79
  fix a b c :: 'a
obua@14738
    80
  assume "b + a = c + a"
obua@14738
    81
  hence "a + b = a + c" by (simp only: add_commute)
obua@14738
    82
  thus "b = c" by (rule f)
obua@14738
    83
qed
obua@14738
    84
obua@14738
    85
axclass ab_group_add \<subseteq> minus, comm_monoid_add
obua@14738
    86
  left_minus[simp]: " - a + a = 0"
obua@14738
    87
  diff_minus: "a - b = a + (-b)"
obua@14738
    88
obua@14738
    89
instance ab_group_add \<subseteq> cancel_ab_semigroup_add
obua@14738
    90
proof 
obua@14738
    91
  fix a b c :: 'a
obua@14738
    92
  assume "a + b = a + c"
obua@14738
    93
  hence "-a + a + b = -a + a + c" by (simp only: add_assoc)
obua@14738
    94
  thus "b = c" by simp 
obua@14738
    95
qed
obua@14738
    96
obua@14738
    97
lemma add_0_right [simp]: "a + 0 = (a::'a::comm_monoid_add)"
obua@14738
    98
proof -
obua@14738
    99
  have "a + 0 = 0 + a" by (simp only: add_commute)
obua@14738
   100
  also have "... = a" by simp
obua@14738
   101
  finally show ?thesis .
obua@14738
   102
qed
obua@14738
   103
obua@14738
   104
lemma add_left_cancel [simp]:
obua@14738
   105
     "(a + b = a + c) = (b = (c::'a::cancel_semigroup_add))"
obua@14738
   106
by (blast dest: add_left_imp_eq) 
obua@14738
   107
obua@14738
   108
lemma add_right_cancel [simp]:
obua@14738
   109
     "(b + a = c + a) = (b = (c::'a::cancel_semigroup_add))"
obua@14738
   110
  by (blast dest: add_right_imp_eq)
obua@14738
   111
obua@14738
   112
lemma right_minus [simp]: "a + -(a::'a::ab_group_add) = 0"
obua@14738
   113
proof -
obua@14738
   114
  have "a + -a = -a + a" by (simp add: add_ac)
obua@14738
   115
  also have "... = 0" by simp
obua@14738
   116
  finally show ?thesis .
obua@14738
   117
qed
obua@14738
   118
obua@14738
   119
lemma right_minus_eq: "(a - b = 0) = (a = (b::'a::ab_group_add))"
obua@14738
   120
proof
obua@14738
   121
  have "a = a - b + b" by (simp add: diff_minus add_ac)
obua@14738
   122
  also assume "a - b = 0"
obua@14738
   123
  finally show "a = b" by simp
obua@14738
   124
next
obua@14738
   125
  assume "a = b"
obua@14738
   126
  thus "a - b = 0" by (simp add: diff_minus)
obua@14738
   127
qed
obua@14738
   128
obua@14738
   129
lemma minus_minus [simp]: "- (- (a::'a::ab_group_add)) = a"
obua@14738
   130
proof (rule add_left_cancel [of "-a", THEN iffD1])
obua@14738
   131
  show "(-a + -(-a) = -a + a)"
obua@14738
   132
  by simp
obua@14738
   133
qed
obua@14738
   134
obua@14738
   135
lemma equals_zero_I: "a+b = 0 ==> -a = (b::'a::ab_group_add)"
obua@14738
   136
apply (rule right_minus_eq [THEN iffD1, symmetric])
obua@14738
   137
apply (simp add: diff_minus add_commute) 
obua@14738
   138
done
obua@14738
   139
obua@14738
   140
lemma minus_zero [simp]: "- 0 = (0::'a::ab_group_add)"
obua@14738
   141
by (simp add: equals_zero_I)
obua@14738
   142
obua@14738
   143
lemma diff_self [simp]: "a - (a::'a::ab_group_add) = 0"
obua@14738
   144
  by (simp add: diff_minus)
obua@14738
   145
obua@14738
   146
lemma diff_0 [simp]: "(0::'a::ab_group_add) - a = -a"
obua@14738
   147
by (simp add: diff_minus)
obua@14738
   148
obua@14738
   149
lemma diff_0_right [simp]: "a - (0::'a::ab_group_add) = a" 
obua@14738
   150
by (simp add: diff_minus)
obua@14738
   151
obua@14738
   152
lemma diff_minus_eq_add [simp]: "a - - b = a + (b::'a::ab_group_add)"
obua@14738
   153
by (simp add: diff_minus)
obua@14738
   154
obua@14738
   155
lemma neg_equal_iff_equal [simp]: "(-a = -b) = (a = (b::'a::ab_group_add))" 
obua@14738
   156
proof 
obua@14738
   157
  assume "- a = - b"
obua@14738
   158
  hence "- (- a) = - (- b)"
obua@14738
   159
    by simp
obua@14738
   160
  thus "a=b" by simp
obua@14738
   161
next
obua@14738
   162
  assume "a=b"
obua@14738
   163
  thus "-a = -b" by simp
obua@14738
   164
qed
obua@14738
   165
obua@14738
   166
lemma neg_equal_0_iff_equal [simp]: "(-a = 0) = (a = (0::'a::ab_group_add))"
obua@14738
   167
by (subst neg_equal_iff_equal [symmetric], simp)
obua@14738
   168
obua@14738
   169
lemma neg_0_equal_iff_equal [simp]: "(0 = -a) = (0 = (a::'a::ab_group_add))"
obua@14738
   170
by (subst neg_equal_iff_equal [symmetric], simp)
obua@14738
   171
obua@14738
   172
text{*The next two equations can make the simplifier loop!*}
obua@14738
   173
obua@14738
   174
lemma equation_minus_iff: "(a = - b) = (b = - (a::'a::ab_group_add))"
obua@14738
   175
proof -
obua@14738
   176
  have "(- (-a) = - b) = (- a = b)" by (rule neg_equal_iff_equal)
obua@14738
   177
  thus ?thesis by (simp add: eq_commute)
obua@14738
   178
qed
obua@14738
   179
obua@14738
   180
lemma minus_equation_iff: "(- a = b) = (- (b::'a::ab_group_add) = a)"
obua@14738
   181
proof -
obua@14738
   182
  have "(- a = - (-b)) = (a = -b)" by (rule neg_equal_iff_equal)
obua@14738
   183
  thus ?thesis by (simp add: eq_commute)
obua@14738
   184
qed
obua@14738
   185
obua@14738
   186
lemma minus_add_distrib [simp]: "- (a + b) = -a + -(b::'a::ab_group_add)"
obua@14738
   187
apply (rule equals_zero_I)
obua@14738
   188
apply (simp add: add_ac) 
obua@14738
   189
done
obua@14738
   190
obua@14738
   191
lemma minus_diff_eq [simp]: "- (a - b) = b - (a::'a::ab_group_add)"
obua@14738
   192
by (simp add: diff_minus add_commute)
obua@14738
   193
obua@14738
   194
subsection {* (Partially) Ordered Groups *} 
obua@14738
   195
obua@14738
   196
axclass pordered_ab_semigroup_add \<subseteq> order, ab_semigroup_add
obua@14738
   197
  add_left_mono: "a \<le> b \<Longrightarrow> c + a \<le> c + b"
obua@14738
   198
obua@14738
   199
axclass pordered_cancel_ab_semigroup_add \<subseteq> pordered_ab_semigroup_add, cancel_ab_semigroup_add
obua@14738
   200
obua@14738
   201
instance pordered_cancel_ab_semigroup_add \<subseteq> pordered_ab_semigroup_add ..
obua@14738
   202
obua@14738
   203
axclass pordered_ab_semigroup_add_imp_le \<subseteq> pordered_cancel_ab_semigroup_add
obua@14738
   204
  add_le_imp_le_left: "c + a \<le> c + b \<Longrightarrow> a \<le> b"
obua@14738
   205
obua@14738
   206
axclass pordered_ab_group_add \<subseteq> ab_group_add, pordered_ab_semigroup_add
obua@14738
   207
obua@14738
   208
instance pordered_ab_group_add \<subseteq> pordered_ab_semigroup_add_imp_le
obua@14738
   209
proof
obua@14738
   210
  fix a b c :: 'a
obua@14738
   211
  assume "c + a \<le> c + b"
obua@14738
   212
  hence "(-c) + (c + a) \<le> (-c) + (c + b)" by (rule add_left_mono)
obua@14738
   213
  hence "((-c) + c) + a \<le> ((-c) + c) + b" by (simp only: add_assoc)
obua@14738
   214
  thus "a \<le> b" by simp
obua@14738
   215
qed
obua@14738
   216
obua@14738
   217
axclass ordered_cancel_ab_semigroup_add \<subseteq> pordered_cancel_ab_semigroup_add, linorder
obua@14738
   218
obua@14738
   219
instance ordered_cancel_ab_semigroup_add \<subseteq> pordered_ab_semigroup_add_imp_le
obua@14738
   220
proof
obua@14738
   221
  fix a b c :: 'a
obua@14738
   222
  assume le: "c + a <= c + b"  
obua@14738
   223
  show "a <= b"
obua@14738
   224
  proof (rule ccontr)
obua@14738
   225
    assume w: "~ a \<le> b"
obua@14738
   226
    hence "b <= a" by (simp add: linorder_not_le)
obua@14738
   227
    hence le2: "c+b <= c+a" by (rule add_left_mono)
obua@14738
   228
    have "a = b" 
obua@14738
   229
      apply (insert le)
obua@14738
   230
      apply (insert le2)
obua@14738
   231
      apply (drule order_antisym, simp_all)
obua@14738
   232
      done
obua@14738
   233
    with w  show False 
obua@14738
   234
      by (simp add: linorder_not_le [symmetric])
obua@14738
   235
  qed
obua@14738
   236
qed
obua@14738
   237
obua@14738
   238
lemma add_right_mono: "a \<le> (b::'a::pordered_ab_semigroup_add) ==> a + c \<le> b + c"
obua@14738
   239
by (simp add: add_commute[of _ c] add_left_mono)
obua@14738
   240
obua@14738
   241
text {* non-strict, in both arguments *}
obua@14738
   242
lemma add_mono:
obua@14738
   243
     "[|a \<le> b;  c \<le> d|] ==> a + c \<le> b + (d::'a::pordered_ab_semigroup_add)"
obua@14738
   244
  apply (erule add_right_mono [THEN order_trans])
obua@14738
   245
  apply (simp add: add_commute add_left_mono)
obua@14738
   246
  done
obua@14738
   247
obua@14738
   248
lemma add_strict_left_mono:
obua@14738
   249
     "a < b ==> c + a < c + (b::'a::pordered_cancel_ab_semigroup_add)"
obua@14738
   250
 by (simp add: order_less_le add_left_mono) 
obua@14738
   251
obua@14738
   252
lemma add_strict_right_mono:
obua@14738
   253
     "a < b ==> a + c < b + (c::'a::pordered_cancel_ab_semigroup_add)"
obua@14738
   254
 by (simp add: add_commute [of _ c] add_strict_left_mono)
obua@14738
   255
obua@14738
   256
text{*Strict monotonicity in both arguments*}
obua@14738
   257
lemma add_strict_mono: "[|a<b; c<d|] ==> a + c < b + (d::'a::pordered_cancel_ab_semigroup_add)"
obua@14738
   258
apply (erule add_strict_right_mono [THEN order_less_trans])
obua@14738
   259
apply (erule add_strict_left_mono)
obua@14738
   260
done
obua@14738
   261
obua@14738
   262
lemma add_less_le_mono:
obua@14738
   263
     "[| a<b; c\<le>d |] ==> a + c < b + (d::'a::pordered_cancel_ab_semigroup_add)"
obua@14738
   264
apply (erule add_strict_right_mono [THEN order_less_le_trans])
obua@14738
   265
apply (erule add_left_mono) 
obua@14738
   266
done
obua@14738
   267
obua@14738
   268
lemma add_le_less_mono:
obua@14738
   269
     "[| a\<le>b; c<d |] ==> a + c < b + (d::'a::pordered_cancel_ab_semigroup_add)"
obua@14738
   270
apply (erule add_right_mono [THEN order_le_less_trans])
obua@14738
   271
apply (erule add_strict_left_mono) 
obua@14738
   272
done
obua@14738
   273
obua@14738
   274
lemma add_less_imp_less_left:
obua@14738
   275
      assumes less: "c + a < c + b"  shows "a < (b::'a::pordered_ab_semigroup_add_imp_le)"
obua@14738
   276
proof -
obua@14738
   277
  from less have le: "c + a <= c + b" by (simp add: order_le_less)
obua@14738
   278
  have "a <= b" 
obua@14738
   279
    apply (insert le)
obua@14738
   280
    apply (drule add_le_imp_le_left)
obua@14738
   281
    by (insert le, drule add_le_imp_le_left, assumption)
obua@14738
   282
  moreover have "a \<noteq> b"
obua@14738
   283
  proof (rule ccontr)
obua@14738
   284
    assume "~(a \<noteq> b)"
obua@14738
   285
    then have "a = b" by simp
obua@14738
   286
    then have "c + a = c + b" by simp
obua@14738
   287
    with less show "False"by simp
obua@14738
   288
  qed
obua@14738
   289
  ultimately show "a < b" by (simp add: order_le_less)
obua@14738
   290
qed
obua@14738
   291
obua@14738
   292
lemma add_less_imp_less_right:
obua@14738
   293
      "a + c < b + c ==> a < (b::'a::pordered_ab_semigroup_add_imp_le)"
obua@14738
   294
apply (rule add_less_imp_less_left [of c])
obua@14738
   295
apply (simp add: add_commute)  
obua@14738
   296
done
obua@14738
   297
obua@14738
   298
lemma add_less_cancel_left [simp]:
obua@14738
   299
    "(c+a < c+b) = (a < (b::'a::pordered_ab_semigroup_add_imp_le))"
obua@14738
   300
by (blast intro: add_less_imp_less_left add_strict_left_mono) 
obua@14738
   301
obua@14738
   302
lemma add_less_cancel_right [simp]:
obua@14738
   303
    "(a+c < b+c) = (a < (b::'a::pordered_ab_semigroup_add_imp_le))"
obua@14738
   304
by (blast intro: add_less_imp_less_right add_strict_right_mono)
obua@14738
   305
obua@14738
   306
lemma add_le_cancel_left [simp]:
obua@14738
   307
    "(c+a \<le> c+b) = (a \<le> (b::'a::pordered_ab_semigroup_add_imp_le))"
obua@14738
   308
by (auto, drule add_le_imp_le_left, simp_all add: add_left_mono) 
obua@14738
   309
obua@14738
   310
lemma add_le_cancel_right [simp]:
obua@14738
   311
    "(a+c \<le> b+c) = (a \<le> (b::'a::pordered_ab_semigroup_add_imp_le))"
obua@14738
   312
by (simp add: add_commute[of a c] add_commute[of b c])
obua@14738
   313
obua@14738
   314
lemma add_le_imp_le_right:
obua@14738
   315
      "a + c \<le> b + c ==> a \<le> (b::'a::pordered_ab_semigroup_add_imp_le)"
obua@14738
   316
by simp
obua@14738
   317
paulson@15234
   318
lemma add_increasing:
paulson@15234
   319
  fixes c :: "'a::{pordered_ab_semigroup_add_imp_le, comm_monoid_add}"
paulson@15234
   320
  shows  "[|0\<le>a; b\<le>c|] ==> b \<le> a + c"
obua@14738
   321
by (insert add_mono [of 0 a b c], simp)
obua@14738
   322
nipkow@15539
   323
lemma add_increasing2:
nipkow@15539
   324
  fixes c :: "'a::{pordered_ab_semigroup_add_imp_le, comm_monoid_add}"
nipkow@15539
   325
  shows  "[|0\<le>c; b\<le>a|] ==> b \<le> a + c"
nipkow@15539
   326
by (simp add:add_increasing add_commute[of a])
nipkow@15539
   327
paulson@15234
   328
lemma add_strict_increasing:
paulson@15234
   329
  fixes c :: "'a::{pordered_ab_semigroup_add_imp_le, comm_monoid_add}"
paulson@15234
   330
  shows "[|0<a; b\<le>c|] ==> b < a + c"
paulson@15234
   331
by (insert add_less_le_mono [of 0 a b c], simp)
paulson@15234
   332
paulson@15234
   333
lemma add_strict_increasing2:
paulson@15234
   334
  fixes c :: "'a::{pordered_ab_semigroup_add_imp_le, comm_monoid_add}"
paulson@15234
   335
  shows "[|0\<le>a; b<c|] ==> b < a + c"
paulson@15234
   336
by (insert add_le_less_mono [of 0 a b c], simp)
paulson@15234
   337
paulson@15234
   338
obua@14738
   339
subsection {* Ordering Rules for Unary Minus *}
obua@14738
   340
obua@14738
   341
lemma le_imp_neg_le:
obua@14738
   342
      assumes "a \<le> (b::'a::{pordered_ab_semigroup_add_imp_le, ab_group_add})" shows "-b \<le> -a"
obua@14738
   343
proof -
obua@14738
   344
  have "-a+a \<le> -a+b"
obua@14738
   345
    by (rule add_left_mono) 
obua@14738
   346
  hence "0 \<le> -a+b"
obua@14738
   347
    by simp
obua@14738
   348
  hence "0 + (-b) \<le> (-a + b) + (-b)"
obua@14738
   349
    by (rule add_right_mono) 
obua@14738
   350
  thus ?thesis
obua@14738
   351
    by (simp add: add_assoc)
obua@14738
   352
qed
obua@14738
   353
obua@14738
   354
lemma neg_le_iff_le [simp]: "(-b \<le> -a) = (a \<le> (b::'a::pordered_ab_group_add))"
obua@14738
   355
proof 
obua@14738
   356
  assume "- b \<le> - a"
obua@14738
   357
  hence "- (- a) \<le> - (- b)"
obua@14738
   358
    by (rule le_imp_neg_le)
obua@14738
   359
  thus "a\<le>b" by simp
obua@14738
   360
next
obua@14738
   361
  assume "a\<le>b"
obua@14738
   362
  thus "-b \<le> -a" by (rule le_imp_neg_le)
obua@14738
   363
qed
obua@14738
   364
obua@14738
   365
lemma neg_le_0_iff_le [simp]: "(-a \<le> 0) = (0 \<le> (a::'a::pordered_ab_group_add))"
obua@14738
   366
by (subst neg_le_iff_le [symmetric], simp)
obua@14738
   367
obua@14738
   368
lemma neg_0_le_iff_le [simp]: "(0 \<le> -a) = (a \<le> (0::'a::pordered_ab_group_add))"
obua@14738
   369
by (subst neg_le_iff_le [symmetric], simp)
obua@14738
   370
obua@14738
   371
lemma neg_less_iff_less [simp]: "(-b < -a) = (a < (b::'a::pordered_ab_group_add))"
obua@14738
   372
by (force simp add: order_less_le) 
obua@14738
   373
obua@14738
   374
lemma neg_less_0_iff_less [simp]: "(-a < 0) = (0 < (a::'a::pordered_ab_group_add))"
obua@14738
   375
by (subst neg_less_iff_less [symmetric], simp)
obua@14738
   376
obua@14738
   377
lemma neg_0_less_iff_less [simp]: "(0 < -a) = (a < (0::'a::pordered_ab_group_add))"
obua@14738
   378
by (subst neg_less_iff_less [symmetric], simp)
obua@14738
   379
obua@14738
   380
text{*The next several equations can make the simplifier loop!*}
obua@14738
   381
obua@14738
   382
lemma less_minus_iff: "(a < - b) = (b < - (a::'a::pordered_ab_group_add))"
obua@14738
   383
proof -
obua@14738
   384
  have "(- (-a) < - b) = (b < - a)" by (rule neg_less_iff_less)
obua@14738
   385
  thus ?thesis by simp
obua@14738
   386
qed
obua@14738
   387
obua@14738
   388
lemma minus_less_iff: "(- a < b) = (- b < (a::'a::pordered_ab_group_add))"
obua@14738
   389
proof -
obua@14738
   390
  have "(- a < - (-b)) = (- b < a)" by (rule neg_less_iff_less)
obua@14738
   391
  thus ?thesis by simp
obua@14738
   392
qed
obua@14738
   393
obua@14738
   394
lemma le_minus_iff: "(a \<le> - b) = (b \<le> - (a::'a::pordered_ab_group_add))"
obua@14738
   395
proof -
obua@14738
   396
  have mm: "!! a (b::'a). (-(-a)) < -b \<Longrightarrow> -(-b) < -a" by (simp only: minus_less_iff)
obua@14738
   397
  have "(- (- a) <= -b) = (b <= - a)" 
obua@14738
   398
    apply (auto simp only: order_le_less)
obua@14738
   399
    apply (drule mm)
obua@14738
   400
    apply (simp_all)
obua@14738
   401
    apply (drule mm[simplified], assumption)
obua@14738
   402
    done
obua@14738
   403
  then show ?thesis by simp
obua@14738
   404
qed
obua@14738
   405
obua@14738
   406
lemma minus_le_iff: "(- a \<le> b) = (- b \<le> (a::'a::pordered_ab_group_add))"
obua@14738
   407
by (auto simp add: order_le_less minus_less_iff)
obua@14738
   408
obua@14738
   409
lemma add_diff_eq: "a + (b - c) = (a + b) - (c::'a::ab_group_add)"
obua@14738
   410
by (simp add: diff_minus add_ac)
obua@14738
   411
obua@14738
   412
lemma diff_add_eq: "(a - b) + c = (a + c) - (b::'a::ab_group_add)"
obua@14738
   413
by (simp add: diff_minus add_ac)
obua@14738
   414
obua@14738
   415
lemma diff_eq_eq: "(a-b = c) = (a = c + (b::'a::ab_group_add))"
obua@14738
   416
by (auto simp add: diff_minus add_assoc)
obua@14738
   417
obua@14738
   418
lemma eq_diff_eq: "(a = c-b) = (a + (b::'a::ab_group_add) = c)"
obua@14738
   419
by (auto simp add: diff_minus add_assoc)
obua@14738
   420
obua@14738
   421
lemma diff_diff_eq: "(a - b) - c = a - (b + (c::'a::ab_group_add))"
obua@14738
   422
by (simp add: diff_minus add_ac)
obua@14738
   423
obua@14738
   424
lemma diff_diff_eq2: "a - (b - c) = (a + c) - (b::'a::ab_group_add)"
obua@14738
   425
by (simp add: diff_minus add_ac)
obua@14738
   426
obua@14738
   427
lemma diff_add_cancel: "a - b + b = (a::'a::ab_group_add)"
obua@14738
   428
by (simp add: diff_minus add_ac)
obua@14738
   429
obua@14738
   430
lemma add_diff_cancel: "a + b - b = (a::'a::ab_group_add)"
obua@14738
   431
by (simp add: diff_minus add_ac)
obua@14738
   432
obua@14754
   433
text{*Further subtraction laws*}
obua@14738
   434
obua@14738
   435
lemma less_iff_diff_less_0: "(a < b) = (a - b < (0::'a::pordered_ab_group_add))"
obua@14738
   436
proof -
obua@14738
   437
  have  "(a < b) = (a + (- b) < b + (-b))"  
obua@14738
   438
    by (simp only: add_less_cancel_right)
obua@14738
   439
  also have "... =  (a - b < 0)" by (simp add: diff_minus)
obua@14738
   440
  finally show ?thesis .
obua@14738
   441
qed
obua@14738
   442
obua@14738
   443
lemma diff_less_eq: "(a-b < c) = (a < c + (b::'a::pordered_ab_group_add))"
paulson@15481
   444
apply (subst less_iff_diff_less_0 [of a])
obua@14738
   445
apply (rule less_iff_diff_less_0 [of _ c, THEN ssubst])
obua@14738
   446
apply (simp add: diff_minus add_ac)
obua@14738
   447
done
obua@14738
   448
obua@14738
   449
lemma less_diff_eq: "(a < c-b) = (a + (b::'a::pordered_ab_group_add) < c)"
paulson@15481
   450
apply (subst less_iff_diff_less_0 [of "a+b"])
paulson@15481
   451
apply (subst less_iff_diff_less_0 [of a])
obua@14738
   452
apply (simp add: diff_minus add_ac)
obua@14738
   453
done
obua@14738
   454
obua@14738
   455
lemma diff_le_eq: "(a-b \<le> c) = (a \<le> c + (b::'a::pordered_ab_group_add))"
obua@14738
   456
by (auto simp add: order_le_less diff_less_eq diff_add_cancel add_diff_cancel)
obua@14738
   457
obua@14738
   458
lemma le_diff_eq: "(a \<le> c-b) = (a + (b::'a::pordered_ab_group_add) \<le> c)"
obua@14738
   459
by (auto simp add: order_le_less less_diff_eq diff_add_cancel add_diff_cancel)
obua@14738
   460
obua@14738
   461
text{*This list of rewrites simplifies (in)equalities by bringing subtractions
obua@14738
   462
  to the top and then moving negative terms to the other side.
obua@14738
   463
  Use with @{text add_ac}*}
obua@14738
   464
lemmas compare_rls =
obua@14738
   465
       diff_minus [symmetric]
obua@14738
   466
       add_diff_eq diff_add_eq diff_diff_eq diff_diff_eq2
obua@14738
   467
       diff_less_eq less_diff_eq diff_le_eq le_diff_eq
obua@14738
   468
       diff_eq_eq eq_diff_eq
obua@14738
   469
avigad@16775
   470
subsection {* Support for reasoning about signs *}
avigad@16775
   471
avigad@16775
   472
lemma add_pos_pos: "0 < 
avigad@16775
   473
    (x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) 
avigad@16775
   474
      ==> 0 < y ==> 0 < x + y"
avigad@16775
   475
apply (subgoal_tac "0 + 0 < x + y")
avigad@16775
   476
apply simp
avigad@16775
   477
apply (erule add_less_le_mono)
avigad@16775
   478
apply (erule order_less_imp_le)
avigad@16775
   479
done
avigad@16775
   480
avigad@16775
   481
lemma add_pos_nonneg: "0 < 
avigad@16775
   482
    (x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) 
avigad@16775
   483
      ==> 0 <= y ==> 0 < x + y"
avigad@16775
   484
apply (subgoal_tac "0 + 0 < x + y")
avigad@16775
   485
apply simp
avigad@16775
   486
apply (erule add_less_le_mono, assumption)
avigad@16775
   487
done
avigad@16775
   488
avigad@16775
   489
lemma add_nonneg_pos: "0 <= 
avigad@16775
   490
    (x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) 
avigad@16775
   491
      ==> 0 < y ==> 0 < x + y"
avigad@16775
   492
apply (subgoal_tac "0 + 0 < x + y")
avigad@16775
   493
apply simp
avigad@16775
   494
apply (erule add_le_less_mono, assumption)
avigad@16775
   495
done
avigad@16775
   496
avigad@16775
   497
lemma add_nonneg_nonneg: "0 <= 
avigad@16775
   498
    (x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) 
avigad@16775
   499
      ==> 0 <= y ==> 0 <= x + y"
avigad@16775
   500
apply (subgoal_tac "0 + 0 <= x + y")
avigad@16775
   501
apply simp
avigad@16775
   502
apply (erule add_mono, assumption)
avigad@16775
   503
done
avigad@16775
   504
avigad@16775
   505
lemma add_neg_neg: "(x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add})
avigad@16775
   506
    < 0 ==> y < 0 ==> x + y < 0"
avigad@16775
   507
apply (subgoal_tac "x + y < 0 + 0")
avigad@16775
   508
apply simp
avigad@16775
   509
apply (erule add_less_le_mono)
avigad@16775
   510
apply (erule order_less_imp_le)
avigad@16775
   511
done
avigad@16775
   512
avigad@16775
   513
lemma add_neg_nonpos: 
avigad@16775
   514
    "(x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) < 0 
avigad@16775
   515
      ==> y <= 0 ==> x + y < 0"
avigad@16775
   516
apply (subgoal_tac "x + y < 0 + 0")
avigad@16775
   517
apply simp
avigad@16775
   518
apply (erule add_less_le_mono, assumption)
avigad@16775
   519
done
avigad@16775
   520
avigad@16775
   521
lemma add_nonpos_neg: 
avigad@16775
   522
    "(x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) <= 0 
avigad@16775
   523
      ==> y < 0 ==> x + y < 0"
avigad@16775
   524
apply (subgoal_tac "x + y < 0 + 0")
avigad@16775
   525
apply simp
avigad@16775
   526
apply (erule add_le_less_mono, assumption)
avigad@16775
   527
done
avigad@16775
   528
avigad@16775
   529
lemma add_nonpos_nonpos: 
avigad@16775
   530
    "(x::'a::{comm_monoid_add,pordered_cancel_ab_semigroup_add}) <= 0 
avigad@16775
   531
      ==> y <= 0 ==> x + y <= 0"
avigad@16775
   532
apply (subgoal_tac "x + y <= 0 + 0")
avigad@16775
   533
apply simp
avigad@16775
   534
apply (erule add_mono, assumption)
avigad@16775
   535
done
obua@14738
   536
obua@14738
   537
subsection{*Lemmas for the @{text cancel_numerals} simproc*}
obua@14738
   538
obua@14738
   539
lemma eq_iff_diff_eq_0: "(a = b) = (a-b = (0::'a::ab_group_add))"
obua@14738
   540
by (simp add: compare_rls)
obua@14738
   541
obua@14738
   542
lemma le_iff_diff_le_0: "(a \<le> b) = (a-b \<le> (0::'a::pordered_ab_group_add))"
obua@14738
   543
by (simp add: compare_rls)
obua@14738
   544
obua@14738
   545
subsection {* Lattice Ordered (Abelian) Groups *}
obua@14738
   546
obua@14738
   547
axclass lordered_ab_group_meet < pordered_ab_group_add, meet_semilorder
obua@14738
   548
obua@14738
   549
axclass lordered_ab_group_join < pordered_ab_group_add, join_semilorder
obua@14738
   550
obua@14738
   551
lemma add_meet_distrib_left: "a + (meet b c) = meet (a + b) (a + (c::'a::{pordered_ab_group_add, meet_semilorder}))"
obua@14738
   552
apply (rule order_antisym)
obua@14738
   553
apply (rule meet_imp_le, simp_all add: meet_join_le)
obua@14738
   554
apply (rule add_le_imp_le_left [of "-a"])
obua@14738
   555
apply (simp only: add_assoc[symmetric], simp)
obua@14738
   556
apply (rule meet_imp_le)
obua@14738
   557
apply (rule add_le_imp_le_left[of "a"], simp only: add_assoc[symmetric], simp add: meet_join_le)+
obua@14738
   558
done
obua@14738
   559
obua@14738
   560
lemma add_join_distrib_left: "a + (join b c) = join (a + b) (a+ (c::'a::{pordered_ab_group_add, join_semilorder}))" 
obua@14738
   561
apply (rule order_antisym)
obua@14738
   562
apply (rule add_le_imp_le_left [of "-a"])
obua@14738
   563
apply (simp only: add_assoc[symmetric], simp)
obua@14738
   564
apply (rule join_imp_le)
obua@14738
   565
apply (rule add_le_imp_le_left [of "a"], simp only: add_assoc[symmetric], simp add: meet_join_le)+
obua@14738
   566
apply (rule join_imp_le)
obua@14738
   567
apply (simp_all add: meet_join_le)
obua@14738
   568
done
obua@14738
   569
obua@14738
   570
lemma is_join_neg_meet: "is_join (% (a::'a::{pordered_ab_group_add, meet_semilorder}) b. - (meet (-a) (-b)))"
obua@14738
   571
apply (auto simp add: is_join_def)
obua@14738
   572
apply (rule_tac c="meet (-a) (-b)" in add_le_imp_le_right, simp, simp add: add_meet_distrib_left meet_join_le)
obua@14738
   573
apply (rule_tac c="meet (-a) (-b)" in add_le_imp_le_right, simp, simp add: add_meet_distrib_left meet_join_le)
obua@14738
   574
apply (subst neg_le_iff_le[symmetric]) 
obua@14738
   575
apply (simp add: meet_imp_le)
obua@14738
   576
done
obua@14738
   577
obua@14738
   578
lemma is_meet_neg_join: "is_meet (% (a::'a::{pordered_ab_group_add, join_semilorder}) b. - (join (-a) (-b)))"
obua@14738
   579
apply (auto simp add: is_meet_def)
obua@14738
   580
apply (rule_tac c="join (-a) (-b)" in add_le_imp_le_right, simp, simp add: add_join_distrib_left meet_join_le)
obua@14738
   581
apply (rule_tac c="join (-a) (-b)" in add_le_imp_le_right, simp, simp add: add_join_distrib_left meet_join_le)
obua@14738
   582
apply (subst neg_le_iff_le[symmetric]) 
obua@14738
   583
apply (simp add: join_imp_le)
obua@14738
   584
done
obua@14738
   585
obua@14738
   586
axclass lordered_ab_group \<subseteq> pordered_ab_group_add, lorder
obua@14738
   587
obua@14738
   588
instance lordered_ab_group_meet \<subseteq> lordered_ab_group
obua@14738
   589
proof 
obua@14738
   590
  show "? j. is_join (j::'a\<Rightarrow>'a\<Rightarrow>('a::lordered_ab_group_meet))" by (blast intro: is_join_neg_meet)
obua@14738
   591
qed
obua@14738
   592
obua@14738
   593
instance lordered_ab_group_join \<subseteq> lordered_ab_group
obua@14738
   594
proof
obua@14738
   595
  show "? m. is_meet (m::'a\<Rightarrow>'a\<Rightarrow>('a::lordered_ab_group_join))" by (blast intro: is_meet_neg_join)
obua@14738
   596
qed
obua@14738
   597
obua@14738
   598
lemma add_join_distrib_right: "(join a b) + (c::'a::lordered_ab_group) = join (a+c) (b+c)"
obua@14738
   599
proof -
obua@14738
   600
  have "c + (join a b) = join (c+a) (c+b)" by (simp add: add_join_distrib_left)
obua@14738
   601
  thus ?thesis by (simp add: add_commute)
obua@14738
   602
qed
obua@14738
   603
obua@14738
   604
lemma add_meet_distrib_right: "(meet a b) + (c::'a::lordered_ab_group) = meet (a+c) (b+c)"
obua@14738
   605
proof -
obua@14738
   606
  have "c + (meet a b) = meet (c+a) (c+b)" by (simp add: add_meet_distrib_left)
obua@14738
   607
  thus ?thesis by (simp add: add_commute)
obua@14738
   608
qed
obua@14738
   609
obua@14738
   610
lemmas add_meet_join_distribs = add_meet_distrib_right add_meet_distrib_left add_join_distrib_right add_join_distrib_left
obua@14738
   611
obua@14738
   612
lemma join_eq_neg_meet: "join a (b::'a::lordered_ab_group) = - meet (-a) (-b)"
obua@14738
   613
by (simp add: is_join_unique[OF is_join_join is_join_neg_meet])
obua@14738
   614
obua@14738
   615
lemma meet_eq_neg_join: "meet a (b::'a::lordered_ab_group) = - join (-a) (-b)"
obua@14738
   616
by (simp add: is_meet_unique[OF is_meet_meet is_meet_neg_join])
obua@14738
   617
obua@14738
   618
lemma add_eq_meet_join: "a + b = (join a b) + (meet a (b::'a::lordered_ab_group))"
obua@14738
   619
proof -
obua@14738
   620
  have "0 = - meet 0 (a-b) + meet (a-b) 0" by (simp add: meet_comm)
obua@14738
   621
  hence "0 = join 0 (b-a) + meet (a-b) 0" by (simp add: meet_eq_neg_join)
obua@14738
   622
  hence "0 = (-a + join a b) + (meet a b + (-b))"
obua@14738
   623
    apply (simp add: add_join_distrib_left add_meet_distrib_right)
obua@14738
   624
    by (simp add: diff_minus add_commute)
obua@14738
   625
  thus ?thesis
obua@14738
   626
    apply (simp add: compare_rls)
obua@14738
   627
    apply (subst add_left_cancel[symmetric, of "a+b" "join a b + meet a b" "-a"])
obua@14738
   628
    apply (simp only: add_assoc, simp add: add_assoc[symmetric])
obua@14738
   629
    done
obua@14738
   630
qed
obua@14738
   631
obua@14738
   632
subsection {* Positive Part, Negative Part, Absolute Value *}
obua@14738
   633
obua@14738
   634
constdefs
obua@14738
   635
  pprt :: "'a \<Rightarrow> ('a::lordered_ab_group)"
obua@14738
   636
  "pprt x == join x 0"
obua@14738
   637
  nprt :: "'a \<Rightarrow> ('a::lordered_ab_group)"
obua@14738
   638
  "nprt x == meet x 0"
obua@14738
   639
obua@14738
   640
lemma prts: "a = pprt a + nprt a"
obua@14738
   641
by (simp add: pprt_def nprt_def add_eq_meet_join[symmetric])
obua@14738
   642
obua@14738
   643
lemma zero_le_pprt[simp]: "0 \<le> pprt a"
obua@14738
   644
by (simp add: pprt_def meet_join_le)
obua@14738
   645
obua@14738
   646
lemma nprt_le_zero[simp]: "nprt a \<le> 0"
obua@14738
   647
by (simp add: nprt_def meet_join_le)
obua@14738
   648
obua@14738
   649
lemma le_eq_neg: "(a \<le> -b) = (a + b \<le> (0::_::lordered_ab_group))" (is "?l = ?r")
obua@14738
   650
proof -
obua@14738
   651
  have a: "?l \<longrightarrow> ?r"
obua@14738
   652
    apply (auto)
obua@14738
   653
    apply (rule add_le_imp_le_right[of _ "-b" _])
obua@14738
   654
    apply (simp add: add_assoc)
obua@14738
   655
    done
obua@14738
   656
  have b: "?r \<longrightarrow> ?l"
obua@14738
   657
    apply (auto)
obua@14738
   658
    apply (rule add_le_imp_le_right[of _ "b" _])
obua@14738
   659
    apply (simp)
obua@14738
   660
    done
obua@14738
   661
  from a b show ?thesis by blast
obua@14738
   662
qed
obua@14738
   663
obua@15580
   664
lemma pprt_0[simp]: "pprt 0 = 0" by (simp add: pprt_def)
obua@15580
   665
lemma nprt_0[simp]: "nprt 0 = 0" by (simp add: nprt_def)
obua@15580
   666
obua@15580
   667
lemma pprt_eq_id[simp]: "0 <= x \<Longrightarrow> pprt x = x"
obua@15580
   668
  by (simp add: pprt_def le_def_join join_aci)
obua@15580
   669
obua@15580
   670
lemma nprt_eq_id[simp]: "x <= 0 \<Longrightarrow> nprt x = x"
obua@15580
   671
  by (simp add: nprt_def le_def_meet meet_aci)
obua@15580
   672
obua@15580
   673
lemma pprt_eq_0[simp]: "x <= 0 \<Longrightarrow> pprt x = 0"
obua@15580
   674
  by (simp add: pprt_def le_def_join join_aci)
obua@15580
   675
obua@15580
   676
lemma nprt_eq_0[simp]: "0 <= x \<Longrightarrow> nprt x = 0"
obua@15580
   677
  by (simp add: nprt_def le_def_meet meet_aci)
obua@15580
   678
obua@14738
   679
lemma join_0_imp_0: "join a (-a) = 0 \<Longrightarrow> a = (0::'a::lordered_ab_group)"
obua@14738
   680
proof -
obua@14738
   681
  {
obua@14738
   682
    fix a::'a
obua@14738
   683
    assume hyp: "join a (-a) = 0"
obua@14738
   684
    hence "join a (-a) + a = a" by (simp)
obua@14738
   685
    hence "join (a+a) 0 = a" by (simp add: add_join_distrib_right) 
obua@14738
   686
    hence "join (a+a) 0 <= a" by (simp)
obua@14738
   687
    hence "0 <= a" by (blast intro: order_trans meet_join_le)
obua@14738
   688
  }
obua@14738
   689
  note p = this
obua@14738
   690
  assume hyp:"join a (-a) = 0"
obua@14738
   691
  hence hyp2:"join (-a) (-(-a)) = 0" by (simp add: join_comm)
obua@14738
   692
  from p[OF hyp] p[OF hyp2] show "a = 0" by simp
obua@14738
   693
qed
obua@14738
   694
obua@14738
   695
lemma meet_0_imp_0: "meet a (-a) = 0 \<Longrightarrow> a = (0::'a::lordered_ab_group)"
obua@14738
   696
apply (simp add: meet_eq_neg_join)
obua@14738
   697
apply (simp add: join_comm)
paulson@15481
   698
apply (erule join_0_imp_0)
paulson@15481
   699
done
obua@14738
   700
obua@14738
   701
lemma join_0_eq_0[simp]: "(join a (-a) = 0) = (a = (0::'a::lordered_ab_group))"
obua@14738
   702
by (auto, erule join_0_imp_0)
obua@14738
   703
obua@14738
   704
lemma meet_0_eq_0[simp]: "(meet a (-a) = 0) = (a = (0::'a::lordered_ab_group))"
obua@14738
   705
by (auto, erule meet_0_imp_0)
obua@14738
   706
obua@14738
   707
lemma zero_le_double_add_iff_zero_le_single_add[simp]: "(0 \<le> a + a) = (0 \<le> (a::'a::lordered_ab_group))"
obua@14738
   708
proof
obua@14738
   709
  assume "0 <= a + a"
obua@14738
   710
  hence a:"meet (a+a) 0 = 0" by (simp add: le_def_meet meet_comm)
obua@14738
   711
  have "(meet a 0)+(meet a 0) = meet (meet (a+a) 0) a" (is "?l=_") by (simp add: add_meet_join_distribs meet_aci)
obua@14738
   712
  hence "?l = 0 + meet a 0" by (simp add: a, simp add: meet_comm)
obua@14738
   713
  hence "meet a 0 = 0" by (simp only: add_right_cancel)
obua@14738
   714
  then show "0 <= a" by (simp add: le_def_meet meet_comm)    
obua@14738
   715
next  
obua@14738
   716
  assume a: "0 <= a"
obua@14738
   717
  show "0 <= a + a" by (simp add: add_mono[OF a a, simplified])
obua@14738
   718
qed
obua@14738
   719
obua@14738
   720
lemma double_add_le_zero_iff_single_add_le_zero[simp]: "(a + a <= 0) = ((a::'a::lordered_ab_group) <= 0)" 
obua@14738
   721
proof -
obua@14738
   722
  have "(a + a <= 0) = (0 <= -(a+a))" by (subst le_minus_iff, simp)
obua@14738
   723
  moreover have "\<dots> = (a <= 0)" by (simp add: zero_le_double_add_iff_zero_le_single_add)
obua@14738
   724
  ultimately show ?thesis by blast
obua@14738
   725
qed
obua@14738
   726
obua@14738
   727
lemma double_add_less_zero_iff_single_less_zero[simp]: "(a+a<0) = ((a::'a::{pordered_ab_group_add,linorder}) < 0)" (is ?s)
obua@14738
   728
proof cases
obua@14738
   729
  assume a: "a < 0"
obua@14738
   730
  thus ?s by (simp add:  add_strict_mono[OF a a, simplified])
obua@14738
   731
next
obua@14738
   732
  assume "~(a < 0)" 
obua@14738
   733
  hence a:"0 <= a" by (simp)
obua@14738
   734
  hence "0 <= a+a" by (simp add: add_mono[OF a a, simplified])
obua@14738
   735
  hence "~(a+a < 0)" by simp
obua@14738
   736
  with a show ?thesis by simp 
obua@14738
   737
qed
obua@14738
   738
obua@14738
   739
axclass lordered_ab_group_abs \<subseteq> lordered_ab_group
obua@14738
   740
  abs_lattice: "abs x = join x (-x)"
obua@14738
   741
obua@14738
   742
lemma abs_zero[simp]: "abs 0 = (0::'a::lordered_ab_group_abs)"
obua@14738
   743
by (simp add: abs_lattice)
obua@14738
   744
obua@14738
   745
lemma abs_eq_0[simp]: "(abs a = 0) = (a = (0::'a::lordered_ab_group_abs))"
obua@14738
   746
by (simp add: abs_lattice)
obua@14738
   747
obua@14738
   748
lemma abs_0_eq[simp]: "(0 = abs a) = (a = (0::'a::lordered_ab_group_abs))"
obua@14738
   749
proof -
obua@14738
   750
  have "(0 = abs a) = (abs a = 0)" by (simp only: eq_ac)
obua@14738
   751
  thus ?thesis by simp
obua@14738
   752
qed
obua@14738
   753
obua@14738
   754
lemma neg_meet_eq_join[simp]: "- meet a (b::_::lordered_ab_group) = join (-a) (-b)"
obua@14738
   755
by (simp add: meet_eq_neg_join)
obua@14738
   756
obua@14738
   757
lemma neg_join_eq_meet[simp]: "- join a (b::_::lordered_ab_group) = meet (-a) (-b)"
obua@14738
   758
by (simp del: neg_meet_eq_join add: join_eq_neg_meet)
obua@14738
   759
obua@14738
   760
lemma join_eq_if: "join a (-a) = (if a < 0 then -a else (a::'a::{lordered_ab_group, linorder}))"
obua@14738
   761
proof -
obua@14738
   762
  note b = add_le_cancel_right[of a a "-a",symmetric,simplified]
obua@14738
   763
  have c: "a + a = 0 \<Longrightarrow> -a = a" by (rule add_right_imp_eq[of _ a], simp)
nipkow@15197
   764
  show ?thesis by (auto simp add: join_max max_def b linorder_not_less)
obua@14738
   765
qed
obua@14738
   766
obua@14738
   767
lemma abs_if_lattice: "\<bar>a\<bar> = (if a < 0 then -a else (a::'a::{lordered_ab_group_abs, linorder}))"
obua@14738
   768
proof -
obua@14738
   769
  show ?thesis by (simp add: abs_lattice join_eq_if)
obua@14738
   770
qed
obua@14738
   771
obua@14738
   772
lemma abs_ge_zero[simp]: "0 \<le> abs (a::'a::lordered_ab_group_abs)"
obua@14738
   773
proof -
obua@14738
   774
  have a:"a <= abs a" and b:"-a <= abs a" by (auto simp add: abs_lattice meet_join_le)
obua@14738
   775
  show ?thesis by (rule add_mono[OF a b, simplified])
obua@14738
   776
qed
obua@14738
   777
  
obua@14738
   778
lemma abs_le_zero_iff [simp]: "(abs a \<le> (0::'a::lordered_ab_group_abs)) = (a = 0)" 
obua@14738
   779
proof
obua@14738
   780
  assume "abs a <= 0"
obua@14738
   781
  hence "abs a = 0" by (auto dest: order_antisym)
obua@14738
   782
  thus "a = 0" by simp
obua@14738
   783
next
obua@14738
   784
  assume "a = 0"
obua@14738
   785
  thus "abs a <= 0" by simp
obua@14738
   786
qed
obua@14738
   787
obua@14738
   788
lemma zero_less_abs_iff [simp]: "(0 < abs a) = (a \<noteq> (0::'a::lordered_ab_group_abs))"
obua@14738
   789
by (simp add: order_less_le)
obua@14738
   790
obua@14738
   791
lemma abs_not_less_zero [simp]: "~ abs a < (0::'a::lordered_ab_group_abs)"
obua@14738
   792
proof -
obua@14738
   793
  have a:"!! x (y::_::order). x <= y \<Longrightarrow> ~(y < x)" by auto
obua@14738
   794
  show ?thesis by (simp add: a)
obua@14738
   795
qed
obua@14738
   796
obua@14738
   797
lemma abs_ge_self: "a \<le> abs (a::'a::lordered_ab_group_abs)"
obua@14738
   798
by (simp add: abs_lattice meet_join_le)
obua@14738
   799
obua@14738
   800
lemma abs_ge_minus_self: "-a \<le> abs (a::'a::lordered_ab_group_abs)"
obua@14738
   801
by (simp add: abs_lattice meet_join_le)
obua@14738
   802
obua@14738
   803
lemma le_imp_join_eq: "a \<le> b \<Longrightarrow> join a b = b" 
obua@14738
   804
by (simp add: le_def_join)
obua@14738
   805
obua@14738
   806
lemma ge_imp_join_eq: "b \<le> a \<Longrightarrow> join a b = a"
obua@14738
   807
by (simp add: le_def_join join_aci)
obua@14738
   808
obua@14738
   809
lemma le_imp_meet_eq: "a \<le> b \<Longrightarrow> meet a b = a"
obua@14738
   810
by (simp add: le_def_meet)
obua@14738
   811
obua@14738
   812
lemma ge_imp_meet_eq: "b \<le> a \<Longrightarrow> meet a b = b"
obua@14738
   813
by (simp add: le_def_meet meet_aci)
obua@14738
   814
obua@14738
   815
lemma abs_prts: "abs (a::_::lordered_ab_group_abs) = pprt a - nprt a"
obua@14738
   816
apply (simp add: pprt_def nprt_def diff_minus)
obua@14738
   817
apply (simp add: add_meet_join_distribs join_aci abs_lattice[symmetric])
obua@14738
   818
apply (subst le_imp_join_eq, auto)
obua@14738
   819
done
obua@14738
   820
obua@14738
   821
lemma abs_minus_cancel [simp]: "abs (-a) = abs(a::'a::lordered_ab_group_abs)"
obua@14738
   822
by (simp add: abs_lattice join_comm)
obua@14738
   823
obua@14738
   824
lemma abs_idempotent [simp]: "abs (abs a) = abs (a::'a::lordered_ab_group_abs)"
obua@14738
   825
apply (simp add: abs_lattice[of "abs a"])
obua@14738
   826
apply (subst ge_imp_join_eq)
obua@14738
   827
apply (rule order_trans[of _ 0])
obua@14738
   828
by auto
obua@14738
   829
paulson@15093
   830
lemma abs_minus_commute: 
paulson@15093
   831
  fixes a :: "'a::lordered_ab_group_abs"
paulson@15093
   832
  shows "abs (a-b) = abs(b-a)"
paulson@15093
   833
proof -
paulson@15093
   834
  have "abs (a-b) = abs (- (a-b))" by (simp only: abs_minus_cancel)
paulson@15093
   835
  also have "... = abs(b-a)" by simp
paulson@15093
   836
  finally show ?thesis .
paulson@15093
   837
qed
paulson@15093
   838
obua@14738
   839
lemma zero_le_iff_zero_nprt: "(0 \<le> a) = (nprt a = 0)"
obua@14738
   840
by (simp add: le_def_meet nprt_def meet_comm)
obua@14738
   841
obua@14738
   842
lemma le_zero_iff_zero_pprt: "(a \<le> 0) = (pprt a = 0)"
obua@14738
   843
by (simp add: le_def_join pprt_def join_comm)
obua@14738
   844
obua@14738
   845
lemma le_zero_iff_pprt_id: "(0 \<le> a) = (pprt a = a)"
obua@14738
   846
by (simp add: le_def_join pprt_def join_comm)
obua@14738
   847
obua@14738
   848
lemma zero_le_iff_nprt_id: "(a \<le> 0) = (nprt a = a)"
obua@14738
   849
by (simp add: le_def_meet nprt_def meet_comm)
obua@14738
   850
obua@15580
   851
lemma pprt_mono[simp]: "(a::_::lordered_ab_group) <= b \<Longrightarrow> pprt a <= pprt b"
obua@15580
   852
  by (simp add: le_def_join pprt_def join_aci)
obua@15580
   853
obua@15580
   854
lemma nprt_mono[simp]: "(a::_::lordered_ab_group) <= b \<Longrightarrow> nprt a <= nprt b"
obua@15580
   855
  by (simp add: le_def_meet nprt_def meet_aci)
obua@15580
   856
obua@14738
   857
lemma iff2imp: "(A=B) \<Longrightarrow> (A \<Longrightarrow> B)"
obua@14738
   858
by (simp)
obua@14738
   859
avigad@16775
   860
lemma abs_of_nonneg [simp]: "0 \<le> a \<Longrightarrow> abs a = (a::'a::lordered_ab_group_abs)"
obua@14738
   861
by (simp add: iff2imp[OF zero_le_iff_zero_nprt] iff2imp[OF le_zero_iff_pprt_id] abs_prts)
obua@14738
   862
avigad@16775
   863
lemma abs_of_pos: "0 < (x::'a::lordered_ab_group_abs) ==> abs x = x";
avigad@16775
   864
by (rule abs_of_nonneg, rule order_less_imp_le);
avigad@16775
   865
avigad@16775
   866
lemma abs_of_nonpos [simp]: "a \<le> 0 \<Longrightarrow> abs a = -(a::'a::lordered_ab_group_abs)"
obua@14738
   867
by (simp add: iff2imp[OF le_zero_iff_zero_pprt] iff2imp[OF zero_le_iff_nprt_id] abs_prts)
obua@14738
   868
avigad@16775
   869
lemma abs_of_neg: "(x::'a::lordered_ab_group_abs) <  0 ==> 
avigad@16775
   870
  abs x = - x"
avigad@16775
   871
by (rule abs_of_nonpos, rule order_less_imp_le)
avigad@16775
   872
obua@14738
   873
lemma abs_leI: "[|a \<le> b; -a \<le> b|] ==> abs a \<le> (b::'a::lordered_ab_group_abs)"
obua@14738
   874
by (simp add: abs_lattice join_imp_le)
obua@14738
   875
obua@14738
   876
lemma le_minus_self_iff: "(a \<le> -a) = (a \<le> (0::'a::lordered_ab_group))"
obua@14738
   877
proof -
obua@14738
   878
  from add_le_cancel_left[of "-a" "a+a" "0"] have "(a <= -a) = (a+a <= 0)" 
obua@14738
   879
    by (simp add: add_assoc[symmetric])
obua@14738
   880
  thus ?thesis by simp
obua@14738
   881
qed
obua@14738
   882
obua@14738
   883
lemma minus_le_self_iff: "(-a \<le> a) = (0 \<le> (a::'a::lordered_ab_group))"
obua@14738
   884
proof -
obua@14738
   885
  from add_le_cancel_left[of "-a" "0" "a+a"] have "(-a <= a) = (0 <= a+a)" 
obua@14738
   886
    by (simp add: add_assoc[symmetric])
obua@14738
   887
  thus ?thesis by simp
obua@14738
   888
qed
obua@14738
   889
obua@14738
   890
lemma abs_le_D1: "abs a \<le> b ==> a \<le> (b::'a::lordered_ab_group_abs)"
obua@14738
   891
by (insert abs_ge_self, blast intro: order_trans)
obua@14738
   892
obua@14738
   893
lemma abs_le_D2: "abs a \<le> b ==> -a \<le> (b::'a::lordered_ab_group_abs)"
obua@14738
   894
by (insert abs_le_D1 [of "-a"], simp)
obua@14738
   895
obua@14738
   896
lemma abs_le_iff: "(abs a \<le> b) = (a \<le> b & -a \<le> (b::'a::lordered_ab_group_abs))"
obua@14738
   897
by (blast intro: abs_leI dest: abs_le_D1 abs_le_D2)
obua@14738
   898
nipkow@15539
   899
lemma abs_triangle_ineq: "abs(a+b) \<le> abs a + abs(b::'a::lordered_ab_group_abs)"
obua@14738
   900
proof -
obua@14738
   901
  have g:"abs a + abs b = join (a+b) (join (-a-b) (join (-a+b) (a + (-b))))" (is "_=join ?m ?n")
haftmann@19233
   902
    by (simp add: abs_lattice add_meet_join_distribs join_aci diff_minus)
obua@14738
   903
  have a:"a+b <= join ?m ?n" by (simp add: meet_join_le)
obua@14738
   904
  have b:"-a-b <= ?n" by (simp add: meet_join_le) 
obua@14738
   905
  have c:"?n <= join ?m ?n" by (simp add: meet_join_le)
obua@14738
   906
  from b c have d: "-a-b <= join ?m ?n" by simp
obua@14738
   907
  have e:"-a-b = -(a+b)" by (simp add: diff_minus)
obua@14738
   908
  from a d e have "abs(a+b) <= join ?m ?n" 
obua@14738
   909
    by (drule_tac abs_leI, auto)
obua@14738
   910
  with g[symmetric] show ?thesis by simp
obua@14738
   911
qed
obua@14738
   912
avigad@16775
   913
lemma abs_triangle_ineq2: "abs (a::'a::lordered_ab_group_abs) - 
avigad@16775
   914
    abs b <= abs (a - b)"
avigad@16775
   915
  apply (simp add: compare_rls)
avigad@16775
   916
  apply (subgoal_tac "abs a = abs (a - b + b)")
avigad@16775
   917
  apply (erule ssubst)
avigad@16775
   918
  apply (rule abs_triangle_ineq)
avigad@16775
   919
  apply (rule arg_cong);back;
avigad@16775
   920
  apply (simp add: compare_rls)
avigad@16775
   921
done
avigad@16775
   922
avigad@16775
   923
lemma abs_triangle_ineq3: 
avigad@16775
   924
    "abs(abs (a::'a::lordered_ab_group_abs) - abs b) <= abs (a - b)"
avigad@16775
   925
  apply (subst abs_le_iff)
avigad@16775
   926
  apply auto
avigad@16775
   927
  apply (rule abs_triangle_ineq2)
avigad@16775
   928
  apply (subst abs_minus_commute)
avigad@16775
   929
  apply (rule abs_triangle_ineq2)
avigad@16775
   930
done
avigad@16775
   931
avigad@16775
   932
lemma abs_triangle_ineq4: "abs ((a::'a::lordered_ab_group_abs) - b) <= 
avigad@16775
   933
    abs a + abs b"
avigad@16775
   934
proof -;
avigad@16775
   935
  have "abs(a - b) = abs(a + - b)"
avigad@16775
   936
    by (subst diff_minus, rule refl)
avigad@16775
   937
  also have "... <= abs a + abs (- b)"
avigad@16775
   938
    by (rule abs_triangle_ineq)
avigad@16775
   939
  finally show ?thesis
avigad@16775
   940
    by simp
avigad@16775
   941
qed
avigad@16775
   942
obua@14738
   943
lemma abs_diff_triangle_ineq:
obua@14738
   944
     "\<bar>(a::'a::lordered_ab_group_abs) + b - (c+d)\<bar> \<le> \<bar>a-c\<bar> + \<bar>b-d\<bar>"
obua@14738
   945
proof -
obua@14738
   946
  have "\<bar>a + b - (c+d)\<bar> = \<bar>(a-c) + (b-d)\<bar>" by (simp add: diff_minus add_ac)
obua@14738
   947
  also have "... \<le> \<bar>a-c\<bar> + \<bar>b-d\<bar>" by (rule abs_triangle_ineq)
obua@14738
   948
  finally show ?thesis .
obua@14738
   949
qed
obua@14738
   950
nipkow@15539
   951
lemma abs_add_abs[simp]:
nipkow@15539
   952
fixes a:: "'a::{lordered_ab_group_abs}"
nipkow@15539
   953
shows "abs(abs a + abs b) = abs a + abs b" (is "?L = ?R")
nipkow@15539
   954
proof (rule order_antisym)
nipkow@15539
   955
  show "?L \<ge> ?R" by(rule abs_ge_self)
nipkow@15539
   956
next
nipkow@15539
   957
  have "?L \<le> \<bar>\<bar>a\<bar>\<bar> + \<bar>\<bar>b\<bar>\<bar>" by(rule abs_triangle_ineq)
nipkow@15539
   958
  also have "\<dots> = ?R" by simp
nipkow@15539
   959
  finally show "?L \<le> ?R" .
nipkow@15539
   960
qed
nipkow@15539
   961
obua@14754
   962
text {* Needed for abelian cancellation simprocs: *}
obua@14754
   963
obua@14754
   964
lemma add_cancel_21: "((x::'a::ab_group_add) + (y + z) = y + u) = (x + z = u)"
obua@14754
   965
apply (subst add_left_commute)
obua@14754
   966
apply (subst add_left_cancel)
obua@14754
   967
apply simp
obua@14754
   968
done
obua@14754
   969
obua@14754
   970
lemma add_cancel_end: "(x + (y + z) = y) = (x = - (z::'a::ab_group_add))"
obua@14754
   971
apply (subst add_cancel_21[of _ _ _ 0, simplified])
obua@14754
   972
apply (simp add: add_right_cancel[symmetric, of "x" "-z" "z", simplified])
obua@14754
   973
done
obua@14754
   974
obua@14754
   975
lemma less_eqI: "(x::'a::pordered_ab_group_add) - y = x' - y' \<Longrightarrow> (x < y) = (x' < y')"
obua@14754
   976
by (simp add: less_iff_diff_less_0[of x y] less_iff_diff_less_0[of x' y'])
obua@14754
   977
obua@14754
   978
lemma le_eqI: "(x::'a::pordered_ab_group_add) - y = x' - y' \<Longrightarrow> (y <= x) = (y' <= x')"
obua@14754
   979
apply (simp add: le_iff_diff_le_0[of y x] le_iff_diff_le_0[of  y' x'])
obua@14754
   980
apply (simp add: neg_le_iff_le[symmetric, of "y-x" 0] neg_le_iff_le[symmetric, of "y'-x'" 0])
obua@14754
   981
done
obua@14754
   982
obua@14754
   983
lemma eq_eqI: "(x::'a::ab_group_add) - y = x' - y' \<Longrightarrow> (x = y) = (x' = y')"
obua@14754
   984
by (simp add: eq_iff_diff_eq_0[of x y] eq_iff_diff_eq_0[of x' y'])
obua@14754
   985
obua@14754
   986
lemma diff_def: "(x::'a::ab_group_add) - y == x + (-y)"
obua@14754
   987
by (simp add: diff_minus)
obua@14754
   988
obua@14754
   989
lemma add_minus_cancel: "(a::'a::ab_group_add) + (-a + b) = b"
obua@14754
   990
by (simp add: add_assoc[symmetric])
obua@14754
   991
obua@14754
   992
lemma minus_add_cancel: "-(a::'a::ab_group_add) + (a + b) = b"
obua@14754
   993
by (simp add: add_assoc[symmetric])
obua@14754
   994
obua@15178
   995
lemma  le_add_right_mono: 
obua@15178
   996
  assumes 
obua@15178
   997
  "a <= b + (c::'a::pordered_ab_group_add)"
obua@15178
   998
  "c <= d"    
obua@15178
   999
  shows "a <= b + d"
obua@15178
  1000
  apply (rule_tac order_trans[where y = "b+c"])
obua@15178
  1001
  apply (simp_all add: prems)
obua@15178
  1002
  done
obua@15178
  1003
obua@15178
  1004
lemmas group_eq_simps =
obua@15178
  1005
  mult_ac
obua@15178
  1006
  add_ac
obua@15178
  1007
  add_diff_eq diff_add_eq diff_diff_eq diff_diff_eq2
obua@15178
  1008
  diff_eq_eq eq_diff_eq
obua@15178
  1009
obua@15178
  1010
lemma estimate_by_abs:
obua@15178
  1011
"a + b <= (c::'a::lordered_ab_group_abs) \<Longrightarrow> a <= c + abs b" 
obua@15178
  1012
proof -
obua@15178
  1013
  assume 1: "a+b <= c"
obua@15178
  1014
  have 2: "a <= c+(-b)"
obua@15178
  1015
    apply (insert 1)
obua@15178
  1016
    apply (drule_tac add_right_mono[where c="-b"])
obua@15178
  1017
    apply (simp add: group_eq_simps)
obua@15178
  1018
    done
obua@15178
  1019
  have 3: "(-b) <= abs b" by (rule abs_ge_minus_self)
obua@15178
  1020
  show ?thesis by (rule le_add_right_mono[OF 2 3])
obua@15178
  1021
qed
obua@15178
  1022
paulson@17085
  1023
text{*Simplification of @{term "x-y < 0"}, etc.*}
paulson@17085
  1024
lemmas diff_less_0_iff_less = less_iff_diff_less_0 [symmetric]
paulson@17085
  1025
lemmas diff_eq_0_iff_eq = eq_iff_diff_eq_0 [symmetric]
paulson@17085
  1026
lemmas diff_le_0_iff_le = le_iff_diff_le_0 [symmetric]
paulson@17085
  1027
declare diff_less_0_iff_less [simp]
paulson@17085
  1028
declare diff_eq_0_iff_eq [simp]
paulson@17085
  1029
declare diff_le_0_iff_le [simp]
paulson@17085
  1030
paulson@17085
  1031
obua@14738
  1032
ML {*
obua@14738
  1033
val add_zero_left = thm"add_0";
obua@14738
  1034
val add_zero_right = thm"add_0_right";
obua@14738
  1035
*}
obua@14738
  1036
obua@14738
  1037
ML {*
obua@14738
  1038
val add_assoc = thm "add_assoc";
obua@14738
  1039
val add_commute = thm "add_commute";
obua@14738
  1040
val add_left_commute = thm "add_left_commute";
obua@14738
  1041
val add_ac = thms "add_ac";
obua@14738
  1042
val mult_assoc = thm "mult_assoc";
obua@14738
  1043
val mult_commute = thm "mult_commute";
obua@14738
  1044
val mult_left_commute = thm "mult_left_commute";
obua@14738
  1045
val mult_ac = thms "mult_ac";
obua@14738
  1046
val add_0 = thm "add_0";
obua@14738
  1047
val mult_1_left = thm "mult_1_left";
obua@14738
  1048
val mult_1_right = thm "mult_1_right";
obua@14738
  1049
val mult_1 = thm "mult_1";
obua@14738
  1050
val add_left_imp_eq = thm "add_left_imp_eq";
obua@14738
  1051
val add_right_imp_eq = thm "add_right_imp_eq";
obua@14738
  1052
val add_imp_eq = thm "add_imp_eq";
obua@14738
  1053
val left_minus = thm "left_minus";
obua@14738
  1054
val diff_minus = thm "diff_minus";
obua@14738
  1055
val add_0_right = thm "add_0_right";
obua@14738
  1056
val add_left_cancel = thm "add_left_cancel";
obua@14738
  1057
val add_right_cancel = thm "add_right_cancel";
obua@14738
  1058
val right_minus = thm "right_minus";
obua@14738
  1059
val right_minus_eq = thm "right_minus_eq";
obua@14738
  1060
val minus_minus = thm "minus_minus";
obua@14738
  1061
val equals_zero_I = thm "equals_zero_I";
obua@14738
  1062
val minus_zero = thm "minus_zero";
obua@14738
  1063
val diff_self = thm "diff_self";
obua@14738
  1064
val diff_0 = thm "diff_0";
obua@14738
  1065
val diff_0_right = thm "diff_0_right";
obua@14738
  1066
val diff_minus_eq_add = thm "diff_minus_eq_add";
obua@14738
  1067
val neg_equal_iff_equal = thm "neg_equal_iff_equal";
obua@14738
  1068
val neg_equal_0_iff_equal = thm "neg_equal_0_iff_equal";
obua@14738
  1069
val neg_0_equal_iff_equal = thm "neg_0_equal_iff_equal";
obua@14738
  1070
val equation_minus_iff = thm "equation_minus_iff";
obua@14738
  1071
val minus_equation_iff = thm "minus_equation_iff";
obua@14738
  1072
val minus_add_distrib = thm "minus_add_distrib";
obua@14738
  1073
val minus_diff_eq = thm "minus_diff_eq";
obua@14738
  1074
val add_left_mono = thm "add_left_mono";
obua@14738
  1075
val add_le_imp_le_left = thm "add_le_imp_le_left";
obua@14738
  1076
val add_right_mono = thm "add_right_mono";
obua@14738
  1077
val add_mono = thm "add_mono";
obua@14738
  1078
val add_strict_left_mono = thm "add_strict_left_mono";
obua@14738
  1079
val add_strict_right_mono = thm "add_strict_right_mono";
obua@14738
  1080
val add_strict_mono = thm "add_strict_mono";
obua@14738
  1081
val add_less_le_mono = thm "add_less_le_mono";
obua@14738
  1082
val add_le_less_mono = thm "add_le_less_mono";
obua@14738
  1083
val add_less_imp_less_left = thm "add_less_imp_less_left";
obua@14738
  1084
val add_less_imp_less_right = thm "add_less_imp_less_right";
obua@14738
  1085
val add_less_cancel_left = thm "add_less_cancel_left";
obua@14738
  1086
val add_less_cancel_right = thm "add_less_cancel_right";
obua@14738
  1087
val add_le_cancel_left = thm "add_le_cancel_left";
obua@14738
  1088
val add_le_cancel_right = thm "add_le_cancel_right";
obua@14738
  1089
val add_le_imp_le_right = thm "add_le_imp_le_right";
obua@14738
  1090
val add_increasing = thm "add_increasing";
obua@14738
  1091
val le_imp_neg_le = thm "le_imp_neg_le";
obua@14738
  1092
val neg_le_iff_le = thm "neg_le_iff_le";
obua@14738
  1093
val neg_le_0_iff_le = thm "neg_le_0_iff_le";
obua@14738
  1094
val neg_0_le_iff_le = thm "neg_0_le_iff_le";
obua@14738
  1095
val neg_less_iff_less = thm "neg_less_iff_less";
obua@14738
  1096
val neg_less_0_iff_less = thm "neg_less_0_iff_less";
obua@14738
  1097
val neg_0_less_iff_less = thm "neg_0_less_iff_less";
obua@14738
  1098
val less_minus_iff = thm "less_minus_iff";
obua@14738
  1099
val minus_less_iff = thm "minus_less_iff";
obua@14738
  1100
val le_minus_iff = thm "le_minus_iff";
obua@14738
  1101
val minus_le_iff = thm "minus_le_iff";
obua@14738
  1102
val add_diff_eq = thm "add_diff_eq";
obua@14738
  1103
val diff_add_eq = thm "diff_add_eq";
obua@14738
  1104
val diff_eq_eq = thm "diff_eq_eq";
obua@14738
  1105
val eq_diff_eq = thm "eq_diff_eq";
obua@14738
  1106
val diff_diff_eq = thm "diff_diff_eq";
obua@14738
  1107
val diff_diff_eq2 = thm "diff_diff_eq2";
obua@14738
  1108
val diff_add_cancel = thm "diff_add_cancel";
obua@14738
  1109
val add_diff_cancel = thm "add_diff_cancel";
obua@14738
  1110
val less_iff_diff_less_0 = thm "less_iff_diff_less_0";
obua@14738
  1111
val diff_less_eq = thm "diff_less_eq";
obua@14738
  1112
val less_diff_eq = thm "less_diff_eq";
obua@14738
  1113
val diff_le_eq = thm "diff_le_eq";
obua@14738
  1114
val le_diff_eq = thm "le_diff_eq";
obua@14738
  1115
val compare_rls = thms "compare_rls";
obua@14738
  1116
val eq_iff_diff_eq_0 = thm "eq_iff_diff_eq_0";
obua@14738
  1117
val le_iff_diff_le_0 = thm "le_iff_diff_le_0";
obua@14738
  1118
val add_meet_distrib_left = thm "add_meet_distrib_left";
obua@14738
  1119
val add_join_distrib_left = thm "add_join_distrib_left";
obua@14738
  1120
val is_join_neg_meet = thm "is_join_neg_meet";
obua@14738
  1121
val is_meet_neg_join = thm "is_meet_neg_join";
obua@14738
  1122
val add_join_distrib_right = thm "add_join_distrib_right";
obua@14738
  1123
val add_meet_distrib_right = thm "add_meet_distrib_right";
obua@14738
  1124
val add_meet_join_distribs = thms "add_meet_join_distribs";
obua@14738
  1125
val join_eq_neg_meet = thm "join_eq_neg_meet";
obua@14738
  1126
val meet_eq_neg_join = thm "meet_eq_neg_join";
obua@14738
  1127
val add_eq_meet_join = thm "add_eq_meet_join";
obua@14738
  1128
val prts = thm "prts";
obua@14738
  1129
val zero_le_pprt = thm "zero_le_pprt";
obua@14738
  1130
val nprt_le_zero = thm "nprt_le_zero";
obua@14738
  1131
val le_eq_neg = thm "le_eq_neg";
obua@14738
  1132
val join_0_imp_0 = thm "join_0_imp_0";
obua@14738
  1133
val meet_0_imp_0 = thm "meet_0_imp_0";
obua@14738
  1134
val join_0_eq_0 = thm "join_0_eq_0";
obua@14738
  1135
val meet_0_eq_0 = thm "meet_0_eq_0";
obua@14738
  1136
val zero_le_double_add_iff_zero_le_single_add = thm "zero_le_double_add_iff_zero_le_single_add";
obua@14738
  1137
val double_add_le_zero_iff_single_add_le_zero = thm "double_add_le_zero_iff_single_add_le_zero";
obua@14738
  1138
val double_add_less_zero_iff_single_less_zero = thm "double_add_less_zero_iff_single_less_zero";
obua@14738
  1139
val abs_lattice = thm "abs_lattice";
obua@14738
  1140
val abs_zero = thm "abs_zero";
obua@14738
  1141
val abs_eq_0 = thm "abs_eq_0";
obua@14738
  1142
val abs_0_eq = thm "abs_0_eq";
obua@14738
  1143
val neg_meet_eq_join = thm "neg_meet_eq_join";
obua@14738
  1144
val neg_join_eq_meet = thm "neg_join_eq_meet";
obua@14738
  1145
val join_eq_if = thm "join_eq_if";
obua@14738
  1146
val abs_if_lattice = thm "abs_if_lattice";
obua@14738
  1147
val abs_ge_zero = thm "abs_ge_zero";
obua@14738
  1148
val abs_le_zero_iff = thm "abs_le_zero_iff";
obua@14738
  1149
val zero_less_abs_iff = thm "zero_less_abs_iff";
obua@14738
  1150
val abs_not_less_zero = thm "abs_not_less_zero";
obua@14738
  1151
val abs_ge_self = thm "abs_ge_self";
obua@14738
  1152
val abs_ge_minus_self = thm "abs_ge_minus_self";
obua@14738
  1153
val le_imp_join_eq = thm "le_imp_join_eq";
obua@14738
  1154
val ge_imp_join_eq = thm "ge_imp_join_eq";
obua@14738
  1155
val le_imp_meet_eq = thm "le_imp_meet_eq";
obua@14738
  1156
val ge_imp_meet_eq = thm "ge_imp_meet_eq";
obua@14738
  1157
val abs_prts = thm "abs_prts";
obua@14738
  1158
val abs_minus_cancel = thm "abs_minus_cancel";
obua@14738
  1159
val abs_idempotent = thm "abs_idempotent";
obua@14738
  1160
val zero_le_iff_zero_nprt = thm "zero_le_iff_zero_nprt";
obua@14738
  1161
val le_zero_iff_zero_pprt = thm "le_zero_iff_zero_pprt";
obua@14738
  1162
val le_zero_iff_pprt_id = thm "le_zero_iff_pprt_id";
obua@14738
  1163
val zero_le_iff_nprt_id = thm "zero_le_iff_nprt_id";
obua@14738
  1164
val iff2imp = thm "iff2imp";
avigad@16775
  1165
(* val imp_abs_id = thm "imp_abs_id";
avigad@16775
  1166
val imp_abs_neg_id = thm "imp_abs_neg_id"; *)
obua@14738
  1167
val abs_leI = thm "abs_leI";
obua@14738
  1168
val le_minus_self_iff = thm "le_minus_self_iff";
obua@14738
  1169
val minus_le_self_iff = thm "minus_le_self_iff";
obua@14738
  1170
val abs_le_D1 = thm "abs_le_D1";
obua@14738
  1171
val abs_le_D2 = thm "abs_le_D2";
obua@14738
  1172
val abs_le_iff = thm "abs_le_iff";
obua@14738
  1173
val abs_triangle_ineq = thm "abs_triangle_ineq";
obua@14738
  1174
val abs_diff_triangle_ineq = thm "abs_diff_triangle_ineq";
obua@14738
  1175
*}
obua@14738
  1176
obua@14738
  1177
end