author  huffman 
Tue, 10 Apr 2007 21:50:08 +0200  
changeset 22624  7a6c8ed516ab 
parent 22390  378f34b1e380 
child 22853  7f000a385606 
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" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

21 
by (simp add: power_Suc) 
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}))" 
15251  25 
by (induct "n", auto) 
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)" 
15251  28 
apply (induct "n") 
14577  29 
apply (auto simp add: power_Suc) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

31 

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

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

34 

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

35 
lemma power_commutes: "(a::'a::recpower) ^ n * a = a * a ^ n" 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

36 
by (induct "n") (simp_all add:power_Suc mult_assoc) 
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

37 

15004  38 
lemma power_add: "(a::'a::recpower) ^ (m+n) = (a^m) * (a^n)" 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

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

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

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

42 

15004  43 
lemma power_mult: "(a::'a::recpower) ^ (m*n) = (a^m) ^ n" 
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset

44 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

47 

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

48 
lemma power_mult_distrib: "((a::'a::{recpower,comm_monoid_mult}) * b) ^ n = (a^n) * (b^n)" 
15251  49 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

52 

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

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

56 
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

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

58 

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

59 
lemma zero_le_power: 
15004  60 
"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

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

63 
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

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

65 

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

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

69 
apply (simp_all add: power_Suc) 
14577  70 
apply (rule order_trans [OF _ mult_mono [of 1 _ 1]]) 
71 
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

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

73 

14738  74 
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

75 
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

76 

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

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

80 
proof  
14577  81 
have "1*1 < a*1" using gt1 by simp 
82 
also have "\<dots> \<le> a * a^n" using gt1 

83 
by (simp only: mult_mono gt1_imp_ge0 one_le_power order_less_imp_le 

84 
zero_le_one order_refl) 

85 
finally show ?thesis by simp 

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

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

87 

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

88 
lemma power_gt1: 
15004  89 
"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

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

91 

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

92 
lemma power_le_imp_le_exp: 
15004  93 
assumes gt1: "(1::'a::{recpower,ordered_semidom}) < a" 
14577  94 
shows "!!n. a^m \<le> a^n ==> m \<le> n" 
95 
proof (induct m) 

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

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

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

99 
case (Suc m) 
14577  100 
show ?case 
101 
proof (cases n) 

102 
case 0 

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

104 
with gt1 show ?thesis 

105 
by (force simp only: power_gt1_lemma 

106 
linorder_not_less [symmetric]) 

107 
next 

108 
case (Suc n) 

109 
from prems show ?thesis 

