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