src/HOL/Presburger.thy
author haftmann
Mon Aug 14 13:46:06 2006 +0200 (2006-08-14)
changeset 20380 14f9f2a1caa6
parent 20217 25b068a99d2b
child 20485 3078fd2eec7b
permissions -rw-r--r--
simplified code generator setup
berghofe@13876
     1
(*  Title:      HOL/Integ/Presburger.thy
berghofe@13876
     2
    ID:         $Id$
berghofe@13876
     3
    Author:     Amine Chaieb, Tobias Nipkow and Stefan Berghofer, TU Muenchen
berghofe@13876
     4
berghofe@13876
     5
File containing necessary theorems for the proof
berghofe@13876
     6
generation for Cooper Algorithm  
berghofe@13876
     7
*)
berghofe@13876
     8
nipkow@15131
     9
header {* Presburger Arithmetic: Cooper's Algorithm *}
wenzelm@14577
    10
nipkow@15131
    11
theory Presburger
wenzelm@20051
    12
imports NatSimprocs
chaieb@17378
    13
uses ("cooper_dec.ML") ("cooper_proof.ML") ("qelim.ML") 
chaieb@17378
    14
	("reflected_presburger.ML") ("reflected_cooper.ML") ("presburger.ML")
nipkow@15131
    15
begin
berghofe@13876
    16
wenzelm@14577
    17
text {* Theorem for unitifying the coeffitients of @{text x} in an existential formula*}
berghofe@13876
    18
berghofe@13876
    19
theorem unity_coeff_ex: "(\<exists>x::int. P (l * x)) = (\<exists>x. l dvd (1*x+0) \<and> P x)"
berghofe@13876
    20
  apply (rule iffI)
berghofe@13876
    21
  apply (erule exE)
berghofe@13876
    22
  apply (rule_tac x = "l * x" in exI)
berghofe@13876
    23
  apply simp
berghofe@13876
    24
  apply (erule exE)
berghofe@13876
    25
  apply (erule conjE)
berghofe@13876
    26
  apply (erule dvdE)
berghofe@13876
    27
  apply (rule_tac x = k in exI)
berghofe@13876
    28
  apply simp
berghofe@13876
    29
  done
berghofe@13876
    30
berghofe@13876
    31
lemma uminus_dvd_conv: "(d dvd (t::int)) = (-d dvd t)"
berghofe@13876
    32
apply(unfold dvd_def)
berghofe@13876
    33
apply(rule iffI)
berghofe@13876
    34
apply(clarsimp)
berghofe@13876
    35
apply(rename_tac k)
berghofe@13876
    36
apply(rule_tac x = "-k" in exI)
berghofe@13876
    37
apply simp
berghofe@13876
    38
apply(clarsimp)
berghofe@13876
    39
apply(rename_tac k)
berghofe@13876
    40
apply(rule_tac x = "-k" in exI)
berghofe@13876
    41
apply simp
berghofe@13876
    42
done
berghofe@13876
    43
berghofe@13876
    44
lemma uminus_dvd_conv': "(d dvd (t::int)) = (d dvd -t)"
berghofe@13876
    45
apply(unfold dvd_def)
berghofe@13876
    46
apply(rule iffI)
berghofe@13876
    47
apply(clarsimp)
berghofe@13876
    48
apply(rule_tac x = "-k" in exI)
berghofe@13876
    49
apply simp
berghofe@13876
    50
apply(clarsimp)
berghofe@13876
    51
apply(rule_tac x = "-k" in exI)
berghofe@13876
    52
apply simp
berghofe@13876
    53
done
berghofe@13876
    54
berghofe@13876
    55
berghofe@13876
    56
wenzelm@14577
    57
text {*Theorems for the combination of proofs of the equality of @{text P} and @{text P_m} for integers @{text x} less than some integer @{text z}.*}
berghofe@13876
    58
berghofe@13876
    59
theorem eq_minf_conjI: "\<exists>z1::int. \<forall>x. x < z1 \<longrightarrow> (A1 x = A2 x) \<Longrightarrow>
berghofe@13876
    60
  \<exists>z2::int. \<forall>x. x < z2 \<longrightarrow> (B1 x = B2 x) \<Longrightarrow>
berghofe@13876
    61
  \<exists>z::int. \<forall>x. x < z \<longrightarrow> ((A1 x \<and> B1 x) = (A2 x \<and> B2 x))"
berghofe@13876
    62
  apply (erule exE)+
berghofe@13876
    63
  apply (rule_tac x = "min z1 z2" in exI)
berghofe@13876
    64
  apply simp
berghofe@13876
    65
  done
berghofe@13876
    66
berghofe@13876
    67
berghofe@13876
    68
theorem eq_minf_disjI: "\<exists>z1::int. \<forall>x. x < z1 \<longrightarrow> (A1 x = A2 x) \<Longrightarrow>
berghofe@13876
    69
  \<exists>z2::int. \<forall>x. x < z2 \<longrightarrow> (B1 x = B2 x) \<Longrightarrow>
berghofe@13876
    70
  \<exists>z::int. \<forall>x. x < z \<longrightarrow> ((A1 x \<or> B1 x) = (A2 x \<or> B2 x))"
berghofe@13876
    71
berghofe@13876
    72
  apply (erule exE)+
berghofe@13876
    73
  apply (rule_tac x = "min z1 z2" in exI)
berghofe@13876
    74
  apply simp
berghofe@13876
    75
  done
berghofe@13876
    76
berghofe@13876
    77
wenzelm@14577
    78
text {*Theorems for the combination of proofs of the equality of @{text P} and @{text P_m} for integers @{text x} greather than some integer @{text z}.*}
berghofe@13876
    79
berghofe@13876
    80
theorem eq_pinf_conjI: "\<exists>z1::int. \<forall>x. z1 < x \<longrightarrow> (A1 x = A2 x) \<Longrightarrow>
berghofe@13876
    81
  \<exists>z2::int. \<forall>x. z2 < x \<longrightarrow> (B1 x = B2 x) \<Longrightarrow>
berghofe@13876
    82
  \<exists>z::int. \<forall>x. z < x \<longrightarrow> ((A1 x \<and> B1 x) = (A2 x \<and> B2 x))"
berghofe@13876
    83
  apply (erule exE)+
berghofe@13876
    84
  apply (rule_tac x = "max z1 z2" in exI)
berghofe@13876
    85
  apply simp
berghofe@13876
    86
  done
berghofe@13876
    87
berghofe@13876
    88
berghofe@13876
    89
theorem eq_pinf_disjI: "\<exists>z1::int. \<forall>x. z1 < x \<longrightarrow> (A1 x = A2 x) \<Longrightarrow>
berghofe@13876
    90
  \<exists>z2::int. \<forall>x. z2 < x \<longrightarrow> (B1 x = B2 x) \<Longrightarrow>
berghofe@13876
    91
  \<exists>z::int. \<forall>x. z < x  \<longrightarrow> ((A1 x \<or> B1 x) = (A2 x \<or> B2 x))"
berghofe@13876
    92
  apply (erule exE)+
berghofe@13876
    93
  apply (rule_tac x = "max z1 z2" in exI)
berghofe@13876
    94
  apply simp
berghofe@13876
    95
  done
wenzelm@14577
    96
wenzelm@14577
    97
text {*
wenzelm@14577
    98
  \medskip Theorems for the combination of proofs of the modulo @{text
wenzelm@14577
    99
  D} property for @{text "P plusinfinity"}
wenzelm@14577
   100
wenzelm@14577
   101
  FIXME: This is THE SAME theorem as for the @{text minusinf} version,
wenzelm@14577
   102
  but with @{text "+k.."} instead of @{text "-k.."} In the future
wenzelm@14577
   103
  replace these both with only one. *}
berghofe@13876
   104
berghofe@13876
   105
theorem modd_pinf_conjI: "\<forall>(x::int) k. A x = A (x+k*d) \<Longrightarrow>
berghofe@13876
   106
  \<forall>(x::int) k. B x = B (x+k*d) \<Longrightarrow>
berghofe@13876
   107
  \<forall>(x::int) (k::int). (A x \<and> B x) = (A (x+k*d) \<and> B (x+k*d))"
berghofe@13876
   108
  by simp
berghofe@13876
   109
berghofe@13876
   110
theorem modd_pinf_disjI: "\<forall>(x::int) k. A x = A (x+k*d) \<Longrightarrow>
berghofe@13876
   111
  \<forall>(x::int) k. B x = B (x+k*d) \<Longrightarrow>
berghofe@13876
   112
  \<forall>(x::int) (k::int). (A x \<or> B x) = (A (x+k*d) \<or> B (x+k*d))"
berghofe@13876
   113
  by simp
berghofe@13876
   114
wenzelm@14577
   115
text {*
wenzelm@14577
   116
  This is one of the cases where the simplifed formula is prooved to
wenzelm@14577
   117
  habe some property (in relation to @{text P_m}) but we need to prove
wenzelm@14577
   118
  the property for the original formula (@{text P_m})
wenzelm@14577
   119
wenzelm@14577
   120
  FIXME: This is exaclty the same thm as for @{text minusinf}. *}
wenzelm@14577
   121
berghofe@13876
   122
lemma pinf_simp_eq: "ALL x. P(x) = Q(x) ==> (EX (x::int). P(x)) --> (EX (x::int). F(x))  ==> (EX (x::int). Q(x)) --> (EX (x::int). F(x)) "
wenzelm@14577
   123
  by blast
berghofe@13876
   124
berghofe@13876
   125
wenzelm@14577
   126
text {*
wenzelm@14577
   127
  \medskip Theorems for the combination of proofs of the modulo @{text D}
wenzelm@14577
   128
  property for @{text "P minusinfinity"} *}
berghofe@13876
   129
berghofe@13876
   130
theorem modd_minf_conjI: "\<forall>(x::int) k. A x = A (x-k*d) \<Longrightarrow>
berghofe@13876
   131
  \<forall>(x::int) k. B x = B (x-k*d) \<Longrightarrow>
berghofe@13876
   132
  \<forall>(x::int) (k::int). (A x \<and> B x) = (A (x-k*d) \<and> B (x-k*d))"
berghofe@13876
   133
  by simp
berghofe@13876
   134
berghofe@13876
   135
theorem modd_minf_disjI: "\<forall>(x::int) k. A x = A (x-k*d) \<Longrightarrow>
berghofe@13876
   136
  \<forall>(x::int) k. B x = B (x-k*d) \<Longrightarrow>
berghofe@13876
   137
  \<forall>(x::int) (k::int). (A x \<or> B x) = (A (x-k*d) \<or> B (x-k*d))"
berghofe@13876
   138
  by simp
berghofe@13876
   139
wenzelm@14577
   140
text {*
wenzelm@14577
   141
  This is one of the cases where the simplifed formula is prooved to
wenzelm@14577
   142
  have some property (in relation to @{text P_m}) but we need to
wenzelm@14577
   143
  prove the property for the original formula (@{text P_m}). *}
berghofe@13876
   144
berghofe@13876
   145
lemma minf_simp_eq: "ALL x. P(x) = Q(x) ==> (EX (x::int). P(x)) --> (EX (x::int). F(x))  ==> (EX (x::int). Q(x)) --> (EX (x::int). F(x)) "
wenzelm@14577
   146
  by blast
berghofe@13876
   147
wenzelm@14577
   148
text {*
wenzelm@14577
   149
  Theorem needed for proving at runtime divide properties using the
wenzelm@14577
   150
  arithmetic tactic (which knows only about modulo = 0). *}
berghofe@13876
   151
berghofe@13876
   152
lemma zdvd_iff_zmod_eq_0: "(m dvd n) = (n mod m = (0::int))"
wenzelm@14577
   153
  by(simp add:dvd_def zmod_eq_0_iff)
berghofe@13876
   154
wenzelm@14577
   155
text {*
wenzelm@14577
   156
  \medskip Theorems used for the combination of proof for the
wenzelm@14577
   157
  backwards direction of Cooper's Theorem. They rely exclusively on
wenzelm@14577
   158
  Predicate calculus.*}
berghofe@13876
   159
berghofe@13876
   160
lemma not_ast_p_disjI: "(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> P1(x) --> P1(x + d))
berghofe@13876
   161
==>
berghofe@13876
   162
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> P2(x) --> P2(x + d))
berghofe@13876
   163