110 
by (force dest: mult_left_le_imp_le 

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

112 
qed 

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

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

114 

14577  115 
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

116 
lemma power_inject_exp [simp]: 
15004  117 
"1 < (a::'a::{ordered_semidom,recpower}) ==> (a^m = a^n) = (m=n)" 
14577  118 
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

119 

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

120 
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

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

122 
lemma power_less_imp_less_exp: 
15004  123 
"[ (1::'a::{recpower,ordered_semidom}) < a; a^m < a^n ] ==> m < n" 
14577  124 
by (simp add: order_less_le [of m n] order_less_le [of "a^m" "a^n"] 
125 
power_le_imp_le_exp) 

14348
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 

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

128 
lemma power_mono: 
15004  129 
"[a \<le> b; (0::'a::{recpower,ordered_semidom}) \<le> a] ==> a^n \<le> 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 (simp_all add: power_Suc) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

132 
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

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_strict_mono [rule_format]: 
15004  136 
"[a < b; (0::'a::{recpower,ordered_semidom}) \<le> a] 
14577  137 
==> 0 < n > a^n < b^n" 
15251  138 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

139 
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

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

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

142 

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

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

146 
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

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

148 

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

149 
lemma field_power_eq_0_iff [simp]: 
15004  150 
"(a^n = 0) = (a = (0::'a::{field,recpower}) & 0<n)" 
15251  151 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

154 

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

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

157 

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

158 
lemma nonzero_power_inverse: 
15004  159 
"a \<noteq> 0 ==> inverse ((a::'a::{field,recpower}) ^ n) = (inverse a) ^ n" 
15251  160 
apply (induct "n") 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

161 
apply (auto simp add: power_Suc nonzero_inverse_mult_distrib mult_commute) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

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

163 

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

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

165 
lemma power_inverse: 
15004  166 
"inverse ((a::'a::{field,division_by_zero,recpower}) ^ n) = (inverse a) ^ n" 
15251  167 
apply (induct "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

170 

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

171 
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

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

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

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

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

176 

14577  177 
lemma nonzero_power_divide: 
15004  178 
"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

179 
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

180 

14577  181 
lemma power_divide: 
15004  182 
"(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

183 
apply (case_tac "b=0", simp add: power_0_left) 
14577  184 
apply (rule nonzero_power_divide) 
185 
apply assumption 

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

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

187 

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

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

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

192 

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

193 
lemma zero_less_power_abs_iff [simp]: 
15004  194 
"(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

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

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

197 
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

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

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

200 
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

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

202 

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

203 
lemma zero_le_power_abs [simp]: 
15004  204 
"(0::'a::{ordered_idom,recpower}) \<le> (abs a)^n" 
15251  205 
apply (induct "n") 
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

206 
apply (auto simp add: zero_le_one zero_le_power) 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

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

208 

15004  209 
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

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

211 
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

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

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

214 

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

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

216 
lemma power_Suc_less: 
15004  217 
"[(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

218 
==> a * a^n < a^n" 
15251  219 
apply (induct n) 
14577  220 
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

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

222 

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

223 
lemma power_strict_decreasing: 
15004  224 
"[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

225 
==> a^N < a^n" 
14577  226 
apply (erule rev_mp) 
15251  227 
apply (induct "N") 
14577  228 
apply (auto simp add: power_Suc power_Suc_less less_Suc_eq) 
229 
apply (rename_tac m) 

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

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

232 
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

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

234 

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

235 
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

236 
lemma power_decreasing: 
15004  237 
"[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

238 
==> a^N \<le> a^n" 
14577  239 
apply (erule rev_mp) 
15251  240 
apply (induct "N") 
14577  241 
apply (auto simp add: power_Suc le_Suc_eq) 
242 
apply (rename_tac m) 

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

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

245 
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

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

247 

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

248 
lemma power_Suc_less_one: 
15004  249 
"[ 0 < a; a < (1::'a::{ordered_semidom,recpower}) ] ==> a ^ Suc n < 1" 
14577  250 
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

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

252 

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

253 
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

254 
lemma power_increasing: 
15004  255 
"[n \<le> N; (1::'a::{ordered_semidom,recpower}) \<le> a] ==> a^n \<le> a^N" 
14577  256 
apply (erule rev_mp) 
15251  257 
apply (induct "N") 
14577  258 
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

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

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

262 
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

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

264 

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

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

266 
lemma power_less_power_Suc: 
15004  267 
"(1::'a::{ordered_semidom,recpower}) < a ==> a^n < a * a^n" 
15251  268 
apply (induct n) 
14577  269 
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

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

271 

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

272 
lemma power_strict_increasing: 
15004  273 
"[n < N; (1::'a::{ordered_semidom,recpower}) < a] ==> a^n < a^N" 
14577  274 
apply (erule rev_mp) 
15251  275 
apply (induct "N") 
14577  276 
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

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

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

280 
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

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

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

283 

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

286 
by (blast intro: power_le_imp_le_exp power_increasing order_less_imp_le) 

287 

288 
lemma power_strict_increasing_iff [simp]: 

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

290 
by (blast intro: power_less_imp_less_exp power_strict_increasing) 

291 

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

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

293 
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

294 
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

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

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

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

298 
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

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

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

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

303 
qed 
14577  304 

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

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

308 
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

309 

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

310 

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

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

312 

21456  313 
instance nat :: power .. 
314 

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

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

317 
"p ^ (Suc n) = (p::nat) * (p ^ n)" 
14577  318 

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

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

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

323 
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

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

325 

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

326 
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

327 
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

328 

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

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

331 

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

332 
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

333 
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

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

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

338 
shows "m < n" 

339 
proof (cases "i = 1") 

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

341 
next 

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

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

344 
qed 

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

345 

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

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

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

348 
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

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

350 
(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

351 

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

352 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

371 
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

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

373 
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

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

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

376 
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

377 
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

378 
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

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

380 
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

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

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

383 
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

384 
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

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

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

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

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

389 
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

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

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

392 
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

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

394 
*} 
14577  395 

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

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

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

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

399 
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

400 
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

401 
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

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

403 

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

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

405 