src/HOL/Ring_and_Field.thy
author nipkow
Mon Aug 16 14:22:27 2004 +0200 (2004-08-16)
changeset 15131 c69542757a4d
parent 15077 89840837108e
child 15140 322485b816ac
permissions -rw-r--r--
New theory header syntax.
paulson@14265
     1
(*  Title:   HOL/Ring_and_Field.thy
paulson@14265
     2
    ID:      $Id$
wenzelm@14770
     3
    Author:  Gertrud Bauer, Steven Obua, Lawrence C Paulson and Markus Wenzel
paulson@14265
     4
*)
paulson@14265
     5
obua@14738
     6
header {* (Ordered) Rings and Fields *}
paulson@14265
     7
nipkow@15131
     8
theory Ring_and_Field 
nipkow@15131
     9
import OrderedGroup
nipkow@15131
    10
begin
paulson@14504
    11
obua@14738
    12
text {*
obua@14738
    13
  The theory of partially ordered rings is taken from the books:
obua@14738
    14
  \begin{itemize}
obua@14738
    15
  \item \emph{Lattice Theory} by Garret Birkhoff, American Mathematical Society 1979 
obua@14738
    16
  \item \emph{Partially Ordered Algebraic Systems}, Pergamon Press 1963
obua@14738
    17
  \end{itemize}
obua@14738
    18
  Most of the used notions can also be looked up in 
obua@14738
    19
  \begin{itemize}
wenzelm@14770
    20
  \item \url{http://www.mathworld.com} by Eric Weisstein et. al.
obua@14738
    21
  \item \emph{Algebra I} by van der Waerden, Springer.
obua@14738
    22
  \end{itemize}
obua@14738
    23
*}
paulson@14504
    24
obua@14738
    25
axclass semiring \<subseteq> ab_semigroup_add, semigroup_mult
obua@14738
    26
  left_distrib: "(a + b) * c = a * c + b * c"
obua@14738
    27
  right_distrib: "a * (b + c) = a * b + a * c"
paulson@14504
    28
obua@14738
    29
axclass semiring_0 \<subseteq> semiring, comm_monoid_add
paulson@14504
    30
obua@14940
    31
axclass semiring_0_cancel \<subseteq> semiring_0, cancel_ab_semigroup_add
obua@14940
    32
obua@14738
    33
axclass comm_semiring \<subseteq> ab_semigroup_add, ab_semigroup_mult  
obua@14738
    34
  mult_commute: "a * b = b * a"
obua@14738
    35
  distrib: "(a + b) * c = a * c + b * c"
paulson@14504
    36
obua@14738
    37
instance comm_semiring \<subseteq> semiring
obua@14738
    38
proof
obua@14738
    39
  fix a b c :: 'a
obua@14738
    40
  show "(a + b) * c = a * c + b * c" by (simp add: distrib)
obua@14738
    41
  have "a * (b + c) = (b + c) * a" by (simp add: mult_ac)
obua@14738
    42
  also have "... = b * a + c * a" by (simp only: distrib)
obua@14738
    43
  also have "... = a * b + a * c" by (simp add: mult_ac)
obua@14738
    44
  finally show "a * (b + c) = a * b + a * c" by blast
paulson@14504
    45
qed
paulson@14504
    46
obua@14738
    47
axclass comm_semiring_0 \<subseteq> comm_semiring, comm_monoid_add
paulson@14504
    48
obua@14738
    49
instance comm_semiring_0 \<subseteq> semiring_0 ..
paulson@14504
    50
obua@14940
    51
axclass comm_semiring_0_cancel \<subseteq> comm_semiring_0, cancel_ab_semigroup_add
obua@14940
    52
obua@14940
    53
instance comm_semiring_0_cancel \<subseteq> semiring_0_cancel ..
obua@14940
    54
obua@14738
    55
axclass axclass_0_neq_1 \<subseteq> zero, one
paulson@14265
    56
  zero_neq_one [simp]: "0 \<noteq> 1"
paulson@14265
    57
obua@14738
    58
axclass semiring_1 \<subseteq> axclass_0_neq_1, semiring_0, monoid_mult
paulson@14504
    59
obua@14738
    60
axclass comm_semiring_1 \<subseteq> axclass_0_neq_1, comm_semiring_0, comm_monoid_mult (* previously almost_semiring *)
obua@14738
    61
obua@14738
    62
instance comm_semiring_1 \<subseteq> semiring_1 ..
paulson@14421
    63
obua@14738
    64
axclass axclass_no_zero_divisors \<subseteq> zero, times
obua@14738
    65
  no_zero_divisors: "a \<noteq> 0 \<Longrightarrow> b \<noteq> 0 \<Longrightarrow> a * b \<noteq> 0"
paulson@14504
    66
obua@14940
    67
axclass semiring_1_cancel \<subseteq> semiring_1, cancel_ab_semigroup_add
obua@14940
    68
obua@14940
    69
instance semiring_1_cancel \<subseteq> semiring_0_cancel ..
obua@14940
    70
obua@14738
    71
axclass comm_semiring_1_cancel \<subseteq> comm_semiring_1, cancel_ab_semigroup_add (* previously semiring *)
obua@14738
    72
obua@14940
    73
instance comm_semiring_1_cancel \<subseteq> semiring_1_cancel ..
obua@14940
    74
obua@14940
    75
instance comm_semiring_1_cancel \<subseteq> comm_semiring_0_cancel ..
obua@14940
    76
obua@14738
    77
axclass ring \<subseteq> semiring, ab_group_add
obua@14738
    78
obua@14940
    79
instance ring \<subseteq> semiring_0_cancel ..
paulson@14504
    80
obua@14738
    81
axclass comm_ring \<subseteq> comm_semiring_0, ab_group_add
obua@14738
    82
obua@14738
    83
instance comm_ring \<subseteq> ring ..
paulson@14504
    84
obua@14940
    85
instance comm_ring \<subseteq> comm_semiring_0_cancel ..
obua@14738
    86
obua@14738
    87
axclass ring_1 \<subseteq> ring, semiring_1
paulson@14265
    88
obua@14940
    89
instance ring_1 \<subseteq> semiring_1_cancel ..
obua@14940
    90
obua@14738
    91
axclass comm_ring_1 \<subseteq> comm_ring, comm_semiring_1 (* previously ring *)
obua@14738
    92
obua@14738
    93
instance comm_ring_1 \<subseteq> ring_1 ..
paulson@14421
    94
obua@14738
    95
instance comm_ring_1 \<subseteq> comm_semiring_1_cancel ..
paulson@14265
    96
obua@14738
    97
axclass idom \<subseteq> comm_ring_1, axclass_no_zero_divisors
paulson@14421
    98
obua@14738
    99
axclass field \<subseteq> comm_ring_1, inverse
paulson@14265
   100
  left_inverse [simp]: "a \<noteq> 0 ==> inverse a * a = 1"
paulson@14430
   101
  divide_inverse:      "a / b = a * inverse b"
paulson@14265
   102
obua@14940
   103
lemma mult_zero_left [simp]: "0 * a = (0::'a::semiring_0_cancel)"
obua@14738
   104
proof -
obua@14738
   105
  have "0*a + 0*a = 0*a + 0"
obua@14738
   106
    by (simp add: left_distrib [symmetric])
obua@14738
   107
  thus ?thesis 
obua@14738
   108
    by (simp only: add_left_cancel)
obua@14738
   109
qed
paulson@14265
   110
obua@14940
   111
lemma mult_zero_right [simp]: "a * 0 = (0::'a::semiring_0_cancel)"
obua@14738
   112
proof -
obua@14738
   113
  have "a*0 + a*0 = a*0 + 0"
obua@14738
   114
    by (simp add: right_distrib [symmetric])
obua@14738
   115
  thus ?thesis 
obua@14738
   116
    by (simp only: add_left_cancel)
obua@14738
   117
qed
obua@14738
   118
obua@14738
   119
lemma field_mult_eq_0_iff [simp]: "(a*b = (0::'a::field)) = (a = 0 | b = 0)"
obua@14738
   120
proof cases
obua@14738
   121
  assume "a=0" thus ?thesis by simp
obua@14738
   122
next
obua@14738
   123
  assume anz [simp]: "a\<noteq>0"
obua@14738
   124
  { assume "a * b = 0"
obua@14738
   125
    hence "inverse a * (a * b) = 0" by simp
obua@14738
   126
    hence "b = 0"  by (simp (no_asm_use) add: mult_assoc [symmetric])}
obua@14738
   127
  thus ?thesis by force
obua@14738
   128
qed
obua@14738
   129
obua@14738
   130
instance field \<subseteq> idom
obua@14738
   131
by (intro_classes, simp)
obua@14738
   132
  
paulson@14265
   133
axclass division_by_zero \<subseteq> zero, inverse
paulson@14268
   134
  inverse_zero [simp]: "inverse 0 = 0"
paulson@14265
   135
paulson@14265
   136
subsection {* Distribution rules *}
paulson@14265
   137
paulson@14265
   138
theorems ring_distrib = right_distrib left_distrib
paulson@14265
   139
paulson@14272
   140
text{*For the @{text combine_numerals} simproc*}
paulson@14421
   141
lemma combine_common_factor:
obua@14738
   142
     "a*e + (b*e + c) = (a+b)*e + (c::'a::semiring)"
paulson@14272
   143
by (simp add: left_distrib add_ac)
paulson@14272
   144
paulson@14265
   145
lemma minus_mult_left: "- (a * b) = (-a) * (b::'a::ring)"
paulson@14265
   146
apply (rule equals_zero_I)
paulson@14265
   147
apply (simp add: left_distrib [symmetric]) 
paulson@14265
   148
done
paulson@14265
   149
paulson@14265
   150
lemma minus_mult_right: "- (a * b) = a * -(b::'a::ring)"
paulson@14265
   151
apply (rule equals_zero_I)
paulson@14265
   152
apply (simp add: right_distrib [symmetric]) 
paulson@14265
   153
done
paulson@14265
   154
paulson@14268
   155
lemma minus_mult_minus [simp]: "(- a) * (- b) = a * (b::'a::ring)"
paulson@14268
   156
  by (simp add: minus_mult_left [symmetric] minus_mult_right [symmetric])
paulson@14268
   157
paulson@14365
   158
lemma minus_mult_commute: "(- a) * b = a * (- b::'a::ring)"
paulson@14365
   159
  by (simp add: minus_mult_left [symmetric] minus_mult_right [symmetric])
paulson@14365
   160
paulson@14265
   161
lemma right_diff_distrib: "a * (b - c) = a * b - a * (c::'a::ring)"
paulson@14265
   162
by (simp add: right_distrib diff_minus 
paulson@14265
   163
              minus_mult_left [symmetric] minus_mult_right [symmetric]) 
paulson@14265
   164
paulson@14272
   165
lemma left_diff_distrib: "(a - b) * c = a * c - b * (c::'a::ring)"
obua@14738
   166
by (simp add: left_distrib diff_minus 
obua@14738
   167
              minus_mult_left [symmetric] minus_mult_right [symmetric]) 
paulson@14265
   168
obua@14738
   169
axclass pordered_semiring \<subseteq> semiring_0, pordered_ab_semigroup_add 
obua@14738
   170
  mult_left_mono: "a <= b \<Longrightarrow> 0 <= c \<Longrightarrow> c * a <= c * b"
obua@14738
   171
  mult_right_mono: "a <= b \<Longrightarrow> 0 <= c \<Longrightarrow> a * c <= b * c"
paulson@14267
   172
obua@14738
   173
axclass pordered_cancel_semiring \<subseteq> pordered_semiring, cancel_ab_semigroup_add
paulson@14268
   174
obua@14940
   175
instance pordered_cancel_semiring \<subseteq> semiring_0_cancel ..
obua@14940
   176
obua@14738
   177
axclass ordered_semiring_strict \<subseteq> semiring_0, ordered_cancel_ab_semigroup_add
obua@14738
   178
  mult_strict_left_mono: "a < b \<Longrightarrow> 0 < c \<Longrightarrow> c * a < c * b"
obua@14738
   179
  mult_strict_right_mono: "a < b \<Longrightarrow> 0 < c \<Longrightarrow> a * c < b * c"
paulson@14341
   180
obua@14940
   181
instance ordered_semiring_strict \<subseteq> semiring_0_cancel ..
obua@14940
   182
obua@14738
   183
instance ordered_semiring_strict \<subseteq> pordered_cancel_semiring
obua@14738
   184
apply intro_classes
obua@14738
   185
apply (case_tac "a < b & 0 < c")
obua@14738
   186
apply (auto simp add: mult_strict_left_mono order_less_le)
obua@14738
   187
apply (auto simp add: mult_strict_left_mono order_le_less)
obua@14738
   188
apply (simp add: mult_strict_right_mono)
paulson@14270
   189
done
paulson@14270
   190
obua@14738
   191
axclass pordered_comm_semiring \<subseteq> comm_semiring_0, pordered_ab_semigroup_add
obua@14738
   192
  mult_mono: "a <= b \<Longrightarrow> 0 <= c \<Longrightarrow> c * a <= c * b"
paulson@14270
   193
obua@14738
   194
axclass pordered_cancel_comm_semiring \<subseteq> pordered_comm_semiring, cancel_ab_semigroup_add
paulson@14270
   195
obua@14738
   196
instance pordered_cancel_comm_semiring \<subseteq> pordered_comm_semiring ..
paulson@14270
   197
obua@14738
   198
axclass ordered_comm_semiring_strict \<subseteq> comm_semiring_0, ordered_cancel_ab_semigroup_add
obua@14738
   199
  mult_strict_mono: "a < b \<Longrightarrow> 0 < c \<Longrightarrow> c * a < c * b"
paulson@14265
   200
obua@14738
   201
instance pordered_comm_semiring \<subseteq> pordered_semiring
obua@14738
   202
by (intro_classes, insert mult_mono, simp_all add: mult_commute, blast+)
paulson@14265
   203
obua@14738
   204
instance pordered_cancel_comm_semiring \<subseteq> pordered_cancel_semiring ..
paulson@14265
   205
obua@14738
   206
instance ordered_comm_semiring_strict \<subseteq> ordered_semiring_strict
obua@14738
   207
by (intro_classes, insert mult_strict_mono, simp_all add: mult_commute, blast+)
paulson@14272
   208
obua@14738
   209
instance ordered_comm_semiring_strict \<subseteq> pordered_cancel_comm_semiring
obua@14738
   210
apply (intro_classes)
obua@14738
   211
apply (case_tac "a < b & 0 < c")
obua@14738
   212
apply (auto simp add: mult_strict_left_mono order_less_le)
obua@14738
   213
apply (auto simp add: mult_strict_left_mono order_le_less)
paulson@14272
   214
done
paulson@14272
   215
obua@14738
   216
axclass pordered_ring \<subseteq> ring, pordered_semiring 
paulson@14270
   217
obua@14738
   218
instance pordered_ring \<subseteq> pordered_ab_group_add ..
paulson@14270
   219
obua@14738
   220
instance pordered_ring \<subseteq> pordered_cancel_semiring ..
paulson@14270
   221
obua@14738
   222
axclass lordered_ring \<subseteq> pordered_ring, lordered_ab_group_abs
paulson@14270
   223
obua@14940
   224
instance lordered_ring \<subseteq> lordered_ab_group_meet ..
obua@14940
   225
obua@14940
   226
instance lordered_ring \<subseteq> lordered_ab_group_join ..
obua@14940
   227
obua@14738
   228
axclass axclass_abs_if \<subseteq> minus, ord, zero
obua@14738
   229
  abs_if: "abs a = (if (a < 0) then (-a) else a)"
paulson@14270
   230
obua@14738
   231
axclass ordered_ring_strict \<subseteq> ring, ordered_semiring_strict, axclass_abs_if
paulson@14270
   232
obua@14738
   233
instance ordered_ring_strict \<subseteq> lordered_ab_group ..
paulson@14270
   234
obua@14738
   235
instance ordered_ring_strict \<subseteq> lordered_ring
obua@14738
   236
by (intro_classes, simp add: abs_if join_eq_if)
paulson@14270
   237
obua@14738
   238
axclass pordered_comm_ring \<subseteq> comm_ring, pordered_comm_semiring
paulson@14270
   239
obua@14738
   240
axclass ordered_semidom \<subseteq> comm_semiring_1_cancel, ordered_comm_semiring_strict (* previously ordered_semiring *)
obua@14738
   241
  zero_less_one [simp]: "0 < 1"
paulson@14270
   242
obua@14738
   243
axclass ordered_idom \<subseteq> comm_ring_1, ordered_comm_semiring_strict, axclass_abs_if (* previously ordered_ring *)
paulson@14270
   244
obua@14738
   245
instance ordered_idom \<subseteq> ordered_ring_strict ..
paulson@14272
   246
obua@14738
   247
axclass ordered_field \<subseteq> field, ordered_idom
paulson@14272
   248
paulson@14272
   249
lemma eq_add_iff1:
paulson@14272
   250
     "(a*e + c = b*e + d) = ((a-b)*e + c = (d::'a::ring))"
obua@14738
   251
apply (simp add: diff_minus left_distrib)
paulson@14272
   252
apply (simp add: diff_minus left_distrib add_ac)
obua@14738
   253
apply (simp add: compare_rls minus_mult_left [symmetric])
paulson@14272
   254
done
paulson@14272
   255
paulson@14272
   256
lemma eq_add_iff2:
paulson@14272
   257
     "(a*e + c = b*e + d) = (c = (b-a)*e + (d::'a::ring))"
paulson@14272
   258
apply (simp add: diff_minus left_distrib add_ac)
paulson@14272
   259
apply (simp add: compare_rls minus_mult_left [symmetric]) 
paulson@14272
   260
done
paulson@14272
   261
paulson@14272
   262
lemma less_add_iff1:
obua@14738
   263
     "(a*e + c < b*e + d) = ((a-b)*e + c < (d::'a::pordered_ring))"
paulson@14272
   264
apply (simp add: diff_minus left_distrib add_ac)
paulson@14272
   265
apply (simp add: compare_rls minus_mult_left [symmetric]) 
paulson@14272
   266
done
paulson@14272
   267
paulson@14272
   268
lemma less_add_iff2:
obua@14738
   269
     "(a*e + c < b*e + d) = (c < (b-a)*e + (d::'a::pordered_ring))"
paulson@14272
   270
apply (simp add: diff_minus left_distrib add_ac)
paulson@14272
   271
apply (simp add: compare_rls minus_mult_left [symmetric]) 
paulson@14272
   272
done
paulson@14272
   273
paulson@14272
   274
lemma le_add_iff1:
obua@14738
   275
     "(a*e + c \<le> b*e + d) = ((a-b)*e + c \<le> (d::'a::pordered_ring))"
paulson@14272
   276
apply (simp add: diff_minus left_distrib add_ac)
paulson@14272
   277
apply (simp add: compare_rls minus_mult_left [symmetric]) 
paulson@14272
   278
done
paulson@14272
   279
paulson@14272
   280
lemma le_add_iff2:
obua@14738
   281
     "(a*e + c \<le> b*e + d) = (c \<le> (b-a)*e + (d::'a::pordered_ring))"
paulson@14272
   282
apply (simp add: diff_minus left_distrib add_ac)
paulson@14272
   283
apply (simp add: compare_rls minus_mult_left [symmetric]) 
paulson@14272
   284
done
paulson@14272
   285
paulson@14270
   286
subsection {* Ordering Rules for Multiplication *}
paulson@14270
   287
paulson@14348
   288
lemma mult_left_le_imp_le:
obua@14738
   289
     "[|c*a \<le> c*b; 0 < c|] ==> a \<le> (b::'a::ordered_semiring_strict)"
paulson@14348
   290
  by (force simp add: mult_strict_left_mono linorder_not_less [symmetric])
paulson@14348
   291
 
paulson@14348
   292
lemma mult_right_le_imp_le:
obua@14738
   293
     "[|a*c \<le> b*c; 0 < c|] ==> a \<le> (b::'a::ordered_semiring_strict)"
paulson@14348
   294
  by (force simp add: mult_strict_right_mono linorder_not_less [symmetric])
paulson@14348
   295
paulson@14348
   296
lemma mult_left_less_imp_less:
obua@14738
   297
     "[|c*a < c*b; 0 \<le> c|] ==> a < (b::'a::ordered_semiring_strict)"
paulson@14348
   298
  by (force simp add: mult_left_mono linorder_not_le [symmetric])
paulson@14348
   299
 
paulson@14348
   300
lemma mult_right_less_imp_less:
obua@14738
   301
     "[|a*c < b*c; 0 \<le> c|] ==> a < (b::'a::ordered_semiring_strict)"
paulson@14348
   302
  by (force simp add: mult_right_mono linorder_not_le [symmetric])
paulson@14348
   303
paulson@14265
   304
lemma mult_strict_left_mono_neg:
obua@14738
   305
     "[|b < a; c < 0|] ==> c * a < c * (b::'a::ordered_ring_strict)"
paulson@14265
   306
apply (drule mult_strict_left_mono [of _ _ "-c"])
paulson@14265
   307
apply (simp_all add: minus_mult_left [symmetric]) 
paulson@14265
   308
done
paulson@14265
   309
obua@14738
   310
lemma mult_left_mono_neg:
obua@14738
   311
     "[|b \<le> a; c \<le> 0|] ==> c * a \<le>  c * (b::'a::pordered_ring)"
obua@14738
   312
apply (drule mult_left_mono [of _ _ "-c"])
obua@14738
   313
apply (simp_all add: minus_mult_left [symmetric]) 
obua@14738
   314
done
obua@14738
   315
paulson@14265
   316
lemma mult_strict_right_mono_neg:
obua@14738
   317
     "[|b < a; c < 0|] ==> a * c < b * (c::'a::ordered_ring_strict)"
paulson@14265
   318
apply (drule mult_strict_right_mono [of _ _ "-c"])
paulson@14265
   319
apply (simp_all add: minus_mult_right [symmetric]) 
paulson@14265
   320
done
paulson@14265
   321
obua@14738
   322
lemma mult_right_mono_neg:
obua@14738
   323
     "[|b \<le> a; c \<le> 0|] ==> a * c \<le>  (b::'a::pordered_ring) * c"
obua@14738
   324
apply (drule mult_right_mono [of _ _ "-c"])
obua@14738
   325
apply (simp)
obua@14738
   326
apply (simp_all add: minus_mult_right [symmetric]) 
obua@14738
   327
done
paulson@14265
   328
paulson@14265
   329
subsection{* Products of Signs *}
paulson@14265
   330
obua@14738
   331
lemma mult_pos: "[| (0::'a::ordered_semiring_strict) < a; 0 < b |] ==> 0 < a*b"
paulson@14265
   332
by (drule mult_strict_left_mono [of 0 b], auto)
paulson@14265
   333
obua@14738
   334
lemma mult_pos_le: "[| (0::'a::pordered_cancel_semiring) \<le> a; 0 \<le> b |] ==> 0 \<le> a*b"
obua@14738
   335
by (drule mult_left_mono [of 0 b], auto)
obua@14738
   336
obua@14738
   337
lemma mult_pos_neg: "[| (0::'a::ordered_semiring_strict) < a; b < 0 |] ==> a*b < 0"
paulson@14265
   338
by (drule mult_strict_left_mono [of b 0], auto)
paulson@14265
   339
obua@14738
   340
lemma mult_pos_neg_le: "[| (0::'a::pordered_cancel_semiring) \<le> a; b \<le> 0 |] ==> a*b \<le> 0"
obua@14738
   341
by (drule mult_left_mono [of b 0], auto)
obua@14738
   342
obua@14738
   343
lemma mult_pos_neg2: "[| (0::'a::ordered_semiring_strict) < a; b < 0 |] ==> b*a < 0" 
obua@14738
   344
by (drule mult_strict_right_mono[of b 0], auto)
obua@14738
   345
obua@14738
   346
lemma mult_pos_neg2_le: "[| (0::'a::pordered_cancel_semiring) \<le> a; b \<le> 0 |] ==> b*a \<le> 0" 
obua@14738
   347
by (drule mult_right_mono[of b 0], auto)
obua@14738
   348
obua@14738
   349
lemma mult_neg: "[| a < (0::'a::ordered_ring_strict); b < 0 |] ==> 0 < a*b"
paulson@14265
   350
by (drule mult_strict_right_mono_neg, auto)
paulson@14265
   351
obua@14738
   352
lemma mult_neg_le: "[| a \<le> (0::'a::pordered_ring); b \<le> 0 |] ==> 0 \<le> a*b"
obua@14738
   353
by (drule mult_right_mono_neg[of a 0 b ], auto)
obua@14738
   354
paulson@14341
   355
lemma zero_less_mult_pos:
obua@14738
   356
     "[| 0 < a*b; 0 < a|] ==> 0 < (b::'a::ordered_semiring_strict)"
paulson@14265
   357
apply (case_tac "b\<le>0") 
paulson@14265
   358
 apply (auto simp add: order_le_less linorder_not_less)
paulson@14265
   359
apply (drule_tac mult_pos_neg [of a b]) 
paulson@14265
   360
 apply (auto dest: order_less_not_sym)
paulson@14265
   361
done
paulson@14265
   362
obua@14738
   363
lemma zero_less_mult_pos2:
obua@14738
   364
     "[| 0 < b*a; 0 < a|] ==> 0 < (b::'a::ordered_semiring_strict)"
obua@14738
   365
apply (case_tac "b\<le>0") 
obua@14738
   366
 apply (auto simp add: order_le_less linorder_not_less)
obua@14738
   367
apply (drule_tac mult_pos_neg2 [of a b]) 
obua@14738
   368
 apply (auto dest: order_less_not_sym)
obua@14738
   369
done
obua@14738
   370
paulson@14265
   371
lemma zero_less_mult_iff:
obua@14738
   372
     "((0::'a::ordered_ring_strict) < a*b) = (0 < a & 0 < b | a < 0 & b < 0)"
paulson@14265
   373
apply (auto simp add: order_le_less linorder_not_less mult_pos mult_neg)
paulson@14265
   374
apply (blast dest: zero_less_mult_pos) 
obua@14738
   375
apply (blast dest: zero_less_mult_pos2)
paulson@14265
   376
done
paulson@14265
   377
paulson@14341
   378
text{*A field has no "zero divisors", and this theorem holds without the
paulson@14277
   379
      assumption of an ordering.  See @{text field_mult_eq_0_iff} below.*}
obua@14738
   380
lemma mult_eq_0_iff [simp]: "(a*b = (0::'a::ordered_ring_strict)) = (a = 0 | b = 0)"
paulson@14265
   381
apply (case_tac "a < 0")
paulson@14265
   382
apply (auto simp add: linorder_not_less order_le_less linorder_neq_iff)
paulson@14265
   383
apply (force dest: mult_strict_right_mono_neg mult_strict_right_mono)+
paulson@14265
   384
done
paulson@14265
   385
paulson@14265
   386
lemma zero_le_mult_iff:
obua@14738
   387
     "((0::'a::ordered_ring_strict) \<le> a*b) = (0 \<le> a & 0 \<le> b | a \<le> 0 & b \<le> 0)"
paulson@14265
   388
by (auto simp add: eq_commute [of 0] order_le_less linorder_not_less
paulson@14265
   389
                   zero_less_mult_iff)
paulson@14265
   390
paulson@14265
   391
lemma mult_less_0_iff:
obua@14738
   392
     "(a*b < (0::'a::ordered_ring_strict)) = (0 < a & b < 0 | a < 0 & 0 < b)"
paulson@14265
   393
apply (insert zero_less_mult_iff [of "-a" b]) 
paulson@14265
   394
apply (force simp add: minus_mult_left[symmetric]) 
paulson@14265
   395
done
paulson@14265
   396
paulson@14265
   397
lemma mult_le_0_iff:
obua@14738
   398
     "(a*b \<le> (0::'a::ordered_ring_strict)) = (0 \<le> a & b \<le> 0 | a \<le> 0 & 0 \<le> b)"
paulson@14265
   399
apply (insert zero_le_mult_iff [of "-a" b]) 
paulson@14265
   400
apply (force simp add: minus_mult_left[symmetric]) 
paulson@14265
   401
done
paulson@14265
   402
obua@14738
   403
lemma split_mult_pos_le: "(0 \<le> a & 0 \<le> b) | (a \<le> 0 & b \<le> 0) \<Longrightarrow> 0 \<le> a * (b::_::pordered_ring)"
obua@14738
   404
by (auto simp add: mult_pos_le mult_neg_le)
obua@14738
   405
obua@14738
   406
lemma split_mult_neg_le: "(0 \<le> a & b \<le> 0) | (a \<le> 0 & 0 \<le> b) \<Longrightarrow> a * b \<le> (0::_::pordered_cancel_semiring)" 
obua@14738
   407
by (auto simp add: mult_pos_neg_le mult_pos_neg2_le)
obua@14738
   408
obua@14738
   409
lemma zero_le_square: "(0::'a::ordered_ring_strict) \<le> a*a"
paulson@14265
   410
by (simp add: zero_le_mult_iff linorder_linear) 
paulson@14265
   411
obua@14738
   412
text{*Proving axiom @{text zero_less_one} makes all @{text ordered_semidom}
obua@14738
   413
      theorems available to members of @{term ordered_idom} *}
obua@14738
   414
obua@14738
   415
instance ordered_idom \<subseteq> ordered_semidom
paulson@14421
   416
proof
paulson@14421
   417
  have "(0::'a) \<le> 1*1" by (rule zero_le_square)
paulson@14430
   418
  thus "(0::'a) < 1" by (simp add: order_le_less) 
paulson@14421
   419
qed
paulson@14421
   420
obua@14738
   421
instance ordered_ring_strict \<subseteq> axclass_no_zero_divisors 
obua@14738
   422
by (intro_classes, simp)
obua@14738
   423
obua@14738
   424
instance ordered_idom \<subseteq> idom ..
obua@14738
   425
paulson@14387
   426
text{*All three types of comparision involving 0 and 1 are covered.*}
paulson@14387
   427
paulson@14387
   428
declare zero_neq_one [THEN not_sym, simp]
paulson@14387
   429
obua@14738
   430
lemma zero_le_one [simp]: "(0::'a::ordered_semidom) \<le> 1"
paulson@14268
   431
  by (rule zero_less_one [THEN order_less_imp_le]) 
paulson@14268
   432
obua@14738
   433
lemma not_one_le_zero [simp]: "~ (1::'a::ordered_semidom) \<le> 0"
obua@14738
   434
by (simp add: linorder_not_le) 
paulson@14387
   435
obua@14738
   436
lemma not_one_less_zero [simp]: "~ (1::'a::ordered_semidom) < 0"
obua@14738
   437
by (simp add: linorder_not_less) 
paulson@14268
   438
paulson@14268
   439
subsection{*More Monotonicity*}
paulson@14268
   440
paulson@14268
   441
text{*Strict monotonicity in both arguments*}
paulson@14268
   442
lemma mult_strict_mono:
obua@14738
   443
     "[|a<b; c<d; 0<b; 0\<le>c|] ==> a * c < b * (d::'a::ordered_semiring_strict)"
paulson@14268
   444
apply (case_tac "c=0")
paulson@14268
   445
 apply (simp add: mult_pos) 
paulson@14268
   446
apply (erule mult_strict_right_mono [THEN order_less_trans])
paulson@14268
   447
 apply (force simp add: order_le_less) 
paulson@14268
   448
apply (erule mult_strict_left_mono, assumption)
paulson@14268
   449
done
paulson@14268
   450
paulson@14268
   451
text{*This weaker variant has more natural premises*}
paulson@14268
   452
lemma mult_strict_mono':
obua@14738
   453
     "[| a<b; c<d; 0 \<le> a; 0 \<le> c|] ==> a * c < b * (d::'a::ordered_semiring_strict)"
paulson@14268
   454
apply (rule mult_strict_mono)
paulson@14268
   455
apply (blast intro: order_le_less_trans)+
paulson@14268
   456
done
paulson@14268
   457
paulson@14268
   458
lemma mult_mono:
paulson@14268
   459
     "[|a \<le> b; c \<le> d; 0 \<le> b; 0 \<le> c|] 
obua@14738
   460
      ==> a * c  \<le>  b * (d::'a::pordered_semiring)"
paulson@14268
   461
apply (erule mult_right_mono [THEN order_trans], assumption)
paulson@14268
   462
apply (erule mult_left_mono, assumption)
paulson@14268
   463
done
paulson@14268
   464
obua@14738
   465
lemma less_1_mult: "[| 1 < m; 1 < n |] ==> 1 < m*(n::'a::ordered_semidom)"
paulson@14387
   466
apply (insert mult_strict_mono [of 1 m 1 n]) 
paulson@14430
   467
apply (simp add:  order_less_trans [OF zero_less_one]) 
paulson@14387
   468
done
paulson@14387
   469
paulson@14268
   470
subsection{*Cancellation Laws for Relationships With a Common Factor*}
paulson@14268
   471
paulson@14268
   472
text{*Cancellation laws for @{term "c*a < c*b"} and @{term "a*c < b*c"},
paulson@14268
   473
   also with the relations @{text "\<le>"} and equality.*}
paulson@14268
   474
paulson@14268
   475
lemma mult_less_cancel_right:
obua@14738
   476
    "(a*c < b*c) = ((0 < c & a < b) | (c < 0 & b < (a::'a::ordered_ring_strict)))"
paulson@14268
   477
apply (case_tac "c = 0")
paulson@14268
   478
apply (auto simp add: linorder_neq_iff mult_strict_right_mono 
paulson@14268
   479
                      mult_strict_right_mono_neg)
paulson@14268
   480
apply (auto simp add: linorder_not_less 
paulson@14268
   481
                      linorder_not_le [symmetric, of "a*c"]
paulson@14268
   482
                      linorder_not_le [symmetric, of a])
paulson@14268
   483
apply (erule_tac [!] notE)
paulson@14268
   484
apply (auto simp add: order_less_imp_le mult_right_mono 
paulson@14268
   485
                      mult_right_mono_neg)
paulson@14268
   486
done
paulson@14268
   487
paulson@14268
   488
lemma mult_less_cancel_left:
obua@14738
   489
    "(c*a < c*b) = ((0 < c & a < b) | (c < 0 & b < (a::'a::ordered_ring_strict)))"
obua@14738
   490
apply (case_tac "c = 0")
obua@14738
   491
apply (auto simp add: linorder_neq_iff mult_strict_left_mono 
obua@14738
   492
                      mult_strict_left_mono_neg)
obua@14738
   493
apply (auto simp add: linorder_not_less 
obua@14738
   494
                      linorder_not_le [symmetric, of "c*a"]
obua@14738
   495
                      linorder_not_le [symmetric, of a])
obua@14738
   496
apply (erule_tac [!] notE)
obua@14738
   497
apply (auto simp add: order_less_imp_le mult_left_mono 
obua@14738
   498
                      mult_left_mono_neg)
obua@14738
   499
done
paulson@14268
   500
paulson@14268
   501
lemma mult_le_cancel_right:
obua@14738
   502
     "(a*c \<le> b*c) = ((0<c --> a\<le>b) & (c<0 --> b \<le> (a::'a::ordered_ring_strict)))"
paulson@14268
   503
by (simp add: linorder_not_less [symmetric] mult_less_cancel_right)
paulson@14268
   504
paulson@14268
   505
lemma mult_le_cancel_left:
obua@14738
   506
     "(c*a \<le> c*b) = ((0<c --> a\<le>b) & (c<0 --> b \<le> (a::'a::ordered_ring_strict)))"
obua@14738
   507
by (simp add: linorder_not_less [symmetric] mult_less_cancel_left)
paulson@14268
   508
paulson@14268
   509
lemma mult_less_imp_less_left:
paulson@14341
   510
      assumes less: "c*a < c*b" and nonneg: "0 \<le> c"
obua@14738
   511
      shows "a < (b::'a::ordered_semiring_strict)"
paulson@14377
   512
proof (rule ccontr)
paulson@14377
   513
  assume "~ a < b"
paulson@14377
   514
  hence "b \<le> a" by (simp add: linorder_not_less)
paulson@14377
   515
  hence "c*b \<le> c*a" by (rule mult_left_mono)
paulson@14377
   516
  with this and less show False 
paulson@14377
   517
    by (simp add: linorder_not_less [symmetric])
paulson@14377
   518
qed
paulson@14268
   519
paulson@14268
   520
lemma mult_less_imp_less_right:
obua@14738
   521
  assumes less: "a*c < b*c" and nonneg: "0 <= c"
obua@14738
   522
  shows "a < (b::'a::ordered_semiring_strict)"
obua@14738
   523
proof (rule ccontr)
obua@14738
   524
  assume "~ a < b"
obua@14738
   525
  hence "b \<le> a" by (simp add: linorder_not_less)
obua@14738
   526
  hence "b*c \<le> a*c" by (rule mult_right_mono)
obua@14738
   527
  with this and less show False 
obua@14738
   528
    by (simp add: linorder_not_less [symmetric])
obua@14738
   529
qed  
paulson@14268
   530
paulson@14268
   531
text{*Cancellation of equalities with a common factor*}
paulson@14268
   532
lemma mult_cancel_right [simp]:
obua@14738
   533
     "(a*c = b*c) = (c = (0::'a::ordered_ring_strict) | a=b)"
paulson@14268
   534
apply (cut_tac linorder_less_linear [of 0 c])
paulson@14268
   535
apply (force dest: mult_strict_right_mono_neg mult_strict_right_mono
paulson@14268
   536
             simp add: linorder_neq_iff)
paulson@14268
   537
done
paulson@14268
   538
paulson@14268
   539
text{*These cancellation theorems require an ordering. Versions are proved
paulson@14268
   540
      below that work for fields without an ordering.*}
paulson@14268
   541
lemma mult_cancel_left [simp]:
obua@14738
   542
     "(c*a = c*b) = (c = (0::'a::ordered_ring_strict) | a=b)"
obua@14738
   543
apply (cut_tac linorder_less_linear [of 0 c])
obua@14738
   544
apply (force dest: mult_strict_left_mono_neg mult_strict_left_mono
obua@14738
   545
             simp add: linorder_neq_iff)
obua@14738
   546
done
paulson@14268
   547
obua@14738
   548
text{*This list of rewrites decides ring equalities by ordered rewriting.*}
obua@14738
   549
lemmas ring_eq_simps =
obua@14738
   550
  mult_ac
obua@14738
   551
  left_distrib right_distrib left_diff_distrib right_diff_distrib
obua@14738
   552
  add_ac
obua@14738
   553
  add_diff_eq diff_add_eq diff_diff_eq diff_diff_eq2
obua@14738
   554
  diff_eq_eq eq_diff_eq
obua@14738
   555
    
wenzelm@14770
   556
paulson@14265
   557
subsection {* Fields *}
paulson@14265
   558
paulson@14288
   559
lemma right_inverse [simp]:
paulson@14288
   560
      assumes not0: "a \<noteq> 0" shows "a * inverse (a::'a::field) = 1"
paulson@14288
   561
proof -
paulson@14288
   562
  have "a * inverse a = inverse a * a" by (simp add: mult_ac)
paulson@14288
   563
  also have "... = 1" using not0 by simp
paulson@14288
   564
  finally show ?thesis .
paulson@14288
   565
qed
paulson@14288
   566
paulson@14288
   567
lemma right_inverse_eq: "b \<noteq> 0 ==> (a / b = 1) = (a = (b::'a::field))"
paulson@14288
   568
proof
paulson@14288
   569
  assume neq: "b \<noteq> 0"
paulson@14288
   570
  {
paulson@14288
   571
    hence "a = (a / b) * b" by (simp add: divide_inverse mult_ac)
paulson@14288
   572
    also assume "a / b = 1"
paulson@14288
   573
    finally show "a = b" by simp
paulson@14288
   574
  next
paulson@14288
   575
    assume "a = b"
paulson@14288
   576
    with neq show "a / b = 1" by (simp add: divide_inverse)
paulson@14288
   577
  }
paulson@14288
   578
qed
paulson@14288
   579
paulson@14288
   580
lemma nonzero_inverse_eq_divide: "a \<noteq> 0 ==> inverse (a::'a::field) = 1/a"
paulson@14288
   581
by (simp add: divide_inverse)
paulson@14288
   582
paulson@14288
   583
lemma divide_self [simp]: "a \<noteq> 0 ==> a / (a::'a::field) = 1"
paulson@14288
   584
  by (simp add: divide_inverse)
paulson@14288
   585
paulson@14430
   586
lemma divide_zero [simp]: "a / 0 = (0::'a::{field,division_by_zero})"
paulson@14430
   587
by (simp add: divide_inverse)
paulson@14277
   588
paulson@14430
   589
lemma divide_zero_left [simp]: "0/a = (0::'a::field)"
paulson@14430
   590
by (simp add: divide_inverse)
paulson@14277
   591
paulson@14430
   592
lemma inverse_eq_divide: "inverse (a::'a::field) = 1/a"
paulson@14430
   593
by (simp add: divide_inverse)
paulson@14277
   594
paulson@14430
   595
lemma add_divide_distrib: "(a+b)/(c::'a::field) = a/c + b/c"
paulson@14293
   596
by (simp add: divide_inverse left_distrib) 
paulson@14293
   597
paulson@14293
   598
paulson@14270
   599
text{*Compared with @{text mult_eq_0_iff}, this version removes the requirement
paulson@14270
   600
      of an ordering.*}
paulson@14348
   601
lemma field_mult_eq_0_iff [simp]: "(a*b = (0::'a::field)) = (a = 0 | b = 0)"
paulson@14377
   602
proof cases
paulson@14377
   603
  assume "a=0" thus ?thesis by simp
paulson@14377
   604
next
paulson@14377
   605
  assume anz [simp]: "a\<noteq>0"
paulson@14377
   606
  { assume "a * b = 0"
paulson@14377
   607
    hence "inverse a * (a * b) = 0" by simp
paulson@14377
   608
    hence "b = 0"  by (simp (no_asm_use) add: mult_assoc [symmetric])}
paulson@14377
   609
  thus ?thesis by force
paulson@14377
   610
qed
paulson@14270
   611
paulson@14268
   612
text{*Cancellation of equalities with a common factor*}
paulson@14268
   613
lemma field_mult_cancel_right_lemma:
paulson@14269
   614
      assumes cnz: "c \<noteq> (0::'a::field)"
paulson@14269
   615
	  and eq:  "a*c = b*c"
paulson@14269
   616
	 shows "a=b"
paulson@14377
   617
proof -
paulson@14268
   618
  have "(a * c) * inverse c = (b * c) * inverse c"
paulson@14268
   619
    by (simp add: eq)
paulson@14268
   620
  thus "a=b"
paulson@14268
   621
    by (simp add: mult_assoc cnz)
paulson@14377
   622
qed
paulson@14268
   623
paulson@14348
   624
lemma field_mult_cancel_right [simp]:
paulson@14268
   625
     "(a*c = b*c) = (c = (0::'a::field) | a=b)"
paulson@14377
   626
proof cases
paulson@14377
   627
  assume "c=0" thus ?thesis by simp
paulson@14377
   628
next
paulson@14377
   629
  assume "c\<noteq>0" 
paulson@14377
   630
  thus ?thesis by (force dest: field_mult_cancel_right_lemma)
paulson@14377
   631
qed
paulson@14268
   632
paulson@14348
   633
lemma field_mult_cancel_left [simp]:
paulson@14268
   634
     "(c*a = c*b) = (c = (0::'a::field) | a=b)"
paulson@14268
   635
  by (simp add: mult_commute [of c] field_mult_cancel_right) 
paulson@14268
   636
paulson@14268
   637
lemma nonzero_imp_inverse_nonzero: "a \<noteq> 0 ==> inverse a \<noteq> (0::'a::field)"
paulson@14377
   638
proof
paulson@14268
   639
  assume ianz: "inverse a = 0"
paulson@14268
   640
  assume "a \<noteq> 0"
paulson@14268
   641
  hence "1 = a * inverse a" by simp
paulson@14268
   642
  also have "... = 0" by (simp add: ianz)
paulson@14268
   643
  finally have "1 = (0::'a::field)" .
paulson@14268
   644
  thus False by (simp add: eq_commute)
paulson@14377
   645
qed
paulson@14268
   646
paulson@14277
   647
paulson@14277
   648
subsection{*Basic Properties of @{term inverse}*}
paulson@14277
   649
paulson@14268
   650
lemma inverse_zero_imp_zero: "inverse a = 0 ==> a = (0::'a::field)"
paulson@14268
   651
apply (rule ccontr) 
paulson@14268
   652
apply (blast dest: nonzero_imp_inverse_nonzero) 
paulson@14268
   653
done
paulson@14268
   654
paulson@14268
   655
lemma inverse_nonzero_imp_nonzero:
paulson@14268
   656
   "inverse a = 0 ==> a = (0::'a::field)"
paulson@14268
   657
apply (rule ccontr) 
paulson@14268
   658
apply (blast dest: nonzero_imp_inverse_nonzero) 
paulson@14268
   659
done
paulson@14268
   660
paulson@14268
   661
lemma inverse_nonzero_iff_nonzero [simp]:
paulson@14268
   662
   "(inverse a = 0) = (a = (0::'a::{field,division_by_zero}))"
paulson@14268
   663
by (force dest: inverse_nonzero_imp_nonzero) 
paulson@14268
   664
paulson@14268
   665
lemma nonzero_inverse_minus_eq:
paulson@14269
   666
      assumes [simp]: "a\<noteq>0"  shows "inverse(-a) = -inverse(a::'a::field)"
paulson@14377
   667
proof -
paulson@14377
   668
  have "-a * inverse (- a) = -a * - inverse a"
paulson@14377
   669
    by simp
paulson@14377
   670
  thus ?thesis 
paulson@14377
   671
    by (simp only: field_mult_cancel_left, simp)
paulson@14377
   672
qed
paulson@14268
   673
paulson@14268
   674
lemma inverse_minus_eq [simp]:
paulson@14377
   675
   "inverse(-a) = -inverse(a::'a::{field,division_by_zero})";
paulson@14377
   676
proof cases
paulson@14377
   677
  assume "a=0" thus ?thesis by (simp add: inverse_zero)
paulson@14377
   678
next
paulson@14377
   679
  assume "a\<noteq>0" 
paulson@14377
   680
  thus ?thesis by (simp add: nonzero_inverse_minus_eq)
paulson@14377
   681
qed
paulson@14268
   682
paulson@14268
   683
lemma nonzero_inverse_eq_imp_eq:
paulson@14269
   684
      assumes inveq: "inverse a = inverse b"
paulson@14269
   685
	  and anz:  "a \<noteq> 0"
paulson@14269
   686
	  and bnz:  "b \<noteq> 0"
paulson@14269
   687
	 shows "a = (b::'a::field)"
paulson@14377
   688
proof -
paulson@14268
   689
  have "a * inverse b = a * inverse a"
paulson@14268
   690
    by (simp add: inveq)
paulson@14268
   691
  hence "(a * inverse b) * b = (a * inverse a) * b"
paulson@14268
   692
    by simp
paulson@14268
   693
  thus "a = b"
paulson@14268
   694
    by (simp add: mult_assoc anz bnz)
paulson@14377
   695
qed
paulson@14268
   696
paulson@14268
   697
lemma inverse_eq_imp_eq:
paulson@14268
   698
     "inverse a = inverse b ==> a = (b::'a::{field,division_by_zero})"
paulson@14268
   699
apply (case_tac "a=0 | b=0") 
paulson@14268
   700
 apply (force dest!: inverse_zero_imp_zero
paulson@14268
   701
              simp add: eq_commute [of "0::'a"])
paulson@14268
   702
apply (force dest!: nonzero_inverse_eq_imp_eq) 
paulson@14268
   703
done
paulson@14268
   704
paulson@14268
   705
lemma inverse_eq_iff_eq [simp]:
paulson@14268
   706
     "(inverse a = inverse b) = (a = (b::'a::{field,division_by_zero}))"
paulson@14268
   707
by (force dest!: inverse_eq_imp_eq) 
paulson@14268
   708
paulson@14270
   709
lemma nonzero_inverse_inverse_eq:
paulson@14270
   710
      assumes [simp]: "a \<noteq> 0"  shows "inverse(inverse (a::'a::field)) = a"
paulson@14270
   711
  proof -
paulson@14270
   712
  have "(inverse (inverse a) * inverse a) * a = a" 
paulson@14270
   713
    by (simp add: nonzero_imp_inverse_nonzero)
paulson@14270
   714
  thus ?thesis
paulson@14270
   715
    by (simp add: mult_assoc)
paulson@14270
   716
  qed
paulson@14270
   717
paulson@14270
   718
lemma inverse_inverse_eq [simp]:
paulson@14270
   719
     "inverse(inverse (a::'a::{field,division_by_zero})) = a"
paulson@14270
   720
  proof cases
paulson@14270
   721
    assume "a=0" thus ?thesis by simp
paulson@14270
   722
  next
paulson@14270
   723
    assume "a\<noteq>0" 
paulson@14270
   724
    thus ?thesis by (simp add: nonzero_inverse_inverse_eq)
paulson@14270
   725
  qed
paulson@14270
   726
paulson@14270
   727
lemma inverse_1 [simp]: "inverse 1 = (1::'a::field)"
paulson@14270
   728
  proof -
paulson@14270
   729
  have "inverse 1 * 1 = (1::'a::field)" 
paulson@14270
   730
    by (rule left_inverse [OF zero_neq_one [symmetric]])
paulson@14270
   731
  thus ?thesis  by simp
paulson@14270
   732
  qed
paulson@14270
   733
paulson@15077
   734
lemma inverse_unique: 
paulson@15077
   735
  assumes ab: "a*b = 1"
paulson@15077
   736
  shows "inverse a = (b::'a::field)"
paulson@15077
   737
proof -
paulson@15077
   738
  have "a \<noteq> 0" using ab by auto
paulson@15077
   739
  moreover have "inverse a * (a * b) = inverse a" by (simp add: ab) 
paulson@15077
   740
  ultimately show ?thesis by (simp add: mult_assoc [symmetric]) 
paulson@15077
   741
qed
paulson@15077
   742
paulson@14270
   743
lemma nonzero_inverse_mult_distrib: 
paulson@14270
   744
      assumes anz: "a \<noteq> 0"
paulson@14270
   745
          and bnz: "b \<noteq> 0"
paulson@14270
   746
      shows "inverse(a*b) = inverse(b) * inverse(a::'a::field)"
paulson@14270
   747
  proof -
paulson@14270
   748
  have "inverse(a*b) * (a * b) * inverse(b) = inverse(b)" 
paulson@14270
   749
    by (simp add: field_mult_eq_0_iff anz bnz)
paulson@14270
   750
  hence "inverse(a*b) * a = inverse(b)" 
paulson@14270
   751
    by (simp add: mult_assoc bnz)
paulson@14270
   752
  hence "inverse(a*b) * a * inverse(a) = inverse(b) * inverse(a)" 
paulson@14270
   753
    by simp
paulson@14270
   754
  thus ?thesis
paulson@14270
   755
    by (simp add: mult_assoc anz)
paulson@14270
   756
  qed
paulson@14270
   757
paulson@14270
   758
text{*This version builds in division by zero while also re-orienting
paulson@14270
   759
      the right-hand side.*}
paulson@14270
   760
lemma inverse_mult_distrib [simp]:
paulson@14270
   761
     "inverse(a*b) = inverse(a) * inverse(b::'a::{field,division_by_zero})"
paulson@14270
   762
  proof cases
paulson@14270
   763
    assume "a \<noteq> 0 & b \<noteq> 0" 
paulson@14270
   764
    thus ?thesis  by (simp add: nonzero_inverse_mult_distrib mult_commute)
paulson@14270
   765
  next
paulson@14270
   766
    assume "~ (a \<noteq> 0 & b \<noteq> 0)" 
paulson@14270
   767
    thus ?thesis  by force
paulson@14270
   768
  qed
paulson@14270
   769
paulson@14270
   770
text{*There is no slick version using division by zero.*}
paulson@14270
   771
lemma inverse_add:
paulson@14270
   772
     "[|a \<noteq> 0;  b \<noteq> 0|]
paulson@14270
   773
      ==> inverse a + inverse b = (a+b) * inverse a * inverse (b::'a::field)"
paulson@14270
   774
apply (simp add: left_distrib mult_assoc)
paulson@14270
   775
apply (simp add: mult_commute [of "inverse a"]) 
paulson@14270
   776
apply (simp add: mult_assoc [symmetric] add_commute)
paulson@14270
   777
done
paulson@14270
   778
paulson@14365
   779
lemma inverse_divide [simp]:
paulson@14365
   780
      "inverse (a/b) = b / (a::'a::{field,division_by_zero})"
paulson@14430
   781
  by (simp add: divide_inverse mult_commute)
paulson@14365
   782
paulson@14277
   783
lemma nonzero_mult_divide_cancel_left:
paulson@14277
   784
  assumes [simp]: "b\<noteq>0" and [simp]: "c\<noteq>0" 
paulson@14277
   785
    shows "(c*a)/(c*b) = a/(b::'a::field)"
paulson@14277
   786
proof -
paulson@14277
   787
  have "(c*a)/(c*b) = c * a * (inverse b * inverse c)"
paulson@14277
   788
    by (simp add: field_mult_eq_0_iff divide_inverse 
paulson@14277
   789
                  nonzero_inverse_mult_distrib)
paulson@14277
   790
  also have "... =  a * inverse b * (inverse c * c)"
paulson@14277
   791
    by (simp only: mult_ac)
paulson@14277
   792
  also have "... =  a * inverse b"
paulson@14277
   793
    by simp
paulson@14277
   794
    finally show ?thesis 
paulson@14277
   795
    by (simp add: divide_inverse)
paulson@14277
   796
qed
paulson@14277
   797
paulson@14277
   798
lemma mult_divide_cancel_left:
paulson@14277
   799
     "c\<noteq>0 ==> (c*a) / (c*b) = a / (b::'a::{field,division_by_zero})"
paulson@14277
   800
apply (case_tac "b = 0")
paulson@14277
   801
apply (simp_all add: nonzero_mult_divide_cancel_left)
paulson@14277
   802
done
paulson@14277
   803
paulson@14321
   804
lemma nonzero_mult_divide_cancel_right:
paulson@14321
   805
     "[|b\<noteq>0; c\<noteq>0|] ==> (a*c) / (b*c) = a/(b::'a::field)"
paulson@14321
   806
by (simp add: mult_commute [of _ c] nonzero_mult_divide_cancel_left) 
paulson@14321
   807
paulson@14321
   808
lemma mult_divide_cancel_right:
paulson@14321
   809
     "c\<noteq>0 ==> (a*c) / (b*c) = a / (b::'a::{field,division_by_zero})"
paulson@14321
   810
apply (case_tac "b = 0")
paulson@14321
   811
apply (simp_all add: nonzero_mult_divide_cancel_right)
paulson@14321
   812
done
paulson@14321
   813
paulson@14277
   814
(*For ExtractCommonTerm*)
paulson@14277
   815
lemma mult_divide_cancel_eq_if:
paulson@14277
   816
     "(c*a) / (c*b) = 
paulson@14277
   817
      (if c=0 then 0 else a / (b::'a::{field,division_by_zero}))"
paulson@14277
   818
  by (simp add: mult_divide_cancel_left)
paulson@14277
   819
paulson@14284
   820
lemma divide_1 [simp]: "a/1 = (a::'a::field)"
paulson@14430
   821
  by (simp add: divide_inverse)
paulson@14284
   822
paulson@14430
   823
lemma times_divide_eq_right [simp]: "a * (b/c) = (a*b) / (c::'a::field)"
paulson@14430
   824
by (simp add: divide_inverse mult_assoc)
paulson@14288
   825
paulson@14430
   826
lemma times_divide_eq_left: "(b/c) * a = (b*a) / (c::'a::field)"
paulson@14430
   827
by (simp add: divide_inverse mult_ac)
paulson@14288
   828
paulson@14288
   829
lemma divide_divide_eq_right [simp]:
paulson@14288
   830
     "a / (b/c) = (a*c) / (b::'a::{field,division_by_zero})"
paulson@14430
   831
by (simp add: divide_inverse mult_ac)
paulson@14288
   832
paulson@14288
   833
lemma divide_divide_eq_left [simp]:
paulson@14288
   834
     "(a / b) / (c::'a::{field,division_by_zero}) = a / (b*c)"
paulson@14430
   835
by (simp add: divide_inverse mult_assoc)
paulson@14288
   836
paulson@14268
   837
paulson@14293
   838
subsection {* Division and Unary Minus *}
paulson@14293
   839
paulson@14293
   840
lemma nonzero_minus_divide_left: "b \<noteq> 0 ==> - (a/b) = (-a) / (b::'a::field)"
paulson@14293
   841
by (simp add: divide_inverse minus_mult_left)
paulson@14293
   842
paulson@14293
   843
lemma nonzero_minus_divide_right: "b \<noteq> 0 ==> - (a/b) = a / -(b::'a::field)"
paulson@14293
   844
by (simp add: divide_inverse nonzero_inverse_minus_eq minus_mult_right)
paulson@14293
   845
paulson@14293
   846
lemma nonzero_minus_divide_divide: "b \<noteq> 0 ==> (-a)/(-b) = a / (b::'a::field)"
paulson@14293
   847
by (simp add: divide_inverse nonzero_inverse_minus_eq)
paulson@14293
   848
paulson@14430
   849
lemma minus_divide_left: "- (a/b) = (-a) / (b::'a::field)"
paulson@14430
   850
by (simp add: divide_inverse minus_mult_left [symmetric])
paulson@14293
   851
paulson@14293
   852
lemma minus_divide_right: "- (a/b) = a / -(b::'a::{field,division_by_zero})"
paulson@14430
   853
by (simp add: divide_inverse minus_mult_right [symmetric])
paulson@14430
   854
paulson@14293
   855
paulson@14293
   856
text{*The effect is to extract signs from divisions*}
paulson@14293
   857
declare minus_divide_left  [symmetric, simp]
paulson@14293
   858
declare minus_divide_right [symmetric, simp]
paulson@14293
   859
paulson@14387
   860
text{*Also, extract signs from products*}
paulson@14387
   861
declare minus_mult_left [symmetric, simp]
paulson@14387
   862
declare minus_mult_right [symmetric, simp]
paulson@14387
   863
paulson@14293
   864
lemma minus_divide_divide [simp]:
paulson@14293
   865
     "(-a)/(-b) = a / (b::'a::{field,division_by_zero})"
paulson@14293
   866
apply (case_tac "b=0", simp) 
paulson@14293
   867
apply (simp add: nonzero_minus_divide_divide) 
paulson@14293
   868
done
paulson@14293
   869
paulson@14430
   870
lemma diff_divide_distrib: "(a-b)/(c::'a::field) = a/c - b/c"
paulson@14387
   871
by (simp add: diff_minus add_divide_distrib) 
paulson@14387
   872
paulson@14293
   873
paulson@14268
   874
subsection {* Ordered Fields *}
paulson@14268
   875
paulson@14277
   876
lemma positive_imp_inverse_positive: 
paulson@14269
   877
      assumes a_gt_0: "0 < a"  shows "0 < inverse (a::'a::ordered_field)"
paulson@14268
   878
  proof -
paulson@14268
   879
  have "0 < a * inverse a" 
paulson@14268
   880
    by (simp add: a_gt_0 [THEN order_less_imp_not_eq2] zero_less_one)
paulson@14268
   881
  thus "0 < inverse a" 
paulson@14268
   882
    by (simp add: a_gt_0 [THEN order_less_not_sym] zero_less_mult_iff)
paulson@14268
   883
  qed
paulson@14268
   884
paulson@14277
   885
lemma negative_imp_inverse_negative:
paulson@14268
   886
     "a < 0 ==> inverse a < (0::'a::ordered_field)"
paulson@14277
   887
  by (insert positive_imp_inverse_positive [of "-a"], 
paulson@14268
   888
      simp add: nonzero_inverse_minus_eq order_less_imp_not_eq) 
paulson@14268
   889
paulson@14268
   890
lemma inverse_le_imp_le:
paulson@14269
   891
      assumes invle: "inverse a \<le> inverse b"
paulson@14269
   892
	  and apos:  "0 < a"
paulson@14269
   893
	 shows "b \<le> (a::'a::ordered_field)"
paulson@14268
   894
  proof (rule classical)
paulson@14268
   895
  assume "~ b \<le> a"
paulson@14268
   896
  hence "a < b"
paulson@14268
   897
    by (simp add: linorder_not_le)
paulson@14268
   898
  hence bpos: "0 < b"
paulson@14268
   899
    by (blast intro: apos order_less_trans)
paulson@14268
   900
  hence "a * inverse a \<le> a * inverse b"
paulson@14268
   901
    by (simp add: apos invle order_less_imp_le mult_left_mono)
paulson@14268
   902
  hence "(a * inverse a) * b \<le> (a * inverse b) * b"
paulson@14268
   903
    by (simp add: bpos order_less_imp_le mult_right_mono)
paulson@14268
   904
  thus "b \<le> a"
paulson@14268
   905
    by (simp add: mult_assoc apos bpos order_less_imp_not_eq2)
paulson@14268
   906
  qed
paulson@14268
   907
paulson@14277
   908
lemma inverse_positive_imp_positive:
paulson@14277
   909
      assumes inv_gt_0: "0 < inverse a"
paulson@14277
   910
          and [simp]:   "a \<noteq> 0"
paulson@14277
   911
        shows "0 < (a::'a::ordered_field)"
paulson@14277
   912
  proof -
paulson@14277
   913
  have "0 < inverse (inverse a)"
paulson@14277
   914
    by (rule positive_imp_inverse_positive)
paulson@14277
   915
  thus "0 < a"
paulson@14277
   916
    by (simp add: nonzero_inverse_inverse_eq)
paulson@14277
   917
  qed
paulson@14277
   918
paulson@14277
   919
lemma inverse_positive_iff_positive [simp]:
paulson@14277
   920
      "(0 < inverse a) = (0 < (a::'a::{ordered_field,division_by_zero}))"
paulson@14277
   921
apply (case_tac "a = 0", simp)
paulson@14277
   922
apply (blast intro: inverse_positive_imp_positive positive_imp_inverse_positive)
paulson@14277
   923
done
paulson@14277
   924
paulson@14277
   925
lemma inverse_negative_imp_negative:
paulson@14277
   926
      assumes inv_less_0: "inverse a < 0"
paulson@14277
   927
          and [simp]:   "a \<noteq> 0"
paulson@14277
   928
        shows "a < (0::'a::ordered_field)"
paulson@14277
   929
  proof -
paulson@14277
   930
  have "inverse (inverse a) < 0"
paulson@14277
   931
    by (rule negative_imp_inverse_negative)
paulson@14277
   932
  thus "a < 0"
paulson@14277
   933
    by (simp add: nonzero_inverse_inverse_eq)
paulson@14277
   934
  qed
paulson@14277
   935
paulson@14277
   936
lemma inverse_negative_iff_negative [simp]:
paulson@14277
   937
      "(inverse a < 0) = (a < (0::'a::{ordered_field,division_by_zero}))"
paulson@14277
   938
apply (case_tac "a = 0", simp)
paulson@14277
   939
apply (blast intro: inverse_negative_imp_negative negative_imp_inverse_negative)
paulson@14277
   940
done
paulson@14277
   941
paulson@14277
   942
lemma inverse_nonnegative_iff_nonnegative [simp]:
paulson@14277
   943
      "(0 \<le> inverse a) = (0 \<le> (a::'a::{ordered_field,division_by_zero}))"
paulson@14277
   944
by (simp add: linorder_not_less [symmetric])
paulson@14277
   945
paulson@14277
   946
lemma inverse_nonpositive_iff_nonpositive [simp]:
paulson@14277
   947
      "(inverse a \<le> 0) = (a \<le> (0::'a::{ordered_field,division_by_zero}))"
paulson@14277
   948
by (simp add: linorder_not_less [symmetric])
paulson@14277
   949
paulson@14277
   950
paulson@14277
   951
subsection{*Anti-Monotonicity of @{term inverse}*}
paulson@14277
   952
paulson@14268
   953
lemma less_imp_inverse_less:
paulson@14269
   954
      assumes less: "a < b"
paulson@14269
   955
	  and apos:  "0 < a"
paulson@14269
   956
	shows "inverse b < inverse (a::'a::ordered_field)"
paulson@14268
   957
  proof (rule ccontr)
paulson@14268
   958
  assume "~ inverse b < inverse a"
paulson@14268
   959
  hence "inverse a \<le> inverse b"
paulson@14268
   960
    by (simp add: linorder_not_less)
paulson@14268
   961
  hence "~ (a < b)"
paulson@14268
   962
    by (simp add: linorder_not_less inverse_le_imp_le [OF _ apos])
paulson@14268
   963
  thus False
paulson@14268
   964
    by (rule notE [OF _ less])
paulson@14268
   965
  qed
paulson@14268
   966
paulson@14268
   967
lemma inverse_less_imp_less:
paulson@14268
   968
   "[|inverse a < inverse b; 0 < a|] ==> b < (a::'a::ordered_field)"
paulson@14268
   969
apply (simp add: order_less_le [of "inverse a"] order_less_le [of "b"])
paulson@14268
   970
apply (force dest!: inverse_le_imp_le nonzero_inverse_eq_imp_eq) 
paulson@14268
   971
done
paulson@14268
   972
paulson@14268
   973
text{*Both premises are essential. Consider -1 and 1.*}
paulson@14268
   974
lemma inverse_less_iff_less [simp]:
paulson@14268
   975
     "[|0 < a; 0 < b|] 
paulson@14268
   976
      ==> (inverse a < inverse b) = (b < (a::'a::ordered_field))"
paulson@14268
   977
by (blast intro: less_imp_inverse_less dest: inverse_less_imp_less) 
paulson@14268
   978
paulson@14268
   979
lemma le_imp_inverse_le:
paulson@14268
   980
   "[|a \<le> b; 0 < a|] ==> inverse b \<le> inverse (a::'a::ordered_field)"
paulson@14268
   981
  by (force simp add: order_le_less less_imp_inverse_less)
paulson@14268
   982
paulson@14268
   983
lemma inverse_le_iff_le [simp]:
paulson@14268
   984
     "[|0 < a; 0 < b|] 
paulson@14268
   985
      ==> (inverse a \<le> inverse b) = (b \<le> (a::'a::ordered_field))"
paulson@14268
   986
by (blast intro: le_imp_inverse_le dest: inverse_le_imp_le) 
paulson@14268
   987
paulson@14268
   988
paulson@14268
   989
text{*These results refer to both operands being negative.  The opposite-sign
paulson@14268
   990
case is trivial, since inverse preserves signs.*}
paulson@14268
   991
lemma inverse_le_imp_le_neg:
paulson@14268
   992
   "[|inverse a \<le> inverse b; b < 0|] ==> b \<le> (a::'a::ordered_field)"
paulson@14268
   993
  apply (rule classical) 
paulson@14268
   994
  apply (subgoal_tac "a < 0") 
paulson@14268
   995
   prefer 2 apply (force simp add: linorder_not_le intro: order_less_trans) 
paulson@14268
   996
  apply (insert inverse_le_imp_le [of "-b" "-a"])
paulson@14268
   997
  apply (simp add: order_less_imp_not_eq nonzero_inverse_minus_eq) 
paulson@14268
   998
  done
paulson@14268
   999
paulson@14268
  1000
lemma less_imp_inverse_less_neg:
paulson@14268
  1001
   "[|a < b; b < 0|] ==> inverse b < inverse (a::'a::ordered_field)"
paulson@14268
  1002
  apply (subgoal_tac "a < 0") 
paulson@14268
  1003
   prefer 2 apply (blast intro: order_less_trans) 
paulson@14268
  1004
  apply (insert less_imp_inverse_less [of "-b" "-a"])
paulson@14268
  1005
  apply (simp add: order_less_imp_not_eq nonzero_inverse_minus_eq) 
paulson@14268
  1006
  done
paulson@14268
  1007
paulson@14268
  1008
lemma inverse_less_imp_less_neg:
paulson@14268
  1009
   "[|inverse a < inverse b; b < 0|] ==> b < (a::'a::ordered_field)"
paulson@14268
  1010
  apply (rule classical) 
paulson@14268
  1011
  apply (subgoal_tac "a < 0") 
paulson@14268
  1012
   prefer 2
paulson@14268
  1013
   apply (force simp add: linorder_not_less intro: order_le_less_trans) 
paulson@14268
  1014
  apply (insert inverse_less_imp_less [of "-b" "-a"])
paulson@14268
  1015
  apply (simp add: order_less_imp_not_eq nonzero_inverse_minus_eq) 
paulson@14268
  1016
  done
paulson@14268
  1017
paulson@14268
  1018
lemma inverse_less_iff_less_neg [simp]:
paulson@14268
  1019
     "[|a < 0; b < 0|] 
paulson@14268
  1020
      ==> (inverse a < inverse b) = (b < (a::'a::ordered_field))"
paulson@14268
  1021
  apply (insert inverse_less_iff_less [of "-b" "-a"])
paulson@14268
  1022
  apply (simp del: inverse_less_iff_less 
paulson@14268
  1023
	      add: order_less_imp_not_eq nonzero_inverse_minus_eq) 
paulson@14268
  1024
  done
paulson@14268
  1025
paulson@14268
  1026
lemma le_imp_inverse_le_neg:
paulson@14268
  1027
   "[|a \<le> b; b < 0|] ==> inverse b \<le> inverse (a::'a::ordered_field)"
paulson@14268
  1028
  by (force simp add: order_le_less less_imp_inverse_less_neg)
paulson@14268
  1029
paulson@14268
  1030
lemma inverse_le_iff_le_neg [simp]:
paulson@14268
  1031
     "[|a < 0; b < 0|] 
paulson@14268
  1032
      ==> (inverse a \<le> inverse b) = (b \<le> (a::'a::ordered_field))"
paulson@14268
  1033
by (blast intro: le_imp_inverse_le_neg dest: inverse_le_imp_le_neg) 
paulson@14265
  1034
paulson@14277
  1035
paulson@14365
  1036
subsection{*Inverses and the Number One*}
paulson@14365
  1037
paulson@14365
  1038
lemma one_less_inverse_iff:
paulson@14365
  1039
    "(1 < inverse x) = (0 < x & x < (1::'a::{ordered_field,division_by_zero}))"proof cases
paulson@14365
  1040
  assume "0 < x"
paulson@14365
  1041
    with inverse_less_iff_less [OF zero_less_one, of x]
paulson@14365
  1042
    show ?thesis by simp
paulson@14365
  1043
next
paulson@14365
  1044
  assume notless: "~ (0 < x)"
paulson@14365
  1045
  have "~ (1 < inverse x)"
paulson@14365
  1046
  proof
paulson@14365
  1047
    assume "1 < inverse x"
paulson@14365
  1048
    also with notless have "... \<le> 0" by (simp add: linorder_not_less)
paulson@14365
  1049
    also have "... < 1" by (rule zero_less_one) 
paulson@14365
  1050
    finally show False by auto
paulson@14365
  1051
  qed
paulson@14365
  1052
  with notless show ?thesis by simp
paulson@14365
  1053
qed
paulson@14365
  1054
paulson@14365
  1055
lemma inverse_eq_1_iff [simp]:
paulson@14365
  1056
    "(inverse x = 1) = (x = (1::'a::{field,division_by_zero}))"
paulson@14365
  1057
by (insert inverse_eq_iff_eq [of x 1], simp) 
paulson@14365
  1058
paulson@14365
  1059
lemma one_le_inverse_iff:
paulson@14365
  1060
   "(1 \<le> inverse x) = (0 < x & x \<le> (1::'a::{ordered_field,division_by_zero}))"
paulson@14365
  1061
by (force simp add: order_le_less one_less_inverse_iff zero_less_one 
paulson@14365
  1062
                    eq_commute [of 1]) 
paulson@14365
  1063
paulson@14365
  1064
lemma inverse_less_1_iff:
paulson@14365
  1065
   "(inverse x < 1) = (x \<le> 0 | 1 < (x::'a::{ordered_field,division_by_zero}))"
paulson@14365
  1066
by (simp add: linorder_not_le [symmetric] one_le_inverse_iff) 
paulson@14365
  1067
paulson@14365
  1068
lemma inverse_le_1_iff:
paulson@14365
  1069
   "(inverse x \<le> 1) = (x \<le> 0 | 1 \<le> (x::'a::{ordered_field,division_by_zero}))"
paulson@14365
  1070
by (simp add: linorder_not_less [symmetric] one_less_inverse_iff) 
paulson@14365
  1071
paulson@14365
  1072
paulson@14277
  1073
subsection{*Division and Signs*}
paulson@14277
  1074
paulson@14277
  1075
lemma zero_less_divide_iff:
paulson@14277
  1076
     "((0::'a::{ordered_field,division_by_zero}) < a/b) = (0 < a & 0 < b | a < 0 & b < 0)"
paulson@14430
  1077
by (simp add: divide_inverse zero_less_mult_iff)
paulson@14277
  1078
paulson@14277
  1079
lemma divide_less_0_iff:
paulson@14277
  1080
     "(a/b < (0::'a::{ordered_field,division_by_zero})) = 
paulson@14277
  1081
      (0 < a & b < 0 | a < 0 & 0 < b)"
paulson@14430
  1082
by (simp add: divide_inverse mult_less_0_iff)
paulson@14277
  1083
paulson@14277
  1084
lemma zero_le_divide_iff:
paulson@14277
  1085
     "((0::'a::{ordered_field,division_by_zero}) \<le> a/b) =
paulson@14277
  1086
      (0 \<le> a & 0 \<le> b | a \<le> 0 & b \<le> 0)"
paulson@14430
  1087
by (simp add: divide_inverse zero_le_mult_iff)
paulson@14277
  1088
paulson@14277
  1089
lemma divide_le_0_iff:
paulson@14288
  1090
     "(a/b \<le> (0::'a::{ordered_field,division_by_zero})) =
paulson@14288
  1091
      (0 \<le> a & b \<le> 0 | a \<le> 0 & 0 \<le> b)"
paulson@14430
  1092
by (simp add: divide_inverse mult_le_0_iff)
paulson@14277
  1093
paulson@14277
  1094
lemma divide_eq_0_iff [simp]:
paulson@14277
  1095
     "(a/b = 0) = (a=0 | b=(0::'a::{field,division_by_zero}))"
paulson@14430
  1096
by (simp add: divide_inverse field_mult_eq_0_iff)
paulson@14277
  1097
paulson@14288
  1098
paulson@14288
  1099
subsection{*Simplification of Inequalities Involving Literal Divisors*}
paulson@14288
  1100
paulson@14288
  1101
lemma pos_le_divide_eq: "0 < (c::'a::ordered_field) ==> (a \<le> b/c) = (a*c \<le> b)"
paulson@14288
  1102
proof -
paulson@14288
  1103
  assume less: "0<c"
paulson@14288
  1104
  hence "(a \<le> b/c) = (a*c \<le> (b/c)*c)"
paulson@14288
  1105
    by (simp add: mult_le_cancel_right order_less_not_sym [OF less])
paulson@14288
  1106
  also have "... = (a*c \<le> b)"
paulson@14288
  1107
    by (simp add: order_less_imp_not_eq2 [OF less] divide_inverse mult_assoc) 
paulson@14288
  1108
  finally show ?thesis .
paulson@14288
  1109
qed
paulson@14288
  1110
paulson@14288
  1111
paulson@14288
  1112
lemma neg_le_divide_eq: "c < (0::'a::ordered_field) ==> (a \<le> b/c) = (b \<le> a*c)"
paulson@14288
  1113
proof -
paulson@14288
  1114
  assume less: "c<0"
paulson@14288
  1115
  hence "(a \<le> b/c) = ((b/c)*c \<le> a*c)"
paulson@14288
  1116
    by (simp add: mult_le_cancel_right order_less_not_sym [OF less])
paulson@14288
  1117
  also have "... = (b \<le> a*c)"
paulson@14288
  1118
    by (simp add: order_less_imp_not_eq [OF less] divide_inverse mult_assoc) 
paulson@14288
  1119
  finally show ?thesis .
paulson@14288
  1120
qed
paulson@14288
  1121
paulson@14288
  1122
lemma le_divide_eq:
paulson@14288
  1123
  "(a \<le> b/c) = 
paulson@14288
  1124
   (if 0 < c then a*c \<le> b
paulson@14288
  1125
             else if c < 0 then b \<le> a*c
paulson@14288
  1126
             else  a \<le> (0::'a::{ordered_field,division_by_zero}))"
paulson@14288
  1127
apply (case_tac "c=0", simp) 
paulson@14288
  1128
apply (force simp add: pos_le_divide_eq neg_le_divide_eq linorder_neq_iff) 
paulson@14288
  1129
done
paulson@14288
  1130
paulson@14288
  1131
lemma pos_divide_le_eq: "0 < (c::'a::ordered_field) ==> (b/c \<le> a) = (b \<le> a*c)"
paulson@14288
  1132
proof -
paulson@14288
  1133
  assume less: "0<c"
paulson@14288
  1134
  hence "(b/c \<le> a) = ((b/c)*c \<le> a*c)"
paulson@14288
  1135
    by (simp add: mult_le_cancel_right order_less_not_sym [OF less])
paulson@14288
  1136
  also have "... = (b \<le> a*c)"
paulson@14288
  1137
    by (simp add: order_less_imp_not_eq2 [OF less] divide_inverse mult_assoc) 
paulson@14288
  1138
  finally show ?thesis .
paulson@14288
  1139
qed
paulson@14288
  1140
paulson@14288
  1141
lemma neg_divide_le_eq: "c < (0::'a::ordered_field) ==> (b/c \<le> a) = (a*c \<le> b)"
paulson@14288
  1142
proof -
paulson@14288
  1143
  assume less: "c<0"
paulson@14288
  1144
  hence "(b/c \<le> a) = (a*c \<le> (b/c)*c)"
paulson@14288
  1145
    by (simp add: mult_le_cancel_right order_less_not_sym [OF less])
paulson@14288
  1146
  also have "... = (a*c \<le> b)"
paulson@14288
  1147
    by (simp add: order_less_imp_not_eq [OF less] divide_inverse mult_assoc) 
paulson@14288
  1148
  finally show ?thesis .
paulson@14288
  1149
qed
paulson@14288
  1150
paulson@14288
  1151
lemma divide_le_eq:
paulson@14288
  1152
  "(b/c \<le> a) = 
paulson@14288
  1153
   (if 0 < c then b \<le> a*c
paulson@14288
  1154
             else if c < 0 then a*c \<le> b
paulson@14288
  1155
             else 0 \<le> (a::'a::{ordered_field,division_by_zero}))"
paulson@14288
  1156
apply (case_tac "c=0", simp) 
paulson@14288
  1157
apply (force simp add: pos_divide_le_eq neg_divide_le_eq linorder_neq_iff) 
paulson@14288
  1158
done
paulson@14288
  1159
paulson@14288
  1160
paulson@14288
  1161
lemma pos_less_divide_eq:
paulson@14288
  1162
     "0 < (c::'a::ordered_field) ==> (a < b/c) = (a*c < b)"
paulson@14288
  1163
proof -
paulson@14288
  1164
  assume less: "0<c"
paulson@14288
  1165
  hence "(a < b/c) = (a*c < (b/c)*c)"
paulson@14288
  1166
    by (simp add: mult_less_cancel_right order_less_not_sym [OF less])
paulson@14288
  1167
  also have "... = (a*c < b)"
paulson@14288
  1168
    by (simp add: order_less_imp_not_eq2 [OF less] divide_inverse mult_assoc) 
paulson@14288
  1169
  finally show ?thesis .
paulson@14288
  1170
qed
paulson@14288
  1171
paulson@14288
  1172
lemma neg_less_divide_eq:
paulson@14288
  1173
 "c < (0::'a::ordered_field) ==> (a < b/c) = (b < a*c)"
paulson@14288
  1174
proof -
paulson@14288
  1175
  assume less: "c<0"
paulson@14288
  1176
  hence "(a < b/c) = ((b/c)*c < a*c)"
paulson@14288
  1177
    by (simp add: mult_less_cancel_right order_less_not_sym [OF less])
paulson@14288
  1178
  also have "... = (b < a*c)"
paulson@14288
  1179
    by (simp add: order_less_imp_not_eq [OF less] divide_inverse mult_assoc) 
paulson@14288
  1180
  finally show ?thesis .
paulson@14288
  1181
qed
paulson@14288
  1182
paulson@14288
  1183
lemma less_divide_eq:
paulson@14288
  1184
  "(a < b/c) = 
paulson@14288
  1185
   (if 0 < c then a*c < b
paulson@14288
  1186
             else if c < 0 then b < a*c
paulson@14288
  1187
             else  a < (0::'a::{ordered_field,division_by_zero}))"
paulson@14288
  1188
apply (case_tac "c=0", simp) 
paulson@14288
  1189
apply (force simp add: pos_less_divide_eq neg_less_divide_eq linorder_neq_iff) 
paulson@14288
  1190
done
paulson@14288
  1191
paulson@14288
  1192
lemma pos_divide_less_eq:
paulson@14288
  1193
     "0 < (c::'a::ordered_field) ==> (b/c < a) = (b < a*c)"
paulson@14288
  1194
proof -
paulson@14288
  1195
  assume less: "0<c"
paulson@14288
  1196
  hence "(b/c < a) = ((b/c)*c < a*c)"
paulson@14288
  1197
    by (simp add: mult_less_cancel_right order_less_not_sym [OF less])
paulson@14288
  1198
  also have "... = (b < a*c)"
paulson@14288
  1199
    by (simp add: order_less_imp_not_eq2 [OF less] divide_inverse mult_assoc) 
paulson@14288
  1200
  finally show ?thesis .
paulson@14288
  1201
qed
paulson@14288
  1202
paulson@14288
  1203
lemma neg_divide_less_eq:
paulson@14288
  1204
 "c < (0::'a::ordered_field) ==> (b/c < a) = (a*c < b)"
paulson@14288
  1205
proof -
paulson@14288
  1206
  assume less: "c<0"
paulson@14288
  1207
  hence "(b/c < a) = (a*c < (b/c)*c)"
paulson@14288
  1208
    by (simp add: mult_less_cancel_right order_less_not_sym [OF less])
paulson@14288
  1209
  also have "... = (a*c < b)"
paulson@14288
  1210
    by (simp add: order_less_imp_not_eq [OF less] divide_inverse mult_assoc) 
paulson@14288
  1211
  finally show ?thesis .
paulson@14288
  1212
qed
paulson@14288
  1213
paulson@14288
  1214
lemma divide_less_eq:
paulson@14288
  1215
  "(b/c < a) = 
paulson@14288
  1216
   (if 0 < c then b < a*c
paulson@14288
  1217
             else if c < 0 then a*c < b
paulson@14288
  1218
             else 0 < (a::'a::{ordered_field,division_by_zero}))"
paulson@14288
  1219
apply (case_tac "c=0", simp) 
paulson@14288
  1220
apply (force simp add: pos_divide_less_eq neg_divide_less_eq linorder_neq_iff) 
paulson@14288
  1221
done
paulson@14288
  1222
paulson@14288
  1223
lemma nonzero_eq_divide_eq: "c\<noteq>0 ==> ((a::'a::field) = b/c) = (a*c = b)"
paulson@14288
  1224
proof -
paulson@14288
  1225
  assume [simp]: "c\<noteq>0"
paulson@14288
  1226
  have "(a = b/c) = (a*c = (b/c)*c)"
paulson@14288
  1227
    by (simp add: field_mult_cancel_right)
paulson@14288
  1228
  also have "... = (a*c = b)"
paulson@14288
  1229
    by (simp add: divide_inverse mult_assoc) 
paulson@14288
  1230
  finally show ?thesis .
paulson@14288
  1231
qed
paulson@14288
  1232
paulson@14288
  1233
lemma eq_divide_eq:
paulson@14288
  1234
  "((a::'a::{field,division_by_zero}) = b/c) = (if c\<noteq>0 then a*c = b else a=0)"
paulson@14288
  1235
by (simp add: nonzero_eq_divide_eq) 
paulson@14288
  1236
paulson@14288
  1237
lemma nonzero_divide_eq_eq: "c\<noteq>0 ==> (b/c = (a::'a::field)) = (b = a*c)"
paulson@14288
  1238
proof -
paulson@14288
  1239
  assume [simp]: "c\<noteq>0"
paulson@14288
  1240
  have "(b/c = a) = ((b/c)*c = a*c)"
paulson@14288
  1241
    by (simp add: field_mult_cancel_right)
paulson@14288
  1242
  also have "... = (b = a*c)"
paulson@14288
  1243
    by (simp add: divide_inverse mult_assoc) 
paulson@14288
  1244
  finally show ?thesis .
paulson@14288
  1245
qed
paulson@14288
  1246
paulson@14288
  1247
lemma divide_eq_eq:
paulson@14288
  1248
  "(b/c = (a::'a::{field,division_by_zero})) = (if c\<noteq>0 then b = a*c else a=0)"
paulson@14288
  1249
by (force simp add: nonzero_divide_eq_eq) 
paulson@14288
  1250
paulson@14288
  1251
subsection{*Cancellation Laws for Division*}
paulson@14288
  1252
paulson@14288
  1253
lemma divide_cancel_right [simp]:
paulson@14288
  1254
     "(a/c = b/c) = (c = 0 | a = (b::'a::{field,division_by_zero}))"
paulson@14288
  1255
apply (case_tac "c=0", simp) 
paulson@14430
  1256
apply (simp add: divide_inverse field_mult_cancel_right) 
paulson@14288
  1257
done
paulson@14288
  1258
paulson@14288
  1259
lemma divide_cancel_left [simp]:
paulson@14288
  1260
     "(c/a = c/b) = (c = 0 | a = (b::'a::{field,division_by_zero}))" 
paulson@14288
  1261
apply (case_tac "c=0", simp) 
paulson@14430
  1262
apply (simp add: divide_inverse field_mult_cancel_left) 
paulson@14288
  1263
done
paulson@14288
  1264
paulson@14353
  1265
subsection {* Division and the Number One *}
paulson@14353
  1266
paulson@14353
  1267
text{*Simplify expressions equated with 1*}
paulson@14353
  1268
lemma divide_eq_1_iff [simp]:
paulson@14353
  1269
     "(a/b = 1) = (b \<noteq> 0 & a = (b::'a::{field,division_by_zero}))"
paulson@14353
  1270
apply (case_tac "b=0", simp) 
paulson@14353
  1271
apply (simp add: right_inverse_eq) 
paulson@14353
  1272
done
paulson@14353
  1273
paulson@14353
  1274
paulson@14353
  1275
lemma one_eq_divide_iff [simp]:
paulson@14353
  1276
     "(1 = a/b) = (b \<noteq> 0 & a = (b::'a::{field,division_by_zero}))"
paulson@14353
  1277
by (simp add: eq_commute [of 1])  
paulson@14353
  1278
paulson@14353
  1279
lemma zero_eq_1_divide_iff [simp]:
paulson@14353
  1280
     "((0::'a::{ordered_field,division_by_zero}) = 1/a) = (a = 0)"
paulson@14353
  1281
apply (case_tac "a=0", simp) 
paulson@14353
  1282
apply (auto simp add: nonzero_eq_divide_eq) 
paulson@14353
  1283
done
paulson@14353
  1284
paulson@14353
  1285
lemma one_divide_eq_0_iff [simp]:
paulson@14353
  1286
     "(1/a = (0::'a::{ordered_field,division_by_zero})) = (a = 0)"
paulson@14353
  1287
apply (case_tac "a=0", simp) 
paulson@14353
  1288
apply (insert zero_neq_one [THEN not_sym]) 
paulson@14353
  1289
apply (auto simp add: nonzero_divide_eq_eq) 
paulson@14353
  1290
done
paulson@14353
  1291
paulson@14353
  1292
text{*Simplify expressions such as @{text "0 < 1/x"} to @{text "0 < x"}*}
paulson@14353
  1293
declare zero_less_divide_iff [of "1", simp]
paulson@14353
  1294
declare divide_less_0_iff [of "1", simp]
paulson@14353
  1295
declare zero_le_divide_iff [of "1", simp]
paulson@14353
  1296
declare divide_le_0_iff [of "1", simp]
paulson@14353
  1297
paulson@14288
  1298
paulson@14293
  1299
subsection {* Ordering Rules for Division *}
paulson@14293
  1300
paulson@14293
  1301
lemma divide_strict_right_mono:
paulson@14293
  1302
     "[|a < b; 0 < c|] ==> a / c < b / (c::'a::ordered_field)"
paulson@14293
  1303
by (simp add: order_less_imp_not_eq2 divide_inverse mult_strict_right_mono 
paulson@14293
  1304
              positive_imp_inverse_positive) 
paulson@14293
  1305
paulson@14293
  1306
lemma divide_right_mono:
paulson@14293
  1307
     "[|a \<le> b; 0 \<le> c|] ==> a/c \<le> b/(c::'a::{ordered_field,division_by_zero})"
paulson@14293
  1308
  by (force simp add: divide_strict_right_mono order_le_less) 
paulson@14293
  1309
paulson@14293
  1310
paulson@14293
  1311
text{*The last premise ensures that @{term a} and @{term b} 
paulson@14293
  1312
      have the same sign*}
paulson@14293
  1313
lemma divide_strict_left_mono:
paulson@14293
  1314
       "[|b < a; 0 < c; 0 < a*b|] ==> c / a < c / (b::'a::ordered_field)"
paulson@14293
  1315
by (force simp add: zero_less_mult_iff divide_inverse mult_strict_left_mono 
paulson@14293
  1316
      order_less_imp_not_eq order_less_imp_not_eq2  
paulson@14293
  1317
      less_imp_inverse_less less_imp_inverse_less_neg) 
paulson@14293
  1318
paulson@14293
  1319
lemma divide_left_mono:
paulson@14293
  1320
     "[|b \<le> a; 0 \<le> c; 0 < a*b|] ==> c / a \<le> c / (b::'a::ordered_field)"
paulson@14293
  1321
  apply (subgoal_tac "a \<noteq> 0 & b \<noteq> 0") 
paulson@14293
  1322
   prefer 2 
paulson@14293
  1323
   apply (force simp add: zero_less_mult_iff order_less_imp_not_eq) 
paulson@14293
  1324
  apply (case_tac "c=0", simp add: divide_inverse)
paulson@14293
  1325
  apply (force simp add: divide_strict_left_mono order_le_less) 
paulson@14293
  1326
  done
paulson@14293
  1327
paulson@14293
  1328
lemma divide_strict_left_mono_neg:
paulson@14293
  1329
     "[|a < b; c < 0; 0 < a*b|] ==> c / a < c / (b::'a::ordered_field)"
paulson@14293
  1330
  apply (subgoal_tac "a \<noteq> 0 & b \<noteq> 0") 
paulson@14293
  1331
   prefer 2 
paulson@14293
  1332
   apply (force simp add: zero_less_mult_iff order_less_imp_not_eq) 
paulson@14293
  1333
  apply (drule divide_strict_left_mono [of _ _ "-c"]) 
paulson@14293
  1334
   apply (simp_all add: mult_commute nonzero_minus_divide_left [symmetric]) 
paulson@14293
  1335
  done
paulson@14293
  1336
paulson@14293
  1337
lemma divide_strict_right_mono_neg:
paulson@14293
  1338
     "[|b < a; c < 0|] ==> a / c < b / (c::'a::ordered_field)"
paulson@14293
  1339
apply (drule divide_strict_right_mono [of _ _ "-c"], simp) 
paulson@14293
  1340
apply (simp add: order_less_imp_not_eq nonzero_minus_divide_right [symmetric]) 
paulson@14293
  1341
done
paulson@14293
  1342
paulson@14293
  1343
paulson@14293
  1344
subsection {* Ordered Fields are Dense *}
paulson@14293
  1345
obua@14738
  1346
lemma less_add_one: "a < (a+1::'a::ordered_semidom)"
paulson@14293
  1347
proof -
obua@14738
  1348
  have "a+0 < (a+1::'a::ordered_semidom)"
paulson@14365
  1349
    by (blast intro: zero_less_one add_strict_left_mono) 
paulson@14293
  1350
  thus ?thesis by simp
paulson@14293
  1351
qed
paulson@14293
  1352
obua@14738
  1353
lemma zero_less_two: "0 < (1+1::'a::ordered_semidom)"
paulson@14365
  1354
  by (blast intro: order_less_trans zero_less_one less_add_one) 
paulson@14365
  1355
paulson@14293
  1356
lemma less_half_sum: "a < b ==> a < (a+b) / (1+1::'a::ordered_field)"
paulson@14293
  1357
by (simp add: zero_less_two pos_less_divide_eq right_distrib) 
paulson@14293
  1358
paulson@14293
  1359
lemma gt_half_sum: "a < b ==> (a+b)/(1+1::'a::ordered_field) < b"
paulson@14293
  1360
by (simp add: zero_less_two pos_divide_less_eq right_distrib) 
paulson@14293
  1361
paulson@14293
  1362
lemma dense: "a < b ==> \<exists>r::'a::ordered_field. a < r & r < b"
paulson@14293
  1363
by (blast intro!: less_half_sum gt_half_sum)
paulson@14293
  1364
paulson@14293
  1365
subsection {* Absolute Value *}
paulson@14293
  1366
obua@14738
  1367
lemma abs_one [simp]: "abs 1 = (1::'a::ordered_idom)"
paulson@14294
  1368
  by (simp add: abs_if zero_less_one [THEN order_less_not_sym]) 
paulson@14294
  1369
obua@14738
  1370
lemma abs_le_mult: "abs (a * b) \<le> (abs a) * (abs (b::'a::lordered_ring))" 
obua@14738
  1371
proof -
obua@14738
  1372
  let ?x = "pprt a * pprt b - pprt a * nprt b - nprt a * pprt b + nprt a * nprt b"
obua@14738
  1373
  let ?y = "pprt a * pprt b + pprt a * nprt b + nprt a * pprt b + nprt a * nprt b"
obua@14738
  1374
  have a: "(abs a) * (abs b) = ?x"
obua@14738
  1375
    by (simp only: abs_prts[of a] abs_prts[of b] ring_eq_simps)
obua@14738
  1376
  {
obua@14738
  1377
    fix u v :: 'a
obua@14738
  1378
    have bh: "\<lbrakk>u = a; v = b\<rbrakk> \<Longrightarrow> u * v = ?y"
obua@14738
  1379
      apply (subst prts[of u], subst prts[of v])
obua@14738
  1380
      apply (simp add: left_distrib right_distrib add_ac) 
obua@14738
  1381
      done
obua@14738
  1382
  }
obua@14738
  1383
  note b = this[OF refl[of a] refl[of b]]
obua@14738
  1384
  note addm = add_mono[of "0::'a" _ "0::'a", simplified]
obua@14738
  1385
  note addm2 = add_mono[of _ "0::'a" _ "0::'a", simplified]
obua@14738
  1386
  have xy: "- ?x <= ?y"
obua@14754
  1387
    apply (simp)
obua@14754
  1388
    apply (rule_tac y="0::'a" in order_trans)
obua@14754
  1389
    apply (rule addm2)+
obua@14754
  1390
    apply (simp_all add: mult_pos_le mult_neg_le)
obua@14754
  1391
    apply (rule addm)+
obua@14754
  1392
    apply (simp_all add: mult_pos_le mult_neg_le)
obua@14754
  1393
    done
obua@14738
  1394
  have yx: "?y <= ?x"
obua@14738
  1395
    apply (simp add: add_ac)
obua@14754
  1396
    apply (rule_tac y=0 in order_trans)
obua@14754
  1397
    apply (rule addm2, (simp add: mult_pos_neg_le mult_pos_neg2_le)+)
obua@14754
  1398
    apply (rule addm, (simp add: mult_pos_neg_le mult_pos_neg2_le)+)
obua@14738
  1399
    done
obua@14738
  1400
  have i1: "a*b <= abs a * abs b" by (simp only: a b yx)
obua@14738
  1401
  have i2: "- (abs a * abs b) <= a*b" by (simp only: a b xy)
obua@14738
  1402
  show ?thesis
obua@14738
  1403
    apply (rule abs_leI)
obua@14738
  1404
    apply (simp add: i1)
obua@14738
  1405
    apply (simp add: i2[simplified minus_le_iff])
obua@14738
  1406
    done
obua@14738
  1407
qed
paulson@14294
  1408
obua@14738
  1409
lemma abs_eq_mult: 
obua@14738
  1410
  assumes "(0 \<le> a \<or> a \<le> 0) \<and> (0 \<le> b \<or> b \<le> 0)"
obua@14738
  1411
  shows "abs (a*b) = abs a * abs (b::'a::lordered_ring)"
obua@14738
  1412
proof -
obua@14738
  1413
  have s: "(0 <= a*b) | (a*b <= 0)"
obua@14738
  1414
    apply (auto)    
obua@14738
  1415
    apply (rule_tac split_mult_pos_le)
obua@14738
  1416
    apply (rule_tac contrapos_np[of "a*b <= 0"])
obua@14738
  1417
    apply (simp)
obua@14738
  1418
    apply (rule_tac split_mult_neg_le)
obua@14738
  1419
    apply (insert prems)
obua@14738
  1420
    apply (blast)
obua@14738
  1421
    done
obua@14738
  1422
  have mulprts: "a * b = (pprt a + nprt a) * (pprt b + nprt b)"
obua@14738
  1423
    by (simp add: prts[symmetric])
obua@14738
  1424
  show ?thesis
obua@14738
  1425
  proof cases
obua@14738
  1426
    assume "0 <= a * b"
obua@14738
  1427
    then show ?thesis
obua@14738
  1428
      apply (simp_all add: mulprts abs_prts)
obua@14754
  1429
      apply (simp add: 
obua@14754
  1430
	iff2imp[OF zero_le_iff_zero_nprt]
obua@14754
  1431
	iff2imp[OF le_zero_iff_pprt_id]
obua@14754
  1432
      )
obua@14738
  1433
      apply (insert prems)
obua@14754
  1434
      apply (auto simp add: 
obua@14754
  1435
	ring_eq_simps 
obua@14754
  1436
	iff2imp[OF zero_le_iff_zero_nprt] iff2imp[OF le_zero_iff_zero_pprt]
obua@14754
  1437
	iff2imp[OF le_zero_iff_pprt_id] iff2imp[OF zero_le_iff_nprt_id] 
obua@14754
  1438
	order_antisym mult_pos_neg_le[of a b] mult_pos_neg2_le[of b a])
obua@14738
  1439
      done
obua@14738
  1440
  next
obua@14738
  1441
    assume "~(0 <= a*b)"
obua@14738
  1442
    with s have "a*b <= 0" by simp
obua@14738
  1443
    then show ?thesis
obua@14738
  1444
      apply (simp_all add: mulprts abs_prts)
obua@14738
  1445
      apply (insert prems)
obua@14738
  1446
      apply (auto simp add: ring_eq_simps iff2imp[OF zero_le_iff_zero_nprt] iff2imp[OF le_zero_iff_zero_pprt]
obua@14738
  1447
	iff2imp[OF le_zero_iff_pprt_id] iff2imp[OF zero_le_iff_nprt_id] order_antisym mult_pos_le[of a b] mult_neg_le[of a b])
obua@14738
  1448
      done
obua@14738
  1449
  qed
obua@14738
  1450
qed
paulson@14294
  1451
obua@14738
  1452
lemma abs_mult: "abs (a * b) = abs a * abs (b::'a::ordered_idom)" 
obua@14738
  1453
by (simp add: abs_eq_mult linorder_linear)
paulson@14293
  1454
obua@14738
  1455
lemma abs_mult_self: "abs a * abs a = a * (a::'a::ordered_idom)"
obua@14738
  1456
by (simp add: abs_if) 
paulson@14294
  1457
paulson@14294
  1458
lemma nonzero_abs_inverse:
paulson@14294
  1459
     "a \<noteq> 0 ==> abs (inverse (a::'a::ordered_field)) = inverse (abs a)"
paulson@14294
  1460
apply (auto simp add: linorder_neq_iff abs_if nonzero_inverse_minus_eq 
paulson@14294
  1461
                      negative_imp_inverse_negative)
paulson@14294
  1462
apply (blast intro: positive_imp_inverse_positive elim: order_less_asym) 
paulson@14294
  1463
done
paulson@14294
  1464
paulson@14294
  1465
lemma abs_inverse [simp]:
paulson@14294
  1466
     "abs (inverse (a::'a::{ordered_field,division_by_zero})) = 
paulson@14294
  1467
      inverse (abs a)"
paulson@14294
  1468
apply (case_tac "a=0", simp) 
paulson@14294
  1469
apply (simp add: nonzero_abs_inverse) 
paulson@14294
  1470
done
paulson@14294
  1471
paulson@14294
  1472
lemma nonzero_abs_divide:
paulson@14294
  1473
     "b \<noteq> 0 ==> abs (a / (b::'a::ordered_field)) = abs a / abs b"
paulson@14294
  1474
by (simp add: divide_inverse abs_mult nonzero_abs_inverse) 
paulson@14294
  1475
paulson@14294
  1476
lemma abs_divide:
paulson@14294
  1477
     "abs (a / (b::'a::{ordered_field,division_by_zero})) = abs a / abs b"
paulson@14294
  1478
apply (case_tac "b=0", simp) 
paulson@14294
  1479
apply (simp add: nonzero_abs_divide) 
paulson@14294
  1480
done
paulson@14294
  1481
paulson@14294
  1482
lemma abs_mult_less:
obua@14738
  1483
     "[| abs a < c; abs b < d |] ==> abs a * abs b < c*(d::'a::ordered_idom)"
paulson@14294
  1484
proof -
paulson@14294
  1485
  assume ac: "abs a < c"
paulson@14294
  1486
  hence cpos: "0<c" by (blast intro: order_le_less_trans abs_ge_zero)
paulson@14294
  1487
  assume "abs b < d"
paulson@14294
  1488
  thus ?thesis by (simp add: ac cpos mult_strict_mono) 
paulson@14294
  1489
qed
paulson@14293
  1490
obua@14738
  1491
lemma eq_minus_self_iff: "(a = -a) = (a = (0::'a::ordered_idom))"
obua@14738
  1492
by (force simp add: order_eq_iff le_minus_self_iff minus_le_self_iff)
obua@14738
  1493
obua@14738
  1494
lemma less_minus_self_iff: "(a < -a) = (a < (0::'a::ordered_idom))"
obua@14738
  1495
by (simp add: order_less_le le_minus_self_iff eq_minus_self_iff)
obua@14738
  1496
obua@14738
  1497
lemma abs_less_iff: "(abs a < b) = (a < b & -a < (b::'a::ordered_idom))" 
obua@14738
  1498
apply (simp add: order_less_le abs_le_iff)  
obua@14738
  1499
apply (auto simp add: abs_if minus_le_self_iff eq_minus_self_iff)
obua@14738
  1500
apply (simp add: le_minus_self_iff linorder_neq_iff) 
obua@14738
  1501
done
obua@14738
  1502
paulson@14430
  1503
text{*Moving this up spoils many proofs using @{text mult_le_cancel_right}*}
paulson@14430
  1504
declare times_divide_eq_left [simp]
paulson@14430
  1505
obua@14738
  1506
ML {*
paulson@14334
  1507
val left_distrib = thm "left_distrib";
obua@14738
  1508
val right_distrib = thm "right_distrib";
obua@14738
  1509
val mult_commute = thm "mult_commute";
obua@14738
  1510
val distrib = thm "distrib";
obua@14738
  1511
val zero_neq_one = thm "zero_neq_one";
obua@14738
  1512
val no_zero_divisors = thm "no_zero_divisors";
paulson@14331
  1513
val left_inverse = thm "left_inverse";
obua@14738
  1514
val divide_inverse = thm "divide_inverse";
obua@14738
  1515
val mult_zero_left = thm "mult_zero_left";
obua@14738
  1516
val mult_zero_right = thm "mult_zero_right";
obua@14738
  1517
val field_mult_eq_0_iff = thm "field_mult_eq_0_iff";
obua@14738
  1518
val inverse_zero = thm "inverse_zero";
obua@14738
  1519
val ring_distrib = thms "ring_distrib";
obua@14738
  1520
val combine_common_factor = thm "combine_common_factor";
obua@14738
  1521
val minus_mult_left = thm "minus_mult_left";
obua@14738
  1522
val minus_mult_right = thm "minus_mult_right";
obua@14738
  1523
val minus_mult_minus = thm "minus_mult_minus";
obua@14738
  1524
val minus_mult_commute = thm "minus_mult_commute";
obua@14738
  1525
val right_diff_distrib = thm "right_diff_distrib";
obua@14738
  1526
val left_diff_distrib = thm "left_diff_distrib";
obua@14738
  1527
val mult_left_mono = thm "mult_left_mono";
obua@14738
  1528
val mult_right_mono = thm "mult_right_mono";
obua@14738
  1529
val mult_strict_left_mono = thm "mult_strict_left_mono";
obua@14738
  1530
val mult_strict_right_mono = thm "mult_strict_right_mono";
obua@14738
  1531
val mult_mono = thm "mult_mono";
obua@14738
  1532
val mult_strict_mono = thm "mult_strict_mono";
obua@14738
  1533
val abs_if = thm "abs_if";
obua@14738
  1534
val zero_less_one = thm "zero_less_one";
obua@14738
  1535
val eq_add_iff1 = thm "eq_add_iff1";
obua@14738
  1536
val eq_add_iff2 = thm "eq_add_iff2";
obua@14738
  1537
val less_add_iff1 = thm "less_add_iff1";
obua@14738
  1538
val less_add_iff2 = thm "less_add_iff2";
obua@14738
  1539
val le_add_iff1 = thm "le_add_iff1";
obua@14738
  1540
val le_add_iff2 = thm "le_add_iff2";
obua@14738
  1541
val mult_left_le_imp_le = thm "mult_left_le_imp_le";
obua@14738
  1542
val mult_right_le_imp_le = thm "mult_right_le_imp_le";
obua@14738
  1543
val mult_left_less_imp_less = thm "mult_left_less_imp_less";
obua@14738
  1544
val mult_right_less_imp_less = thm "mult_right_less_imp_less";
obua@14738
  1545
val mult_strict_left_mono_neg = thm "mult_strict_left_mono_neg";
obua@14738
  1546
val mult_left_mono_neg = thm "mult_left_mono_neg";
obua@14738
  1547
val mult_strict_right_mono_neg = thm "mult_strict_right_mono_neg";
obua@14738
  1548
val mult_right_mono_neg = thm "mult_right_mono_neg";
obua@14738
  1549
val mult_pos = thm "mult_pos";
obua@14738
  1550
val mult_pos_le = thm "mult_pos_le";
obua@14738
  1551
val mult_pos_neg = thm "mult_pos_neg";
obua@14738
  1552
val mult_pos_neg_le = thm "mult_pos_neg_le";
obua@14738
  1553
val mult_pos_neg2 = thm "mult_pos_neg2";
obua@14738
  1554
val mult_pos_neg2_le = thm "mult_pos_neg2_le";
obua@14738
  1555
val mult_neg = thm "mult_neg";
obua@14738
  1556
val mult_neg_le = thm "mult_neg_le";
obua@14738
  1557
val zero_less_mult_pos = thm "zero_less_mult_pos";
obua@14738
  1558
val zero_less_mult_pos2 = thm "zero_less_mult_pos2";
obua@14738
  1559
val zero_less_mult_iff = thm "zero_less_mult_iff";
obua@14738
  1560
val mult_eq_0_iff = thm "mult_eq_0_iff";
obua@14738
  1561
val zero_le_mult_iff = thm "zero_le_mult_iff";
obua@14738
  1562
val mult_less_0_iff = thm "mult_less_0_iff";
obua@14738
  1563
val mult_le_0_iff = thm "mult_le_0_iff";
obua@14738
  1564
val split_mult_pos_le = thm "split_mult_pos_le";
obua@14738
  1565
val split_mult_neg_le = thm "split_mult_neg_le";
obua@14738
  1566
val zero_le_square = thm "zero_le_square";
obua@14738
  1567
val zero_le_one = thm "zero_le_one";
obua@14738
  1568
val not_one_le_zero = thm "not_one_le_zero";
obua@14738
  1569
val not_one_less_zero = thm "not_one_less_zero";
obua@14738
  1570
val mult_left_mono_neg = thm "mult_left_mono_neg";
obua@14738
  1571
val mult_right_mono_neg = thm "mult_right_mono_neg";
obua@14738
  1572
val mult_strict_mono = thm "mult_strict_mono";
obua@14738
  1573
val mult_strict_mono' = thm "mult_strict_mono'";
obua@14738
  1574
val mult_mono = thm "mult_mono";
obua@14738
  1575
val less_1_mult = thm "less_1_mult";
obua@14738
  1576
val mult_less_cancel_right = thm "mult_less_cancel_right";
obua@14738
  1577
val mult_less_cancel_left = thm "mult_less_cancel_left";
obua@14738
  1578
val mult_le_cancel_right = thm "mult_le_cancel_right";
obua@14738
  1579
val mult_le_cancel_left = thm "mult_le_cancel_left";
obua@14738
  1580
val mult_less_imp_less_left = thm "mult_less_imp_less_left";
obua@14738
  1581
val mult_less_imp_less_right = thm "mult_less_imp_less_right";
obua@14738
  1582
val mult_cancel_right = thm "mult_cancel_right";
obua@14738
  1583
val mult_cancel_left = thm "mult_cancel_left";
obua@14738
  1584
val ring_eq_simps = thms "ring_eq_simps";
obua@14738
  1585
val right_inverse = thm "right_inverse";
obua@14738
  1586
val right_inverse_eq = thm "right_inverse_eq";
obua@14738
  1587
val nonzero_inverse_eq_divide = thm "nonzero_inverse_eq_divide";
obua@14738
  1588
val divide_self = thm "divide_self";
obua@14738
  1589
val divide_zero = thm "divide_zero";
obua@14738
  1590
val divide_zero_left = thm "divide_zero_left";
obua@14738
  1591
val inverse_eq_divide = thm "inverse_eq_divide";
obua@14738
  1592
val add_divide_distrib = thm "add_divide_distrib";
obua@14738
  1593
val field_mult_eq_0_iff = thm "field_mult_eq_0_iff";
obua@14738
  1594
val field_mult_cancel_right_lemma = thm "field_mult_cancel_right_lemma";
obua@14738
  1595
val field_mult_cancel_right = thm "field_mult_cancel_right";
obua@14738
  1596
val field_mult_cancel_left = thm "field_mult_cancel_left";
obua@14738
  1597
val nonzero_imp_inverse_nonzero = thm "nonzero_imp_inverse_nonzero";
obua@14738
  1598
val inverse_zero_imp_zero = thm "inverse_zero_imp_zero";
obua@14738
  1599
val inverse_nonzero_imp_nonzero = thm "inverse_nonzero_imp_nonzero";
obua@14738
  1600
val inverse_nonzero_iff_nonzero = thm "inverse_nonzero_iff_nonzero";
obua@14738
  1601
val nonzero_inverse_minus_eq = thm "nonzero_inverse_minus_eq";
obua@14738
  1602
val inverse_minus_eq = thm "inverse_minus_eq";
obua@14738
  1603
val nonzero_inverse_eq_imp_eq = thm "nonzero_inverse_eq_imp_eq";
obua@14738
  1604
val inverse_eq_imp_eq = thm "inverse_eq_imp_eq";
obua@14738
  1605
val inverse_eq_iff_eq = thm "inverse_eq_iff_eq";
obua@14738
  1606
val nonzero_inverse_inverse_eq = thm "nonzero_inverse_inverse_eq";
obua@14738
  1607
val inverse_inverse_eq = thm "inverse_inverse_eq";
obua@14738
  1608
val inverse_1 = thm "inverse_1";
obua@14738
  1609
val nonzero_inverse_mult_distrib = thm "nonzero_inverse_mult_distrib";
obua@14738
  1610
val inverse_mult_distrib = thm "inverse_mult_distrib";
obua@14738
  1611
val inverse_add = thm "inverse_add";
obua@14738
  1612
val inverse_divide = thm "inverse_divide";
obua@14738
  1613
val nonzero_mult_divide_cancel_left = thm "nonzero_mult_divide_cancel_left";
obua@14738
  1614
val mult_divide_cancel_left = thm "mult_divide_cancel_left";
obua@14738
  1615
val nonzero_mult_divide_cancel_right = thm "nonzero_mult_divide_cancel_right";
obua@14738
  1616
val mult_divide_cancel_right = thm "mult_divide_cancel_right";
obua@14738
  1617
val mult_divide_cancel_eq_if = thm "mult_divide_cancel_eq_if";
obua@14738
  1618
val divide_1 = thm "divide_1";
obua@14738
  1619
val times_divide_eq_right = thm "times_divide_eq_right";
obua@14738
  1620
val times_divide_eq_left = thm "times_divide_eq_left";
obua@14738
  1621
val divide_divide_eq_right = thm "divide_divide_eq_right";
obua@14738
  1622
val divide_divide_eq_left = thm "divide_divide_eq_left";
obua@14738
  1623
val nonzero_minus_divide_left = thm "nonzero_minus_divide_left";
obua@14738
  1624
val nonzero_minus_divide_right = thm "nonzero_minus_divide_right";
obua@14738
  1625
val nonzero_minus_divide_divide = thm "nonzero_minus_divide_divide";
obua@14738
  1626
val minus_divide_left = thm "minus_divide_left";
obua@14738
  1627
val minus_divide_right = thm "minus_divide_right";
obua@14738
  1628
val minus_divide_divide = thm "minus_divide_divide";
obua@14738
  1629
val diff_divide_distrib = thm "diff_divide_distrib";
obua@14738
  1630
val positive_imp_inverse_positive = thm "positive_imp_inverse_positive";
obua@14738
  1631
val negative_imp_inverse_negative = thm "negative_imp_inverse_negative";
obua@14738
  1632
val inverse_le_imp_le = thm "inverse_le_imp_le";
obua@14738
  1633
val inverse_positive_imp_positive = thm "inverse_positive_imp_positive";
obua@14738
  1634
val inverse_positive_iff_positive = thm "inverse_positive_iff_positive";
obua@14738
  1635
val inverse_negative_imp_negative = thm "inverse_negative_imp_negative";
obua@14738
  1636
val inverse_negative_iff_negative = thm "inverse_negative_iff_negative";
obua@14738
  1637
val inverse_nonnegative_iff_nonnegative = thm "inverse_nonnegative_iff_nonnegative";
obua@14738
  1638
val inverse_nonpositive_iff_nonpositive = thm "inverse_nonpositive_iff_nonpositive";
obua@14738
  1639
val less_imp_inverse_less = thm "less_imp_inverse_less";
obua@14738
  1640
val inverse_less_imp_less = thm "inverse_less_imp_less";
obua@14738
  1641
val inverse_less_iff_less = thm "inverse_less_iff_less";
obua@14738
  1642
val le_imp_inverse_le = thm "le_imp_inverse_le";
obua@14738
  1643
val inverse_le_iff_le = thm "inverse_le_iff_le";
obua@14738
  1644
val inverse_le_imp_le_neg = thm "inverse_le_imp_le_neg";
obua@14738
  1645
val less_imp_inverse_less_neg = thm "less_imp_inverse_less_neg";
obua@14738
  1646
val inverse_less_imp_less_neg = thm "inverse_less_imp_less_neg";
obua@14738
  1647
val inverse_less_iff_less_neg = thm "inverse_less_iff_less_neg";
obua@14738
  1648
val le_imp_inverse_le_neg = thm "le_imp_inverse_le_neg";
obua@14738
  1649
val inverse_le_iff_le_neg = thm "inverse_le_iff_le_neg";
obua@14738
  1650
val one_less_inverse_iff = thm "one_less_inverse_iff";
obua@14738
  1651
val inverse_eq_1_iff = thm "inverse_eq_1_iff";
obua@14738
  1652
val one_le_inverse_iff = thm "one_le_inverse_iff";
obua@14738
  1653
val inverse_less_1_iff = thm "inverse_less_1_iff";
obua@14738
  1654
val inverse_le_1_iff = thm "inverse_le_1_iff";
obua@14738
  1655
val zero_less_divide_iff = thm "zero_less_divide_iff";
obua@14738
  1656
val divide_less_0_iff = thm "divide_less_0_iff";
obua@14738
  1657
val zero_le_divide_iff = thm "zero_le_divide_iff";
obua@14738
  1658
val divide_le_0_iff = thm "divide_le_0_iff";
obua@14738
  1659
val divide_eq_0_iff = thm "divide_eq_0_iff";
obua@14738
  1660
val pos_le_divide_eq = thm "pos_le_divide_eq";
obua@14738
  1661
val neg_le_divide_eq = thm "neg_le_divide_eq";
obua@14738
  1662
val le_divide_eq = thm "le_divide_eq";
obua@14738
  1663
val pos_divide_le_eq = thm "pos_divide_le_eq";
obua@14738
  1664
val neg_divide_le_eq = thm "neg_divide_le_eq";
obua@14738
  1665
val divide_le_eq = thm "divide_le_eq";
obua@14738
  1666
val pos_less_divide_eq = thm "pos_less_divide_eq";
obua@14738
  1667
val neg_less_divide_eq = thm "neg_less_divide_eq";
obua@14738
  1668
val less_divide_eq = thm "less_divide_eq";
obua@14738
  1669
val pos_divide_less_eq = thm "pos_divide_less_eq";
obua@14738
  1670
val neg_divide_less_eq = thm "neg_divide_less_eq";
obua@14738
  1671
val divide_less_eq = thm "divide_less_eq";
obua@14738
  1672
val nonzero_eq_divide_eq = thm "nonzero_eq_divide_eq";
obua@14738
  1673
val eq_divide_eq = thm "eq_divide_eq";
obua@14738
  1674
val nonzero_divide_eq_eq = thm "nonzero_divide_eq_eq";
obua@14738
  1675
val divide_eq_eq = thm "divide_eq_eq";
obua@14738
  1676
val divide_cancel_right = thm "divide_cancel_right";
obua@14738
  1677
val divide_cancel_left = thm "divide_cancel_left";
obua@14738
  1678
val divide_eq_1_iff = thm "divide_eq_1_iff";
obua@14738
  1679
val one_eq_divide_iff = thm "one_eq_divide_iff";
obua@14738
  1680
val zero_eq_1_divide_iff = thm "zero_eq_1_divide_iff";
obua@14738
  1681
val one_divide_eq_0_iff = thm "one_divide_eq_0_iff";
obua@14738
  1682
val divide_strict_right_mono = thm "divide_strict_right_mono";
obua@14738
  1683
val divide_right_mono = thm "divide_right_mono";
obua@14738
  1684
val divide_strict_left_mono = thm "divide_strict_left_mono";
obua@14738
  1685
val divide_left_mono = thm "divide_left_mono";
obua@14738
  1686
val divide_strict_left_mono_neg = thm "divide_strict_left_mono_neg";
obua@14738
  1687
val divide_strict_right_mono_neg = thm "divide_strict_right_mono_neg";
obua@14738
  1688
val less_add_one = thm "less_add_one";
obua@14738
  1689
val zero_less_two = thm "zero_less_two";
obua@14738
  1690
val less_half_sum = thm "less_half_sum";
obua@14738
  1691
val gt_half_sum = thm "gt_half_sum";
obua@14738
  1692
val dense = thm "dense";
obua@14738
  1693
val abs_one = thm "abs_one";
obua@14738
  1694
val abs_le_mult = thm "abs_le_mult";
obua@14738
  1695
val abs_eq_mult = thm "abs_eq_mult";
obua@14738
  1696
val abs_mult = thm "abs_mult";
obua@14738
  1697
val abs_mult_self = thm "abs_mult_self";
obua@14738
  1698
val nonzero_abs_inverse = thm "nonzero_abs_inverse";
obua@14738
  1699
val abs_inverse = thm "abs_inverse";
obua@14738
  1700
val nonzero_abs_divide = thm "nonzero_abs_divide";
obua@14738
  1701
val abs_divide = thm "abs_divide";
obua@14738
  1702
val abs_mult_less = thm "abs_mult_less";
obua@14738
  1703
val eq_minus_self_iff = thm "eq_minus_self_iff";
obua@14738
  1704
val less_minus_self_iff = thm "less_minus_self_iff";
obua@14738
  1705
val abs_less_iff = thm "abs_less_iff";
paulson@14331
  1706
*}
paulson@14331
  1707
paulson@14265
  1708
end