==>
berghofe@13876
   164
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) -->(P1(x) \<or> P2(x)) --> (P1(x + d) \<or> P2(x + d))) "
wenzelm@14577
   165
  by blast
berghofe@13876
   166
berghofe@13876
   167
berghofe@13876
   168
lemma not_ast_p_conjI: "(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a- j)) --> P1(x) --> P1(x + d))
berghofe@13876
   169
==>
berghofe@13876
   170
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> P2(x) --> P2(x + d))
berghofe@13876
   171
==>
berghofe@13876
   172
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) -->(P1(x) \<and> P2(x)) --> (P1(x + d)
berghofe@13876
   173
\<and> P2(x + d))) "
wenzelm@14577
   174
  by blast
berghofe@13876
   175
berghofe@13876
   176
lemma not_ast_p_Q_elim: "
berghofe@13876
   177
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) -->P(x) --> P(x + d))
berghofe@13876
   178
==> ( P = Q )
berghofe@13876
   179
==> (ALL x. ~(EX (j::int) : {1..d}. EX (a::int) : A. P(a - j)) -->P(x) --> P(x + d))"
wenzelm@14577
   180
  by blast
berghofe@13876
   181
wenzelm@14577
   182
text {*
wenzelm@14577
   183
  \medskip Theorems used for the combination of proof for the
wenzelm@14577
   184
  backwards direction of Cooper's Theorem. They rely exclusively on
wenzelm@14577
   185
  Predicate calculus.*}
berghofe@13876
   186
berghofe@13876
   187
lemma not_bst_p_disjI: "(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> P1(x) --> P1(x - d))
berghofe@13876
   188
==>
berghofe@13876
   189
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> P2(x) --> P2(x - d))
berghofe@13876
   190
==>
berghofe@13876
   191
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) -->(P1(x) \<or> P2(x)) --> (P1(x - d)
berghofe@13876
   192
\<or> P2(x-d))) "
wenzelm@14577
   193
  by blast
berghofe@13876
   194
berghofe@13876
   195
lemma not_bst_p_conjI: "(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> P1(x) --> P1(x - d))
berghofe@13876
   196
==>
berghofe@13876
   197
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> P2(x) --> P2(x - d))
berghofe@13876
   198
==>
berghofe@13876
   199
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) -->(P1(x) \<and> P2(x)) --> (P1(x - d)
berghofe@13876
   200
\<and> P2(x-d))) "
wenzelm@14577
   201
  by blast
berghofe@13876
   202
berghofe@13876
   203
lemma not_bst_p_Q_elim: "
berghofe@13876
   204
(ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) -->P(x) --> P(x - d)) 
berghofe@13876
   205
==> ( P = Q )
berghofe@13876
   206
==> (ALL x. ~(EX (j::int) : {1..d}. EX (b::int) : B. P(b+j)) -->P(x) --> P(x - d))"
wenzelm@14577
   207
  by blast
berghofe@13876
   208
wenzelm@14577
   209
text {* \medskip This is the first direction of Cooper's Theorem. *}
berghofe@13876
   210
lemma cooper_thm: "(R --> (EX x::int. P x))  ==> (Q -->(EX x::int.  P x )) ==> ((R|Q) --> (EX x::int. P x )) "
wenzelm@14577
   211
  by blast
berghofe@13876
   212
wenzelm@14577
   213
text {*
wenzelm@14577
   214
  \medskip The full Cooper's Theorem in its equivalence Form. Given
wenzelm@14577
   215
  the premises it is trivial too, it relies exclusively on prediacte calculus.*}
berghofe@13876
   216
lemma cooper_eq_thm: "(R --> (EX x::int. P x))  ==> (Q -->(EX x::int.  P x )) ==> ((~Q)
berghofe@13876
   217
--> (EX x::int. P x ) --> R) ==> (EX x::int. P x) = R|Q "
wenzelm@14577
   218
  by blast
berghofe@13876
   219
wenzelm@14577
   220
text {*
wenzelm@14577
   221
  \medskip Some of the atomic theorems generated each time the atom
wenzelm@14577
   222
  does not depend on @{text x}, they are trivial.*}
berghofe@13876
   223
berghofe@13876
   224
lemma  fm_eq_minf: "EX z::int. ALL x. x < z --> (P = P) "
wenzelm@14577
   225
  by blast
berghofe@13876
   226
berghofe@13876
   227
lemma  fm_modd_minf: "ALL (x::int). ALL (k::int). (P = P)"
wenzelm@14577
   228
  by blast
berghofe@13876
   229
berghofe@13876
   230
lemma not_bst_p_fm: "ALL (x::int). Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> fm --> fm"
wenzelm@14577
   231
  by blast
berghofe@13876
   232
berghofe@13876
   233
lemma  fm_eq_pinf: "EX z::int. ALL x. z < x --> (P = P) "
wenzelm@14577
   234
  by blast
berghofe@13876
   235
wenzelm@14577
   236
text {* The next two thms are the same as the @{text minusinf} version. *}
wenzelm@14577
   237
berghofe@13876
   238
lemma  fm_modd_pinf: "ALL (x::int). ALL (k::int). (P = P)"
wenzelm@14577
   239
  by blast
berghofe@13876
   240
berghofe@13876
   241
lemma not_ast_p_fm: "ALL (x::int). Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> fm --> fm"
wenzelm@14577
   242
  by blast
berghofe@13876
   243
wenzelm@14577
   244
text {* Theorems to be deleted from simpset when proving simplified formulaes. *}
berghofe@13876
   245
berghofe@13876
   246
lemma P_eqtrue: "(P=True) = P"
nipkow@17589
   247
  by iprover
berghofe@13876
   248
berghofe@13876
   249
lemma P_eqfalse: "(P=False) = (~P)"
nipkow@17589
   250
  by iprover
berghofe@13876
   251
wenzelm@14577
   252
text {*
wenzelm@14577
   253
  \medskip Theorems for the generation of the bachwards direction of
wenzelm@14577
   254
  Cooper's Theorem.
berghofe@13876
   255
wenzelm@14577
   256
  These are the 6 interesting atomic cases which have to be proved relying on the
wenzelm@14577
   257
  properties of B-set and the arithmetic and contradiction proofs. *}
berghofe@13876
   258
berghofe@13876
   259
lemma not_bst_p_lt: "0 < (d::int) ==>
berghofe@13876
   260
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> ( 0 < -x + a) --> (0 < -(x - d) + a )"
wenzelm@14577
   261
  by arith
berghofe@13876
   262
berghofe@13876
   263
lemma not_bst_p_gt: "\<lbrakk> (g::int) \<in> B; g = -a \<rbrakk> \<Longrightarrow>
berghofe@13876
   264
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> (0 < (x) + a) --> ( 0 < (x - d) + a)"
berghofe@13876
   265
apply clarsimp
berghofe@13876
   266
