src/HOL/Parity.thy
author wenzelm
Thu May 24 17:25:53 2012 +0200 (2012-05-24)
changeset 47988 e4b69e10b990
parent 47225 650318981557
child 54227 63b441f49645
permissions -rw-r--r--
tuned proofs;
wenzelm@41959
     1
(*  Title:      HOL/Parity.thy
wenzelm@41959
     2
    Author:     Jeremy Avigad
wenzelm@41959
     3
    Author:     Jacques D. Fleuriot
wenzelm@21256
     4
*)
wenzelm@21256
     5
wenzelm@21256
     6
header {* Even and Odd for int and nat *}
wenzelm@21256
     7
wenzelm@21256
     8
theory Parity
haftmann@30738
     9
imports Main
wenzelm@21256
    10
begin
wenzelm@21256
    11
haftmann@29608
    12
class even_odd = 
haftmann@22390
    13
  fixes even :: "'a \<Rightarrow> bool"
wenzelm@21256
    14
wenzelm@21256
    15
abbreviation
haftmann@22390
    16
  odd :: "'a\<Colon>even_odd \<Rightarrow> bool" where
haftmann@22390
    17
  "odd x \<equiv> \<not> even x"
haftmann@22390
    18
haftmann@26259
    19
instantiation nat and int  :: even_odd
haftmann@25571
    20
begin
haftmann@25571
    21
haftmann@25571
    22
definition
haftmann@25571
    23
  even_def [presburger]: "even x \<longleftrightarrow> (x\<Colon>int) mod 2 = 0"
haftmann@22390
    24
haftmann@25571
    25
definition
haftmann@25571
    26
  even_nat_def [presburger]: "even x \<longleftrightarrow> even (int x)"
haftmann@25571
    27
haftmann@25571
    28
instance ..
haftmann@25571
    29
haftmann@25571
    30
end
wenzelm@21256
    31
haftmann@33318
    32
lemma transfer_int_nat_relations:
haftmann@33318
    33
  "even (int x) \<longleftrightarrow> even x"
haftmann@33318
    34
  by (simp add: even_nat_def)
haftmann@33318
    35
haftmann@35644
    36
declare transfer_morphism_int_nat[transfer add return:
haftmann@33318
    37
  transfer_int_nat_relations
haftmann@33318
    38
]
wenzelm@21256
    39
nipkow@31148
    40
lemma even_zero_int[simp]: "even (0::int)" by presburger
nipkow@31148
    41
nipkow@31148
    42
lemma odd_one_int[simp]: "odd (1::int)" by presburger
nipkow@31148
    43
nipkow@31148
    44
lemma even_zero_nat[simp]: "even (0::nat)" by presburger
nipkow@31148
    45
nipkow@31718
    46
lemma odd_1_nat [simp]: "odd (1::nat)" by presburger
nipkow@31148
    47
huffman@47224
    48
lemma even_numeral_int [simp]: "even (numeral (Num.Bit0 k) :: int)"
huffman@47224
    49
  unfolding even_def by simp
huffman@47224
    50
huffman@47224
    51
lemma odd_numeral_int [simp]: "odd (numeral (Num.Bit1 k) :: int)"
huffman@47224
    52
  unfolding even_def by simp
huffman@47224
    53
huffman@47108
    54
(* TODO: proper simp rules for Num.Bit0, Num.Bit1 *)
huffman@47108
    55
declare even_def[of "neg_numeral v", simp] for v
nipkow@31148
    56
huffman@47224
    57
lemma even_numeral_nat [simp]: "even (numeral (Num.Bit0 k) :: nat)"
huffman@47224
    58
  unfolding even_nat_def by simp
huffman@47224
    59
huffman@47224
    60
lemma odd_numeral_nat [simp]: "odd (numeral (Num.Bit1 k) :: nat)"
huffman@47224
    61
  unfolding even_nat_def by simp
nipkow@31148
    62
wenzelm@21256
    63
subsection {* Even and odd are mutually exclusive *}
wenzelm@21256
    64
wenzelm@21263
    65
lemma int_pos_lt_two_imp_zero_or_one:
wenzelm@21256
    66
    "0 <= x ==> (x::int) < 2 ==> x = 0 | x = 1"
