author  huffman 
Mon, 11 Jun 2007 02:24:39 +0200  
changeset 23305  8ae6f7b0903b 
parent 23183  af27d3ad9baf 
child 23431  25ca91279a9b 
permissions  rwrr 
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

1 
(* Title: HOL/Power.thy 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

2 
ID: $Id$ 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

4 
Copyright 1997 University of Cambridge 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

5 

0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

6 
*) 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

7 

16733
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
15251
diff
changeset

8 
header{*Exponentiation*} 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

9 

15131  10 
theory Power 
21413  11 
imports Nat 
15131  12 
begin 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

13 

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

14 
subsection{*Powers for Arbitrary Monoids*} 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

15 

22390  16 
class recpower = monoid_mult + power + 
17 
assumes power_0 [simp]: "a \<^loc>^ 0 = \<^loc>1" 

18 
assumes power_Suc: "a \<^loc>^ Suc n = a \<^loc>* (a \<^loc>^ n)" 

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

19 

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

20 
lemma power_0_Suc [simp]: "(0::'a::{recpower,semiring_0}) ^ (Suc n) = 0" 
23183  21 
by (simp add: power_Suc) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

22 

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

23 
text{*It looks plausible as a simprule, but its effect can be strange.*} 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

24 
lemma power_0_left: "0^n = (if n=0 then 1 else (0::'a::{recpower,semiring_0}))" 
23183  25 
by (induct n) simp_all 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

26 

15004  27 
lemma power_one [simp]: "1^n = (1::'a::recpower)" 
23183  28 
by (induct n) (simp_all add: power_Suc) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

29 

15004  30 
lemma power_one_right [simp]: "(a::'a::recpower) ^ 1 = a" 
23183  31 
by (simp add: power_Suc) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

32 

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

33 
lemma power_commutes: "(a::'a::recpower) ^ n * a = a * a ^ n" 
23183  34 
by (induct n) (simp_all add: power_Suc mult_assoc) 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

35 

15004  36 
lemma power_add: "(a::'a::recpower) ^ (m+n) = (a^m) * (a^n)" 
23183  37 
by (induct m) (simp_all add: power_Suc mult_ac) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

38 

15004  39 
lemma power_mult: "(a::'a::recpower) ^ (m*n) = (a^m) ^ n" 
23183  40 
by (induct n) (simp_all add: power_Suc power_add) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

41 

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

42 
lemma power_mult_distrib: "((a::'a::{recpower,comm_monoid_mult}) * b) ^ n = (a^n) * (b^n)" 
23183  43 
by (induct n) (simp_all add: power_Suc mult_ac) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

44 

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

45 
lemma zero_less_power: 
15004  46 
"0 < (a::'a::{ordered_semidom,recpower}) ==> 0 < a^n" 
15251  47 
apply (induct "n") 
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset

48 
apply (simp_all add: power_Suc zero_less_one mult_pos_pos) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

50 

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

51 
lemma zero_le_power: 
15004  52 
"0 \<le> (a::'a::{ordered_semidom,recpower}) ==> 0 \<le> a^n" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

53 
apply (simp add: order_le_less) 
14577  54 
apply (erule disjE) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

55 
apply (simp_all add: zero_less_power zero_less_one power_0_left) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

57 

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

58 
lemma one_le_power: 
15004  59 
"1 \<le> (a::'a::{ordered_semidom,recpower}) ==> 1 \<le> a^n" 
15251  60 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

61 
apply (simp_all add: power_Suc) 
14577  62 
apply (rule order_trans [OF _ mult_mono [of 1 _ 1]]) 
63 
apply (simp_all add: zero_le_one order_trans [OF zero_le_one]) 

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

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

65 

14738  66 
lemma gt1_imp_ge0: "1 < a ==> 0 \<le> (a::'a::ordered_semidom)" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