apply(rule ccontr)
berghofe@13876
   267
apply(drule_tac x = "x+a" in bspec)
berghofe@13876
   268
apply(simp add:atLeastAtMost_iff)
berghofe@13876
   269
apply(drule_tac x = "-a" in bspec)
berghofe@13876
   270
apply assumption
berghofe@13876
   271
apply(simp)
berghofe@13876
   272
done
berghofe@13876
   273
berghofe@13876
   274
lemma not_bst_p_eq: "\<lbrakk> 0 < d; (g::int) \<in> B; g = -a - 1 \<rbrakk> \<Longrightarrow>
berghofe@13876
   275
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> (0 = x + a) --> (0 = (x - d) + a )"
berghofe@13876
   276
apply clarsimp
berghofe@13876
   277
apply(subgoal_tac "x = -a")
berghofe@13876
   278
 prefer 2 apply arith
berghofe@13876
   279
apply(drule_tac x = "1" in bspec)
berghofe@13876
   280
apply(simp add:atLeastAtMost_iff)
berghofe@13876
   281
apply(drule_tac x = "-a- 1" in bspec)
berghofe@13876
   282
apply assumption
berghofe@13876
   283
apply(simp)
berghofe@13876
   284
done
berghofe@13876
   285
berghofe@13876
   286
berghofe@13876
   287
lemma not_bst_p_ne: "\<lbrakk> 0 < d; (g::int) \<in> B; g = -a \<rbrakk> \<Longrightarrow>
berghofe@13876
   288
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> ~(0 = x + a) --> ~(0 = (x - d) + a)"
berghofe@13876
   289
apply clarsimp
berghofe@13876
   290
apply(subgoal_tac "x = -a+d")
berghofe@13876
   291
 prefer 2 apply arith
berghofe@13876
   292
apply(drule_tac x = "d" in bspec)
berghofe@13876
   293
apply(simp add:atLeastAtMost_iff)
berghofe@13876
   294
apply(drule_tac x = "-a" in bspec)
berghofe@13876
   295
apply assumption
berghofe@13876
   296
apply(simp)
berghofe@13876
   297
done
berghofe@13876
   298
berghofe@13876
   299
berghofe@13876
   300
lemma not_bst_p_dvd: "(d1::int) dvd d ==>
berghofe@13876
   301
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> d1 dvd (x + a) --> d1 dvd ((x - d) + a )"
berghofe@13876
   302
apply(clarsimp simp add:dvd_def)
berghofe@13876
   303
apply(rename_tac m)
berghofe@13876
   304
apply(rule_tac x = "m - k" in exI)
berghofe@13876
   305
apply(simp add:int_distrib)
berghofe@13876
   306
done
berghofe@13876
   307
berghofe@13876
   308
lemma not_bst_p_ndvd: "(d1::int) dvd d ==>
berghofe@13876
   309
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (b::int) : B. Q(b+j)) --> ~(d1 dvd (x + a)) --> ~(d1 dvd ((x - d) + a ))"
berghofe@13876
   310
apply(clarsimp simp add:dvd_def)
berghofe@13876
   311
apply(rename_tac m)
berghofe@13876
   312
apply(erule_tac x = "m + k" in allE)
berghofe@13876
   313
apply(simp add:int_distrib)
berghofe@13876
   314
done
berghofe@13876
   315
wenzelm@14577
   316
text {*
wenzelm@14577
   317
  \medskip Theorems for the generation of the bachwards direction of
wenzelm@14577
   318
  Cooper's Theorem.
berghofe@13876
   319
wenzelm@14577
   320
  These are the 6 interesting atomic cases which have to be proved
wenzelm@14577
   321
  relying on the properties of A-set ant the arithmetic and
wenzelm@14577
   322
  contradiction proofs. *}
berghofe@13876
   323
berghofe@13876
   324
lemma not_ast_p_gt: "0 < (d::int) ==>
berghofe@13876
   325
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> ( 0 < x + t) --> (0 < (x + d) + t )"
wenzelm@14577
   326
  by arith
berghofe@13876
   327
berghofe@13876
   328
lemma not_ast_p_lt: "\<lbrakk>0 < d ;(t::int) \<in> A \<rbrakk> \<Longrightarrow>
berghofe@13876
   329
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> (0 < -x + t) --> ( 0 < -(x + d) + t)"
berghofe@13876
   330
  apply clarsimp
berghofe@13876
   331
  apply (rule ccontr)
berghofe@13876
   332
  apply (drule_tac x = "t-x" in bspec)
berghofe@13876
   333
  apply simp
berghofe@13876
   334
  apply (drule_tac x = "t" in bspec)
berghofe@13876
   335
  apply assumption
berghofe@13876
   336
  apply simp
berghofe@13876
   337
  done
berghofe@13876
   338
berghofe@13876
   339
lemma not_ast_p_eq: "\<lbrakk> 0 < d; (g::int) \<in> A; g = -t + 1 \<rbrakk> \<Longrightarrow>
berghofe@13876
   340
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> (0 = x + t) --> (0 = (x + d) + t )"
berghofe@13876
   341
  apply clarsimp
berghofe@13876
   342
  apply (drule_tac x="1" in bspec)
berghofe@13876
   343
  apply simp
berghofe@13876
   344
  apply (drule_tac x="- t + 1" in bspec)
berghofe@13876
   345
  apply assumption
berghofe@13876
   346
  apply(subgoal_tac "x = -t")
berghofe@13876
   347
  prefer 2 apply arith
berghofe@13876
   348
  apply simp
berghofe@13876
   349
  done
berghofe@13876
   350
berghofe@13876
   351
lemma not_ast_p_ne: "\<lbrakk> 0 < d; (g::int) \<in> A; g = -t \<rbrakk> \<Longrightarrow>
berghofe@13876
   352
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> ~(0 = x + t) --> ~(0 = (x + d) + t)"
berghofe@13876
   353
  apply clarsimp
berghofe@13876
   354
  apply (subgoal_tac "x = -t-d")
berghofe@13876
   355
  prefer 2 apply arith
berghofe@13876
   356
  apply (drule_tac x = "d" in bspec)
berghofe@13876
   357
  apply simp
berghofe@13876
   358
  apply (drule_tac x = "-t" in bspec)
berghofe@13876
   359
  apply assumption
berghofe@13876
   360
  apply simp
berghofe@13876
   361
  done
berghofe@13876
   362
berghofe@13876
   363
lemma not_ast_p_dvd: "(d1::int) dvd d ==>
berghofe@13876
   364
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> d1 dvd (x + t) --> d1 dvd ((x + d) + t )"
berghofe@13876
   365
  apply(clarsimp simp add:dvd_def)
berghofe@13876
   366
  apply(rename_tac m)
berghofe@13876
   367
  apply(rule_tac x = "m + k" in exI)
berghofe@13876
   368
  apply(simp add:int_distrib)
berghofe@13876
   369
  done
berghofe@13876
   370
berghofe@13876
   371
lemma not_ast_p_ndvd: "(d1::int) dvd d ==>
berghofe@13876
   372
 ALL x. Q(x::int) \<and> ~(EX (j::int) : {1..d}. EX (a::int) : A. Q(a - j)) --> ~(d1 dvd (x + t)) --> ~(d1 dvd ((x + d) + t ))"
berghofe@13876
   373
  apply(clarsimp simp add:dvd_def)
berghofe@13876
   374
  apply(rename_tac m)
berghofe@13876
   375
  apply(erule_tac x = "m - k" in allE)
berghofe@13876
   376
  apply(simp add:int_distrib)
berghofe@13876
   377
  done
berghofe@13876
   378
wenzelm@14577
   379
text {*
wenzelm@14577
   380
  \medskip These are the atomic cases for the proof generation for the
wenzelm@14577
   381
  modulo @{text D} property for @{text "P plusinfinity"}
berghofe@13876
   382
wenzelm@14577
   383
  They are fully based on arithmetics. *}
berghofe@13876
   384
berghofe@13876
   385
lemma  dvd_modd_pinf: "((d::int) dvd d1) ==>
berghofe@13876
   386
 (ALL (x::int). ALL (k::int). (((d::int) dvd (x + t)) = (d dvd (x+k*d1 + t))))"
berghofe@13876
   387
  apply(clarsimp simp add:dvd_def)
berghofe@13876
   388
  apply(rule iffI)
berghofe@13876
   389
  apply(clarsimp)
berghofe@13876
   390
  apply(rename_tac n m)
berghofe@13876
   391
  apply(rule_tac x = "m + n*k" in exI)
berghofe@13876
   392
  apply(simp add:int_distrib)
berghofe@13876
   393
  apply(clarsimp)
berghofe@13876
   394
  apply(rename_tac n m)
berghofe@13876
   395
  apply(rule_tac x = "m - n*k" in exI)
paulson@14271
   396
  apply(simp add:int_distrib mult_ac)
berghofe@13876
   397
  done
berghofe@13876
   398
berghofe@13876
   399
lemma  not_dvd_modd_pinf: "((d::int) dvd d1) ==>
berghofe@13876
   400
 (ALL (x::int). ALL k. (~((d::int) dvd (x + t))) = (~(d dvd (x+k*d1 + t))))"
berghofe@13876
   401
  apply(clarsimp simp add:dvd_def)
berghofe@13876
   402
  apply(rule iffI)
berghofe@13876
   403
  apply(clarsimp)
berghofe@13876
   404
  apply(rename_tac n m)
berghofe@13876
   405
  apply(erule_tac x = "m - n*k" in allE)
paulson@14271
   406
  apply(simp add:int_distrib mult_ac)