chaieb@23522
    67
  by presburger
wenzelm@21256
    68
chaieb@23522
    69
lemma neq_one_mod_two [simp, presburger]: 
chaieb@23522
    70
  "((x::int) mod 2 ~= 0) = (x mod 2 = 1)" by presburger
wenzelm@21256
    71
haftmann@25600
    72
wenzelm@21256
    73
subsection {* Behavior under integer arithmetic operations *}
chaieb@27668
    74
declare dvd_def[algebra]
chaieb@27668
    75
lemma nat_even_iff_2_dvd[algebra]: "even (x::nat) \<longleftrightarrow> 2 dvd x"
huffman@36840
    76
  by presburger
chaieb@27668
    77
lemma int_even_iff_2_dvd[algebra]: "even (x::int) \<longleftrightarrow> 2 dvd x"
chaieb@27668
    78
  by presburger
wenzelm@21256
    79
wenzelm@21256
    80
lemma even_times_anything: "even (x::int) ==> even (x * y)"
chaieb@27668
    81
  by algebra
wenzelm@21256
    82
chaieb@27668
    83
lemma anything_times_even: "even (y::int) ==> even (x * y)" by algebra
wenzelm@21256
    84
chaieb@27668
    85
lemma odd_times_odd: "odd (x::int) ==> odd y ==> odd (x * y)" 
huffman@47163
    86
  by (simp add: even_def mod_mult_right_eq)
wenzelm@21256
    87
nipkow@31148
    88
lemma even_product[simp,presburger]: "even((x::int) * y) = (even x | even y)"
wenzelm@21263
    89
  apply (auto simp add: even_times_anything anything_times_even)
wenzelm@21256
    90
  apply (rule ccontr)
wenzelm@21256
    91
  apply (auto simp add: odd_times_odd)
wenzelm@21256
    92
  done
wenzelm@21256
    93
wenzelm@21256
    94
lemma even_plus_even: "even (x::int) ==> even y ==> even (x + y)"
nipkow@31148
    95
by presburger
wenzelm@21256
    96
wenzelm@21256
    97
lemma even_plus_odd: "even (x::int) ==> odd y ==> odd (x + y)"
nipkow@31148
    98
by presburger
wenzelm@21256
    99
wenzelm@21256
   100
lemma odd_plus_even: "odd (x::int) ==> even y ==> odd (x + y)"
nipkow@31148
   101
by presburger
wenzelm@21256
   102
chaieb@23522
   103
lemma odd_plus_odd: "odd (x::int) ==> odd y ==> even (x + y)" by presburger
wenzelm@21256
   104
nipkow@31148
   105
lemma even_sum[simp,presburger]:
nipkow@31148
   106
  "even ((x::int) + y) = ((even x & even y) | (odd x & odd y))"
nipkow@31148
   107
by presburger
wenzelm@21256
   108
nipkow@31148
   109
lemma even_neg[simp,presburger,algebra]: "even (-(x::int)) = even x"
nipkow@31148
   110
by presburger
wenzelm@21256
   111
nipkow@31148
   112
lemma even_difference[simp]:
chaieb@23522
   113
    "even ((x::int) - y) = ((even x & even y) | (odd x & odd y))" by presburger
wenzelm@21256
   114
nipkow@31148
   115
lemma even_power[simp,presburger]: "even ((x::int)^n) = (even x & n \<noteq> 0)"
nipkow@31148
   116
by (induct n) auto
wenzelm@21256
   117
nipkow@31148
   118
lemma odd_pow: "odd x ==> odd((x::int)^n)" by simp
wenzelm@21256
   119
wenzelm@21256
   120
wenzelm@21256
   121
subsection {* Equivalent definitions *}
wenzelm@21256
   122
chaieb@23522
   123
lemma two_times_even_div_two: "even (x::int) ==> 2 * (x div 2) = x" 
nipkow@31148
   124
by presburger
wenzelm@21256
   125
nipkow@31148
   126
lemma two_times_odd_div_two_plus_one:
nipkow@31148
   127
  "odd (x::int) ==> 2 * (x div 2) + 1 = x"
nipkow@31148
   128
by presburger
wenzelm@21256
   129
chaieb@23522
   130