67 
by (simp add: order_trans [OF zero_le_one order_less_imp_le]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

68 

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

69 
lemma power_gt1_lemma: 
15004  70 
assumes gt1: "1 < (a::'a::{ordered_semidom,recpower})" 
14577  71 
shows "1 < a * a^n" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

72 
proof  
14577  73 
have "1*1 < a*1" using gt1 by simp 
74 
also have "\<dots> \<le> a * a^n" using gt1 

75 
by (simp only: mult_mono gt1_imp_ge0 one_le_power order_less_imp_le 

76 
zero_le_one order_refl) 

77 
finally show ?thesis by simp 

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

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

79 

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

80 
lemma power_gt1: 
15004  81 
"1 < (a::'a::{ordered_semidom,recpower}) ==> 1 < a ^ (Suc n)" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

82 
by (simp add: power_gt1_lemma power_Suc) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

83 

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

84 
lemma power_le_imp_le_exp: 
15004  85 
assumes gt1: "(1::'a::{recpower,ordered_semidom}) < a" 
14577  86 
shows "!!n. a^m \<le> a^n ==> m \<le> n" 
87 
proof (induct m) 

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

88 
case 0 
14577  89 
show ?case by simp 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

91 
case (Suc m) 
14577  92 
show ?case 
93 
proof (cases n) 

94 
case 0 

95 
from prems have "a * a^m \<le> 1" by (simp add: power_Suc) 

96 
with gt1 show ?thesis 

97 
by (force simp only: power_gt1_lemma 

98 
linorder_not_less [symmetric]) 

99 
next 

100 
case (Suc n) 

101 
from prems show ?thesis 

102 
by (force dest: mult_left_le_imp_le 

103 
simp add: power_Suc order_less_trans [OF zero_less_one gt1]) 

104 
qed 

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

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

106 

14577  107 
text{*Surely we can strengthen this? It holds for @{text "0<a<1"} too.*} 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

108 
lemma power_inject_exp [simp]: 
15004  109 
"1 < (a::'a::{ordered_semidom,recpower}) ==> (a^m = a^n) = (m=n)" 
14577  110 
by (force simp add: order_antisym power_le_imp_le_exp) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

111 

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

112 
text{*Can relax the first premise to @{term "0<a"} in the case of the 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

113 
natural numbers.*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

114 
lemma power_less_imp_less_exp: 
15004  115 
"[ (1::'a::{recpower,ordered_semidom}) < a; a^m < a^n ] ==> m < n" 
14577  116 
by (simp add: order_less_le [of m n] order_less_le [of "a^m" "a^n"] 
117 
power_le_imp_le_exp) 

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

118 

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

119 

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

120 
lemma power_mono: 
15004  121 
"[a \<le> b; (0::'a::{recpower,ordered_semidom}) \<le> a] ==> a^n \<le> b^n" 
15251  122 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

123 
apply (simp_all add: power_Suc) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

124 
apply (auto intro: mult_mono zero_le_power order_trans [of 0 a b]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

126 

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

127 
lemma power_strict_mono [rule_format]: 
15004  128 
"[a < b; (0::'a::{recpower,ordered_semidom}) \<le> a] 
14577  129 
==> 0 < n > a^n < b^n" 
15251  130 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

131 
apply (auto simp add: mult_strict_mono zero_le_power power_Suc 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

132 
order_le_less_trans [of 0 a b]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

134 

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

135 
lemma power_eq_0_iff [simp]: 
22991  136 
"(a^n = 0) = (a = (0::'a::{dom,recpower}) & 0<n)" 
15251  137 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

138 
apply (auto simp add: power_Suc zero_neq_one [THEN not_sym]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

140 

22991  141 
lemma field_power_eq_0_iff: 
22988
f6b8184f5b4a
generalize some lemmas from field to division_ring
huffman
parents:
22957
diff
changeset

142 
"(a^n = 0) = (a = (0::'a::{division_ring,recpower}) & 0<n)" 
22991  143 
by simp (* TODO: delete *) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

144 

22991  145 
lemma field_power_not_zero: "a \<noteq> (0::'a::{dom,recpower}) ==> a^n \<noteq> 0" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

146 
by force 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

147 

14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

148 
lemma nonzero_power_inverse: 
22991  149 
fixes a :: "'a::{division_ring,recpower}" 
150 
shows "a \<noteq> 0 ==> inverse (a ^ n) = (inverse a) ^ n" 

15251  151 
apply (induct "n") 
22988
f6b8184f5b4a
generalize some lemmas from field to division_ring
huffman
parents:
22957
diff
changeset

152 
apply (auto simp add: power_Suc nonzero_inverse_mult_distrib power_commutes) 
22991  153 
done (* TODO: reorient or rename to nonzero_inverse_power *) 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

154 

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

155 
text{*Perhaps these should be simprules.*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

156 
lemma power_inverse: 
22991  157 
fixes a :: "'a::{division_ring,division_by_zero,recpower}" 
158 
shows "inverse (a ^ n) = (inverse a) ^ n" 

159 
apply (cases "a = 0") 

160 
apply (simp add: power_0_left) 

161 
apply (simp add: nonzero_power_inverse) 

162 
done (* TODO: reorient or rename to inverse_power *) 

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

163 

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

164 
lemma power_one_over: "1 / (a::'a::{field,division_by_zero,recpower})^n = 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset

165 
(1 / a)^n" 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset

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

167 
apply (rule power_inverse) 
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset

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

169 

14577  170 
lemma nonzero_power_divide: 
15004  171 
"b \<noteq> 0 ==> (a/b) ^ n = ((a::'a::{field,recpower}) ^ n) / (b ^ n)" 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

172 
by (simp add: divide_inverse power_mult_distrib nonzero_power_inverse) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

173 

14577  174 
lemma power_divide: 
15004  175 
"(a/b) ^ n = ((a::'a::{field,division_by_zero,recpower}) ^ n / b ^ n)" 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

176 
apply (case_tac "b=0", simp add: power_0_left) 
14577  177 
apply (rule nonzero_power_divide) 
178 
apply assumption 

14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

179 
done 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

180 

15004  181 
lemma power_abs: "abs(a ^ n) = abs(a::'a::{ordered_idom,recpower}) ^ n" 
15251  182 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

183 
apply (auto simp add: power_Suc abs_mult) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

185 

14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

186 
lemma zero_less_power_abs_iff [simp]: 
15004  187 
"(0 < (abs a)^n) = (a \<noteq> (0::'a::{ordered_idom,recpower})  n=0)" 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

188 
proof (induct "n") 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

189 
case 0 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

190 
show ?case by (simp add: zero_less_one) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

191 
next 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

192 
case (Suc n) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

193 
show ?case by (force simp add: prems power_Suc zero_less_mult_iff) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

194 
qed 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

195 

79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

196 
lemma zero_le_power_abs [simp]: 
15004  197 
"(0::'a::{ordered_idom,recpower}) \<le> (abs a)^n" 
22957  198 
by (rule zero_le_power [OF abs_ge_zero]) 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

199 

15004  200 
lemma power_minus: "(a) ^ n = ( 1)^n * (a::'a::{comm_ring_1,recpower}) ^ n" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

202 
have "a = ( 1) * a" by (simp add: minus_mult_left [symmetric]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

203 
thus ?thesis by (simp only: power_mult_distrib) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

205 

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

206 
text{*Lemma for @{text power_strict_decreasing}*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

207 
lemma power_Suc_less: 
15004  208 
"[(0::'a::{ordered_semidom,recpower}) < a; a < 1] 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

209 
==> a * a^n < a^n" 
15251  210 
apply (induct n) 
14577  211 
apply (auto simp add: power_Suc mult_strict_left_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

213 

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

214 
lemma power_strict_decreasing: 
15004  215 
"[n < N; 0 < a; a < (1::'a::{ordered_semidom,recpower})] 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

216 
==> a^N < a^n" 
14577  217 
apply (erule rev_mp) 
15251  218 
apply (induct "N") 
14577  219 
apply (auto simp add: power_Suc power_Suc_less less_Suc_eq) 
220 
apply (rename_tac m) 

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

221 
apply (subgoal_tac "a * a^m < 1 * a^n", simp) 
14577  222 
apply (rule mult_strict_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

223 
apply (auto simp add: zero_le_power zero_less_one order_less_imp_le) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

225 

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

226 
text{*Proof resembles that of @{text power_strict_decreasing}*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

227 
lemma power_decreasing: 
15004  228 
"[n \<le> N; 0 \<le> a; a \<le> (1::'a::{ordered_semidom,recpower})] 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

229 
==> a^N \<le> a^n" 
14577  230 
apply (erule rev_mp) 
15251  231 
apply (induct "N") 
14577  232 
apply (auto simp add: power_Suc le_Suc_eq) 
233 
apply (rename_tac m) 

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

234 
apply (subgoal_tac "a * a^m \<le> 1 * a^n", simp) 
14577  235 
apply (rule mult_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

236 
apply (auto simp add: zero_le_power zero_le_one) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

238 

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

239 
lemma power_Suc_less_one: 
15004  240 
"[ 0 < a; a < (1::'a::{ordered_semidom,recpower}) ] ==> a ^ Suc n < 1" 
14577  241 
apply (insert power_strict_decreasing [of 0 "Suc n" a], simp) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

243 

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

244 
text{*Proof again resembles that of @{text power_strict_decreasing}*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

245 
lemma power_increasing: 
15004  246 
"[n \<le> N; (1::'a::{ordered_semidom,recpower}) \<le> a] ==> a^n \<le> a^N" 
14577  247 
apply (erule rev_mp) 
15251  248 
apply (induct "N") 
14577  249 
apply (auto simp add: power_Suc le_Suc_eq) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

250 
apply (rename_tac m) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

251 
apply (subgoal_tac "1 * a^n \<le> a * a^m", simp) 
14577  252 
apply (rule mult_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

253 
apply (auto simp add: order_trans [OF zero_le_one] zero_le_power) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

255 

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

256 
text{*Lemma for @{text power_strict_increasing}*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

257 
lemma power_less_power_Suc: 
15004  258 
"(1::'a::{ordered_semidom,recpower}) < a ==> a^n < a * a^n" 
15251  259 
apply (induct n) 
14577  260 
apply (auto simp add: power_Suc mult_strict_left_mono order_less_trans [OF zero_less_one]) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

262 

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

263 
lemma power_strict_increasing: 
15004  264 
"[n < N; (1::'a::{ordered_semidom,recpower}) < a] ==> a^n < a^N" 
14577  265 
apply (erule rev_mp) 
15251  266 
apply (induct "N") 
14577  267 
apply (auto simp add: power_less_power_Suc power_Suc less_Suc_eq) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

268 
apply (rename_tac m) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

269 
apply (subgoal_tac "1 * a^n < a * a^m", simp) 
14577  270 
apply (rule mult_strict_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

271 
apply (auto simp add: order_less_trans [OF zero_less_one] zero_le_power 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

272 
order_less_imp_le) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

274 

15066  275 
lemma power_increasing_iff [simp]: 
276 
"1 < (b::'a::{ordered_semidom,recpower}) ==> (b ^ x \<le> b ^ y) = (x \<le> y)" 

277 
by (blast intro: power_le_imp_le_exp power_increasing order_less_imp_le) 

278 

279 
lemma power_strict_increasing_iff [simp]: 

280 
"1 < (b::'a::{ordered_semidom,recpower}) ==> (b ^ x < b ^ y) = (x < y)" 

281 
by (blast intro: power_less_imp_less_exp power_strict_increasing) 

282 

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

283 
lemma power_le_imp_le_base: 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

284 
assumes le: "a ^ Suc n \<le> b ^ Suc n" 
22624
7a6c8ed516ab
removed unnecessary premise from power_le_imp_le_base
huffman
parents:
22390
diff
changeset

285 
and ynonneg: "(0::'a::{ordered_semidom,recpower}) \<le> b" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

286 
shows "a \<le> b" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

287 
proof (rule ccontr) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

288 
assume "~ a \<le> b" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

289 
then have "b < a" by (simp only: linorder_not_le) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

290 
then have "b ^ Suc n < a ^ Suc n" 
14577  291 
by (simp only: prems power_strict_mono) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

292 
from le and this show "False" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

293 
by (simp add: linorder_not_less [symmetric]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

294 
qed 
14577  295 

22853  296 
lemma power_less_imp_less_base: 
297 
fixes a b :: "'a::{ordered_semidom,recpower}" 

298 
assumes less: "a ^ n < b ^ n" 

299 
assumes nonneg: "0 \<le> b" 

300 
shows "a < b" 

301 
proof (rule contrapos_pp [OF less]) 

302 
assume "~ a < b" 

303 
hence "b \<le> a" by (simp only: linorder_not_less) 

304 
hence "b ^ n \<le> a ^ n" using nonneg by (rule power_mono) 

305 
thus "~ a ^ n < b ^ n" by (simp only: linorder_not_less) 

306 
qed 

307 

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

308 
lemma power_inject_base: 
14577  309 
"[ a ^ Suc n = b ^ Suc n; 0 \<le> a; 0 \<le> b ] 
15004  310 
==> a = (b::'a::{ordered_semidom,recpower})" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

311 
by (blast intro: power_le_imp_le_base order_antisym order_eq_refl sym) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

312 

22955  313 
lemma power_eq_imp_eq_base: 
314 
fixes a b :: "'a::{ordered_semidom,recpower}" 

315 
shows "\<lbrakk>a ^ n = b ^ n; 0 \<le> a; 0 \<le> b; 0 < n\<rbrakk> \<Longrightarrow> a = b" 

316 
by (cases n, simp_all, rule power_inject_base) 

317 

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

318 

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

319 
subsection{*Exponentiation for the Natural Numbers*} 
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

320 

21456  321 
instance nat :: power .. 
322 

8844  323 
primrec (power) 
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

324 
"p ^ 0 = 1" 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

325 
"p ^ (Suc n) = (p::nat) * (p ^ n)" 
14577  326 

15004  327 
instance nat :: recpower 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

328 
proof 
14438  329 
fix z n :: nat 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

330 
show "z^0 = 1" by simp 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

331 
show "z^(Suc n) = z * (z^n)" by simp 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

333 

23305  334 
lemma of_nat_power: 
335 
"of_nat (m ^ n) = (of_nat m::'a::{semiring_1,recpower}) ^ n" 

336 
by (induct n, simp_all add: power_Suc) 

337 

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

338 
lemma nat_one_le_power [simp]: "1 \<le> i ==> Suc 0 \<le> i^n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

339 
by (insert one_le_power [of i n], simp) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

340 

21413  341 
lemma nat_zero_less_power_iff [simp]: "(0 < x^n) = (x \<noteq> (0::nat)  n=0)" 
342 
by (induct "n", auto) 

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

343 

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

344 
text{*Valid for the naturals, but what if @{text"0<i<1"}? 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

345 
Premises cannot be weakened: consider the case where @{term "i=0"}, 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

346 
@{term "m=1"} and @{term "n=0"}.*} 
21413  347 
lemma nat_power_less_imp_less: 
348 
assumes nonneg: "0 < (i\<Colon>nat)" 

349 
assumes less: "i^m < i^n" 

350 
shows "m < n" 

351 
proof (cases "i = 1") 

352 
case True with less power_one [where 'a = nat] show ?thesis by simp 

353 
next 

354 
case False with nonneg have "1 < i" by auto 

355 
from power_strict_increasing_iff [OF this] less show ?thesis .. 

356 
qed 

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

357 

17149
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

358 
lemma power_diff: 
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

359 
assumes nz: "a ~= 0" 
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

360 
shows "n <= m ==> (a::'a::{recpower, field}) ^ (mn) = (a^m) / (a^n)" 
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

361 
by (induct m n rule: diff_induct) 
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

362 
(simp_all add: power_Suc nonzero_mult_divide_cancel_left nz) 
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

363 

e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset

364 

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

365 
text{*ML bindings for the general exponentiation theorems*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

367 
{* 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

368 
val power_0 = thm"power_0"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

369 
val power_Suc = thm"power_Suc"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

370 
val power_0_Suc = thm"power_0_Suc"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

371 
val power_0_left = thm"power_0_left"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

372 
val power_one = thm"power_one"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

373 
val power_one_right = thm"power_one_right"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

374 
val power_add = thm"power_add"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

375 
val power_mult = thm"power_mult"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

376 
val power_mult_distrib = thm"power_mult_distrib"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

377 
val zero_less_power = thm"zero_less_power"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

378 
val zero_le_power = thm"zero_le_power"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

379 
val one_le_power = thm"one_le_power"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

380 
val gt1_imp_ge0 = thm"gt1_imp_ge0"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

381 
val power_gt1_lemma = thm"power_gt1_lemma"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

382 
val power_gt1 = thm"power_gt1"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

383 
val power_le_imp_le_exp = thm"power_le_imp_le_exp"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

384 
val power_inject_exp = thm"power_inject_exp"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

385 
val power_less_imp_less_exp = thm"power_less_imp_less_exp"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

386 
val power_mono = thm"power_mono"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

387 
val power_strict_mono = thm"power_strict_mono"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

388 
val power_eq_0_iff = thm"power_eq_0_iff"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

389 
val field_power_eq_0_iff = thm"field_power_eq_0_iff"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

390 
val field_power_not_zero = thm"field_power_not_zero"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

391 
val power_inverse = thm"power_inverse"; 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

392 
val nonzero_power_divide = thm"nonzero_power_divide"; 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

393 
val power_divide = thm"power_divide"; 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

394 
val power_abs = thm"power_abs"; 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

395 
val zero_less_power_abs_iff = thm"zero_less_power_abs_iff"; 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

396 
val zero_le_power_abs = thm "zero_le_power_abs"; 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

397 
val power_minus = thm"power_minus"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

398 
val power_Suc_less = thm"power_Suc_less"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

399 
val power_strict_decreasing = thm"power_strict_decreasing"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

400 
val power_decreasing = thm"power_decreasing"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

401 
val power_Suc_less_one = thm"power_Suc_less_one"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

402 
val power_increasing = thm"power_increasing"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

403 
val power_strict_increasing = thm"power_strict_increasing"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

404 
val power_le_imp_le_base = thm"power_le_imp_le_base"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

405 
val power_inject_base = thm"power_inject_base"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

406 
*} 
14577  407 

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

408 
text{*ML bindings for the remaining theorems*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

410 
{* 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

411 
val nat_one_le_power = thm"nat_one_le_power"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

412 
val nat_power_less_imp_less = thm"nat_power_less_imp_less"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

413 
val nat_zero_less_power_iff = thm"nat_zero_less_power_iff"; 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

414 
*} 
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

415 

0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

416 
end 
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

417 