berghofe@13876
   407
  apply(clarsimp)
berghofe@13876
   408
  apply(rename_tac n m)
berghofe@13876
   409
  apply(erule_tac x = "m + n*k" in allE)
paulson@14271
   410
  apply(simp add:int_distrib mult_ac)
berghofe@13876
   411
  done
berghofe@13876
   412
wenzelm@14577
   413
text {*
wenzelm@14577
   414
  \medskip These are the atomic cases for the proof generation for the
wenzelm@14577
   415
  equivalence of @{text P} and @{text "P plusinfinity"} for integers
wenzelm@14577
   416
  @{text x} greater than some integer @{text z}.
wenzelm@14577
   417
wenzelm@14577
   418
  They are fully based on arithmetics. *}
berghofe@13876
   419
berghofe@13876
   420
lemma  eq_eq_pinf: "EX z::int. ALL x. z < x --> (( 0 = x +t ) = False )"
berghofe@13876
   421
  apply(rule_tac x = "-t" in exI)
berghofe@13876
   422
  apply simp
berghofe@13876
   423
  done
berghofe@13876
   424
berghofe@13876
   425
lemma  neq_eq_pinf: "EX z::int. ALL x.  z < x --> ((~( 0 = x +t )) = True )"
berghofe@13876
   426
  apply(rule_tac x = "-t" in exI)
berghofe@13876
   427
  apply simp
berghofe@13876
   428
  done
berghofe@13876
   429
berghofe@13876
   430
lemma  le_eq_pinf: "EX z::int. ALL x.  z < x --> ( 0 < x +t  = True )"
berghofe@13876
   431
  apply(rule_tac x = "-t" in exI)
berghofe@13876
   432
  apply simp
berghofe@13876
   433
  done
berghofe@13876
   434
berghofe@13876
   435
lemma  len_eq_pinf: "EX z::int. ALL x. z < x  --> (0 < -x +t  = False )"
berghofe@13876
   436
  apply(rule_tac x = "t" in exI)
berghofe@13876
   437
  apply simp
berghofe@13876
   438
  done
berghofe@13876
   439
berghofe@13876
   440
lemma  dvd_eq_pinf: "EX z::int. ALL x.  z < x --> ((d dvd (x + t)) = (d dvd (x + t))) "
wenzelm@14577
   441
  by simp
berghofe@13876
   442
berghofe@13876
   443
lemma  not_dvd_eq_pinf: "EX z::int. ALL x. z < x  --> ((~(d dvd (x + t))) = (~(d dvd (x + t)))) "
wenzelm@14577
   444
  by simp
berghofe@13876
   445
wenzelm@14577
   446
text {*
wenzelm@14577
   447
  \medskip These are the atomic cases for the proof generation for the
wenzelm@14577
   448
  modulo @{text D} property for @{text "P minusinfinity"}.
wenzelm@14577
   449
wenzelm@14577
   450
  They are fully based on arithmetics. *}
berghofe@13876
   451
berghofe@13876
   452
lemma  dvd_modd_minf: "((d::int) dvd d1) ==>
berghofe@13876
   453
 (ALL (x::int). ALL (k::int). (((d::int) dvd (x + t)) = (d dvd (x-k*d1 + t))))"
berghofe@13876
   454
apply(clarsimp simp add:dvd_def)
berghofe@13876
   455
apply(rule iffI)
berghofe@13876
   456
apply(clarsimp)
berghofe@13876
   457
apply(rename_tac n m)
berghofe@13876
   458
apply(rule_tac x = "m - n*k" in exI)
berghofe@13876
   459
apply(simp add:int_distrib)
berghofe@13876
   460
apply(clarsimp)
berghofe@13876
   461
apply(rename_tac n m)
berghofe@13876
   462
apply(rule_tac x = "m + n*k" in exI)
paulson@14271
   463
apply(simp add:int_distrib mult_ac)
berghofe@13876
   464
done
berghofe@13876
   465
berghofe@13876
   466
berghofe@13876
   467
lemma  not_dvd_modd_minf: "((d::int) dvd d1) ==>
berghofe@13876
   468
 (ALL (x::int). ALL k. (~((d::int) dvd (x + t))) = (~(d dvd (x-k*d1 + t))))"
berghofe@13876
   469
apply(clarsimp simp add:dvd_def)
berghofe@13876
   470
apply(rule iffI)
berghofe@13876
   471
apply(clarsimp)
berghofe@13876
   472
apply(rename_tac n m)
berghofe@13876
   473
apply(erule_tac x = "m + n*k" in allE)
paulson@14271
   474
apply(simp add:int_distrib mult_ac)
berghofe@13876
   475
apply(clarsimp)
berghofe@13876
   476
apply(rename_tac n m)
berghofe@13876
   477
apply(erule_tac x = "m - n*k" in allE)
paulson@14271
   478
apply(simp add:int_distrib mult_ac)
berghofe@13876
   479
done
berghofe@13876
   480
wenzelm@14577
   481
text {*
wenzelm@14577
   482
  \medskip These are the atomic cases for the proof generation for the
wenzelm@14577
   483
  equivalence of @{text P} and @{text "P minusinfinity"} for integers
wenzelm@14577
   484
  @{text x} less than some integer @{text z}.
berghofe@13876
   485
wenzelm@14577
   486
  They are fully based on arithmetics. *}
berghofe@13876
   487
berghofe@13876
   488
lemma  eq_eq_minf: "EX z::int. ALL x. x < z --> (( 0 = x +t ) = False )"
berghofe@13876
   489
apply(rule_tac x = "-t" in exI)
berghofe@13876
   490
apply simp
berghofe@13876
   491
done
berghofe@13876
   492
berghofe@13876
   493
lemma  neq_eq_minf: "EX z::int. ALL x. x < z --> ((~( 0 = x +t )) = True )"
berghofe@13876
   494
apply(rule_tac x = "-t" in exI)
berghofe@13876
   495
apply simp
berghofe@13876
   496
done
berghofe@13876
   497
berghofe@13876
   498
lemma  le_eq_minf: "EX z::int. ALL x. x < z --> ( 0 < x +t  = False )"
berghofe@13876
   499
apply(rule_tac x = "-t" in exI)
berghofe@13876
   500
apply simp
berghofe@13876
   501
done
berghofe@13876
   502
berghofe@13876
   503
berghofe@13876
   504
lemma  len_eq_minf: "EX z::int. ALL x. x < z --> (0 < -x +t  = True )"
berghofe@13876
   505
apply(rule_tac x = "t" in exI)
berghofe@13876
   506
apply simp
berghofe@13876
   507
done
berghofe@13876
   508
berghofe@13876
   509
lemma  dvd_eq_minf: "EX z::int. ALL x. x < z --> ((d dvd (x + t)) = (d dvd (x + t))) "
wenzelm@14577
   510
  by simp
berghofe@13876
   511
berghofe@13876
   512
lemma  not_dvd_eq_minf: "EX z::int. ALL x. x < z --> ((~(d dvd (x + t))) = (~(d dvd (x + t)))) "
wenzelm@14577
   513
  by simp
berghofe@13876
   514
wenzelm@14577
   515
