author  paulson 
Fri, 24 Aug 2007 14:21:33 +0200  
changeset 24427  bc5cf3b09ff3 
parent 24422  c0b5ff9e9e4d 
child 24491  8d194c9198ae 
permissions  rwrr 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

1 
(* Title: HOL/Ring_and_Field.thy 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

2 
ID: $Id$ 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

3 
Author: Gertrud Bauer, Steven Obua, Tobias Nipkow, Lawrence C Paulson, and Markus Wenzel, 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

4 
with contributions by Jeremy Avigad 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

5 
*) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

6 

14738  7 
header {* (Ordered) Rings and Fields *} 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

8 

15229  9 
theory Ring_and_Field 
15140  10 
imports OrderedGroup 
15131  11 
begin 
14504  12 

14738  13 
text {* 
14 
The theory of partially ordered rings is taken from the books: 

15 
\begin{itemize} 

16 
\item \emph{Lattice Theory} by Garret Birkhoff, American Mathematical Society 1979 

17 
\item \emph{Partially Ordered Algebraic Systems}, Pergamon Press 1963 

18 
\end{itemize} 

19 
Most of the used notions can also be looked up in 

20 
\begin{itemize} 

14770  21 
\item \url{http://www.mathworld.com} by Eric Weisstein et. al. 
14738  22 
\item \emph{Algebra I} by van der Waerden, Springer. 
23 
\end{itemize} 

24 
*} 

14504  25 

22390  26 
class semiring = ab_semigroup_add + semigroup_mult + 
27 
assumes left_distrib: "(a \<^loc>+ b) \<^loc>* c = a \<^loc>* c \<^loc>+ b \<^loc>* c" 

28 
assumes right_distrib: "a \<^loc>* (b \<^loc>+ c) = a \<^loc>* b \<^loc>+ a \<^loc>* c" 

14504  29 

22390  30 
class mult_zero = times + zero + 
31 
assumes mult_zero_left [simp]: "\<^loc>0 \<^loc>* a = \<^loc>0" 

32 
assumes mult_zero_right [simp]: "a \<^loc>* \<^loc>0 = \<^loc>0" 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

33 

22390  34 
class semiring_0 = semiring + comm_monoid_add + mult_zero 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

35 

22390  36 
class semiring_0_cancel = semiring + comm_monoid_add + cancel_ab_semigroup_add 
14504  37 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

38 
instance semiring_0_cancel \<subseteq> semiring_0 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

39 
proof 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

40 
fix a :: 'a 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

41 
have "0 * a + 0 * a = 0 * a + 0" 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

42 
by (simp add: left_distrib [symmetric]) 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

43 
thus "0 * a = 0" 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

44 
by (simp only: add_left_cancel) 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

45 

2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

46 
have "a * 0 + a * 0 = a * 0 + 0" 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

47 
by (simp add: right_distrib [symmetric]) 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

48 
thus "a * 0 = 0" 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

49 
by (simp only: add_left_cancel) 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

50 
qed 
14940  51 

22390  52 
class comm_semiring = ab_semigroup_add + ab_semigroup_mult + 
53 
assumes distrib: "(a \<^loc>+ b) \<^loc>* c = a \<^loc>* c \<^loc>+ b \<^loc>* c" 

14504  54 

14738  55 
instance comm_semiring \<subseteq> semiring 
56 
proof 

57 
fix a b c :: 'a 

58 
show "(a + b) * c = a * c + b * c" by (simp add: distrib) 

59 
have "a * (b + c) = (b + c) * a" by (simp add: mult_ac) 

60 
also have "... = b * a + c * a" by (simp only: distrib) 

61 
also have "... = a * b + a * c" by (simp add: mult_ac) 

62 
finally show "a * (b + c) = a * b + a * c" by blast 

14504  63 
qed 
64 

22390  65 
class comm_semiring_0 = comm_semiring + comm_monoid_add + mult_zero 
14504  66 

14738  67 
instance comm_semiring_0 \<subseteq> semiring_0 .. 
14504  68 

22390  69 
class comm_semiring_0_cancel = comm_semiring + comm_monoid_add + cancel_ab_semigroup_add 
14940  70 

71 
instance comm_semiring_0_cancel \<subseteq> semiring_0_cancel .. 

72 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

73 
instance comm_semiring_0_cancel \<subseteq> comm_semiring_0 .. 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

74 

22390  75 
class zero_neq_one = zero + one + 
76 
assumes zero_neq_one [simp]: "\<^loc>0 \<noteq> \<^loc>1" 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

77 

22390  78 
class semiring_1 = zero_neq_one + semiring_0 + monoid_mult 
14504  79 

22390  80 
class comm_semiring_1 = zero_neq_one + comm_semiring_0 + comm_monoid_mult 
81 
(*previously almost_semiring*) 

14738  82 

83 
instance comm_semiring_1 \<subseteq> semiring_1 .. 

14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

84 

22390  85 
class no_zero_divisors = zero + times + 
86 
assumes no_zero_divisors: "a \<noteq> \<^loc>0 \<Longrightarrow> b \<noteq> \<^loc>0 \<Longrightarrow> a \<^loc>* b \<noteq> \<^loc>0" 

14504  87 

22390  88 
class semiring_1_cancel = semiring + comm_monoid_add + zero_neq_one 
89 
+ cancel_ab_semigroup_add + monoid_mult 

14940  90 

91 
instance semiring_1_cancel \<subseteq> semiring_0_cancel .. 

92 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

93 
instance semiring_1_cancel \<subseteq> semiring_1 .. 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

94 

22390  95 
class comm_semiring_1_cancel = comm_semiring + comm_monoid_add + comm_monoid_mult 
96 
+ zero_neq_one + cancel_ab_semigroup_add 

14738  97 

14940  98 
instance comm_semiring_1_cancel \<subseteq> semiring_1_cancel .. 
99 

100 
instance comm_semiring_1_cancel \<subseteq> comm_semiring_0_cancel .. 

101 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

102 
instance comm_semiring_1_cancel \<subseteq> comm_semiring_1 .. 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

103 

22390  104 
class ring = semiring + ab_group_add 
14738  105 

14940  106 
instance ring \<subseteq> semiring_0_cancel .. 
14504  107 

22390  108 
class comm_ring = comm_semiring + ab_group_add 
14738  109 

110 
instance comm_ring \<subseteq> ring .. 

14504  111 

14940  112 
instance comm_ring \<subseteq> comm_semiring_0_cancel .. 
14738  113 

22390  114 
class ring_1 = ring + zero_neq_one + monoid_mult 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

115 

14940  116 
instance ring_1 \<subseteq> semiring_1_cancel .. 
117 

22390  118 
class comm_ring_1 = comm_ring + zero_neq_one + comm_monoid_mult 
119 
(*previously ring*) 

14738  120 

121 
instance comm_ring_1 \<subseteq> ring_1 .. 

14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

122 

14738  123 
instance comm_ring_1 \<subseteq> comm_semiring_1_cancel .. 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

124 

22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

125 
class ring_no_zero_divisors = ring + no_zero_divisors 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

126 

23544  127 
class ring_1_no_zero_divisors = ring_1 + ring_no_zero_divisors 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

128 

22390  129 
class idom = comm_ring_1 + no_zero_divisors 
14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

130 

23544  131 
instance idom \<subseteq> ring_1_no_zero_divisors .. 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

132 

22390  133 
class division_ring = ring_1 + inverse + 
134 
assumes left_inverse [simp]: "a \<noteq> \<^loc>0 \<Longrightarrow> inverse a \<^loc>* a = \<^loc>1" 

135 
assumes right_inverse [simp]: "a \<noteq> \<^loc>0 \<Longrightarrow> a \<^loc>* inverse a = \<^loc>1" 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

136 

23544  137 
instance division_ring \<subseteq> ring_1_no_zero_divisors 
22987
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

138 
proof 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

139 
fix a b :: 'a 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

140 
assume a: "a \<noteq> 0" and b: "b \<noteq> 0" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

141 
show "a * b \<noteq> 0" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

142 
proof 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

143 
assume ab: "a * b = 0" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

144 
hence "0 = inverse a * (a * b) * inverse b" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

145 
by simp 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

146 
also have "\<dots> = (inverse a * a) * (b * inverse b)" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

147 
by (simp only: mult_assoc) 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

148 
also have "\<dots> = 1" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

149 
using a b by simp 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

150 
finally show False 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

151 
by simp 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

152 
qed 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

153 
qed 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

154 

22987
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

155 
class field = comm_ring_1 + inverse + 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

156 
assumes field_inverse: "a \<noteq> 0 \<Longrightarrow> inverse a \<^loc>* a = \<^loc>1" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

157 
assumes divide_inverse: "a \<^loc>/ b = a \<^loc>* inverse b" 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

158 

23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

159 
instance field \<subseteq> division_ring 
22987
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

160 
proof 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

161 
fix a :: 'a 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

162 
assume "a \<noteq> 0" 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

163 
thus "inverse a * a = 1" by (rule field_inverse) 
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

164 
thus "a * inverse a = 1" by (simp only: mult_commute) 
14738  165 
qed 
166 

22987
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

167 
instance field \<subseteq> idom .. 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

168 

22390  169 
class division_by_zero = zero + inverse + 
170 
assumes inverse_zero [simp]: "inverse \<^loc>0 = \<^loc>0" 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

171 

23389  172 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

173 
subsection {* Distribution rules *} 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

174 

14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

175 
text{*For the @{text combine_numerals} simproc*} 
14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

176 
lemma combine_common_factor: 
14738  177 
"a*e + (b*e + c) = (a+b)*e + (c::'a::semiring)" 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

178 
by (simp add: left_distrib add_ac) 
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

179 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

180 
lemma minus_mult_left: " (a * b) = (a) * (b::'a::ring)" 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

181 
apply (rule equals_zero_I) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

182 
apply (simp add: left_distrib [symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

183 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

184 

95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

185 
lemma minus_mult_right: " (a * b) = a * (b::'a::ring)" 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

186 
apply (rule equals_zero_I) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

187 
apply (simp add: right_distrib [symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

188 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

189 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

190 
lemma minus_mult_minus [simp]: "( a) * ( b) = a * (b::'a::ring)" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

191 
by (simp add: minus_mult_left [symmetric] minus_mult_right [symmetric]) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

192 

14365
3d4df8c166ae
replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
14353
diff
changeset

193 
lemma minus_mult_commute: "( a) * b = a * ( b::'a::ring)" 
3d4df8c166ae
replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
14353
diff
changeset

194 
by (simp add: minus_mult_left [symmetric] minus_mult_right [symmetric]) 
3d4df8c166ae
replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
14353
diff
changeset

195 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

196 
lemma right_diff_distrib: "a * (b  c) = a * b  a * (c::'a::ring)" 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

197 
by (simp add: right_distrib diff_minus 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

198 
minus_mult_left [symmetric] minus_mult_right [symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

199 

14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

200 
lemma left_diff_distrib: "(a  b) * c = a * c  b * (c::'a::ring)" 
14738  201 
by (simp add: left_distrib diff_minus 
202 
minus_mult_left [symmetric] minus_mult_right [symmetric]) 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

203 

23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

204 
lemmas ring_distribs = 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

205 
right_distrib left_distrib left_diff_distrib right_diff_distrib 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

206 

f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

207 
text{*This list of rewrites simplifies ring terms by multiplying 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

208 
everything out and bringing sums and products into a canonical form 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

209 
(by ordered rewriting). As a result it decides ring equalities but 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

210 
also helps with inequalities. *} 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

211 
lemmas ring_simps = group_simps ring_distribs 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

212 

22390  213 
class mult_mono = times + zero + ord + 
214 
assumes mult_left_mono: "a \<sqsubseteq> b \<Longrightarrow> \<^loc>0 \<sqsubseteq> c \<Longrightarrow> c \<^loc>* a \<sqsubseteq> c \<^loc>* b" 

215 
assumes mult_right_mono: "a \<sqsubseteq> b \<Longrightarrow> \<^loc>0 \<sqsubseteq> c \<Longrightarrow> a \<^loc>* c \<sqsubseteq> b \<^loc>* c" 

14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset

216 

22390  217 
class pordered_semiring = mult_mono + semiring_0 + pordered_ab_semigroup_add 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

218 

22390  219 
class pordered_cancel_semiring = mult_mono + pordered_ab_semigroup_add 
22987
550709aa8e66
instance division_ring < no_zero_divisors; clean up field instance proofs
huffman
parents:
22842
diff
changeset

220 
+ semiring + comm_monoid_add + cancel_ab_semigroup_add 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

221 

14940  222 
instance pordered_cancel_semiring \<subseteq> semiring_0_cancel .. 
223 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

224 
instance pordered_cancel_semiring \<subseteq> pordered_semiring .. 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

225 

23521  226 
class ordered_semiring = semiring + comm_monoid_add + ordered_cancel_ab_semigroup_add + mult_mono 
227 

228 
instance ordered_semiring \<subseteq> pordered_cancel_semiring .. 

229 

22390  230 
class ordered_semiring_strict = semiring + comm_monoid_add + ordered_cancel_ab_semigroup_add + 
231 
assumes mult_strict_left_mono: "a \<sqsubset> b \<Longrightarrow> \<^loc>0 \<sqsubset> c \<Longrightarrow> c \<^loc>* a \<sqsubset> c \<^loc>* b" 

232 
assumes mult_strict_right_mono: "a \<sqsubset> b \<Longrightarrow> \<^loc>0 \<sqsubset> c \<Longrightarrow> a \<^loc>* c \<sqsubset> b \<^loc>* c" 

14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14334
diff
changeset

233 

14940  234 
instance ordered_semiring_strict \<subseteq> semiring_0_cancel .. 
235 

23521  236 
instance ordered_semiring_strict \<subseteq> ordered_semiring 
23550  237 
proof 
238 
fix a b c :: 'a 

239 
assume A: "a \<le> b" "0 \<le> c" 

240 
from A show "c * a \<le> c * b" 

241 
unfolding order_le_less 

242 
using mult_strict_left_mono by auto 

243 
from A show "a * c \<le> b * c" 

244 
unfolding order_le_less 

245 
using mult_strict_right_mono by auto 

246 
qed 

14270  247 

22390  248 
class mult_mono1 = times + zero + ord + 
249 
assumes mult_mono: "a \<sqsubseteq> b \<Longrightarrow> \<^loc>0 \<sqsubseteq> c \<Longrightarrow> c \<^loc>* a \<sqsubseteq> c \<^loc>* b" 

14270  250 

22390  251 
class pordered_comm_semiring = comm_semiring_0 
252 
+ pordered_ab_semigroup_add + mult_mono1 

14270  253 

22390  254 
class pordered_cancel_comm_semiring = comm_semiring_0_cancel 
255 
+ pordered_ab_semigroup_add + mult_mono1 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

256 

14738  257 
instance pordered_cancel_comm_semiring \<subseteq> pordered_comm_semiring .. 
14270  258 

22390  259 
class ordered_comm_semiring_strict = comm_semiring_0 + ordered_cancel_ab_semigroup_add + 
260 
assumes mult_strict_mono: "a \<sqsubset> b \<Longrightarrow> \<^loc>0 \<sqsubset> c \<Longrightarrow> c \<^loc>* a \<sqsubset> c \<^loc>* b" 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

261 

14738  262 
instance pordered_comm_semiring \<subseteq> pordered_semiring 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

263 
proof 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

264 
fix a b c :: 'a 
23550  265 
assume "a \<le> b" "0 \<le> c" 
266 
thus "c * a \<le> c * b" by (rule mult_mono) 

267 
thus "a * c \<le> b * c" by (simp only: mult_commute) 

21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
20633
diff
changeset

268 
qed 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

269 

14738  270 
instance pordered_cancel_comm_semiring \<subseteq> pordered_cancel_semiring .. 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

271 

14738  272 
instance ordered_comm_semiring_strict \<subseteq> ordered_semiring_strict 
23550  273 
proof 
274 
fix a b c :: 'a 

275 
assume "a < b" "0 < c" 

276 
thus "c * a < c * b" by (rule mult_strict_mono) 

277 
thus "a * c < b * c" by (simp only: mult_commute) 

278 
qed 

14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

279 

14738  280 
instance ordered_comm_semiring_strict \<subseteq> pordered_cancel_comm_semiring 
23550  281 
proof 
282 
fix a b c :: 'a 

283 
assume "a \<le> b" "0 \<le> c" 

284 
thus "c * a \<le> c * b" 

285 
unfolding order_le_less 

286 
using mult_strict_mono by auto 

287 
qed 

14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

288 

22390  289 
class pordered_ring = ring + pordered_cancel_semiring 
14270  290 

14738  291 
instance pordered_ring \<subseteq> pordered_ab_group_add .. 
14270  292 

22452
8a86fd2a1bf0
adjusted to new lattice theory developement in Lattices.thy / FixedPoint.thy
haftmann
parents:
22422
diff
changeset

293 
class lordered_ring = pordered_ring + lordered_ab_group_abs 
14270  294 

14940  295 
instance lordered_ring \<subseteq> lordered_ab_group_meet .. 
296 

297 
instance lordered_ring \<subseteq> lordered_ab_group_join .. 

298 

23879  299 
class abs_if = minus + ord + zero + abs + 
22390  300 
assumes abs_if: "abs a = (if a \<sqsubset> 0 then (uminus a) else a)" 
14270  301 

23521  302 
(* The "strict" suffix can be seen as describing the combination of ordered_ring and no_zero_divisors. 
303 
Basically, ordered_ring + no_zero_divisors = ordered_ring_strict. 

304 
*) 

305 
class ordered_ring = ring + ordered_semiring + lordered_ab_group + abs_if 

14270  306 

23550  307 
instance ordered_ring \<subseteq> lordered_ring 
308 
proof 

309 
fix x :: 'a 

310 
show "\<bar>x\<bar> = sup x ( x)" 

311 
by (simp only: abs_if sup_eq_if) 

312 
qed 

23521  313 

314 
class ordered_ring_strict = ring + ordered_semiring_strict + lordered_ab_group + abs_if 

315 

316 
instance ordered_ring_strict \<subseteq> ordered_ring .. 

14270  317 

22390  318 
class pordered_comm_ring = comm_ring + pordered_comm_semiring 
14270  319 

23527  320 
instance pordered_comm_ring \<subseteq> pordered_ring .. 
321 

23073  322 
instance pordered_comm_ring \<subseteq> pordered_cancel_comm_semiring .. 
323 

22390  324 
class ordered_semidom = comm_semiring_1_cancel + ordered_comm_semiring_strict + 
325 
(*previously ordered_semiring*) 

326 
assumes zero_less_one [simp]: "\<^loc>0 \<sqsubset> \<^loc>1" 

14270  327 

24422  328 
lemma pos_add_strict: 
329 
fixes a b c :: "'a\<Colon>ordered_semidom" 

330 
shows "0 < a \<Longrightarrow> b < c \<Longrightarrow> b < a + c" 

331 
using add_strict_mono [of 0 a b c] by simp 

332 

23521  333 
class ordered_idom = comm_ring_1 + ordered_comm_semiring_strict + lordered_ab_group + abs_if 
22390  334 
(*previously ordered_ring*) 
14270  335 

14738  336 
instance ordered_idom \<subseteq> ordered_ring_strict .. 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

337 

23073  338 
instance ordered_idom \<subseteq> pordered_comm_ring .. 
339 

22390  340 
class ordered_field = field + ordered_idom 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

341 

15923  342 
lemmas linorder_neqE_ordered_idom = 
343 
linorder_neqE[where 'a = "?'b::ordered_idom"] 

344 

14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

345 
lemma eq_add_iff1: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

346 
"(a*e + c = b*e + d) = ((ab)*e + c = (d::'a::ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

347 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

348 

5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

349 
lemma eq_add_iff2: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

350 
"(a*e + c = b*e + d) = (c = (ba)*e + (d::'a::ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

351 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

352 

5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

353 
lemma less_add_iff1: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

354 
"(a*e + c < b*e + d) = ((ab)*e + c < (d::'a::pordered_ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

355 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

356 

5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

357 
lemma less_add_iff2: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

358 
"(a*e + c < b*e + d) = (c < (ba)*e + (d::'a::pordered_ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

359 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

360 

5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

361 
lemma le_add_iff1: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

362 
"(a*e + c \<le> b*e + d) = ((ab)*e + c \<le> (d::'a::pordered_ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

363 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

364 

5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

365 
lemma le_add_iff2: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

366 
"(a*e + c \<le> b*e + d) = (c \<le> (ba)*e + (d::'a::pordered_ring))" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

367 
by (simp add: ring_simps) 
14272
5efbb548107d
Tidying of the integer development; towards removing the
paulson
parents:
14270
diff
changeset

368 

23389  369 

14270  370 
subsection {* Ordering Rules for Multiplication *} 
371 

14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

372 
lemma mult_left_le_imp_le: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

373 
"[c*a \<le> c*b; 0 < c] ==> a \<le> (b::'a::ordered_semiring_strict)" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

374 
by (force simp add: mult_strict_left_mono linorder_not_less [symmetric]) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

375 

744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

376 
lemma mult_right_le_imp_le: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

377 
"[a*c \<le> b*c; 0 < c] ==> a \<le> (b::'a::ordered_semiring_strict)" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

378 
by (force simp add: mult_strict_right_mono linorder_not_less [symmetric]) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

379 

744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

380 
lemma mult_left_less_imp_less: 
23521  381 
"[c*a < c*b; 0 \<le> c] ==> a < (b::'a::ordered_semiring)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

382 
by (force simp add: mult_left_mono linorder_not_le [symmetric]) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

383 

744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

384 
lemma mult_right_less_imp_less: 
23521  385 
"[a*c < b*c; 0 \<le> c] ==> a < (b::'a::ordered_semiring)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

386 
by (force simp add: mult_right_mono linorder_not_le [symmetric]) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

387 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

388 
lemma mult_strict_left_mono_neg: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

389 
"[b < a; c < 0] ==> c * a < c * (b::'a::ordered_ring_strict)" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

390 
apply (drule mult_strict_left_mono [of _ _ "c"]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

391 
apply (simp_all add: minus_mult_left [symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

392 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

393 

14738  394 
lemma mult_left_mono_neg: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

395 
"[b \<le> a; c \<le> 0] ==> c * a \<le> c * (b::'a::pordered_ring)" 
14738  396 
apply (drule mult_left_mono [of _ _ "c"]) 
397 
apply (simp_all add: minus_mult_left [symmetric]) 

398 
done 

399 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

400 
lemma mult_strict_right_mono_neg: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

401 
"[b < a; c < 0] ==> a * c < b * (c::'a::ordered_ring_strict)" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

402 
apply (drule mult_strict_right_mono [of _ _ "c"]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

403 
apply (simp_all add: minus_mult_right [symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

404 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

405 

14738  406 
lemma mult_right_mono_neg: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

407 
"[b \<le> a; c \<le> 0] ==> a * c \<le> (b::'a::pordered_ring) * c" 
14738  408 
apply (drule mult_right_mono [of _ _ "c"]) 
409 
apply (simp) 

410 
apply (simp_all add: minus_mult_right [symmetric]) 

411 
done 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

412 

23389  413 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

414 
subsection{* Products of Signs *} 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

415 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

416 
lemma mult_pos_pos: "[ (0::'a::ordered_semiring_strict) < a; 0 < b ] ==> 0 < a*b" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

417 
by (drule mult_strict_left_mono [of 0 b], auto) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

418 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

419 
lemma mult_nonneg_nonneg: "[ (0::'a::pordered_cancel_semiring) \<le> a; 0 \<le> b ] ==> 0 \<le> a*b" 
14738  420 
by (drule mult_left_mono [of 0 b], auto) 
421 

422 
lemma mult_pos_neg: "[ (0::'a::ordered_semiring_strict) < a; b < 0 ] ==> a*b < 0" 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

423 
by (drule mult_strict_left_mono [of b 0], auto) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

424 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

425 
lemma mult_nonneg_nonpos: "[ (0::'a::pordered_cancel_semiring) \<le> a; b \<le> 0 ] ==> a*b \<le> 0" 
14738  426 
by (drule mult_left_mono [of b 0], auto) 
427 

428 
lemma mult_pos_neg2: "[ (0::'a::ordered_semiring_strict) < a; b < 0 ] ==> b*a < 0" 

429 
by (drule mult_strict_right_mono[of b 0], auto) 

430 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

431 
lemma mult_nonneg_nonpos2: "[ (0::'a::pordered_cancel_semiring) \<le> a; b \<le> 0 ] ==> b*a \<le> 0" 
14738  432 
by (drule mult_right_mono[of b 0], auto) 
433 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

434 
lemma mult_neg_neg: "[ a < (0::'a::ordered_ring_strict); b < 0 ] ==> 0 < a*b" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

435 
by (drule mult_strict_right_mono_neg, auto) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

436 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

437 
lemma mult_nonpos_nonpos: "[ a \<le> (0::'a::pordered_ring); b \<le> 0 ] ==> 0 \<le> a*b" 
14738  438 
by (drule mult_right_mono_neg[of a 0 b ], auto) 
439 

14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14334
diff
changeset

440 
lemma zero_less_mult_pos: 
14738  441 
"[ 0 < a*b; 0 < a] ==> 0 < (b::'a::ordered_semiring_strict)" 
21328  442 
apply (cases "b\<le>0") 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

443 
apply (auto simp add: order_le_less linorder_not_less) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

444 
apply (drule_tac mult_pos_neg [of a b]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

445 
apply (auto dest: order_less_not_sym) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

446 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

447 

14738  448 
lemma zero_less_mult_pos2: 
449 
"[ 0 < b*a; 0 < a] ==> 0 < (b::'a::ordered_semiring_strict)" 

21328  450 
apply (cases "b\<le>0") 
14738  451 
apply (auto simp add: order_le_less linorder_not_less) 
452 
apply (drule_tac mult_pos_neg2 [of a b]) 

453 
apply (auto dest: order_less_not_sym) 

454 
done 

455 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

456 
lemma zero_less_mult_iff: 
14738  457 
"((0::'a::ordered_ring_strict) < a*b) = (0 < a & 0 < b  a < 0 & b < 0)" 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

458 
apply (auto simp add: order_le_less linorder_not_less mult_pos_pos 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

459 
mult_neg_neg) 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

460 
apply (blast dest: zero_less_mult_pos) 
14738  461 
apply (blast dest: zero_less_mult_pos2) 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

462 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

463 

22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

464 
lemma mult_eq_0_iff [simp]: 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

465 
fixes a b :: "'a::ring_no_zero_divisors" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

466 
shows "(a * b = 0) = (a = 0 \<or> b = 0)" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

467 
by (cases "a = 0 \<or> b = 0", auto dest: no_zero_divisors) 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

468 

775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

469 
instance ordered_ring_strict \<subseteq> ring_no_zero_divisors 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

470 
apply intro_classes 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

471 
apply (auto simp add: linorder_not_less order_le_less linorder_neq_iff) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

472 
apply (force dest: mult_strict_right_mono_neg mult_strict_right_mono)+ 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

473 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

474 

95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

475 
lemma zero_le_mult_iff: 
14738  476 
"((0::'a::ordered_ring_strict) \<le> a*b) = (0 \<le> a & 0 \<le> b  a \<le> 0 & b \<le> 0)" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

477 
by (auto simp add: eq_commute [of 0] order_le_less linorder_not_less 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

478 
zero_less_mult_iff) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

479 

95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

480 
lemma mult_less_0_iff: 
14738  481 
"(a*b < (0::'a::ordered_ring_strict)) = (0 < a & b < 0  a < 0 & 0 < b)" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

482 
apply (insert zero_less_mult_iff [of "a" b]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

483 
apply (force simp add: minus_mult_left[symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

484 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

485 

95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

486 
lemma mult_le_0_iff: 
14738  487 
"(a*b \<le> (0::'a::ordered_ring_strict)) = (0 \<le> a & b \<le> 0  a \<le> 0 & 0 \<le> b)" 
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

488 
apply (insert zero_le_mult_iff [of "a" b]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

489 
apply (force simp add: minus_mult_left[symmetric]) 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

490 
done 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

491 

14738  492 
lemma split_mult_pos_le: "(0 \<le> a & 0 \<le> b)  (a \<le> 0 & b \<le> 0) \<Longrightarrow> 0 \<le> a * (b::_::pordered_ring)" 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

493 
by (auto simp add: mult_nonneg_nonneg mult_nonpos_nonpos) 
14738  494 

495 
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)" 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

496 
by (auto simp add: mult_nonneg_nonpos mult_nonneg_nonpos2) 
14738  497 

23095  498 
lemma zero_le_square[simp]: "(0::'a::ordered_ring_strict) \<le> a*a" 
499 
by (simp add: zero_le_mult_iff linorder_linear) 

500 

501 
lemma not_square_less_zero[simp]: "\<not> (a * a < (0::'a::ordered_ring_strict))" 

502 
by (simp add: not_less) 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

503 

14738  504 
text{*Proving axiom @{text zero_less_one} makes all @{text ordered_semidom} 
505 
theorems available to members of @{term ordered_idom} *} 

506 

507 
instance ordered_idom \<subseteq> ordered_semidom 

14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

508 
proof 
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

509 
have "(0::'a) \<le> 1*1" by (rule zero_le_square) 
14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

510 
thus "(0::'a) < 1" by (simp add: order_le_less) 
14421
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

511 
qed 
ee97b6463cb4
new Ring_and_Field hierarchy, eliminating redundant axioms
paulson
parents:
14398
diff
changeset

512 

14738  513 
instance ordered_idom \<subseteq> idom .. 
514 

14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

515 
text{*All three types of comparision involving 0 and 1 are covered.*} 
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

516 

17085  517 
lemmas one_neq_zero = zero_neq_one [THEN not_sym] 
518 
declare one_neq_zero [simp] 

14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

519 

14738  520 
lemma zero_le_one [simp]: "(0::'a::ordered_semidom) \<le> 1" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

521 
by (rule zero_less_one [THEN order_less_imp_le]) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

522 

14738  523 
lemma not_one_le_zero [simp]: "~ (1::'a::ordered_semidom) \<le> 0" 
524 
by (simp add: linorder_not_le) 

14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

525 

14738  526 
lemma not_one_less_zero [simp]: "~ (1::'a::ordered_semidom) < 0" 
527 
by (simp add: linorder_not_less) 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

528 

23389  529 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

530 
subsection{*More Monotonicity*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

531 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

532 
text{*Strict monotonicity in both arguments*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

533 
lemma mult_strict_mono: 
14738  534 
"[a<b; c<d; 0<b; 0\<le>c] ==> a * c < b * (d::'a::ordered_semiring_strict)" 
21328  535 
apply (cases "c=0") 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

536 
apply (simp add: mult_pos_pos) 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

537 
apply (erule mult_strict_right_mono [THEN order_less_trans]) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

538 
apply (force simp add: order_le_less) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

539 
apply (erule mult_strict_left_mono, assumption) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

540 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

541 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

542 
text{*This weaker variant has more natural premises*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

543 
lemma mult_strict_mono': 
14738  544 
"[ a<b; c<d; 0 \<le> a; 0 \<le> c] ==> a * c < b * (d::'a::ordered_semiring_strict)" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

545 
apply (rule mult_strict_mono) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

546 
apply (blast intro: order_le_less_trans)+ 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

547 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

548 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

549 
lemma mult_mono: 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

550 
"[a \<le> b; c \<le> d; 0 \<le> b; 0 \<le> c] 
14738  551 
==> a * c \<le> b * (d::'a::pordered_semiring)" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

552 
apply (erule mult_right_mono [THEN order_trans], assumption) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

553 
apply (erule mult_left_mono, assumption) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

554 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

555 

21258  556 
lemma mult_mono': 
557 
"[a \<le> b; c \<le> d; 0 \<le> a; 0 \<le> c] 

558 
==> a * c \<le> b * (d::'a::pordered_semiring)" 

559 
apply (rule mult_mono) 

560 
apply (fast intro: order_trans)+ 

561 
done 

562 

14738  563 
lemma less_1_mult: "[ 1 < m; 1 < n ] ==> 1 < m*(n::'a::ordered_semidom)" 
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

564 
apply (insert mult_strict_mono [of 1 m 1 n]) 
14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

565 
apply (simp add: order_less_trans [OF zero_less_one]) 
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

566 
done 
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

567 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

568 
lemma mult_less_le_imp_less: "(a::'a::ordered_semiring_strict) < b ==> 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

569 
c <= d ==> 0 <= a ==> 0 < c ==> a * c < b * d" 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

570 
apply (subgoal_tac "a * c < b * c") 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

571 
apply (erule order_less_le_trans) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

572 
apply (erule mult_left_mono) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

573 
apply simp 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

574 
apply (erule mult_strict_right_mono) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

575 
apply assumption 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

576 
done 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

577 

c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

578 
lemma mult_le_less_imp_less: "(a::'a::ordered_semiring_strict) <= b ==> 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

579 
c < d ==> 0 < a ==> 0 <= c ==> a * c < b * d" 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

580 
apply (subgoal_tac "a * c <= b * c") 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

581 
apply (erule order_le_less_trans) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

582 
apply (erule mult_strict_left_mono) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

583 
apply simp 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

584 
apply (erule mult_right_mono) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

585 
apply simp 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

586 
done 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

587 

23389  588 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

589 
subsection{*Cancellation Laws for Relationships With a Common Factor*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

590 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

591 
text{*Cancellation laws for @{term "c*a < c*b"} and @{term "a*c < b*c"}, 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

592 
also with the relations @{text "\<le>"} and equality.*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

593 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

594 
text{*These ``disjunction'' versions produce two cases when the comparison is 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

595 
an assumption, but effectively four when the comparison is a goal.*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

596 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

597 
lemma mult_less_cancel_right_disj: 
14738  598 
"(a*c < b*c) = ((0 < c & a < b)  (c < 0 & b < (a::'a::ordered_ring_strict)))" 
21328  599 
apply (cases "c = 0") 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

600 
apply (auto simp add: linorder_neq_iff mult_strict_right_mono 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

601 
mult_strict_right_mono_neg) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

602 
apply (auto simp add: linorder_not_less 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

603 
linorder_not_le [symmetric, of "a*c"] 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

604 
linorder_not_le [symmetric, of a]) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

605 
apply (erule_tac [!] notE) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

606 
apply (auto simp add: order_less_imp_le mult_right_mono 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

607 
mult_right_mono_neg) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

608 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

609 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

610 
lemma mult_less_cancel_left_disj: 
14738  611 
"(c*a < c*b) = ((0 < c & a < b)  (c < 0 & b < (a::'a::ordered_ring_strict)))" 
21328  612 
apply (cases "c = 0") 
14738  613 
apply (auto simp add: linorder_neq_iff mult_strict_left_mono 
614 
mult_strict_left_mono_neg) 

615 
apply (auto simp add: linorder_not_less 

616 
linorder_not_le [symmetric, of "c*a"] 

617 
linorder_not_le [symmetric, of a]) 

618 
apply (erule_tac [!] notE) 

619 
apply (auto simp add: order_less_imp_le mult_left_mono 

620 
mult_left_mono_neg) 

621 
done 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

622 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

623 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

624 
text{*The ``conjunction of implication'' lemmas produce two cases when the 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

625 
comparison is a goal, but give four when the comparison is an assumption.*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

626 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

627 
lemma mult_less_cancel_right: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

628 
fixes c :: "'a :: ordered_ring_strict" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

629 
shows "(a*c < b*c) = ((0 \<le> c > a < b) & (c \<le> 0 > b < a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

630 
by (insert mult_less_cancel_right_disj [of a c b], auto) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

631 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

632 
lemma mult_less_cancel_left: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

633 
fixes c :: "'a :: ordered_ring_strict" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

634 
shows "(c*a < c*b) = ((0 \<le> c > a < b) & (c \<le> 0 > b < a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

635 
by (insert mult_less_cancel_left_disj [of c a b], auto) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

636 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

637 
lemma mult_le_cancel_right: 
14738  638 
"(a*c \<le> b*c) = ((0<c > a\<le>b) & (c<0 > b \<le> (a::'a::ordered_ring_strict)))" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

639 
by (simp add: linorder_not_less [symmetric] mult_less_cancel_right_disj) 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

640 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

641 
lemma mult_le_cancel_left: 
14738  642 
"(c*a \<le> c*b) = ((0<c > a\<le>b) & (c<0 > b \<le> (a::'a::ordered_ring_strict)))" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

643 
by (simp add: linorder_not_less [symmetric] mult_less_cancel_left_disj) 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

644 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

645 
lemma mult_less_imp_less_left: 
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14334
diff
changeset

646 
assumes less: "c*a < c*b" and nonneg: "0 \<le> c" 
14738  647 
shows "a < (b::'a::ordered_semiring_strict)" 
14377  648 
proof (rule ccontr) 
649 
assume "~ a < b" 

650 
hence "b \<le> a" by (simp add: linorder_not_less) 

23389  651 
hence "c*b \<le> c*a" using nonneg by (rule mult_left_mono) 
14377  652 
with this and less show False 
653 
by (simp add: linorder_not_less [symmetric]) 

654 
qed 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

655 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

656 
lemma mult_less_imp_less_right: 
14738  657 
assumes less: "a*c < b*c" and nonneg: "0 <= c" 
658 
shows "a < (b::'a::ordered_semiring_strict)" 

659 
proof (rule ccontr) 

660 
assume "~ a < b" 

661 
hence "b \<le> a" by (simp add: linorder_not_less) 

23389  662 
hence "b*c \<le> a*c" using nonneg by (rule mult_right_mono) 
14738  663 
with this and less show False 
664 
by (simp add: linorder_not_less [symmetric]) 

665 
qed 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

666 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

667 
text{*Cancellation of equalities with a common factor*} 
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
23879
diff
changeset

668 
lemma mult_cancel_right [simp,noatp]: 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

669 
fixes a b c :: "'a::ring_no_zero_divisors" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

670 
shows "(a * c = b * c) = (c = 0 \<or> a = b)" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

671 
proof  
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

672 
have "(a * c = b * c) = ((a  b) * c = 0)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

673 
by (simp add: ring_distribs) 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

674 
thus ?thesis 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

675 
by (simp add: disj_commute) 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

676 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

677 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
23879
diff
changeset

678 
lemma mult_cancel_left [simp,noatp]: 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

679 
fixes a b c :: "'a::ring_no_zero_divisors" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

680 
shows "(c * a = c * b) = (c = 0 \<or> a = b)" 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

681 
proof  
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

682 
have "(c * a = c * b) = (c * (a  b) = 0)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

683 
by (simp add: ring_distribs) 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

684 
thus ?thesis 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

685 
by simp 
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

686 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

687 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

688 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

689 
subsubsection{*Special Cancellation Simprules for Multiplication*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

690 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

691 
text{*These also produce two cases when the comparison is a goal.*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

692 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

693 
lemma mult_le_cancel_right1: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

694 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

695 
shows "(c \<le> b*c) = ((0<c > 1\<le>b) & (c<0 > b \<le> 1))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

696 
by (insert mult_le_cancel_right [of 1 c b], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

697 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

698 
lemma mult_le_cancel_right2: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

699 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

700 
shows "(a*c \<le> c) = ((0<c > a\<le>1) & (c<0 > 1 \<le> a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

701 
by (insert mult_le_cancel_right [of a c 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

702 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

703 
lemma mult_le_cancel_left1: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

704 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

705 
shows "(c \<le> c*b) = ((0<c > 1\<le>b) & (c<0 > b \<le> 1))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

706 
by (insert mult_le_cancel_left [of c 1 b], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

707 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

708 
lemma mult_le_cancel_left2: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

709 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

710 
shows "(c*a \<le> c) = ((0<c > a\<le>1) & (c<0 > 1 \<le> a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

711 
by (insert mult_le_cancel_left [of c a 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

712 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

713 
lemma mult_less_cancel_right1: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

714 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

715 
shows "(c < b*c) = ((0 \<le> c > 1<b) & (c \<le> 0 > b < 1))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

716 
by (insert mult_less_cancel_right [of 1 c b], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

717 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

718 
lemma mult_less_cancel_right2: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

719 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

720 
shows "(a*c < c) = ((0 \<le> c > a<1) & (c \<le> 0 > 1 < a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

721 
by (insert mult_less_cancel_right [of a c 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

722 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

723 
lemma mult_less_cancel_left1: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

724 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

725 
shows "(c < c*b) = ((0 \<le> c > 1<b) & (c \<le> 0 > b < 1))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

726 
by (insert mult_less_cancel_left [of c 1 b], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

727 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

728 
lemma mult_less_cancel_left2: 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

729 
fixes c :: "'a :: ordered_idom" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

730 
shows "(c*a < c) = ((0 \<le> c > a<1) & (c \<le> 0 > 1 < a))" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

731 
by (insert mult_less_cancel_left [of c a 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

732 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

733 
lemma mult_cancel_right1 [simp]: 
23544  734 
fixes c :: "'a :: ring_1_no_zero_divisors" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

735 
shows "(c = b*c) = (c = 0  b=1)" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

736 
by (insert mult_cancel_right [of 1 c b], force) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

737 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

738 
lemma mult_cancel_right2 [simp]: 
23544  739 
fixes c :: "'a :: ring_1_no_zero_divisors" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

740 
shows "(a*c = c) = (c = 0  a=1)" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

741 
by (insert mult_cancel_right [of a c 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

742 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

743 
lemma mult_cancel_left1 [simp]: 
23544  744 
fixes c :: "'a :: ring_1_no_zero_divisors" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

745 
shows "(c = c*b) = (c = 0  b=1)" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

746 
by (insert mult_cancel_left [of c 1 b], force) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

747 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

748 
lemma mult_cancel_left2 [simp]: 
23544  749 
fixes c :: "'a :: ring_1_no_zero_divisors" 
15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

750 
shows "(c*a = c) = (c = 0  a=1)" 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

751 
by (insert mult_cancel_left [of c a 1], simp) 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

752 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

753 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

754 
text{*Simprules for comparisons where common factors can be cancelled.*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

755 
lemmas mult_compare_simps = 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

756 
mult_le_cancel_right mult_le_cancel_left 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

757 
mult_le_cancel_right1 mult_le_cancel_right2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

758 
mult_le_cancel_left1 mult_le_cancel_left2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

759 
mult_less_cancel_right mult_less_cancel_left 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

760 
mult_less_cancel_right1 mult_less_cancel_right2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

761 
mult_less_cancel_left1 mult_less_cancel_left2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

762 
mult_cancel_right mult_cancel_left 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

763 
mult_cancel_right1 mult_cancel_right2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

764 
mult_cancel_left1 mult_cancel_left2 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

765 

ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

766 

14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

767 
subsection {* Fields *} 
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
diff
changeset

768 

14288  769 
lemma right_inverse_eq: "b \<noteq> 0 ==> (a / b = 1) = (a = (b::'a::field))" 
770 
proof 

771 
assume neq: "b \<noteq> 0" 

772 
{ 

773 
hence "a = (a / b) * b" by (simp add: divide_inverse mult_ac) 

774 
also assume "a / b = 1" 

775 
finally show "a = b" by simp 

776 
next 

777 
assume "a = b" 

778 
with neq show "a / b = 1" by (simp add: divide_inverse) 

779 
} 

780 
qed 

781 

782 
lemma nonzero_inverse_eq_divide: "a \<noteq> 0 ==> inverse (a::'a::field) = 1/a" 

783 
by (simp add: divide_inverse) 

784 

23398  785 
lemma divide_self[simp]: "a \<noteq> 0 ==> a / (a::'a::field) = 1" 
14288  786 
by (simp add: divide_inverse) 
787 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

788 
lemma divide_zero [simp]: "a / 0 = (0::'a::{field,division_by_zero})" 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

789 
by (simp add: divide_inverse) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

790 

15228  791 
lemma divide_self_if [simp]: 
792 
"a / (a::'a::{field,division_by_zero}) = (if a=0 then 0 else 1)" 

793 
by (simp add: divide_self) 

794 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

795 
lemma divide_zero_left [simp]: "0/a = (0::'a::field)" 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

796 
by (simp add: divide_inverse) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

797 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

798 
lemma inverse_eq_divide: "inverse (a::'a::field) = 1/a" 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

799 
by (simp add: divide_inverse) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

800 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

801 
lemma add_divide_distrib: "(a+b)/(c::'a::field) = a/c + b/c" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

802 
by (simp add: divide_inverse ring_distribs) 
14293  803 

23482  804 
(* what ordering?? this is a straight instance of mult_eq_0_iff 
14270  805 
text{*Compared with @{text mult_eq_0_iff}, this version removes the requirement 
806 
of an ordering.*} 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

807 
lemma field_mult_eq_0_iff [simp]: 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

808 
"(a*b = (0::'a::division_ring)) = (a = 0  b = 0)" 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

809 
by simp 
23482  810 
*) 
23496  811 
(* subsumed by mult_cancel lemmas on ring_no_zero_divisors 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

812 
text{*Cancellation of equalities with a common factor*} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

813 
lemma field_mult_cancel_right_lemma: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

814 
assumes cnz: "c \<noteq> (0::'a::division_ring)" 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

815 
and eq: "a*c = b*c" 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

816 
shows "a=b" 
14377  817 
proof  
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

818 
have "(a * c) * inverse c = (b * c) * inverse c" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

819 
by (simp add: eq) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

820 
thus "a=b" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

821 
by (simp add: mult_assoc cnz) 
14377  822 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

823 

14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

824 
lemma field_mult_cancel_right [simp]: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

825 
"(a*c = b*c) = (c = (0::'a::division_ring)  a=b)" 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

826 
by simp 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

827 

14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset

828 
lemma field_mult_cancel_left [simp]: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

829 
"(c*a = c*b) = (c = (0::'a::division_ring)  a=b)" 
22990
775e9de3db48
added classes ring_no_zero_divisors and dom (noncommutative version of idom);
huffman
parents:
22987
diff
changeset

830 
by simp 
23496  831 
*) 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

832 
lemma nonzero_imp_inverse_nonzero: 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

833 
"a \<noteq> 0 ==> inverse a \<noteq> (0::'a::division_ring)" 
14377  834 
proof 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

835 
assume ianz: "inverse a = 0" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

836 
assume "a \<noteq> 0" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

837 
hence "1 = a * inverse a" by simp 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

838 
also have "... = 0" by (simp add: ianz) 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

839 
finally have "1 = (0::'a::division_ring)" . 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

840 
thus False by (simp add: eq_commute) 
14377  841 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

842 

14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

843 

ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

844 
subsection{*Basic Properties of @{term inverse}*} 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

845 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

846 
lemma inverse_zero_imp_zero: "inverse a = 0 ==> a = (0::'a::division_ring)" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

847 
apply (rule ccontr) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

848 
apply (blast dest: nonzero_imp_inverse_nonzero) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

849 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

850 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

851 
lemma inverse_nonzero_imp_nonzero: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

852 
"inverse a = 0 ==> a = (0::'a::division_ring)" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

853 
apply (rule ccontr) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

854 
apply (blast dest: nonzero_imp_inverse_nonzero) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

855 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

856 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

857 
lemma inverse_nonzero_iff_nonzero [simp]: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

858 
"(inverse a = 0) = (a = (0::'a::{division_ring,division_by_zero}))" 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

859 
by (force dest: inverse_nonzero_imp_nonzero) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

860 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

861 
lemma nonzero_inverse_minus_eq: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

862 
assumes [simp]: "a\<noteq>0" 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

863 
shows "inverse(a) = inverse(a::'a::division_ring)" 
14377  864 
proof  
865 
have "a * inverse ( a) = a *  inverse a" 

866 
by simp 

867 
thus ?thesis 

23496  868 
by (simp only: mult_cancel_left, simp) 
14377  869 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

870 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

871 
lemma inverse_minus_eq [simp]: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

872 
"inverse(a) = inverse(a::'a::{division_ring,division_by_zero})" 
14377  873 
proof cases 
874 
assume "a=0" thus ?thesis by (simp add: inverse_zero) 

875 
next 

876 
assume "a\<noteq>0" 

877 
thus ?thesis by (simp add: nonzero_inverse_minus_eq) 

878 
qed 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

879 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

880 
lemma nonzero_inverse_eq_imp_eq: 
14269  881 
assumes inveq: "inverse a = inverse b" 
882 
and anz: "a \<noteq> 0" 

883 
and bnz: "b \<noteq> 0" 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

884 
shows "a = (b::'a::division_ring)" 
14377  885 
proof  
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

886 
have "a * inverse b = a * inverse a" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

887 
by (simp add: inveq) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

888 
hence "(a * inverse b) * b = (a * inverse a) * b" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

889 
by simp 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

890 
thus "a = b" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

891 
by (simp add: mult_assoc anz bnz) 
14377  892 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

893 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

894 
lemma inverse_eq_imp_eq: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

895 
"inverse a = inverse b ==> a = (b::'a::{division_ring,division_by_zero})" 
21328  896 
apply (cases "a=0  b=0") 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

897 
apply (force dest!: inverse_zero_imp_zero 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

898 
simp add: eq_commute [of "0::'a"]) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

899 
apply (force dest!: nonzero_inverse_eq_imp_eq) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

900 
done 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

901 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

902 
lemma inverse_eq_iff_eq [simp]: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

903 
"(inverse a = inverse b) = (a = (b::'a::{division_ring,division_by_zero}))" 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

904 
by (force dest!: inverse_eq_imp_eq) 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

905 

14270  906 
lemma nonzero_inverse_inverse_eq: 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

907 
assumes [simp]: "a \<noteq> 0" 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

908 
shows "inverse(inverse (a::'a::division_ring)) = a" 
14270  909 
proof  
910 
have "(inverse (inverse a) * inverse a) * a = a" 

911 
by (simp add: nonzero_imp_inverse_nonzero) 

912 
thus ?thesis 

913 
by (simp add: mult_assoc) 

914 
qed 

915 

916 
lemma inverse_inverse_eq [simp]: 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

917 
"inverse(inverse (a::'a::{division_ring,division_by_zero})) = a" 
14270  918 
proof cases 
919 
assume "a=0" thus ?thesis by simp 

920 
next 

921 
assume "a\<noteq>0" 

922 
thus ?thesis by (simp add: nonzero_inverse_inverse_eq) 

923 
qed 

924 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

925 
lemma inverse_1 [simp]: "inverse 1 = (1::'a::division_ring)" 
14270  926 
proof  
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

927 
have "inverse 1 * 1 = (1::'a::division_ring)" 
14270  928 
by (rule left_inverse [OF zero_neq_one [symmetric]]) 
929 
thus ?thesis by simp 

930 
qed 

931 

15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

932 
lemma inverse_unique: 
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

933 
assumes ab: "a*b = 1" 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

934 
shows "inverse a = (b::'a::division_ring)" 
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

935 
proof  
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

936 
have "a \<noteq> 0" using ab by auto 
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

937 
moreover have "inverse a * (a * b) = inverse a" by (simp add: ab) 
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

938 
ultimately show ?thesis by (simp add: mult_assoc [symmetric]) 
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

939 
qed 
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15010
diff
changeset

940 

14270  941 
lemma nonzero_inverse_mult_distrib: 
942 
assumes anz: "a \<noteq> 0" 

943 
and bnz: "b \<noteq> 0" 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

944 
shows "inverse(a*b) = inverse(b) * inverse(a::'a::division_ring)" 
14270  945 
proof  
946 
have "inverse(a*b) * (a * b) * inverse(b) = inverse(b)" 

23482  947 
by (simp add: anz bnz) 
14270  948 
hence "inverse(a*b) * a = inverse(b)" 
949 
by (simp add: mult_assoc bnz) 

950 
hence "inverse(a*b) * a * inverse(a) = inverse(b) * inverse(a)" 

951 
by simp 

952 
thus ?thesis 

953 
by (simp add: mult_assoc anz) 

954 
qed 

955 

956 
text{*This version builds in division by zero while also reorienting 

957 
the righthand side.*} 

958 
lemma inverse_mult_distrib [simp]: 

959 
"inverse(a*b) = inverse(a) * inverse(b::'a::{field,division_by_zero})" 

960 
proof cases 

961 
assume "a \<noteq> 0 & b \<noteq> 0" 

22993  962 
thus ?thesis 
963 
by (simp add: nonzero_inverse_mult_distrib mult_commute) 

14270  964 
next 
965 
assume "~ (a \<noteq> 0 & b \<noteq> 0)" 

22993  966 
thus ?thesis 
967 
by force 

14270  968 
qed 
969 

20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

970 
lemma division_ring_inverse_add: 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

971 
"[(a::'a::division_ring) \<noteq> 0; b \<noteq> 0] 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

972 
==> inverse a + inverse b = inverse a * (a+b) * inverse b" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

973 
by (simp add: ring_simps) 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

974 

23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

975 
lemma division_ring_inverse_diff: 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

976 
"[(a::'a::division_ring) \<noteq> 0; b \<noteq> 0] 
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

977 
==> inverse a  inverse b = inverse a * (ba) * inverse b" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

978 
by (simp add: ring_simps) 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

979 

14270  980 
text{*There is no slick version using division by zero.*} 
981 
lemma inverse_add: 

23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

982 
"[a \<noteq> 0; b \<noteq> 0] 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

983 
==> inverse a + inverse b = (a+b) * inverse a * inverse (b::'a::field)" 
20496
23eb6034c06d
added axclass division_ring (like field without commutativity; includes e.g. quaternions) and generalized some theorems from field to division_ring
huffman
parents:
19404
diff
changeset

984 
by (simp add: division_ring_inverse_add mult_ac) 
14270  985 

14365
3d4df8c166ae
replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
14353
diff
changeset

986 
lemma inverse_divide [simp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

987 
"inverse (a/b) = b / (a::'a::{field,division_by_zero})" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

988 
by (simp add: divide_inverse mult_commute) 
14365
3d4df8c166ae
replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
14353
diff
changeset

989 

23389  990 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

991 
subsection {* Calculations with fractions *} 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

992 

23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

993 
text{* There is a whole bunch of simprules just for class @{text 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

994 
field} but none for class @{text field} and @{text nonzero_divides} 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

995 
because the latter are covered by a simproc. *} 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

996 

24427  997 
lemma nonzero_mult_divide_mult_cancel_left[simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

998 
assumes [simp]: "b\<noteq>0" and [simp]: "c\<noteq>0" shows "(c*a)/(c*b) = a/(b::'a::field)" 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

999 
proof  
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1000 
have "(c*a)/(c*b) = c * a * (inverse b * inverse c)" 
23482  1001 
by (simp add: divide_inverse nonzero_inverse_mult_distrib) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1002 
also have "... = a * inverse b * (inverse c * c)" 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1003 
by (simp only: mult_ac) 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1004 
also have "... = a * inverse b" 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1005 
by simp 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1006 
finally show ?thesis 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1007 
by (simp add: divide_inverse) 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1008 
qed 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1009 

23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1010 
lemma mult_divide_mult_cancel_left: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1011 
"c\<noteq>0 ==> (c*a) / (c*b) = a / (b::'a::{field,division_by_zero})" 
21328  1012 
apply (cases "b = 0") 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1013 
apply (simp_all add: nonzero_mult_divide_mult_cancel_left) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1014 
done 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1015 

24427  1016 
lemma nonzero_mult_divide_mult_cancel_right [noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1017 
"[b\<noteq>0; c\<noteq>0] ==> (a*c) / (b*c) = a/(b::'a::field)" 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1018 
by (simp add: mult_commute [of _ c] nonzero_mult_divide_mult_cancel_left) 
14321  1019 

23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1020 
lemma mult_divide_mult_cancel_right: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1021 
"c\<noteq>0 ==> (a*c) / (b*c) = a / (b::'a::{field,division_by_zero})" 
21328  1022 
apply (cases "b = 0") 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1023 
apply (simp_all add: nonzero_mult_divide_mult_cancel_right) 
14321  1024 
done 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1025 

14284
f1abe67c448a
reorganisation of Real/RealArith0.ML; more `Isar scripts
paulson
parents:
14277
diff
changeset

1026 
lemma divide_1 [simp]: "a/1 = (a::'a::field)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1027 
by (simp add: divide_inverse) 
14284
f1abe67c448a
reorganisation of Real/RealArith0.ML; more `Isar scripts
paulson
parents:
14277
diff
changeset

1028 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

1029 
lemma times_divide_eq_right: "a * (b/c) = (a*b) / (c::'a::field)" 
14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1030 
by (simp add: divide_inverse mult_assoc) 
14288  1031 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1032 
lemma times_divide_eq_left: "(b/c) * a = (b*a) / (c::'a::field)" 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1033 
by (simp add: divide_inverse mult_ac) 
14288  1034 

23482  1035 
lemmas times_divide_eq = times_divide_eq_right times_divide_eq_left 
1036 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
23879
diff
changeset

1037 
lemma divide_divide_eq_right [simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1038 
"a / (b/c) = (a*c) / (b::'a::{field,division_by_zero})" 
14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1039 
by (simp add: divide_inverse mult_ac) 
14288  1040 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
23879
diff
changeset

1041 
lemma divide_divide_eq_left [simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1042 
"(a / b) / (c::'a::{field,division_by_zero}) = a / (b*c)" 
14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1043 
by (simp add: divide_inverse mult_assoc) 
14288  1044 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

1045 
lemma add_frac_eq: "(y::'a::field) ~= 0 ==> z ~= 0 ==> 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

1046 
x / y + w / z = (x * z + w * y) / (y * z)" 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1047 
apply (subgoal_tac "x / y = (x * z) / (y * z)") 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1048 
apply (erule ssubst) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1049 
apply (subgoal_tac "w / z = (w * y) / (y * z)") 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1050 
apply (erule ssubst) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1051 
apply (rule add_divide_distrib [THEN sym]) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1052 
apply (subst mult_commute) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1053 
apply (erule nonzero_mult_divide_mult_cancel_left [THEN sym]) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1054 
apply assumption 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1055 
apply (erule nonzero_mult_divide_mult_cancel_right [THEN sym]) 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1056 
apply assumption 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

1057 
done 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1058 

23389  1059 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

1060 
subsubsection{*Special Cancellation Simprules for Division*} 
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

1061 

24427  1062 
lemma mult_divide_mult_cancel_left_if[simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1063 
fixes c :: "'a :: {field,division_by_zero}" 
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1064 
shows "(c*a) / (c*b) = (if c=0 then 0 else a/b)" 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1065 
by (simp add: mult_divide_mult_cancel_left) 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1066 

24427  1067 
lemma nonzero_mult_divide_cancel_right[simp,noatp]: 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1068 
"b \<noteq> 0 \<Longrightarrow> a * b / b = (a::'a::field)" 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1069 
using nonzero_mult_divide_mult_cancel_right[of 1 b a] by simp 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1070 

24427  1071 
lemma nonzero_mult_divide_cancel_left[simp,noatp]: 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1072 
"a \<noteq> 0 \<Longrightarrow> a * b / a = (b::'a::field)" 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1073 
using nonzero_mult_divide_mult_cancel_left[of 1 a b] by simp 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1074 

5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1075 

24427  1076 
lemma nonzero_divide_mult_cancel_right[simp,noatp]: 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1077 
"\<lbrakk> a\<noteq>0; b\<noteq>0 \<rbrakk> \<Longrightarrow> b / (a * b) = 1/(a::'a::field)" 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1078 
using nonzero_mult_divide_mult_cancel_right[of a b 1] by simp 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1079 

24427  1080 
lemma nonzero_divide_mult_cancel_left[simp,noatp]: 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1081 
"\<lbrakk> a\<noteq>0; b\<noteq>0 \<rbrakk> \<Longrightarrow> a / (a * b) = 1/(b::'a::field)" 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1082 
using nonzero_mult_divide_mult_cancel_left[of b a 1] by simp 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1083 

5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1084 

24427  1085 
lemma nonzero_mult_divide_mult_cancel_left2[simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1086 
"[b\<noteq>0; c\<noteq>0] ==> (c*a) / (b*c) = a/(b::'a::field)" 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1087 
using nonzero_mult_divide_mult_cancel_left[of b c a] by(simp add:mult_ac) 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1088 

24427  1089 
lemma nonzero_mult_divide_mult_cancel_right2[simp,noatp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1090 
"[b\<noteq>0; c\<noteq>0] ==> (a*c) / (c*b) = a/(b::'a::field)" 
23413
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1091 
using nonzero_mult_divide_mult_cancel_right[of b c a] by(simp add:mult_ac) 
5caa2710dd5b
tuned laws for cancellation in divisions for fields.
nipkow
parents:
23406
diff
changeset

1092 

15234
ec91a90c604e
simplification tweaks for better arithmetic reasoning
paulson
parents:
15229
diff
changeset

1093 

14293  1094 
subsection {* Division and Unary Minus *} 
1095 

1096 
lemma nonzero_minus_divide_left: "b \<noteq> 0 ==>  (a/b) = (a) / (b::'a::field)" 

1097 
by (simp add: divide_inverse minus_mult_left) 

1098 

1099 
lemma nonzero_minus_divide_right: "b \<noteq> 0 ==>  (a/b) = a / (b::'a::field)" 

1100 
by (simp add: divide_inverse nonzero_inverse_minus_eq minus_mult_right) 

1101 

1102 
lemma nonzero_minus_divide_divide: "b \<noteq> 0 ==> (a)/(b) = a / (b::'a::field)" 

1103 
by (simp add: divide_inverse nonzero_inverse_minus_eq) 

1104 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1105 
lemma minus_divide_left: " (a/b) = (a) / (b::'a::field)" 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1106 
by (simp add: divide_inverse minus_mult_left [symmetric]) 
14293  1107 

1108 
lemma minus_divide_right: " (a/b) = a / (b::'a::{field,division_by_zero})" 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1109 
by (simp add: divide_inverse minus_mult_right [symmetric]) 
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1110 

14293  1111 

1112 
text{*The effect is to extract signs from divisions*} 

17085  1113 
lemmas divide_minus_left = minus_divide_left [symmetric] 
1114 
lemmas divide_minus_right = minus_divide_right [symmetric] 

1115 
declare divide_minus_left [simp] divide_minus_right [simp] 

14293  1116 

14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

1117 
text{*Also, extract signs from products*} 
17085  1118 
lemmas mult_minus_left = minus_mult_left [symmetric] 
1119 
lemmas mult_minus_right = minus_mult_right [symmetric] 

1120 
declare mult_minus_left [simp] mult_minus_right [simp] 

14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

1121 

14293  1122 
lemma minus_divide_divide [simp]: 
23477
f4b83f03cac9
tuned and renamed group_eq_simps and ring_eq_simps
nipkow
parents:
23413
diff
changeset

1123 
"(a)/(b) = a / (b::'a::{field,division_by_zero})" 
21328  1124 
apply (cases "b=0", simp) 
14293  1125 
apply (simp add: nonzero_minus_divide_divide) 
1126 
done 

1127 

14430
5cb24165a2e1
new material from Avigad, and simplified treatment of division by 0
paulson
parents:
14421
diff
changeset

1128 
lemma diff_divide_distrib: "(ab)/(c::'a::field) = a/c  b/c" 
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

1129 
by (simp add: diff_minus add_divide_distrib) 
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14377
diff
changeset

1130 

23482  1131 
lemma add_divide_eq_iff: 
1132 
"(z::'a::field) \<noteq> 0 \<Longrightarrow> x + y/z = (z*x + y)/z" 

1133 
by(simp add:add_divide_distrib nonzero_mult_divide_cancel_left) 

1134 

1135 
lemma divide_add_eq_iff: 

1136 
"(z::'a::field) \<noteq> 0 \<Longrightarrow> x/z + y = (x + z*y)/z" 

1137 
by(simp add:add_divide_distrib nonzero_mult_divide_cancel_left) 

1138 

1139 
lemma diff_divide_eq_iff: 

1140 
"(z::'a::field) \<noteq> 0 \<Longrightarrow> x  y/z = (z*x  y)/z" 

1141 
by(simp add:diff_divide_distrib nonzero_mult_divide_cancel_left) 

1142 

1143 
lemma divide_diff_eq_iff: 

1144 
"(z::'a::field) \<noteq> 0 \<Longrightarrow> x/z  y = (x  z*y)/z" 

1145 
by(simp add:diff_divide_distrib nonzero_mult_divide_cancel_left) 

1146 

1147 
lemma nonzero_eq_divide_eq: "c\<noteq>0 ==> ((a::'a::field) = b/c) = (a*c = b)" 

1148 
proof  

1149 
assume [simp]: "c\<noteq>0" 

23496  1150 
have "(a = b/c) = (a*c = (b/c)*c)" by simp 
1151 
also have "... = (a*c = b)" by (simp add: divide_inverse mult_assoc) 

23482  1152 
finally show ?thesis . 
1153 
qed 

1154 

1155 
lemma nonzero_divide_eq_eq: "c\<noteq>0 ==> (b/c = (a::'a::field)) = (b = a*c)" 

1156 
proof  

1157 
assume [simp]: "c\<noteq>0" 

23496  1158 
have "(b/c = a) = ((b/c)*c = a*c)" by simp 
1159 
also have "... = (b = a*c)" by (simp add: divide_inverse mult_assoc) 

23482  1160 
finally show ?thesis . 
1161 
qed 

1162 

1163 
lemma eq_divide_eq: 

1164 
"((a::'a::{field,division_by_zero}) = b/c) = (if c\<noteq>0 then a*c = b else a=0)" 

1165 
by (simp add: nonzero_eq_divide_eq) 

1166 

1167 
lemma divide_eq_eq: 

1168 
"(b/c = (a::'a::{field,division_by_zero})) = (if c\<noteq>0 then b = a*c else a=0)" 

1169 
by (force simp add: nonzero_divide_eq_eq) 

1170 

1171 
lemma divide_eq_imp: "(c::'a::{division_by_zero,field}) ~= 0 ==> 

1172 
b = a * c ==> b / c = a" 

1173 
by (subst divide_eq_eq, simp) 

1174 

1175 
lemma eq_divide_imp: "(c::'a::{division_by_zero,field}) ~= 0 ==> 

1176 
a * c = b ==> a = b / c" 

1177 
by (subst eq_divide_eq, simp) 

1178 

1179 

1180 
lemmas field_eq_simps = ring_simps 

1181 
(* pull / out*) 

1182 
add_divide_eq_iff divide_add_eq_iff 

1183 
diff_divide_eq_iff divide_diff_eq_iff 

1184 
(* multiply eqn *) 

1185 
nonzero_eq_divide_eq nonzero_divide_eq_eq 

1186 
(* is added later: 

1187 
times_divide_eq_left times_divide_eq_right 

1188 
*) 

1189 

1190 
text{*An example:*} 

1191 
lemma fixes a b c d e f :: "'a::field" 

1192 
shows "\<lbrakk>a\<noteq>b; c\<noteq>d; e\<noteq>f \<rbrakk> \<Longrightarrow> ((ab)*(cd)*(ef))/((cd)*(ef)*(ab)) = 1" 

1193 
apply(subgoal_tac "(cd)*(ef)*(ab) \<noteq> 0") 

1194 
apply(simp add:field_eq_simps) 

1195 
apply(simp) 

1196 
done 

1197 

1198 

16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

1199 
lemma diff_frac_eq: "(y::'a::field) ~= 0 ==> z ~= 0 ==> 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16568
diff
changeset

1200 
x / y  w / z = (x * z  w * y) / (y * z)" 
23482  1201 
by (simp add:field_eq_simps times_divide_eq) 
1202 

1203 
lemma frac_eq_eq: "(y::'a::field) ~= 0 ==> z ~= 0 ==> 

1204 
(x / y = w / z) = (x * z = w * y)" 

1205 
by (simp add:field_eq_simps times_divide_eq) 

14293  1206 

23389  1207 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1208 
subsection {* Ordered Fields *} 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1209 

14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1210 
lemma positive_imp_inverse_positive: 
23482  1211 
assumes a_gt_0: "0 < a" shows "0 < inverse (a::'a::ordered_field)" 
1212 
proof  

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1213 
have "0 < a * inverse a" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1214 
by (simp add: a_gt_0 [THEN order_less_imp_not_eq2] zero_less_one) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1215 
thus "0 < inverse a" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1216 
by (simp add: a_gt_0 [THEN order_less_not_sym] zero_less_mult_iff) 
23482  1217 
qed 
14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1218 

14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1219 
lemma negative_imp_inverse_negative: 
23482  1220 
"a < 0 ==> inverse a < (0::'a::ordered_field)" 
1221 
by (insert positive_imp_inverse_positive [of "a"], 

1222 
simp add: nonzero_inverse_minus_eq order_less_imp_not_eq) 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1223 

5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1224 
lemma inverse_le_imp_le: 
23482  1225 
assumes invle: "inverse a \<le> inverse b" and apos: "0 < a" 
1226 
shows "b \<le> (a::'a::ordered_field)" 

1227 
proof (rule classical) 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1228 
assume "~ b \<le> a" 
23482  1229 
hence "a < b" by (simp add: linorder_not_le) 
1230 
hence bpos: "0 < b" by (blast intro: apos order_less_trans) 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1231 
hence "a * inverse a \<le> a * inverse b" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1232 
by (simp add: apos invle order_less_imp_le mult_left_mono) 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1233 
hence "(a * inverse a) * b \<le> (a * inverse b) * b" 
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1234 
by (simp add: bpos order_less_imp_le mult_right_mono) 
23482  1235 
thus "b \<le> a" by (simp add: mult_assoc apos bpos order_less_imp_not_eq2) 
1236 
qed 

14268
5cf13e80be0e
Removal of Hyperreal/ExtraThms2.ML, sending the material to the correct files.
paulson
parents:
14267
diff
changeset

1237 

14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1238 
lemma inverse_positive_imp_positive: 
23482  1239 
assumes inv_gt_0: "0 < inverse a" and nz: "a \<noteq> 0" 
1240 
shows "0 < (a::'a::ordered_field)" 

23389  1241 
proof  
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1242 
have "0 < inverse (inverse a)" 
23389  1243 
using inv_gt_0 by (rule positive_imp_inverse_positive) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1244 
thus "0 < a" 
23389  1245 
using nz by (simp add: nonzero_inverse_inverse_eq) 
1246 
qed 

14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1247 

ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1248 
lemma inverse_positive_iff_positive [simp]: 
23482  1249 
"(0 < inverse a) = (0 < (a::'a::{ordered_field,division_by_zero}))" 
21328  1250 
apply (cases "a = 0", simp) 
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1251 
apply (blast intro: inverse_positive_imp_positive positive_imp_inverse_positive) 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1252 
done 
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1253 

ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1254 
lemma inverse_negative_imp_negative: 
23482  1255 
assumes inv_less_0: "inverse a < 0" and nz: "a \<noteq> 0" 
1256 
shows "a < (0::'a::ordered_field)" 

23389  1257 
proof  
14277
ad66687ece6e
more field division lemmas transferred from Real to Ring_and_Field
paulson
parents:
14272
diff
changeset

1258 
have "inverse (inverse a) < 0" 