author  paulson 
Tue, 20 Jul 2004 14:22:49 +0200  
changeset 15066  d2f2b908e0a4 
parent 15004  44ac09ba7213 
child 15131  c69542757a4d 
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 

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

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

9 

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

10 
theory Power = Divides: 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

11 

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

13 

15004  14 
axclass recpower \<subseteq> comm_semiring_1_cancel, power 
15 
power_0 [simp]: "a ^ 0 = 1" 

16 
power_Suc: "a ^ (Suc n) = a * (a ^ n)" 

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

17 

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

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

20 

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

21 
text{*It looks plausible as a simprule, but its effect can be strange.*} 
15004  22 
lemma power_0_left: "0^n = (if n=0 then 1 else (0::'a::recpower))" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

23 
by (induct_tac "n", auto) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

24 

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

26 
apply (induct_tac "n") 
14577  27 
apply (auto simp add: power_Suc) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

28 
done 
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" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

32 

15004  33 
lemma power_add: "(a::'a::recpower) ^ (m+n) = (a^m) * (a^n)" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

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

37 

15004  38 
lemma power_mult: "(a::'a::recpower) ^ (m*n) = (a^m) ^ n" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

40 
apply (simp_all add: power_Suc power_add) 
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_distrib: "((a::'a::recpower) * b) ^ n = (a^n) * (b^n)" 
14577  44 
apply (induct_tac "n") 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

45 
apply (auto simp add: power_Suc mult_ac) 
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 

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

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

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

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

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

53 

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

54 
lemma zero_le_power: 
15004  55 
"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

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

58 
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

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

60 

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

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

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

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

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

68 

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

70 
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

71 

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

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

75 
proof  
14577  76 
have "1*1 < a*1" using gt1 by simp 
77 
also have "\<dots> \<le> a * a^n" using gt1 

78 
by (simp only: mult_mono gt1_imp_ge0 one_le_power order_less_imp_le 

79 
zero_le_one order_refl) 

80 
finally show ?thesis by simp 

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

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

82 

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

83 
lemma power_gt1: 
15004  84 
"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

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

86 

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

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

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

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

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

94 
case (Suc m) 
14577  95 
show ?case 
96 
proof (cases n) 

97 
case 0 

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

99 
with gt1 show ?thesis 

100 
by (force simp only: power_gt1_lemma 

101 
linorder_not_less [symmetric]) 

102 
next 

103 
case (Suc n) 

104 
from prems show ?thesis 