lemma even_equiv_def: "even (x::int) = (EX y. x = 2 * y)" by presburger
wenzelm@21256
   131
chaieb@23522
   132
lemma odd_equiv_def: "odd (x::int) = (EX y. x = 2 * y + 1)" by presburger
wenzelm@21256
   133
wenzelm@21256
   134
subsection {* even and odd for nats *}
wenzelm@21256
   135
wenzelm@21256
   136
lemma pos_int_even_equiv_nat_even: "0 \<le> x ==> even x = even (nat x)"
nipkow@31148
   137
by (simp add: even_nat_def)
wenzelm@21256
   138
nipkow@31148
   139
lemma even_product_nat[simp,presburger,algebra]:
nipkow@31148
   140
  "even((x::nat) * y) = (even x | even y)"
nipkow@31148
   141
by (simp add: even_nat_def int_mult)
wenzelm@21256
   142
nipkow@31148
   143
lemma even_sum_nat[simp,presburger,algebra]:
nipkow@31148
   144
  "even ((x::nat) + y) = ((even x & even y) | (odd x & odd y))"
chaieb@23522
   145
by presburger
wenzelm@21256
   146
nipkow@31148
   147
lemma even_difference_nat[simp,presburger,algebra]:
nipkow@31148
   148
  "even ((x::nat) - y) = (x < y | (even x & even y) | (odd x & odd y))"
nipkow@31148
   149
by presburger
wenzelm@21256
   150
nipkow@31148
   151
lemma even_Suc[simp,presburger,algebra]: "even (Suc x) = odd x"
nipkow@31148
   152
by presburger
wenzelm@21256
   153
nipkow@31148
   154
lemma even_power_nat[simp,presburger,algebra]:
nipkow@31148
   155
  "even ((x::nat)^y) = (even x & 0 < y)"
nipkow@31148
   156
by (simp add: even_nat_def int_power)
wenzelm@21256
   157
wenzelm@21256
   158
wenzelm@21256
   159
subsection {* Equivalent definitions *}
wenzelm@21256
   160
nipkow@31148
   161
lemma nat_lt_two_imp_zero_or_one:
nipkow@31148
   162
  "(x::nat) < Suc (Suc 0) ==> x = 0 | x = Suc 0"
nipkow@31148
   163
by presburger
wenzelm@21256
   164
wenzelm@21256
   165
lemma even_nat_mod_two_eq_zero: "even (x::nat) ==> x mod (Suc (Suc 0)) = 0"
nipkow@31148
   166
by presburger
wenzelm@21256
   167
wenzelm@21256
   168
lemma odd_nat_mod_two_eq_one: "odd (x::nat) ==> x mod (Suc (Suc 0)) = Suc 0"
chaieb@23522
   169
by presburger
wenzelm@21256
   170
wenzelm@21263
   171
lemma even_nat_equiv_def: "even (x::nat) = (x mod Suc (Suc 0) = 0)"
nipkow@31148
   172
by presburger
wenzelm@21256
   173
wenzelm@21256
   174
lemma odd_nat_equiv_def: "odd (x::nat) = (x mod Suc (Suc 0) = Suc 0)"
nipkow@31148
   175
by presburger
wenzelm@21256
   176
wenzelm@21263
   177
lemma even_nat_div_two_times_two: "even (x::nat) ==>
chaieb@23522
   178
    Suc (Suc 0) * (x div Suc (Suc 0)) = x" by presburger
wenzelm@21256
   179
wenzelm@21263
   180
lemma odd_nat_div_two_times_two_plus_one: "odd (x::nat) ==>
chaieb@23522
   181
    Suc( Suc (Suc 0) * (x div Suc (Suc 0))) = x" by presburger
wenzelm@21256
   182
wenzelm@21256
   183
lemma even_nat_equiv_def2: "even (x::nat) = (EX y. x = Suc (Suc 0) * y)"
nipkow@31148
   184
by presburger
wenzelm@21256
   185
wenzelm@21256
   186
lemma odd_nat_equiv_def2: "odd (x::nat) = (EX y. x = Suc(Suc (Suc 0) * y))"
nipkow@31148
   187
by presburger
wenzelm@21256
   188
haftmann@25600
   189
wenzelm@21256
   190