text {*
wenzelm@14577
   516
  \medskip This Theorem combines whithnesses about @{text "P
wenzelm@14577
   517
  minusinfinity"} to show one component of the equivalence proof for
wenzelm@14577
   518
  Cooper's Theorem.
berghofe@13876
   519
wenzelm@14577
   520
  FIXME: remove once they are part of the distribution. *}
wenzelm@14577
   521
berghofe@13876
   522
theorem int_ge_induct[consumes 1,case_names base step]:
berghofe@13876
   523
  assumes ge: "k \<le> (i::int)" and
berghofe@13876
   524
        base: "P(k)" and
berghofe@13876
   525
        step: "\<And>i. \<lbrakk>k \<le> i; P i\<rbrakk> \<Longrightarrow> P(i+1)"
berghofe@13876
   526
  shows "P i"
berghofe@13876
   527
proof -
berghofe@13876
   528
  { fix n have "\<And>i::int. n = nat(i-k) \<Longrightarrow> k <= i \<Longrightarrow> P i"
berghofe@13876
   529
    proof (induct n)
berghofe@13876
   530
      case 0
berghofe@13876
   531
      hence "i = k" by arith
berghofe@13876
   532
      thus "P i" using base by simp
berghofe@13876
   533
    next
berghofe@13876
   534
      case (Suc n)
berghofe@13876
   535
      hence "n = nat((i - 1) - k)" by arith
berghofe@13876
   536
      moreover
berghofe@13876
   537
      have ki1: "k \<le> i - 1" using Suc.prems by arith
berghofe@13876
   538
      ultimately
berghofe@13876
   539
      have "P(i - 1)" by(rule Suc.hyps)
berghofe@13876
   540
      from step[OF ki1 this] show ?case by simp
berghofe@13876
   541
    qed
berghofe@13876
   542
  }
berghofe@13876
   543
  from this ge show ?thesis by fast
berghofe@13876
   544
qed
berghofe@13876
   545
berghofe@13876
   546
theorem int_gr_induct[consumes 1,case_names base step]:
berghofe@13876
   547
  assumes gr: "k < (i::int)" and
berghofe@13876
   548
        base: "P(k+1)" and
berghofe@13876
   549
        step: "\<And>i. \<lbrakk>k < i; P i\<rbrakk> \<Longrightarrow> P(i+1)"
berghofe@13876
   550
  shows "P i"
berghofe@13876
   551
apply(rule int_ge_induct[of "k + 1"])
berghofe@13876
   552
  using gr apply arith
berghofe@13876
   553
 apply(rule base)
berghofe@13876
   554
apply(rule step)
berghofe@13876
   555
 apply simp+
berghofe@13876
   556
done
berghofe@13876
   557
berghofe@13876
   558
lemma decr_lemma: "0 < (d::int) \<Longrightarrow> x - (abs(x-z)+1) * d < z"
berghofe@13876
   559
apply(induct rule: int_gr_induct)
berghofe@13876
   560
 apply simp
berghofe@13876
   561
apply (simp add:int_distrib)
berghofe@13876
   562
done
berghofe@13876
   563
berghofe@13876
   564
lemma incr_lemma: "0 < (d::int) \<Longrightarrow> z < x + (abs(x-z)+1) * d"
berghofe@13876
   565
apply(induct rule: int_gr_induct)
berghofe@13876
   566
 apply simp
berghofe@13876
   567
apply (simp add:int_distrib)
berghofe@13876
   568
done
berghofe@13876
   569
berghofe@13876
   570
lemma  minusinfinity:
berghofe@13876
   571
  assumes "0 < d" and
berghofe@13876
   572
    P1eqP1: "ALL x k. P1 x = P1(x - k*d)" and
berghofe@13876
   573
    ePeqP1: "EX z::int. ALL x. x < z \<longrightarrow> (P x = P1 x)"
berghofe@13876
   574
  shows "(EX x. P1 x) \<longrightarrow> (EX x. P x)"
berghofe@13876
   575
proof
berghofe@13876
   576
  assume eP1: "EX x. P1 x"
berghofe@13876
   577
  then obtain x where P1: "P1 x" ..
berghofe@13876
   578
  from ePeqP1 obtain z where P1eqP: "ALL x. x < z \<longrightarrow> (P x = P1 x)" ..
berghofe@13876
   579
  let ?w = "x - (abs(x-z)+1) * d"
berghofe@13876
   580
  show "EX x. P x"
berghofe@13876
   581
  proof
berghofe@13876
   582
    have w: "?w < z" by(rule decr_lemma)
berghofe@13876
   583
    have "P1 x = P1 ?w" using P1eqP1 by blast
berghofe@13876
   584
    also have "\<dots> = P(?w)" using w P1eqP by blast
berghofe@13876
   585
    finally show "P ?w" using P1 by blast
berghofe@13876
   586
  qed
berghofe@13876
   587
qed
berghofe@13876
   588
wenzelm@14577
   589
text {*
wenzelm@14577
   590
  \medskip This Theorem combines whithnesses about @{text "P
wenzelm@14577
   591
  minusinfinity"} to show one component of the equivalence proof for
wenzelm@14577
   592
  Cooper's Theorem. *}
berghofe@13876
   593
berghofe@13876
   594
lemma plusinfinity:
berghofe@13876
   595
  assumes "0 < d" and
berghofe@13876
   596
    P1eqP1: "ALL (x::int) (k::int). P1 x = P1 (x + k * d)" and
berghofe@13876
   597
    ePeqP1: "EX z::int. ALL x. z < x  --> (P x = P1 x)"
berghofe@13876
   598
  shows "(EX x::int. P1 x) --> (EX x::int. P x)"
berghofe@13876
   599
proof
berghofe@13876
   600
  assume eP1: "EX x. P1 x"
berghofe@13876
   601
  then obtain x where P1: "P1 x" ..
berghofe@13876
   602
  from ePeqP1 obtain z where P1eqP: "ALL x. z < x \<longrightarrow> (P x = P1 x)" ..
berghofe@13876
   603
  let ?w = "x + (abs(x-z)+1) * d"
berghofe@13876
   604
  show "EX x. P x"
berghofe@13876
   605
  proof
berghofe@13876
   606
    have w: "z < ?w" by(rule incr_lemma)
berghofe@13876
   607
    have "P1 x = P1 ?w" using P1eqP1 by blast
berghofe@13876
   608
    also have "\<dots> = P(?w)" using w P1eqP by blast
berghofe@13876
   609
    finally show "P ?w" using P1 by blast
berghofe@13876
   610
  qed
berghofe@13876
   611
qed
berghofe@13876
   612
 
wenzelm@14577
   613
text {*
wenzelm@14577
   614
  \medskip Theorem for periodic function on discrete sets. *}
berghofe@13876
   615
berghofe@13876
   616
lemma minf_vee:
berghofe@13876
   617
  assumes dpos: "(0::int) < d" and modd: "ALL x k. P x = P(x - k*d)"
berghofe@13876
   618
  shows "(EX x. P x) = (EX j : {1..d}. P j)"
berghofe@13876
   619
  (is "?LHS = ?RHS")
berghofe@13876
   620
proof
berghofe@13876
   621
  assume ?LHS
berghofe@13876
   622
  then obtain x where P: "P x" ..
berghofe@13876
   623
  have "x mod d = x - (x div d)*d"
paulson@14271
   624
    by(simp add:zmod_zdiv_equality mult_ac eq_diff_eq)
berghofe@13876
   625
  hence Pmod: "P x = P(x mod d)" using modd by simp
berghofe@13876
   626
  show ?RHS
berghofe@13876
   627
  proof (cases)
berghofe@13876
   628
    assume "x mod d = 0"
berghofe@13876
   629
    hence "P 0" using P Pmod by simp
berghofe@13876
   630
    moreover have "P 0 = P(0 - (-1)*d)" using modd by blast
berghofe@13876
   631
    ultimately have "P d" by simp
berghofe@13876
   632
    moreover have "d : {1..d}" using dpos by(simp add:atLeastAtMost_iff)
berghofe@13876
   633
    ultimately show ?RHS ..
berghofe@13876
   634
  next
berghofe@13876
   635
    assume not0: "x mod d \<noteq> 0"
berghofe@13876
   636
    have "P(x mod d)" using dpos P Pmod by(simp add:pos_mod_sign pos_mod_bound)
berghofe@13876
   637
    moreover have "x mod d : {1..d}"
berghofe@13876
   638
    proof -
berghofe@13876
   639
      have "0 \<le> x mod d" by(rule pos_mod_sign)
berghofe@13876
   640
      moreover have "x mod d < d" by(rule pos_mod_bound)
berghofe@13876
   641
      ultimately show ?thesis using not0 by(simp add:atLeastAtMost_iff)
berghofe@13876
   642
    qed
berghofe@13876
   643
    ultimately show ?RHS ..
berghofe@13876
   644
  qed
berghofe@13876
   645
next
berghofe@13876
   646
  assume ?RHS thus ?LHS by blast
berghofe@13876
   647
qed
berghofe@13876
   648
wenzelm@14577
   649
text {*
wenzelm@14577
   650
  \medskip Theorem for periodic function on discrete sets. *}
wenzelm@14577
   651
berghofe@13876
   652
lemma pinf_vee:
berghofe@13876
   653
  assumes dpos: "0 < (d::int)" and modd: "ALL (x::int) (k::int). P x = P (x+k*d)"
berghofe@13876
   654
  shows "(EX x::int. P x) = (EX (j::int) : {1..d} . P j)"
berghofe@13876
   655
  (is "?LHS = ?RHS")
berghofe@13876
   656
proof
berghofe@13876
   657
  assume ?LHS
berghofe@13876
   658
  then obtain x where P: "P x" ..
berghofe@13876
   659
  have "x mod d = x + (-(x div d))*d"
paulson@14271
   660
    by(simp add:zmod_zdiv_equality mult_ac eq_diff_eq)
berghofe@13876
   661
  hence Pmod: "P x = P(x mod d)" using modd by (simp only:)
berghofe@13876
   662
  show ?RHS
berghofe@13876
   663
  proof (cases)
berghofe@13876
   664
    assume "x mod d = 0"
berghofe@13876
   665
    hence "P 0" using P Pmod by simp
berghofe@13876
   666
    moreover have "P 0 = P(0 + 1*d)" using modd by blast
berghofe@13876
   667
    ultimately have "P d" by simp
berghofe@13876
   668
    moreover have "d : {1..d}" using dpos by(simp add:atLeastAtMost_iff)
berghofe@13876
   669
    ultimately show ?RHS ..
berghofe@13876
   670
  next
berghofe@13876
   671
    assume not0: "x mod d \<noteq> 0"
berghofe@13876
   672
    have "P(x mod d)" using dpos P Pmod by(simp add:pos_mod_sign pos_mod_bound)
berghofe@13876
   673
    moreover have "x mod d : {1..d}"
berghofe@13876
   674
    proof -
berghofe@13876
   675
      have "0 \<le> x mod d" by(rule pos_mod_sign)
berghofe@13876
   676
      moreover have "x mod d < d" by(rule pos_mod_bound)
berghofe@13876
   677
      ultimately show ?thesis using not0 by(simp add:atLeastAtMost_iff)
berghofe@13876
   678
    qed
berghofe@13876
   679
    ultimately show ?RHS ..
berghofe@13876
   680
  qed
berghofe@13876
   681
next
berghofe@13876
   682
  assume ?RHS thus ?LHS by blast
berghofe@13876
   683
qed
berghofe@13876
   684
berghofe@13876
   685
lemma decr_mult_lemma:
berghofe@13876
   686
  assumes dpos: "(0::int) < d" and
berghofe@13876
   687
          minus: "ALL x::int. P x \<longrightarrow> P(x - d)" and
berghofe@13876
   688
          knneg: "0 <= k"
berghofe@13876
   689
  shows "ALL x. P x \<longrightarrow> P(x - k*d)"
berghofe@13876
   690
using knneg
berghofe@13876
   691
proof (induct rule:int_ge_induct)
berghofe@13876
   692
  case base thus ?case by simp
berghofe@13876
   693
next
berghofe@13876
   694
  case (step i)
berghofe@13876
   695
  show ?case
berghofe@13876
   696
  proof
berghofe@13876
   697
    fix x
berghofe@13876
   698
    have "P x \<longrightarrow> P (x - i * d)" using step.hyps by blast
berghofe@13876
   699
    also have "\<dots> \<longrightarrow> P(x - (i + 1) * d)"
berghofe@13876
   700
      using minus[THEN spec, of "x - i * d"]
obua@14738
   701
      by (simp add:int_distrib OrderedGroup.diff_diff_eq[symmetric])
berghofe@13876
   702
    ultimately show "P x \<longrightarrow> P(x - (i + 1) * d)" by blast
berghofe@13876
   703
  qed
berghofe@13876
   704
qed
berghofe@13876
   705
berghofe@13876
   706
lemma incr_mult_lemma:
berghofe@13876
   707
  assumes dpos: "(0::int) < d" and
berghofe@13876
   708
          plus: "ALL x::int. P x \<longrightarrow> P(x + d)" and
berghofe@13876
   709
          knneg: "0 <= k"
berghofe@13876
   710
  shows "ALL x. P x \<longrightarrow> P(x + k*d)"
berghofe@13876
   711
using knneg
berghofe@13876
   712
proof (induct rule:int_ge_induct)
berghofe@13876
   713
  case base thus ?case by simp
berghofe@13876
   714
next
berghofe@13876
   715
  case (step i)
berghofe@13876
   716
  show ?case
berghofe@13876
   717
  proof
berghofe@13876
   718
    fix x
berghofe@13876
   719
    have "P x \<longrightarrow> P (x + i * d)" using step.hyps by blast
berghofe@13876
   720
    also have "\<dots> \<longrightarrow> P(x + (i + 1) * d)"
berghofe@13876
   721
      using plus[THEN spec, of "x + i * d"]
berghofe@13876
   722
      by (simp add:int_distrib zadd_ac)
berghofe@13876
   723
    ultimately show "P x \<longrightarrow> P(x + (i + 1) * d)" by blast
berghofe@13876
   724
  qed
berghofe@13876
   725
qed
berghofe@13876
   726
berghofe@13876
   727
lemma cpmi_eq: "0 < D \<Longrightarrow> (EX z::int. ALL x. x < z --> (P x = P1 x))
berghofe@13876
   728
==> ALL x.~(EX (j::int) : {1..D}. EX (b::int) : B. P(b+j)) --> P (x) --> P (x - D) 
berghofe@13876
   729
==> (ALL (x::int). ALL (k::int). ((P1 x)= (P1 (x-k*D))))
berghofe@13876
   730
==> (EX (x::int). P(x)) = ((EX (j::int) : {1..D} . (P1(j))) | (EX (j::int) : {1..D}. EX (b::int) : B. P (b+j)))"
berghofe@13876
   731
apply(rule iffI)
berghofe@13876
   732
prefer 2
berghofe@13876
   733
apply(drule minusinfinity)
berghofe@13876
   734
apply assumption+
berghofe@13876
   735
apply(fastsimp)
berghofe@13876
   736
apply clarsimp
berghofe@13876
   737
apply(subgoal_tac "!!k. 0<=k \<Longrightarrow> !x. P x \<longrightarrow> P (x - k*D)")
berghofe@13876
   738
apply(frule_tac x = x and z=z in decr_lemma)
berghofe@13876
   739
apply(subgoal_tac "P1(x - (\<bar>x - z\<bar> + 1) * D)")
berghofe@13876
   740
prefer 2
berghofe@13876
   741
apply(subgoal_tac "0 <= (\<bar>x - z\<bar> + 1)")
berghofe@13876
   742
prefer 2 apply arith
berghofe@13876
   743
 apply fastsimp
berghofe@13876
   744
apply(drule (1) minf_vee)
berghofe@13876
   745
apply blast
berghofe@13876
   746
apply(blast dest:decr_mult_lemma)
berghofe@13876
   747
done
berghofe@13876
   748
wenzelm@14577
   749
text {* Cooper Theorem, plus infinity version. *}
berghofe@13876
   750
lemma cppi_eq: "0 < D \<Longrightarrow> (EX z::int. ALL x. z < x --> (P x = P1 x))
berghofe@13876
   751
==> ALL x.~(EX (j::int) : {1..D}. EX (a::int) : A. P(a - j)) --> P (x) --> P (x + D) 
berghofe@13876
   752
==> (ALL (x::int). ALL (k::int). ((P1 x)= (P1 (x+k*D))))
berghofe@13876
   753
==> (EX (x::int). P(x)) = ((EX (j::int) : {1..D} . (P1(j))) | (EX (j::int) : {1..D}. EX (a::int) : A. P (a - j)))"
berghofe@13876
   754
  apply(rule iffI)
berghofe@13876
   755
  prefer 2
berghofe@13876
   756
  apply(drule plusinfinity)
berghofe@13876
   757
  apply assumption+
berghofe@13876
   758
  apply(fastsimp)
berghofe@13876
   759
  apply clarsimp
berghofe@13876
   760
  apply(subgoal_tac "!!k. 0<=k \<Longrightarrow> !x. P x \<longrightarrow> P (x + k*D)")
berghofe@13876
   761
  apply(frule_tac x = x and z=z in incr_lemma)
berghofe@13876
   762
  apply(subgoal_tac "P1(x + (\<bar>x - z\<bar> + 1) * D)")
berghofe@13876
   763
  prefer 2
berghofe@13876
   764
  apply(subgoal_tac "0 <= (\<bar>x - z\<bar> + 1)")
berghofe@13876
   765
  prefer 2 apply arith
berghofe@13876
   766
  apply fastsimp
berghofe@13876
   767
  apply(drule (1) pinf_vee)
berghofe@13876
   768
  apply blast
berghofe@13876
   769
  apply(blast dest:incr_mult_lemma)
berghofe@13876
   770
  done
berghofe@13876
   771
berghofe@13876
   772
wenzelm@14577
   773
text {*
wenzelm@14577
   774
  \bigskip Theorems for the quantifier elminination Functions. *}
berghofe@13876
   775
berghofe@13876
   776
lemma qe_ex_conj: "(EX (x::int). A x) = R
berghofe@13876
   777
		==> (EX (x::int). P x) = (Q & (EX x::int. A x))
berghofe@13876
   778
		==> (EX (x::int). P x) = (Q & R)"
berghofe@13876
   779
by blast
berghofe@13876
   780
berghofe@13876
   781
lemma qe_ex_nconj: "(EX (x::int). P x) = (True & Q)
berghofe@13876
   782
		==> (EX (x::int). P x) = Q"
berghofe@13876
   783
by blast
berghofe@13876
   784
berghofe@13876
   785
lemma qe_conjI: "P1 = P2 ==> Q1 = Q2 ==> (P1 & Q1) = (P2 & Q2)"
berghofe@13876
   786
by blast
berghofe@13876
   787
berghofe@13876
   788
lemma qe_disjI: "P1 = P2 ==> Q1 = Q2 ==> (P1 | Q1) = (P2 | Q2)"
berghofe@13876
   789
by blast
berghofe@13876
   790
berghofe@13876
   791
lemma qe_impI: "P1 = P2 ==> Q1 = Q2 ==> (P1 --> Q1) = (P2 --> Q2)"
berghofe@13876
   792
by blast
berghofe@13876
   793
berghofe@13876
   794
lemma qe_eqI: "P1 = P2 ==> Q1 = Q2 ==> (P1 = Q1) = (P2 = Q2)"
berghofe@13876
   795
by blast
berghofe@13876
   796
berghofe@13876
   797
lemma qe_Not: "P = Q ==> (~P) = (~Q)"
berghofe@13876
   798
by blast
berghofe@13876
   799
berghofe@13876
   800
lemma qe_ALL: "(EX x. ~P x) = R ==> (ALL x. P x) = (~R)"
berghofe@13876
   801
by blast
berghofe@13876
   802
wenzelm@14577
   803
text {* \bigskip Theorems for proving NNF *}
berghofe@13876
   804
berghofe@13876
   805
lemma nnf_im: "((~P) = P1) ==> (Q=Q1) ==> ((P --> Q) = (P1 | Q1))"
berghofe@13876
   806
by blast
berghofe@13876
   807
berghofe@13876
   808
lemma nnf_eq: "((P & Q) = (P1 & Q1)) ==> (((~P) & (~Q)) = (P2 & Q2)) ==> ((P = Q) = ((P1 & Q1)|(P2 & Q2)))"
berghofe@13876
   809
by blast
berghofe@13876
   810
berghofe@13876
   811
lemma nnf_nn: "(P = Q) ==> ((~~P) = Q)"
berghofe@13876
   812
  by blast
berghofe@13876
   813
lemma nnf_ncj: "((~P) = P1) ==> ((~Q) = Q1) ==> ((~(P & Q)) = (P1 | Q1))"
berghofe@13876
   814
by blast
berghofe@13876
   815
berghofe@13876
   816
lemma nnf_ndj: "((~P) = P1) ==> ((~Q) = Q1) ==> ((~(P | Q)) = (P1 & Q1))"
berghofe@13876
   817
by blast
berghofe@13876
   818
lemma nnf_nim: "(P = P1) ==> ((~Q) = Q1) ==> ((~(P --> Q)) = (P1 & Q1))"
berghofe@13876
   819
by blast
berghofe@13876
   820
lemma nnf_neq: "((P & (~Q)) = (P1 & Q1)) ==> (((~P) & Q) = (P2 & Q2)) ==> ((~(P = Q)) = ((P1 & Q1)|(P2 & Q2)))"
berghofe@13876
   821
by blast
berghofe@13876
   822
lemma nnf_sdj: "((A & (~B)) = (A1 & B1)) ==> ((C & (~D)) = (C1 & D1)) ==> (A = (~C)) ==> ((~((A & B) | (C & D))) = ((A1 & B1) | (C1 & D1)))"
berghofe@13876
   823
by blast
berghofe@13876
   824
berghofe@13876
   825
berghofe@13876
   826
lemma qe_exI2: "A = B ==> (EX (x::int). A(x)) = (EX (x::int). B(x))"
berghofe@13876
   827
  by simp
berghofe@13876
   828
berghofe@13876
   829
lemma qe_exI: "(!!x::int. A x = B x) ==> (EX (x::int). A(x)) = (EX (x::int). B(x))"
nipkow@17589
   830
  by iprover
berghofe@13876
   831
berghofe@13876
   832
lemma qe_ALLI: "(!!x::int. A x = B x) ==> (ALL (x::int). A(x)) = (ALL (x::int). B(x))"
nipkow@17589
   833
  by iprover
berghofe@13876
   834
berghofe@13876
   835
lemma cp_expand: "(EX (x::int). P (x)) = (EX (j::int) : {1..d}. EX (b::int) : B. (P1 (j) | P(b+j)))
berghofe@13876
   836
==>(EX (x::int). P (x)) = (EX (j::int) : {1..d}. EX (b::int) : B. (P1 (j) | P(b+j))) "
berghofe@13876
   837
by blast
berghofe@13876
   838
berghofe@13876
   839
lemma cppi_expand: "(EX (x::int). P (x)) = (EX (j::int) : {1..d}. EX (a::int) : A. (P1 (j) | P(a - j)))
berghofe@13876
   840
==>(EX (x::int). P (x)) = (EX (j::int) : {1..d}. EX (a::int) : A. (P1 (j) | P(a - j))) "
berghofe@13876
   841
by blast
berghofe@13876
   842
berghofe@13876
   843
berghofe@13876
   844
lemma simp_from_to: "{i..j::int} = (if j < i then {} else insert i {i+1..j})"
berghofe@13876
   845
apply(simp add:atLeastAtMost_def atLeast_def atMost_def)
berghofe@13876
   846
apply(fastsimp)
berghofe@13876
   847
done
berghofe@13876
   848
wenzelm@14577
   849
text {* \bigskip Theorems required for the @{text adjustcoeffitienteq} *}
berghofe@13876
   850
berghofe@13876
   851
lemma ac_dvd_eq: assumes not0: "0 ~= (k::int)"
berghofe@13876
   852
shows "((m::int) dvd (c*n+t)) = (k*m dvd ((k*c)*n+(k*t)))" (is "?P = ?Q")
berghofe@13876
   853
proof
berghofe@13876
   854
  assume ?P
berghofe@13876
   855
  thus ?Q
berghofe@13876
   856
    apply(simp add:dvd_def)
berghofe@13876
   857
    apply clarify
berghofe@13876
   858
    apply(rename_tac d)
berghofe@13876
   859
    apply(drule_tac f = "op * k" in arg_cong)
berghofe@13876
   860
    apply(simp only:int_distrib)
berghofe@13876
   861
    apply(rule_tac x = "d" in exI)
paulson@14271
   862
    apply(simp only:mult_ac)
berghofe@13876
   863
    done
berghofe@13876
   864
next
berghofe@13876
   865
  assume ?Q
berghofe@13876
   866
  then obtain d where "k * c * n + k * t = (k*m)*d" by(fastsimp simp:dvd_def)
paulson@14271
   867
  hence "(c * n + t) * k = (m*d) * k" by(simp add:int_distrib mult_ac)
berghofe@13876
   868
  hence "((c * n + t) * k) div k = ((m*d) * k) div k" by(rule arg_cong[of _ _ "%t. t div k"])
berghofe@13876
   869
  hence "c*n+t = m*d" by(simp add: zdiv_zmult_self1[OF not0[symmetric]])
berghofe@13876
   870
  thus ?P by(simp add:dvd_def)
berghofe@13876
   871
qed
berghofe@13876
   872
berghofe@13876
   873
lemma ac_lt_eq: assumes gr0: "0 < (k::int)"
berghofe@13876
   874
shows "((m::int) < (c*n+t)) = (k*m <((k*c)*n+(k*t)))" (is "?P = ?Q")
berghofe@13876
   875
proof
berghofe@13876
   876
  assume P: ?P
paulson@14271
   877
  show ?Q using zmult_zless_mono2[OF P gr0] by(simp add: int_distrib mult_ac)
berghofe@13876
   878
next
berghofe@13876
   879
  assume ?Q
paulson@14271
   880
  hence "0 < k*(c*n + t - m)" by(simp add: int_distrib mult_ac)
paulson@14353
   881
  with gr0 have "0 < (c*n + t - m)" by(simp add: zero_less_mult_iff)
berghofe@13876
   882
  thus ?P by(simp)
berghofe@13876
   883
qed
berghofe@13876
   884
berghofe@13876
   885
lemma ac_eq_eq : assumes not0: "0 ~= (k::int)" shows "((m::int) = (c*n+t)) = (k*m =((k*c)*n+(k*t)) )" (is "?P = ?Q")
berghofe@13876
   886
proof
berghofe@13876
   887
  assume ?P
berghofe@13876
   888
  thus ?Q
berghofe@13876
   889
    apply(drule_tac f = "op * k" in arg_cong)
berghofe@13876
   890
    apply(simp only:int_distrib)
berghofe@13876
   891
    done
berghofe@13876
   892
next
berghofe@13876
   893
  assume ?Q
paulson@14271
   894
  hence "m * k = (c*n + t) * k" by(simp add:int_distrib mult_ac)
berghofe@13876
   895
  hence "((m) * k) div k = ((c*n + t) * k) div k" by(rule arg_cong[of _ _ "%t. t div k"])
berghofe@13876
   896
  thus ?P by(simp add: zdiv_zmult_self1[OF not0[symmetric]])
berghofe@13876
   897
qed
berghofe@13876
   898
berghofe@13876
   899
lemma ac_pi_eq: assumes gr0: "0 < (k::int)" shows "(~((0::int) < (c*n + t))) = (0 < ((-k)*c)*n + ((-k)*t + k))"
berghofe@13876
   900
proof -
berghofe@13876
   901
  have "(~ (0::int) < (c*n + t)) = (0<1-(c*n + t))" by arith
paulson@14271
   902
  also have  "(1-(c*n + t)) = (-1*c)*n + (-t+1)" by(simp add: int_distrib mult_ac)
berghofe@13876
   903
  also have "0<(-1*c)*n + (-t+1) = (0 < (k*(-1*c)*n) + (k*(-t+1)))" by(rule ac_lt_eq[of _ 0,OF gr0,simplified])
paulson@14271
   904
  also have "(k*(-1*c)*n) + (k*(-t+1)) = ((-k)*c)*n + ((-k)*t + k)" by(simp add: int_distrib mult_ac)
berghofe@13876
   905
  finally show ?thesis .
berghofe@13876
   906
qed
berghofe@13876
   907
berghofe@13876
   908
lemma binminus_uminus_conv: "(a::int) - b = a + (-b)"
berghofe@13876
   909
by arith
berghofe@13876
   910
berghofe@13876
   911
lemma  linearize_dvd: "(t::int) = t1 ==> (d dvd t) = (d dvd t1)"
berghofe@13876
   912
by simp
berghofe@13876
   913
berghofe@13876
   914
lemma lf_lt: "(l::int) = ll ==> (r::int) = lr ==> (l < r) =(ll < lr)"
berghofe@13876
   915
by simp
berghofe@13876
   916
berghofe@13876
   917
lemma lf_eq: "(l::int) = ll ==> (r::int) = lr ==> (l = r) =(ll = lr)"
berghofe@13876
   918
by simp
berghofe@13876
   919
berghofe@13876
   920
lemma lf_dvd: "(l::int) = ll ==> (r::int) = lr ==> (l dvd r) =(ll dvd lr)"
berghofe@13876
   921
by simp
berghofe@13876
   922
wenzelm@14577
   923
text {* \bigskip Theorems for transforming predicates on nat to predicates on @{text int}*}
berghofe@13876
   924
berghofe@13876
   925
theorem all_nat: "(\<forall>x::nat. P x) = (\<forall>x::int. 0 <= x \<longrightarrow> P (nat x))"
berghofe@13876
   926
  by (simp split add: split_nat)
berghofe@13876
   927
berghofe@13876
   928
theorem ex_nat: "(\<exists>x::nat. P x) = (\<exists>x::int. 0 <= x \<and> P (nat x))"
berghofe@13876
   929
  apply (simp split add: split_nat)
berghofe@13876
   930
  apply (rule iffI)
berghofe@13876
   931
  apply (erule exE)
berghofe@13876
   932
  apply (rule_tac x = "int x" in exI)
berghofe@13876
   933
  apply simp
berghofe@13876
   934
  apply (erule exE)
berghofe@13876
   935
  apply (rule_tac x = "nat x" in exI)
berghofe@13876
   936
  apply (erule conjE)
berghofe@13876
   937
  apply (erule_tac x = "nat x" in allE)
berghofe@13876
   938
  apply simp
berghofe@13876
   939
  done
berghofe@13876
   940
berghofe@13876
   941
theorem zdiff_int_split: "P (int (x - y)) =
berghofe@13876
   942
  ((y \<le> x \<longrightarrow> P (int x - int y)) \<and> (x < y \<longrightarrow> P 0))"
berghofe@13876
   943
  apply (case_tac "y \<le> x")
berghofe@13876
   944
  apply (simp_all add: zdiff_int)
berghofe@13876
   945
  done
berghofe@13876
   946
berghofe@13876
   947
theorem zdvd_int: "(x dvd y) = (int x dvd int y)"
berghofe@13876
   948
  apply (simp only: dvd_def ex_nat int_int_eq [symmetric] zmult_int [symmetric]
berghofe@13876
   949
    nat_0_le cong add: conj_cong)
berghofe@13876
   950
  apply (rule iffI)
nipkow@17589
   951
  apply iprover
berghofe@13876
   952
  apply (erule exE)
berghofe@13876
   953
  apply (case_tac "x=0")
berghofe@13876
   954
  apply (rule_tac x=0 in exI)
berghofe@13876
   955
  apply simp
berghofe@13876
   956
  apply (case_tac "0 \<le> k")
nipkow@17589
   957
  apply iprover
berghofe@13876
   958
  apply (simp add: linorder_not_le)
paulson@14378
   959
  apply (drule mult_strict_left_mono_neg [OF iffD2 [OF zero_less_int_conv]])
berghofe@13876
   960
  apply assumption
paulson@14271
   961
  apply (simp add: mult_ac)
berghofe@13876
   962
  done
berghofe@13876
   963
berghofe@13876
   964
theorem number_of1: "(0::int) <= number_of n \<Longrightarrow> (0::int) <= number_of (n BIT b)"
berghofe@13876
   965
  by simp
berghofe@13876
   966
paulson@15013
   967
theorem number_of2: "(0::int) <= Numeral0" by simp
berghofe@13876
   968
berghofe@13876
   969
theorem Suc_plus1: "Suc n = n + 1" by simp
berghofe@13876
   970
wenzelm@14577
   971
text {*
wenzelm@14577
   972
  \medskip Specific instances of congruence rules, to prevent
wenzelm@14577
   973
  simplifier from looping. *}
berghofe@13876
   974
chaieb@14758
   975
theorem imp_le_cong: "(0 <= x \<Longrightarrow> P = P') \<Longrightarrow> (0 <= (x::int) \<longrightarrow> P) = (0 <= x \<longrightarrow> P')"
berghofe@13876
   976
  by simp
berghofe@13876
   977
chaieb@14758
   978
theorem conj_le_cong: "(0 <= x \<Longrightarrow> P = P') \<Longrightarrow> (0 <= (x::int) \<and> P) = (0 <= x \<and> P')"
chaieb@14758
   979
  by (simp cong: conj_cong)
berghofe@13876
   980
chaieb@18202
   981
    (* Theorems used in presburger.ML for the computation simpset*)
chaieb@18202
   982
    (* FIXME: They are present in Float.thy, so may be Float.thy should be lightened.*)
chaieb@18202
   983
chaieb@18202
   984
lemma lift_bool: "x \<Longrightarrow> x=True"
chaieb@18202
   985
  by simp
chaieb@18202
   986
chaieb@18202
   987
lemma nlift_bool: "~x \<Longrightarrow> x=False"
chaieb@18202
   988
  by simp
chaieb@18202
   989
chaieb@18202
   990
lemma not_false_eq_true: "(~ False) = True" by simp
chaieb@18202
   991
chaieb@18202
   992
lemma not_true_eq_false: "(~ True) = False" by simp
chaieb@18202
   993
chaieb@18202
   994
chaieb@18202
   995
lemma int_eq_number_of_eq: "(((number_of v)::int)=(number_of w)) = iszero ((number_of (bin_add v (bin_minus w)))::int)"
chaieb@18202
   996
  by simp
chaieb@18202
   997
lemma int_iszero_number_of_Pls: "iszero (Numeral0::int)" 
chaieb@18202
   998
  by (simp only: iszero_number_of_Pls)
chaieb@18202
   999
chaieb@18202
  1000
lemma int_nonzero_number_of_Min: "~(iszero ((-1)::int))"
chaieb@18202
  1001
  by simp
chaieb@18202
  1002
chaieb@18202
  1003
lemma int_iszero_number_of_0: "iszero ((number_of (w BIT bit.B0))::int) = iszero ((number_of w)::int)"
chaieb@18202
  1004
  by simp
chaieb@18202
  1005
chaieb@18202
  1006
lemma int_iszero_number_of_1: "\<not> iszero ((number_of (w BIT bit.B1))::int)" 
chaieb@18202
  1007
  by simp
chaieb@18202
  1008
chaieb@18202
  1009
lemma int_less_number_of_eq_neg: "(((number_of x)::int) < number_of y) = neg ((number_of (bin_add x (bin_minus y)))::int)"
chaieb@18202
  1010
  by simp
chaieb@18202
  1011
chaieb@18202
  1012
lemma int_not_neg_number_of_Pls: "\<not> (neg (Numeral0::int))" 
chaieb@18202
  1013
  by simp
chaieb@18202
  1014
chaieb@18202
  1015
lemma int_neg_number_of_Min: "neg (-1::int)"
chaieb@18202
  1016
  by simp
chaieb@18202
  1017
chaieb@18202
  1018
lemma int_neg_number_of_BIT: "neg ((number_of (w BIT x))::int) = neg ((number_of w)::int)"
chaieb@18202
  1019
  by simp
chaieb@18202
  1020
chaieb@18202
  1021
lemma int_le_number_of_eq: "(((number_of x)::int) \<le> number_of y) = (\<not> neg ((number_of (bin_add y (bin_minus x)))::int))"
chaieb@18202
  1022
  by simp
chaieb@18202
  1023
lemma int_number_of_add_sym: "((number_of v)::int) + number_of w = number_of (bin_add v w)"
chaieb@18202
  1024
  by simp
chaieb@18202
  1025
chaieb@18202
  1026
lemma int_number_of_diff_sym: "((number_of v)::int) - number_of w = number_of (bin_add v (bin_minus w))"
chaieb@18202
  1027
  by simp
chaieb@18202
  1028
chaieb@18202
  1029
lemma int_number_of_mult_sym: "((number_of v)::int) * number_of w = number_of (bin_mult v w)"
chaieb@18202
  1030
  by simp
chaieb@18202
  1031
chaieb@18202
  1032
lemma int_number_of_minus_sym: "- ((number_of v)::int) = number_of (bin_minus v)"
chaieb@18202
  1033
  by simp
chaieb@18202
  1034
lemma add_left_zero: "0 + a = (a::'a::comm_monoid_add)"
chaieb@18202
  1035
  by simp
chaieb@18202
  1036
chaieb@18202
  1037
lemma add_right_zero: "a + 0 = (a::'a::comm_monoid_add)"
chaieb@18202
  1038
  by simp
chaieb@18202
  1039
chaieb@18202
  1040
lemma mult_left_one: "1 * a = (a::'a::semiring_1)"
chaieb@18202
  1041
  by simp
chaieb@18202
  1042
chaieb@18202
  1043
lemma mult_right_one: "a * 1 = (a::'a::semiring_1)"
chaieb@18202
  1044
  by simp
chaieb@18202
  1045
chaieb@18202
  1046
lemma int_pow_0: "(a::int)^(Numeral0) = 1"
chaieb@18202
  1047
  by simp
chaieb@18202
  1048
chaieb@18202
  1049
lemma int_pow_1: "(a::int)^(Numeral1) = a"
chaieb@18202
  1050
  by simp
chaieb@18202
  1051
chaieb@18202
  1052
lemma zero_eq_Numeral0_nring: "(0::'a::number_ring) = Numeral0"
chaieb@18202
  1053
  by simp
chaieb@18202
  1054
chaieb@18202
  1055
lemma one_eq_Numeral1_nring: "(1::'a::number_ring) = Numeral1"
chaieb@18202
  1056
  by simp
chaieb@18202
  1057
chaieb@18202
  1058
lemma zero_eq_Numeral0_nat: "(0::nat) = Numeral0"
chaieb@18202
  1059
  by simp
chaieb@18202
  1060
chaieb@18202
  1061
lemma one_eq_Numeral1_nat: "(1::nat) = Numeral1"
chaieb@18202
  1062
  by simp
chaieb@18202
  1063
chaieb@18202
  1064
lemma zpower_Pls: "(z::int)^Numeral0 = Numeral1"
chaieb@18202
  1065
  by simp
chaieb@18202
  1066
chaieb@18202
  1067
lemma zpower_Min: "(z::int)^((-1)::nat) = Numeral1"
chaieb@18202
  1068
proof -
chaieb@18202
  1069
  have 1:"((-1)::nat) = 0"
chaieb@18202
  1070
    by simp
chaieb@18202
  1071
  show ?thesis by (simp add: 1)
chaieb@18202
  1072
qed
chaieb@18202
  1073
berghofe@13876
  1074
use "cooper_dec.ML"
chaieb@17378
  1075
use "reflected_presburger.ML" 
chaieb@17378
  1076
use "reflected_cooper.ML"
chaieb@14941
  1077
oracle
chaieb@17378
  1078
  presburger_oracle ("term") = ReflectedCooper.presburger_oracle
chaieb@14941
  1079
berghofe@13876
  1080
use "cooper_proof.ML"
berghofe@13876
  1081
use "qelim.ML"
berghofe@13876
  1082
use "presburger.ML"
berghofe@13876
  1083
berghofe@13876
  1084
setup "Presburger.setup"
berghofe@13876
  1085
berghofe@13876
  1086
end