105 
by (force dest: mult_left_le_imp_le 

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

107 
qed 

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

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

109 

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

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

114 

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

115 
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

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

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

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

121 

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

122 

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

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

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

127 
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

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

129 

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

130 
lemma power_strict_mono [rule_format]: 
15004  131 
"[a < b; (0::'a::{recpower,ordered_semidom}) \<le> a] 
14577  132 
==> 0 < n > a^n < b^n" 
133 
apply (induct_tac "n") 

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

134 
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

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

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

137 

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

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

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

141 
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

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

143 

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

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

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

147 
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

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

149 

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

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

152 

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

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

155 
apply (induct_tac "n") 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

156 
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

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

158 

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

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

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

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

163 
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

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

165 

14577  166 
lemma nonzero_power_divide: 
15004  167 
"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

168 
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

169 

14577  170 
lemma power_divide: 
15004  171 
"(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

172 
apply (case_tac "b=0", simp add: power_0_left) 
14577  173 
apply (rule nonzero_power_divide) 
174 
apply assumption 

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

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

176 

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

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

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

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

181 

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

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

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

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

186 
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

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

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

189 
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

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

191 

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

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

194 
apply (induct_tac "n") 
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset

195 
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

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

197 

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

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

200 
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

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

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

203 

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

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

205 
lemma power_Suc_less: 
15004  206 
"[(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

207 
==> a * a^n < a^n" 
14577  208 
apply (induct_tac n) 
209 
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

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

211 

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

212 
lemma power_strict_decreasing: 
15004  213 
"[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

214 
==> a^N < a^n" 
14577  215 
apply (erule rev_mp) 
216 
apply (induct_tac "N") 

217 
apply (auto simp add: power_Suc power_Suc_less less_Suc_eq) 

218 
apply (rename_tac m) 

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

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

221 
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

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

223 

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

224 
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

225 
lemma power_decreasing: 
15004  226 
"[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

227 
==> a^N \<le> a^n" 
14577  228 
apply (erule rev_mp) 
229 
apply (induct_tac "N") 

230 
apply (auto simp add: power_Suc le_Suc_eq) 

231 
apply (rename_tac m) 

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

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

234 
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

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

236 

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

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

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

241 

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

242 
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

243 
lemma power_increasing: 
15004  244 
"[n \<le> N; (1::'a::{ordered_semidom,recpower}) \<le> a] ==> a^n \<le> a^N" 
14577  245 
apply (erule rev_mp) 
246 
apply (induct_tac "N") 

247 
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

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

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

251 
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

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

253 

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

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

255 
lemma power_less_power_Suc: 
15004  256 
"(1::'a::{ordered_semidom,recpower}) < a ==> a^n < a * a^n" 
14577  257 
apply (induct_tac n) 
258 
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

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

260 

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

261 
lemma power_strict_increasing: 
15004  262 
"[n < N; (1::'a::{ordered_semidom,recpower}) < a] ==> a^n < a^N" 
14577  263 
apply (erule rev_mp) 
264 
apply (induct_tac "N") 

265 
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

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

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

269 
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

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

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

272 

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

275 
by (blast intro: power_le_imp_le_exp power_increasing order_less_imp_le) 

276 

277 
lemma power_strict_increasing_iff [simp]: 

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

279 
by (blast intro: power_less_imp_less_exp power_strict_increasing) 

280 

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

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

282 
assumes le: "a ^ Suc n \<le> b ^ Suc n" 
15004  283 
and xnonneg: "(0::'a::{ordered_semidom,recpower}) \<le> a" 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

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

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

288 
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

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

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

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

293 
qed 
14577  294 

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

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

298 
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

299 

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

300 

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

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

302 

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

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

305 
"p ^ (Suc n) = (p::nat) * (p ^ n)" 
14577  306 

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

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

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

311 
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

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

313 

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

314 
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

315 
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

316 

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

317 
lemma le_imp_power_dvd: "!!i::nat. m \<le> n ==> i^m dvd i^n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

318 
apply (unfold dvd_def) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

319 
apply (erule not_less_iff_le [THEN iffD2, THEN add_diff_inverse, THEN subst]) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

322 

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

323 
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

324 
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

325 
@{term "m=1"} and @{term "n=0"}.*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

326 
lemma nat_power_less_imp_less: "!!i::nat. [ 0 < i; i^m < i^n ] ==> m < n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

328 
apply (drule leI [THEN le_imp_power_dvd, THEN dvd_imp_le, THEN leD]) 
14577  329 
apply (erule zero_less_power, auto) 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

330 
done 
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 
lemma nat_zero_less_power_iff [simp]: "(0 < x^n) = (x \<noteq> (0::nat)  n=0)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

333 
by (induct_tac "n", auto) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

334 

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

335 
lemma power_le_dvd [rule_format]: "k^j dvd n > i\<le>j > k^i dvd (n::nat)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

336 
apply (induct_tac "j") 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

338 
apply (blast dest!: dvd_mult_right) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

340 

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

341 
lemma power_dvd_imp_le: "[i^m dvd i^n; (1::nat) < i] ==> m \<le> n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

342 
apply (rule power_le_imp_le_exp, assumption) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

343 
apply (erule dvd_imp_le, simp) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

345 

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

346 

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

347 
subsection{*Binomial Coefficients*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

348 

14577  349 
text{*This development is based on the work of Andy Gordon and 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

350 
Florian Kammueller*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

351 

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

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

353 
binomial :: "[nat,nat] => nat" (infixl "choose" 65) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

354 

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

356 
binomial_0: "(0 choose k) = (if k = 0 then 1 else 0)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

357 

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

358 
binomial_Suc: "(Suc n choose k) = 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

359 
(if k = 0 then 1 else (n choose (k  1)) + (n choose k))" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

360 

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

361 
lemma binomial_n_0 [simp]: "(n choose 0) = 1" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

362 
by (case_tac "n", simp_all) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

363 

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

364 
lemma binomial_0_Suc [simp]: "(0 choose Suc k) = 0" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

366 

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

367 
lemma binomial_Suc_Suc [simp]: 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

368 
"(Suc n choose Suc k) = (n choose k) + (n choose Suc k)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

370 

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

371 
lemma binomial_eq_0 [rule_format]: "\<forall>k. n < k > (n choose k) = 0" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

372 
apply (induct_tac "n", auto) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

373 
apply (erule allE) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

374 
apply (erule mp, arith) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

376 

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

377 
declare binomial_0 [simp del] binomial_Suc [simp del] 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

378 

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

379 
lemma binomial_n_n [simp]: "(n choose n) = 1" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

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

383 

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

384 
lemma binomial_Suc_n [simp]: "(Suc n choose n) = Suc n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

385 
by (induct_tac "n", simp_all) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

386 

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

387 
lemma binomial_1 [simp]: "(n choose Suc 0) = n" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

388 
by (induct_tac "n", simp_all) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

389 

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

390 
lemma zero_less_binomial [rule_format]: "k \<le> n > 0 < (n choose k)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

391 
by (rule_tac m = n and n = k in diff_induct, simp_all) 
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset

392 

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

393 
lemma binomial_eq_0_iff: "(n choose k = 0) = (n<k)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

394 
apply (safe intro!: binomial_eq_0) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

395 
apply (erule contrapos_pp) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

397 
done 
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 
lemma zero_less_binomial_iff: "(0 < n choose k) = (k\<le>n)" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

401 

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

402 
(*Might be more useful if reoriented*) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

403 
lemma Suc_times_binomial_eq [rule_format]: 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

404 
"\<forall>k. k \<le> n > Suc n * (n choose k) = (Suc n choose Suc k) * Suc k" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

406 
apply (simp add: binomial_0, clarify) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

407 
apply (case_tac "k") 
14577  408 
apply (auto simp add: add_mult_distrib add_mult_distrib2 le_Suc_eq 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

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

411 

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

412 
text{*This is the wellknown version, but it's harder to use because of the 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

413 
need to reason about division.*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

415 
"k \<le> n ==> (Suc n choose Suc k) = (Suc n * (n choose k)) div Suc k" 
14577  416 
by (simp add: Suc_times_binomial_eq div_mult_self_is_m zero_less_Suc 
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

417 
del: mult_Suc mult_Suc_right) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

418 

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

419 
text{*Another version, with 1 instead of Suc.*} 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

421 
"[k \<le> n; 0<k] ==> (n choose k) * k = n * ((n  1) choose (k  1))" 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

422 
apply (cut_tac n = "n  1" and k = "k  1" in Suc_times_binomial_eq) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

423 
apply (simp split add: nat_diff_split, auto) 
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset

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

425 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

444 
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

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

446 
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

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

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

449 
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

450 
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

451 
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

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

453 
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

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

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

456 
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

457 
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

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

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

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

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

462 
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

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

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

465 
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

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

467 
*} 
14577  468 

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

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

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

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

472 
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

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

474 
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

475 
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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

492 

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

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

494 