subsection {* Parity and powers *}
wenzelm@21256
   191
wenzelm@21263
   192
lemma  minus_one_even_odd_power:
haftmann@31017
   193
     "(even x --> (- 1::'a::{comm_ring_1})^x = 1) &
wenzelm@21256
   194
      (odd x --> (- 1::'a)^x = - 1)"
wenzelm@21256
   195
  apply (induct x)
wenzelm@21256
   196
  apply (rule conjI)
wenzelm@21256
   197
  apply simp
nipkow@31148
   198
  apply (insert even_zero_nat, blast)
huffman@35216
   199
  apply simp
wenzelm@21263
   200
  done
wenzelm@21256
   201
wenzelm@21256
   202
lemma minus_one_even_power [simp]:
haftmann@31017
   203
    "even x ==> (- 1::'a::{comm_ring_1})^x = 1"
wenzelm@21263
   204
  using minus_one_even_odd_power by blast
wenzelm@21256
   205
wenzelm@21256
   206
lemma minus_one_odd_power [simp]:
haftmann@31017
   207
    "odd x ==> (- 1::'a::{comm_ring_1})^x = - 1"
wenzelm@21263
   208
  using minus_one_even_odd_power by blast
wenzelm@21256
   209
wenzelm@21256
   210
lemma neg_one_even_odd_power:
huffman@47108
   211
     "(even x --> (-1::'a::{comm_ring_1})^x = 1) &
wenzelm@21256
   212
      (odd x --> (-1::'a)^x = -1)"
wenzelm@21256
   213
  apply (induct x)
huffman@35216
   214
  apply (simp, simp)
wenzelm@21256
   215
  done
wenzelm@21256
   216
wenzelm@21256
   217
lemma neg_one_even_power [simp]:
huffman@47108
   218
    "even x ==> (-1::'a::{comm_ring_1})^x = 1"
wenzelm@21263
   219
  using neg_one_even_odd_power by blast
wenzelm@21256
   220
wenzelm@21256
   221
lemma neg_one_odd_power [simp]:
huffman@47108
   222
    "odd x ==> (-1::'a::{comm_ring_1})^x = -1"
wenzelm@21263
   223
  using neg_one_even_odd_power by blast
wenzelm@21256
   224
wenzelm@21256
   225
lemma neg_power_if:
haftmann@31017
   226
     "(-x::'a::{comm_ring_1}) ^ n =
wenzelm@21256
   227
      (if even n then (x ^ n) else -(x ^ n))"
wenzelm@21263
   228
  apply (induct n)
huffman@35216
   229
  apply simp_all
wenzelm@21263
   230
  done
wenzelm@21256
   231
wenzelm@21263
   232
lemma zero_le_even_power: "even n ==>
huffman@35631
   233
    0 <= (x::'a::{linordered_ring,monoid_mult}) ^ n"
wenzelm@21256
   234
  apply (simp add: even_nat_equiv_def2)
wenzelm@21256
   235
  apply (erule exE)
wenzelm@21256
   236
  apply (erule ssubst)
wenzelm@21256
   237
  apply (subst power_add)
wenzelm@21256
   238
  apply (rule zero_le_square)
wenzelm@21256
   239
  done
wenzelm@21256
   240
wenzelm@21263
   241
lemma zero_le_odd_power: "odd n ==>
haftmann@35028
   242
    (0 <= (x::'a::{linordered_idom}) ^ n) = (0 <= x)"
huffman@35216
   243
apply (auto simp: odd_nat_equiv_def2 power_add zero_le_mult_iff)
haftmann@36722
   244
apply (metis field_power_not_zero divisors_zero order_antisym_conv zero_le_square)
nipkow@30056
   245
done
wenzelm@21256
   246
haftmann@35028
   247
lemma zero_le_power_eq[presburger]: "(0 <= (x::'a::{linordered_idom}) ^ n) =
wenzelm@21256
   248
    (even n | (odd n & 0 <= x))"
wenzelm@21256
   249
  apply auto
wenzelm@21263
   250
  apply (subst zero_le_odd_power [symmetric])
wenzelm@21256
   251
  apply assumption+
wenzelm@21256
   252
  apply (erule zero_le_even_power)
wenzelm@21263
   253
  done
wenzelm@21256
   254
haftmann@35028
   255
lemma zero_less_power_eq[presburger]: "(0 < (x::'a::{linordered_idom}) ^ n) =
wenzelm@21256
   256
    (n = 0 | (even n & x ~= 0) | (odd n & 0 < x))"
chaieb@27668
   257
chaieb@27668
   258
  unfolding order_less_le zero_le_power_eq by auto
wenzelm@21256
   259
haftmann@35028
   260
lemma power_less_zero_eq[presburger]: "((x::'a::{linordered_idom}) ^ n < 0) =
chaieb@27668
   261
    (odd n & x < 0)"
wenzelm@21263
   262
  apply (subst linorder_not_le [symmetric])+
wenzelm@21256
   263
  apply (subst zero_le_power_eq)
wenzelm@21256
   264
  apply auto
wenzelm@21263
   265
  done
wenzelm@21256
   266
haftmann@35028
   267
lemma power_le_zero_eq[presburger]: "((x::'a::{linordered_idom}) ^ n <= 0) =
wenzelm@21256
   268
    (n ~= 0 & ((odd n & x <= 0) | (even n & x = 0)))"
wenzelm@21263
   269
  apply (subst linorder_not_less [symmetric])+
wenzelm@21256
   270
  apply (subst zero_less_power_eq)
wenzelm@21256
   271
  apply auto
wenzelm@21263
   272
  done
wenzelm@21256
   273
wenzelm@21263
   274
lemma power_even_abs: "even n ==>
haftmann@35028
   275
    (abs (x::'a::{linordered_idom}))^n = x^n"
wenzelm@21263
   276
  apply (subst power_abs [symmetric])
wenzelm@21256
   277
  apply (simp add: zero_le_even_power)
wenzelm@21263
   278
  done
wenzelm@21256
   279
chaieb@23522
   280
lemma zero_less_power_nat_eq[presburger]: "(0 < (x::nat) ^ n) = (n = 0 | 0 < x)"
wenzelm@21263
   281
  by (induct n) auto
wenzelm@21256
   282
wenzelm@21263
   283
lemma power_minus_even [simp]: "even n ==>
haftmann@31017
   284
    (- x)^n = (x^n::'a::{comm_ring_1})"
wenzelm@21256
   285
  apply (subst power_minus)
wenzelm@21256
   286
  apply simp
wenzelm@21263
   287
  done
wenzelm@21256
   288
wenzelm@21263
   289
lemma power_minus_odd [simp]: "odd n ==>
haftmann@31017
   290
    (- x)^n = - (x^n::'a::{comm_ring_1})"
wenzelm@21256
   291
  apply (subst power_minus)
wenzelm@21256
   292
  apply simp
wenzelm@21263
   293
  done
wenzelm@21256
   294
haftmann@35028
   295
lemma power_mono_even: fixes x y :: "'a :: {linordered_idom}"
hoelzl@29803
   296
  assumes "even n" and "\<bar>x\<bar> \<le> \<bar>y\<bar>"
hoelzl@29803
   297
  shows "x^n \<le> y^n"
hoelzl@29803
   298
proof -
hoelzl@29803
   299
  have "0 \<le> \<bar>x\<bar>" by auto
hoelzl@29803
   300
  with `\<bar>x\<bar> \<le> \<bar>y\<bar>`
hoelzl@29803
   301
  have "\<bar>x\<bar>^n \<le> \<bar>y\<bar>^n" by (rule power_mono)
hoelzl@29803
   302
  thus ?thesis unfolding power_even_abs[OF `even n`] .
hoelzl@29803
   303
qed
hoelzl@29803
   304
hoelzl@29803
   305
lemma odd_pos: "odd (n::nat) \<Longrightarrow> 0 < n" by presburger
hoelzl@29803
   306
haftmann@35028
   307
lemma power_mono_odd: fixes x y :: "'a :: {linordered_idom}"
hoelzl@29803
   308
  assumes "odd n" and "x \<le> y"
hoelzl@29803
   309
  shows "x^n \<le> y^n"
hoelzl@29803
   310
proof (cases "y < 0")
hoelzl@29803
   311
  case True with `x \<le> y` have "-y \<le> -x" and "0 \<le> -y" by auto
hoelzl@29803
   312
  hence "(-y)^n \<le> (-x)^n" by (rule power_mono)
hoelzl@29803
   313
  thus ?thesis unfolding power_minus_odd[OF `odd n`] by auto
hoelzl@29803
   314
next
hoelzl@29803
   315
  case False
hoelzl@29803
   316
  show ?thesis
hoelzl@29803
   317
  proof (cases "x < 0")
hoelzl@29803
   318
    case True hence "n \<noteq> 0" and "x \<le> 0" using `odd n`[THEN odd_pos] by auto
hoelzl@29803
   319
    hence "x^n \<le> 0" unfolding power_le_zero_eq using `odd n` by auto
hoelzl@29803
   320
    moreover
hoelzl@29803
   321
    from `\<not> y < 0` have "0 \<le> y" by auto
hoelzl@29803
   322
    hence "0 \<le> y^n" by auto
hoelzl@29803
   323
    ultimately show ?thesis by auto
hoelzl@29803
   324
  next
hoelzl@29803
   325
    case False hence "0 \<le> x" by auto
hoelzl@29803
   326
    with `x \<le> y` show ?thesis using power_mono by auto
hoelzl@29803
   327
  qed
hoelzl@29803
   328
qed
wenzelm@21263
   329
haftmann@25600
   330
haftmann@25600
   331
subsection {* More Even/Odd Results *}
haftmann@25600
   332
 
chaieb@27668
   333
lemma even_mult_two_ex: "even(n) = (\<exists>m::nat. n = 2*m)" by presburger
chaieb@27668
   334
lemma odd_Suc_mult_two_ex: "odd(n) = (\<exists>m. n = Suc (2*m))" by presburger
chaieb@27668
   335
lemma even_add [simp]: "even(m + n::nat) = (even m = even n)"  by presburger
haftmann@25600
   336
chaieb@27668
   337
lemma odd_add [simp]: "odd(m + n::nat) = (odd m \<noteq> odd n)" by presburger
haftmann@25600
   338
haftmann@25600
   339
lemma div_Suc: "Suc a div c = a div c + Suc 0 div c +
haftmann@25600
   340
    (a mod c + Suc 0 mod c) div c" 
haftmann@25600
   341
  apply (subgoal_tac "Suc a = a + Suc 0")
haftmann@25600
   342
  apply (erule ssubst)
haftmann@25600
   343
  apply (rule div_add1_eq, simp)
haftmann@25600
   344
  done
haftmann@25600
   345
chaieb@27668
   346
lemma lemma_even_div2 [simp]: "even (n::nat) ==> (n + 1) div 2 = n div 2" by presburger
haftmann@25600
   347
haftmann@25600
   348
lemma lemma_not_even_div2 [simp]: "~even n ==> (n + 1) div 2 = Suc (n div 2)"
chaieb@27668
   349
by presburger
haftmann@25600
   350
chaieb@27668
   351
lemma even_num_iff: "0 < n ==> even n = (~ even(n - 1 :: nat))"  by presburger
chaieb@27668
   352
lemma even_even_mod_4_iff: "even (n::nat) = even (n mod 4)" by presburger
haftmann@25600
   353
chaieb@27668
   354
lemma lemma_odd_mod_4_div_2: "n mod 4 = (3::nat) ==> odd((n - 1) div 2)" by presburger
haftmann@25600
   355
haftmann@25600
   356
lemma lemma_even_mod_4_div_2: "n mod 4 = (1::nat) ==> even ((n - 1) div 2)"
chaieb@27668
   357
  by presburger
haftmann@25600
   358
wenzelm@21263
   359
text {* Simplify, when the exponent is a numeral *}
wenzelm@21256
   360
huffman@47108
   361
lemmas zero_le_power_eq_numeral [simp] =
huffman@47108
   362
    zero_le_power_eq [of _ "numeral w"] for w
wenzelm@21256
   363
huffman@47108
   364
lemmas zero_less_power_eq_numeral [simp] =
huffman@47108
   365
    zero_less_power_eq [of _ "numeral w"] for w
wenzelm@21256
   366
huffman@47108
   367
lemmas power_le_zero_eq_numeral [simp] =
huffman@47108
   368
    power_le_zero_eq [of _ "numeral w"] for w
wenzelm@21256
   369
huffman@47108
   370
lemmas power_less_zero_eq_numeral [simp] =
huffman@47108
   371
    power_less_zero_eq [of _ "numeral w"] for w
wenzelm@21256
   372
huffman@47108
   373
lemmas zero_less_power_nat_eq_numeral [simp] =
huffman@47108
   374
    zero_less_power_nat_eq [of _ "numeral w"] for w
wenzelm@21256
   375
huffman@47108
   376
lemmas power_eq_0_iff_numeral [simp] = power_eq_0_iff [of _ "numeral w"] for w
wenzelm@21256
   377
huffman@47108
   378
lemmas power_even_abs_numeral [simp] = power_even_abs [of "numeral w" _] for w
wenzelm@21256
   379
wenzelm@21256
   380
wenzelm@21256
   381
subsection {* An Equivalence for @{term [source] "0 \<le> a^n"} *}
wenzelm@21256
   382
wenzelm@21256
   383
lemma even_power_le_0_imp_0:
haftmann@35028
   384
    "a ^ (2*k) \<le> (0::'a::{linordered_idom}) ==> a=0"
huffman@35216
   385
  by (induct k) (auto simp add: zero_le_mult_iff mult_le_0_iff)
wenzelm@21256
   386
chaieb@23522
   387
lemma zero_le_power_iff[presburger]:
haftmann@35028
   388
  "(0 \<le> a^n) = (0 \<le> (a::'a::{linordered_idom}) | even n)"
wenzelm@21256
   389
proof cases
wenzelm@21256
   390
  assume even: "even n"
wenzelm@21256
   391
  then obtain k where "n = 2*k"
wenzelm@21256
   392
    by (auto simp add: even_nat_equiv_def2 numeral_2_eq_2)
wenzelm@21263
   393
  thus ?thesis by (simp add: zero_le_even_power even)
wenzelm@21256
   394
next
wenzelm@21256
   395
  assume odd: "odd n"
wenzelm@21256
   396
  then obtain k where "n = Suc(2*k)"
wenzelm@21256
   397
    by (auto simp add: odd_nat_equiv_def2 numeral_2_eq_2)
wenzelm@21256
   398
  thus ?thesis
huffman@35216
   399
    by (auto simp add: zero_le_mult_iff zero_le_even_power
wenzelm@21263
   400
             dest!: even_power_le_0_imp_0)
wenzelm@21263
   401
qed
wenzelm@21263
   402
wenzelm@21256
   403
wenzelm@21256
   404
subsection {* Miscellaneous *}
wenzelm@21256
   405
chaieb@23522
   406
lemma [presburger]:"(x + 1) div 2 = x div 2 \<longleftrightarrow> even (x::int)" by presburger
chaieb@23522
   407
lemma [presburger]: "(x + 1) div 2 = x div 2 + 1 \<longleftrightarrow> odd (x::int)" by presburger
chaieb@23522
   408
lemma even_plus_one_div_two: "even (x::int) ==> (x + 1) div 2 = x div 2"  by presburger
chaieb@23522
   409
lemma odd_plus_one_div_two: "odd (x::int) ==> (x + 1) div 2 = x div 2 + 1" by presburger
wenzelm@21256
   410
chaieb@23522
   411
lemma [presburger]: "(Suc x) div Suc (Suc 0) = x div Suc (Suc 0) \<longleftrightarrow> even x" by presburger
chaieb@23522
   412
lemma [presburger]: "(Suc x) div Suc (Suc 0) = x div Suc (Suc 0) \<longleftrightarrow> even x" by presburger
wenzelm@21263
   413
lemma even_nat_plus_one_div_two: "even (x::nat) ==>
chaieb@23522
   414
    (Suc x) div Suc (Suc 0) = x div Suc (Suc 0)" by presburger
wenzelm@21256
   415
wenzelm@21263
   416
lemma odd_nat_plus_one_div_two: "odd (x::nat) ==>
chaieb@23522
   417
    (Suc x) div Suc (Suc 0) = Suc (x div Suc (Suc 0))" by presburger
wenzelm@21256
   418
wenzelm@21256
   419
end