author | wenzelm |
Wed, 29 Aug 2007 11:10:28 +0200 | |
changeset 24470 | 41c81e23c08d |
parent 24376 | e403ab5c9415 |
child 24996 | ebd5f4cc7118 |
permissions | -rw-r--r-- |
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
1 |
(* Title: HOL/Power.thy |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
2 |
ID: $Id$ |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
4 |
Copyright 1997 University of Cambridge |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
5 |
|
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
6 |
*) |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
7 |
|
16733
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
15251
diff
changeset
|
8 |
header{*Exponentiation*} |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
9 |
|
15131 | 10 |
theory Power |
21413 | 11 |
imports Nat |
15131 | 12 |
begin |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
13 |
|
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
14 |
subsection{*Powers for Arbitrary Monoids*} |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
15 |
|
22390 | 16 |
class recpower = monoid_mult + power + |
17 |
assumes power_0 [simp]: "a \<^loc>^ 0 = \<^loc>1" |
|
18 |
assumes power_Suc: "a \<^loc>^ Suc n = a \<^loc>* (a \<^loc>^ n)" |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
19 |
|
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
20 |
lemma power_0_Suc [simp]: "(0::'a::{recpower,semiring_0}) ^ (Suc n) = 0" |
23183 | 21 |
by (simp add: power_Suc) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
22 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
23 |
text{*It looks plausible as a simprule, but its effect can be strange.*} |
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
24 |
lemma power_0_left: "0^n = (if n=0 then 1 else (0::'a::{recpower,semiring_0}))" |
23183 | 25 |
by (induct n) simp_all |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
26 |
|
15004 | 27 |
lemma power_one [simp]: "1^n = (1::'a::recpower)" |
23183 | 28 |
by (induct n) (simp_all add: power_Suc) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
29 |
|
15004 | 30 |
lemma power_one_right [simp]: "(a::'a::recpower) ^ 1 = a" |
23183 | 31 |
by (simp add: power_Suc) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
32 |
|
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
33 |
lemma power_commutes: "(a::'a::recpower) ^ n * a = a * a ^ n" |
23183 | 34 |
by (induct n) (simp_all add: power_Suc mult_assoc) |
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
35 |
|
15004 | 36 |
lemma power_add: "(a::'a::recpower) ^ (m+n) = (a^m) * (a^n)" |
23183 | 37 |
by (induct m) (simp_all add: power_Suc mult_ac) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
38 |
|
15004 | 39 |
lemma power_mult: "(a::'a::recpower) ^ (m*n) = (a^m) ^ n" |
23183 | 40 |
by (induct n) (simp_all add: power_Suc power_add) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
41 |
|
21199
2d83f93c3580
* Added annihilation axioms ("x * 0 = 0") to axclass semiring_0.
krauss
parents:
17149
diff
changeset
|
42 |
lemma power_mult_distrib: "((a::'a::{recpower,comm_monoid_mult}) * b) ^ n = (a^n) * (b^n)" |
23183 | 43 |
by (induct n) (simp_all add: power_Suc mult_ac) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
44 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
45 |
lemma zero_less_power: |
15004 | 46 |
"0 < (a::'a::{ordered_semidom,recpower}) ==> 0 < a^n" |
15251 | 47 |
apply (induct "n") |
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
48 |
apply (simp_all add: power_Suc zero_less_one mult_pos_pos) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
49 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
50 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
51 |
lemma zero_le_power: |
15004 | 52 |
"0 \<le> (a::'a::{ordered_semidom,recpower}) ==> 0 \<le> a^n" |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
53 |
apply (simp add: order_le_less) |
14577 | 54 |
apply (erule disjE) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
55 |
apply (simp_all add: zero_less_power zero_less_one power_0_left) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
56 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
57 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
58 |
lemma one_le_power: |
15004 | 59 |
"1 \<le> (a::'a::{ordered_semidom,recpower}) ==> 1 \<le> a^n" |
15251 | 60 |
apply (induct "n") |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
61 |
apply (simp_all add: power_Suc) |
14577 | 62 |
apply (rule order_trans [OF _ mult_mono [of 1 _ 1]]) |
63 |
apply (simp_all add: zero_le_one order_trans [OF zero_le_one]) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
64 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
65 |
|
14738 | 66 |
lemma gt1_imp_ge0: "1 < a ==> 0 \<le> (a::'a::ordered_semidom)" |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
67 |
by (simp add: order_trans [OF zero_le_one order_less_imp_le]) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
68 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
69 |
lemma power_gt1_lemma: |
15004 | 70 |
assumes gt1: "1 < (a::'a::{ordered_semidom,recpower})" |
14577 | 71 |
shows "1 < a * a^n" |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
72 |
proof - |
14577 | 73 |
have "1*1 < a*1" using gt1 by simp |
74 |
also have "\<dots> \<le> a * a^n" using gt1 |
|
75 |
by (simp only: mult_mono gt1_imp_ge0 one_le_power order_less_imp_le |
|
76 |
zero_le_one order_refl) |
|
77 |
finally show ?thesis by simp |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
78 |
qed |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
79 |
|
24376 | 80 |
lemma one_less_power: |
81 |
"\<lbrakk>1 < (a::'a::{ordered_semidom,recpower}); 0 < n\<rbrakk> \<Longrightarrow> 1 < a ^ n" |
|
82 |
by (cases n, simp_all add: power_gt1_lemma power_Suc) |
|
83 |
||
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
84 |
lemma power_gt1: |
15004 | 85 |
"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
|
86 |
by (simp add: power_gt1_lemma power_Suc) |
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_le_imp_le_exp: |
15004 | 89 |
assumes gt1: "(1::'a::{recpower,ordered_semidom}) < a" |
14577 | 90 |
shows "!!n. a^m \<le> a^n ==> m \<le> n" |
91 |
proof (induct m) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
92 |
case 0 |
14577 | 93 |
show ?case by simp |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
94 |
next |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
95 |
case (Suc m) |
14577 | 96 |
show ?case |
97 |
proof (cases n) |
|
98 |
case 0 |
|
99 |
from prems have "a * a^m \<le> 1" by (simp add: power_Suc) |
|
100 |
with gt1 show ?thesis |
|
101 |
by (force simp only: power_gt1_lemma |
|
102 |
linorder_not_less [symmetric]) |
|
103 |
next |
|
104 |
case (Suc n) |
|
105 |
from prems show ?thesis |
|
106 |
by (force dest: mult_left_le_imp_le |
|
107 |
simp add: power_Suc order_less_trans [OF zero_less_one gt1]) |
|
108 |
qed |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
109 |
qed |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
110 |
|
14577 | 111 |
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
|
112 |
lemma power_inject_exp [simp]: |
15004 | 113 |
"1 < (a::'a::{ordered_semidom,recpower}) ==> (a^m = a^n) = (m=n)" |
14577 | 114 |
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
|
115 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
116 |
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
|
117 |
natural numbers.*} |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
118 |
lemma power_less_imp_less_exp: |
15004 | 119 |
"[| (1::'a::{recpower,ordered_semidom}) < a; a^m < a^n |] ==> m < n" |
14577 | 120 |
by (simp add: order_less_le [of m n] order_less_le [of "a^m" "a^n"] |
121 |
power_le_imp_le_exp) |
|
14348
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 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
124 |
lemma power_mono: |
15004 | 125 |
"[|a \<le> b; (0::'a::{recpower,ordered_semidom}) \<le> a|] ==> a^n \<le> b^n" |
15251 | 126 |
apply (induct "n") |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
127 |
apply (simp_all add: power_Suc) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
128 |
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
|
129 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
130 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
131 |
lemma power_strict_mono [rule_format]: |
15004 | 132 |
"[|a < b; (0::'a::{recpower,ordered_semidom}) \<le> a|] |
14577 | 133 |
==> 0 < n --> a^n < b^n" |
15251 | 134 |
apply (induct "n") |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
135 |
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
|
136 |
order_le_less_trans [of 0 a b]) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
137 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
138 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
139 |
lemma power_eq_0_iff [simp]: |
23544 | 140 |
"(a^n = 0) = (a = (0::'a::{ring_1_no_zero_divisors,recpower}) & 0<n)" |
15251 | 141 |
apply (induct "n") |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
142 |
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
|
143 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
144 |
|
22991 | 145 |
lemma field_power_eq_0_iff: |
22988
f6b8184f5b4a
generalize some lemmas from field to division_ring
huffman
parents:
22957
diff
changeset
|
146 |
"(a^n = 0) = (a = (0::'a::{division_ring,recpower}) & 0<n)" |
22991 | 147 |
by simp (* TODO: delete *) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
148 |
|
23544 | 149 |
lemma field_power_not_zero: "a \<noteq> (0::'a::{ring_1_no_zero_divisors,recpower}) ==> a^n \<noteq> 0" |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
150 |
by force |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
151 |
|
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
152 |
lemma nonzero_power_inverse: |
22991 | 153 |
fixes a :: "'a::{division_ring,recpower}" |
154 |
shows "a \<noteq> 0 ==> inverse (a ^ n) = (inverse a) ^ n" |
|
15251 | 155 |
apply (induct "n") |
22988
f6b8184f5b4a
generalize some lemmas from field to division_ring
huffman
parents:
22957
diff
changeset
|
156 |
apply (auto simp add: power_Suc nonzero_inverse_mult_distrib power_commutes) |
22991 | 157 |
done (* TODO: reorient or rename to nonzero_inverse_power *) |
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
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: |
22991 | 161 |
fixes a :: "'a::{division_ring,division_by_zero,recpower}" |
162 |
shows "inverse (a ^ n) = (inverse a) ^ n" |
|
163 |
apply (cases "a = 0") |
|
164 |
apply (simp add: power_0_left) |
|
165 |
apply (simp add: nonzero_power_inverse) |
|
166 |
done (* TODO: reorient or rename to inverse_power *) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
167 |
|
16775
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
168 |
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
|
169 |
(1 / a)^n" |
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
170 |
apply (simp add: divide_inverse) |
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
171 |
apply (rule power_inverse) |
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
172 |
done |
c1b87ef4a1c3
added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents:
16733
diff
changeset
|
173 |
|
14577 | 174 |
lemma nonzero_power_divide: |
15004 | 175 |
"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
|
176 |
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
|
177 |
|
14577 | 178 |
lemma power_divide: |
15004 | 179 |
"(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
|
180 |
apply (case_tac "b=0", simp add: power_0_left) |
14577 | 181 |
apply (rule nonzero_power_divide) |
182 |
apply assumption |
|
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
183 |
done |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
184 |
|
15004 | 185 |
lemma power_abs: "abs(a ^ n) = abs(a::'a::{ordered_idom,recpower}) ^ n" |
15251 | 186 |
apply (induct "n") |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
187 |
apply (auto simp add: power_Suc abs_mult) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
188 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
189 |
|
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
23544
diff
changeset
|
190 |
lemma zero_less_power_abs_iff [simp,noatp]: |
15004 | 191 |
"(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
|
192 |
proof (induct "n") |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
193 |
case 0 |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
194 |
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
|
195 |
next |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
196 |
case (Suc n) |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
197 |
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
|
198 |
qed |
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
199 |
|
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
200 |
lemma zero_le_power_abs [simp]: |
15004 | 201 |
"(0::'a::{ordered_idom,recpower}) \<le> (abs a)^n" |
22957 | 202 |
by (rule zero_le_power [OF abs_ge_zero]) |
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
203 |
|
15004 | 204 |
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
|
205 |
proof - |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
206 |
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
|
207 |
thus ?thesis by (simp only: power_mult_distrib) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
208 |
qed |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
209 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
210 |
text{*Lemma for @{text power_strict_decreasing}*} |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
211 |
lemma power_Suc_less: |
15004 | 212 |
"[|(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
|
213 |
==> a * a^n < a^n" |
15251 | 214 |
apply (induct n) |
14577 | 215 |
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
|
216 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
217 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
218 |
lemma power_strict_decreasing: |
15004 | 219 |
"[|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
|
220 |
==> a^N < a^n" |
14577 | 221 |
apply (erule rev_mp) |
15251 | 222 |
apply (induct "N") |
14577 | 223 |
apply (auto simp add: power_Suc power_Suc_less less_Suc_eq) |
224 |
apply (rename_tac m) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
225 |
apply (subgoal_tac "a * a^m < 1 * a^n", simp) |
14577 | 226 |
apply (rule mult_strict_mono) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
227 |
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
|
228 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
229 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
230 |
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
|
231 |
lemma power_decreasing: |
15004 | 232 |
"[|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
|
233 |
==> a^N \<le> a^n" |
14577 | 234 |
apply (erule rev_mp) |
15251 | 235 |
apply (induct "N") |
14577 | 236 |
apply (auto simp add: power_Suc le_Suc_eq) |
237 |
apply (rename_tac m) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
238 |
apply (subgoal_tac "a * a^m \<le> 1 * a^n", simp) |
14577 | 239 |
apply (rule mult_mono) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
240 |
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
|
241 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
242 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
243 |
lemma power_Suc_less_one: |
15004 | 244 |
"[| 0 < a; a < (1::'a::{ordered_semidom,recpower}) |] ==> a ^ Suc n < 1" |
14577 | 245 |
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
|
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 |
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
|
249 |
lemma power_increasing: |
15004 | 250 |
"[|n \<le> N; (1::'a::{ordered_semidom,recpower}) \<le> a|] ==> a^n \<le> a^N" |
14577 | 251 |
apply (erule rev_mp) |
15251 | 252 |
apply (induct "N") |
14577 | 253 |
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
|
254 |
apply (rename_tac m) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
255 |
apply (subgoal_tac "1 * a^n \<le> a * a^m", simp) |
14577 | 256 |
apply (rule mult_mono) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
257 |
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
|
258 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
259 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
260 |
text{*Lemma for @{text power_strict_increasing}*} |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
261 |
lemma power_less_power_Suc: |
15004 | 262 |
"(1::'a::{ordered_semidom,recpower}) < a ==> a^n < a * a^n" |
15251 | 263 |
apply (induct n) |
14577 | 264 |
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
|
265 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
266 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
267 |
lemma power_strict_increasing: |
15004 | 268 |
"[|n < N; (1::'a::{ordered_semidom,recpower}) < a|] ==> a^n < a^N" |
14577 | 269 |
apply (erule rev_mp) |
15251 | 270 |
apply (induct "N") |
14577 | 271 |
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
|
272 |
apply (rename_tac m) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
273 |
apply (subgoal_tac "1 * a^n < a * a^m", simp) |
14577 | 274 |
apply (rule mult_strict_mono) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
275 |
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
|
276 |
order_less_imp_le) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
277 |
done |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
278 |
|
15066 | 279 |
lemma power_increasing_iff [simp]: |
280 |
"1 < (b::'a::{ordered_semidom,recpower}) ==> (b ^ x \<le> b ^ y) = (x \<le> y)" |
|
281 |
by (blast intro: power_le_imp_le_exp power_increasing order_less_imp_le) |
|
282 |
||
283 |
lemma power_strict_increasing_iff [simp]: |
|
284 |
"1 < (b::'a::{ordered_semidom,recpower}) ==> (b ^ x < b ^ y) = (x < y)" |
|
285 |
by (blast intro: power_less_imp_less_exp power_strict_increasing) |
|
286 |
||
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
287 |
lemma power_le_imp_le_base: |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
288 |
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
|
289 |
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
|
290 |
shows "a \<le> b" |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
291 |
proof (rule ccontr) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
292 |
assume "~ a \<le> b" |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
293 |
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
|
294 |
then have "b ^ Suc n < a ^ Suc n" |
14577 | 295 |
by (simp only: prems power_strict_mono) |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
296 |
from le and this show "False" |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
297 |
by (simp add: linorder_not_less [symmetric]) |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
298 |
qed |
14577 | 299 |
|
22853 | 300 |
lemma power_less_imp_less_base: |
301 |
fixes a b :: "'a::{ordered_semidom,recpower}" |
|
302 |
assumes less: "a ^ n < b ^ n" |
|
303 |
assumes nonneg: "0 \<le> b" |
|
304 |
shows "a < b" |
|
305 |
proof (rule contrapos_pp [OF less]) |
|
306 |
assume "~ a < b" |
|
307 |
hence "b \<le> a" by (simp only: linorder_not_less) |
|
308 |
hence "b ^ n \<le> a ^ n" using nonneg by (rule power_mono) |
|
309 |
thus "~ a ^ n < b ^ n" by (simp only: linorder_not_less) |
|
310 |
qed |
|
311 |
||
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
312 |
lemma power_inject_base: |
14577 | 313 |
"[| a ^ Suc n = b ^ Suc n; 0 \<le> a; 0 \<le> b |] |
15004 | 314 |
==> a = (b::'a::{ordered_semidom,recpower})" |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
315 |
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
|
316 |
|
22955 | 317 |
lemma power_eq_imp_eq_base: |
318 |
fixes a b :: "'a::{ordered_semidom,recpower}" |
|
319 |
shows "\<lbrakk>a ^ n = b ^ n; 0 \<le> a; 0 \<le> b; 0 < n\<rbrakk> \<Longrightarrow> a = b" |
|
320 |
by (cases n, simp_all, rule power_inject_base) |
|
321 |
||
14348
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 |
subsection{*Exponentiation for the Natural Numbers*} |
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
324 |
|
21456 | 325 |
instance nat :: power .. |
326 |
||
8844 | 327 |
primrec (power) |
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
328 |
"p ^ 0 = 1" |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
329 |
"p ^ (Suc n) = (p::nat) * (p ^ n)" |
14577 | 330 |
|
15004 | 331 |
instance nat :: recpower |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
332 |
proof |
14438 | 333 |
fix z n :: nat |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
334 |
show "z^0 = 1" by simp |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
335 |
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
|
336 |
qed |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
337 |
|
23305 | 338 |
lemma of_nat_power: |
339 |
"of_nat (m ^ n) = (of_nat m::'a::{semiring_1,recpower}) ^ n" |
|
23431
25ca91279a9b
change simp rules for of_nat to work like int did previously (reorient of_nat_Suc, remove of_nat_mult [simp]); preserve original variable names in legacy int theorems
huffman
parents:
23305
diff
changeset
|
340 |
by (induct n, simp_all add: power_Suc of_nat_mult) |
23305 | 341 |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
342 |
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
|
343 |
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
|
344 |
|
21413 | 345 |
lemma nat_zero_less_power_iff [simp]: "(0 < x^n) = (x \<noteq> (0::nat) | n=0)" |
346 |
by (induct "n", auto) |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
347 |
|
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
348 |
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
|
349 |
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
|
350 |
@{term "m=1"} and @{term "n=0"}.*} |
21413 | 351 |
lemma nat_power_less_imp_less: |
352 |
assumes nonneg: "0 < (i\<Colon>nat)" |
|
353 |
assumes less: "i^m < i^n" |
|
354 |
shows "m < n" |
|
355 |
proof (cases "i = 1") |
|
356 |
case True with less power_one [where 'a = nat] show ?thesis by simp |
|
357 |
next |
|
358 |
case False with nonneg have "1 < i" by auto |
|
359 |
from power_strict_increasing_iff [OF this] less show ?thesis .. |
|
360 |
qed |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
361 |
|
17149
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
362 |
lemma power_diff: |
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
363 |
assumes nz: "a ~= 0" |
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
364 |
shows "n <= m ==> (a::'a::{recpower, field}) ^ (m-n) = (a^m) / (a^n)" |
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
365 |
by (induct m n rule: diff_induct) |
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
366 |
(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
|
367 |
|
e2b19c92ef51
Lemmas on dvd, power and finite summation added or strengthened.
ballarin
parents:
16796
diff
changeset
|
368 |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
369 |
text{*ML bindings for the general exponentiation theorems*} |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
370 |
ML |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
371 |
{* |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
372 |
val power_0 = thm"power_0"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
373 |
val power_Suc = thm"power_Suc"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
374 |
val power_0_Suc = thm"power_0_Suc"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
375 |
val power_0_left = thm"power_0_left"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
376 |
val power_one = thm"power_one"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
377 |
val power_one_right = thm"power_one_right"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
378 |
val power_add = thm"power_add"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
379 |
val power_mult = thm"power_mult"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
380 |
val power_mult_distrib = thm"power_mult_distrib"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
381 |
val zero_less_power = thm"zero_less_power"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
382 |
val zero_le_power = thm"zero_le_power"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
383 |
val one_le_power = thm"one_le_power"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
384 |
val gt1_imp_ge0 = thm"gt1_imp_ge0"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
385 |
val power_gt1_lemma = thm"power_gt1_lemma"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
386 |
val power_gt1 = thm"power_gt1"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
387 |
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
|
388 |
val power_inject_exp = thm"power_inject_exp"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
389 |
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
|
390 |
val power_mono = thm"power_mono"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
391 |
val power_strict_mono = thm"power_strict_mono"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
392 |
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
|
393 |
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
|
394 |
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
|
395 |
val power_inverse = thm"power_inverse"; |
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
396 |
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
|
397 |
val power_divide = thm"power_divide"; |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
398 |
val power_abs = thm"power_abs"; |
14353
79f9fbef9106
Added lemmas to Ring_and_Field with slightly modified simplification rules
paulson
parents:
14348
diff
changeset
|
399 |
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
|
400 |
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
|
401 |
val power_minus = thm"power_minus"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
402 |
val power_Suc_less = thm"power_Suc_less"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
403 |
val power_strict_decreasing = thm"power_strict_decreasing"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
404 |
val power_decreasing = thm"power_decreasing"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
405 |
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
|
406 |
val power_increasing = thm"power_increasing"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
407 |
val power_strict_increasing = thm"power_strict_increasing"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
408 |
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
|
409 |
val power_inject_base = thm"power_inject_base"; |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
410 |
*} |
14577 | 411 |
|
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
412 |
text{*ML bindings for the remaining theorems*} |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
413 |
ML |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
414 |
{* |
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
8844
diff
changeset
|
415 |
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
|
416 |
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
|
417 |
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
|
418 |
*} |
3390
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
419 |
|
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
420 |
end |
0c7625196d95
New theory "Power" of exponentiation (and binomial coefficients)
paulson
parents:
diff
changeset
|
421 |