author | chaieb |
Sun, 17 Jun 2007 13:39:27 +0200 | |
changeset 23405 | 8993b3144358 |
parent 23390 | 01ef1135de73 |
child 23430 | 771117253634 |
permissions | -rw-r--r-- |
23148 | 1 |
(* Title: HOL/Presburger.thy |
13876 | 2 |
ID: $Id$ |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
3 |
Author: Amine Chaieb, TU Muenchen |
13876 | 4 |
*) |
5 |
||
15131 | 6 |
theory Presburger |
23164 | 7 |
imports NatSimprocs SetInterval |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
8 |
uses "Tools/Presburger/cooper_data" "Tools/Presburger/qelim" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
9 |
"Tools/Presburger/generated_cooper.ML" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
10 |
("Tools/Presburger/cooper.ML") ("Tools/Presburger/presburger.ML") |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
11 |
|
15131 | 12 |
begin |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
13 |
setup {* Cooper_Data.setup*} |
13876 | 14 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
15 |
section{* The @{text "-\<infinity>"} and @{text "+\<infinity>"} Properties *} |
13876 | 16 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
17 |
lemma minf: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
18 |
"\<lbrakk>\<exists>(z ::'a::linorder).\<forall>x<z. P x = P' x; \<exists>z.\<forall>x<z. Q x = Q' x\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
19 |
\<Longrightarrow> \<exists>z.\<forall>x<z. (P x \<and> Q x) = (P' x \<and> Q' x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
20 |
"\<lbrakk>\<exists>(z ::'a::linorder).\<forall>x<z. P x = P' x; \<exists>z.\<forall>x<z. Q x = Q' x\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
21 |
\<Longrightarrow> \<exists>z.\<forall>x<z. (P x \<or> Q x) = (P' x \<or> Q' x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
22 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x = t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
23 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x \<noteq> t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
24 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x < t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
25 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x \<le> t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
26 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x > t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
27 |
"\<exists>(z ::'a::{linorder}).\<forall>x<z.(x \<ge> t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
28 |
"\<exists>z.\<forall>(x::'a::{linorder,plus,times})<z. (d dvd x + s) = (d dvd x + s)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
29 |
"\<exists>z.\<forall>(x::'a::{linorder,plus,times})<z. (\<not> d dvd x + s) = (\<not> d dvd x + s)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
30 |
"\<exists>z.\<forall>x<z. F = F" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
31 |
by ((erule exE, erule exE,rule_tac x="min z za" in exI,simp)+, (rule_tac x="t" in exI,fastsimp)+) simp_all |
13876 | 32 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
33 |
lemma pinf: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
34 |
"\<lbrakk>\<exists>(z ::'a::linorder).\<forall>x>z. P x = P' x; \<exists>z.\<forall>x>z. Q x = Q' x\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
35 |
\<Longrightarrow> \<exists>z.\<forall>x>z. (P x \<and> Q x) = (P' x \<and> Q' x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
36 |
"\<lbrakk>\<exists>(z ::'a::linorder).\<forall>x>z. P x = P' x; \<exists>z.\<forall>x>z. Q x = Q' x\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
37 |
\<Longrightarrow> \<exists>z.\<forall>x>z. (P x \<or> Q x) = (P' x \<or> Q' x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
38 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x = t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
39 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x \<noteq> t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
40 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x < t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
41 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x \<le> t) = False" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
42 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x > t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
43 |
"\<exists>(z ::'a::{linorder}).\<forall>x>z.(x \<ge> t) = True" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
44 |
"\<exists>z.\<forall>(x::'a::{linorder,plus,times})>z. (d dvd x + s) = (d dvd x + s)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
45 |
"\<exists>z.\<forall>(x::'a::{linorder,plus,times})>z. (\<not> d dvd x + s) = (\<not> d dvd x + s)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
46 |
"\<exists>z.\<forall>x>z. F = F" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
47 |
by ((erule exE, erule exE,rule_tac x="max z za" in exI,simp)+,(rule_tac x="t" in exI,fastsimp)+) simp_all |
13876 | 48 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
49 |
lemma inf_period: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
50 |
"\<lbrakk>\<forall>x k. P x = P (x - k*D); \<forall>x k. Q x = Q (x - k*D)\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
51 |
\<Longrightarrow> \<forall>x k. (P x \<and> Q x) = (P (x - k*D) \<and> Q (x - k*D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
52 |
"\<lbrakk>\<forall>x k. P x = P (x - k*D); \<forall>x k. Q x = Q (x - k*D)\<rbrakk> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
53 |
\<Longrightarrow> \<forall>x k. (P x \<or> Q x) = (P (x - k*D) \<or> Q (x - k*D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
54 |
"(d::'a::{comm_ring}) dvd D \<Longrightarrow> \<forall>x k. (d dvd x + t) = (d dvd (x - k*D) + t)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
55 |
"(d::'a::{comm_ring}) dvd D \<Longrightarrow> \<forall>x k. (\<not>d dvd x + t) = (\<not>d dvd (x - k*D) + t)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
56 |
"\<forall>x k. F = F" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
57 |
by simp_all |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
58 |
(clarsimp simp add: dvd_def, rule iffI, clarsimp,rule_tac x = "kb - ka*k" in exI, |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
59 |
simp add: ring_eq_simps, clarsimp,rule_tac x = "kb + ka*k" in exI,simp add: ring_eq_simps)+ |
13876 | 60 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
61 |
section{* The A and B sets *} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
62 |
lemma bset: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
63 |
"\<lbrakk>\<forall>x.(\<forall>j \<in> {1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> P x \<longrightarrow> P(x - D) ; |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
64 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> Q x \<longrightarrow> Q(x - D)\<rbrakk> \<Longrightarrow> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
65 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j) \<longrightarrow> (P x \<and> Q x) \<longrightarrow> (P(x - D) \<and> Q (x - D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
66 |
"\<lbrakk>\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> P x \<longrightarrow> P(x - D) ; |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
67 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> Q x \<longrightarrow> Q(x - D)\<rbrakk> \<Longrightarrow> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
68 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (P x \<or> Q x) \<longrightarrow> (P(x - D) \<or> Q (x - D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
69 |
"\<lbrakk>D>0; t - 1\<in> B\<rbrakk> \<Longrightarrow> (\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x = t) \<longrightarrow> (x - D = t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
70 |
"\<lbrakk>D>0 ; t \<in> B\<rbrakk> \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<noteq> t) \<longrightarrow> (x - D \<noteq> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
71 |
"D>0 \<Longrightarrow> (\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x < t) \<longrightarrow> (x - D < t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
72 |
"D>0 \<Longrightarrow> (\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<le> t) \<longrightarrow> (x - D \<le> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
73 |
"\<lbrakk>D>0 ; t \<in> B\<rbrakk> \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x > t) \<longrightarrow> (x - D > t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
74 |
"\<lbrakk>D>0 ; t - 1 \<in> B\<rbrakk> \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<ge> t) \<longrightarrow> (x - D \<ge> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
75 |
"d dvd D \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (d dvd x+t) \<longrightarrow> (d dvd (x - D) + t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
76 |
"d dvd D \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (\<not>d dvd x+t) \<longrightarrow> (\<not> d dvd (x - D) + t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
77 |
"\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j) \<longrightarrow> F \<longrightarrow> F" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
78 |
proof (blast, blast) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
79 |
assume dp: "D > 0" and tB: "t - 1\<in> B" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
80 |
show "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x = t) \<longrightarrow> (x - D = t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
81 |
apply (rule allI, rule impI,erule ballE[where x="1"],erule ballE[where x="t - 1"]) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
82 |
using dp tB by simp_all |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
83 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
84 |
assume dp: "D > 0" and tB: "t \<in> B" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
85 |
show "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<noteq> t) \<longrightarrow> (x - D \<noteq> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
86 |
apply (rule allI, rule impI,erule ballE[where x="D"],erule ballE[where x="t"]) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
87 |
using dp tB by simp_all |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
88 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
89 |
assume dp: "D > 0" thus "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x < t) \<longrightarrow> (x - D < t))" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
90 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
91 |
assume dp: "D > 0" thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<le> t) \<longrightarrow> (x - D \<le> t)" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
92 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
93 |
assume dp: "D > 0" and tB:"t \<in> B" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
94 |
{fix x assume nob: "\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j" and g: "x > t" and ng: "\<not> (x - D) > t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
95 |
hence "x -t \<le> D" and "1 \<le> x - t" by simp+ |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
96 |
hence "\<exists>j \<in> {1 .. D}. x - t = j" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
97 |
hence "\<exists>j \<in> {1 .. D}. x = t + j" by (simp add: ring_eq_simps) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
98 |
with nob tB have "False" by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
99 |
thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x > t) \<longrightarrow> (x - D > t)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
100 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
101 |
assume dp: "D > 0" and tB:"t - 1\<in> B" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
102 |
{fix x assume nob: "\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j" and g: "x \<ge> t" and ng: "\<not> (x - D) \<ge> t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
103 |
hence "x - (t - 1) \<le> D" and "1 \<le> x - (t - 1)" by simp+ |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
104 |
hence "\<exists>j \<in> {1 .. D}. x - (t - 1) = j" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
105 |
hence "\<exists>j \<in> {1 .. D}. x = (t - 1) + j" by (simp add: ring_eq_simps) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
106 |
with nob tB have "False" by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
107 |
thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (x \<ge> t) \<longrightarrow> (x - D \<ge> t)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
108 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
109 |
assume d: "d dvd D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
110 |
{fix x assume H: "d dvd x + t" with d have "d dvd (x - D) + t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
111 |
by (clarsimp simp add: dvd_def,rule_tac x= "ka - k" in exI,simp add: ring_eq_simps)} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
112 |
thus "\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (d dvd x+t) \<longrightarrow> (d dvd (x - D) + t)" by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
113 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
114 |
assume d: "d dvd D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
115 |
{fix x assume H: "\<not>(d dvd x + t)" with d have "\<not>d dvd (x - D) + t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
116 |
by (clarsimp simp add: dvd_def,erule_tac x= "ka + k" in allE,simp add: ring_eq_simps)} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
117 |
thus "\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>B. x \<noteq> b + j)\<longrightarrow> (\<not>d dvd x+t) \<longrightarrow> (\<not>d dvd (x - D) + t)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
118 |
qed blast |
13876 | 119 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
120 |
lemma aset: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
121 |
"\<lbrakk>\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> P x \<longrightarrow> P(x + D) ; |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
122 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> Q x \<longrightarrow> Q(x + D)\<rbrakk> \<Longrightarrow> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
123 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j) \<longrightarrow> (P x \<and> Q x) \<longrightarrow> (P(x + D) \<and> Q (x + D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
124 |
"\<lbrakk>\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> P x \<longrightarrow> P(x + D) ; |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
125 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> Q x \<longrightarrow> Q(x + D)\<rbrakk> \<Longrightarrow> |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
126 |
\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (P x \<or> Q x) \<longrightarrow> (P(x + D) \<or> Q (x + D))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
127 |
"\<lbrakk>D>0; t + 1\<in> A\<rbrakk> \<Longrightarrow> (\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x = t) \<longrightarrow> (x + D = t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
128 |
"\<lbrakk>D>0 ; t \<in> A\<rbrakk> \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<noteq> t) \<longrightarrow> (x + D \<noteq> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
129 |
"\<lbrakk>D>0; t\<in> A\<rbrakk> \<Longrightarrow>(\<forall>(x::int). (\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x < t) \<longrightarrow> (x + D < t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
130 |
"\<lbrakk>D>0; t + 1 \<in> A\<rbrakk> \<Longrightarrow> (\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<le> t) \<longrightarrow> (x + D \<le> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
131 |
"D>0 \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x > t) \<longrightarrow> (x + D > t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
132 |
"D>0 \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<ge> t) \<longrightarrow> (x + D \<ge> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
133 |
"d dvd D \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (d dvd x+t) \<longrightarrow> (d dvd (x + D) + t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
134 |
"d dvd D \<Longrightarrow>(\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (\<not>d dvd x+t) \<longrightarrow> (\<not> d dvd (x + D) + t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
135 |
"\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j) \<longrightarrow> F \<longrightarrow> F" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
136 |
proof (blast, blast) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
137 |
assume dp: "D > 0" and tA: "t + 1 \<in> A" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
138 |
show "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x = t) \<longrightarrow> (x + D = t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
139 |
apply (rule allI, rule impI,erule ballE[where x="1"],erule ballE[where x="t + 1"]) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
140 |
using dp tA by simp_all |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
141 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
142 |
assume dp: "D > 0" and tA: "t \<in> A" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
143 |
show "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<noteq> t) \<longrightarrow> (x + D \<noteq> t))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
144 |
apply (rule allI, rule impI,erule ballE[where x="D"],erule ballE[where x="t"]) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
145 |
using dp tA by simp_all |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
146 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
147 |
assume dp: "D > 0" thus "(\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x > t) \<longrightarrow> (x + D > t))" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
148 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
149 |
assume dp: "D > 0" thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<ge> t) \<longrightarrow> (x + D \<ge> t)" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
150 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
151 |
assume dp: "D > 0" and tA:"t \<in> A" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
152 |
{fix x assume nob: "\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j" and g: "x < t" and ng: "\<not> (x + D) < t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
153 |
hence "t - x \<le> D" and "1 \<le> t - x" by simp+ |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
154 |
hence "\<exists>j \<in> {1 .. D}. t - x = j" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
155 |
hence "\<exists>j \<in> {1 .. D}. x = t - j" by (auto simp add: ring_eq_simps) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
156 |
with nob tA have "False" by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
157 |
thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x < t) \<longrightarrow> (x + D < t)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
158 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
159 |
assume dp: "D > 0" and tA:"t + 1\<in> A" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
160 |
{fix x assume nob: "\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j" and g: "x \<le> t" and ng: "\<not> (x + D) \<le> t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
161 |
hence "(t + 1) - x \<le> D" and "1 \<le> (t + 1) - x" by (simp_all add: ring_eq_simps) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
162 |
hence "\<exists>j \<in> {1 .. D}. (t + 1) - x = j" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
163 |
hence "\<exists>j \<in> {1 .. D}. x = (t + 1) - j" by (auto simp add: ring_eq_simps) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
164 |
with nob tA have "False" by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
165 |
thus "\<forall>x.(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (x \<le> t) \<longrightarrow> (x + D \<le> t)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
166 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
167 |
assume d: "d dvd D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
168 |
{fix x assume H: "d dvd x + t" with d have "d dvd (x + D) + t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
169 |
by (clarsimp simp add: dvd_def,rule_tac x= "ka + k" in exI,simp add: ring_eq_simps)} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
170 |
thus "\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (d dvd x+t) \<longrightarrow> (d dvd (x + D) + t)" by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
171 |
next |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
172 |
assume d: "d dvd D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
173 |
{fix x assume H: "\<not>(d dvd x + t)" with d have "\<not>d dvd (x + D) + t" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
174 |
by (clarsimp simp add: dvd_def,erule_tac x= "ka - k" in allE,simp add: ring_eq_simps)} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
175 |
thus "\<forall>(x::int).(\<forall>j\<in>{1 .. D}. \<forall>b\<in>A. x \<noteq> b - j)\<longrightarrow> (\<not>d dvd x+t) \<longrightarrow> (\<not>d dvd (x + D) + t)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
176 |
qed blast |
14577 | 177 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
178 |
section{* Cooper's Theorem @{text "-\<infinity>"} and @{text "+\<infinity>"} Version *} |
13876 | 179 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
180 |
subsection{* First some trivial facts about periodic sets or predicates *} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
181 |
lemma periodic_finite_ex: |
13876 | 182 |
assumes dpos: "(0::int) < d" and modd: "ALL x k. P x = P(x - k*d)" |
183 |
shows "(EX x. P x) = (EX j : {1..d}. P j)" |
|
184 |
(is "?LHS = ?RHS") |
|
185 |
proof |
|
186 |
assume ?LHS |
|
187 |
then obtain x where P: "P x" .. |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
188 |
have "x mod d = x - (x div d)*d" by(simp add:zmod_zdiv_equality mult_ac eq_diff_eq) |
13876 | 189 |
hence Pmod: "P x = P(x mod d)" using modd by simp |
190 |
show ?RHS |
|
191 |
proof (cases) |
|
192 |
assume "x mod d = 0" |
|
193 |
hence "P 0" using P Pmod by simp |
|
194 |
moreover have "P 0 = P(0 - (-1)*d)" using modd by blast |
|
195 |
ultimately have "P d" by simp |
|
196 |
moreover have "d : {1..d}" using dpos by(simp add:atLeastAtMost_iff) |
|
197 |
ultimately show ?RHS .. |
|
198 |
next |
|
199 |
assume not0: "x mod d \<noteq> 0" |
|
200 |
have "P(x mod d)" using dpos P Pmod by(simp add:pos_mod_sign pos_mod_bound) |
|
201 |
moreover have "x mod d : {1..d}" |
|
202 |
proof - |
|
23389 | 203 |
from dpos have "0 \<le> x mod d" by(rule pos_mod_sign) |
204 |
moreover from dpos have "x mod d < d" by(rule pos_mod_bound) |
|
13876 | 205 |
ultimately show ?thesis using not0 by(simp add:atLeastAtMost_iff) |
206 |
qed |
|
207 |
ultimately show ?RHS .. |
|
208 |
qed |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
209 |
qed auto |
13876 | 210 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
211 |
subsection{* The @{text "-\<infinity>"} Version*} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
212 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
213 |
lemma decr_lemma: "0 < (d::int) \<Longrightarrow> x - (abs(x-z)+1) * d < z" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
214 |
by(induct rule: int_gr_induct,simp_all add:int_distrib) |
14577 | 215 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
216 |
lemma incr_lemma: "0 < (d::int) \<Longrightarrow> z < x + (abs(x-z)+1) * d" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
217 |
by(induct rule: int_gr_induct, simp_all add:int_distrib) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
218 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
219 |
theorem int_induct[case_names base step1 step2]: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
220 |
assumes |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
221 |
base: "P(k::int)" and step1: "\<And>i. \<lbrakk>k \<le> i; P i\<rbrakk> \<Longrightarrow> P(i+1)" and |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
222 |
step2: "\<And>i. \<lbrakk>k \<ge> i; P i\<rbrakk> \<Longrightarrow> P(i - 1)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
223 |
shows "P i" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
224 |
proof - |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
225 |
have "i \<le> k \<or> i\<ge> k" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
226 |
thus ?thesis using prems int_ge_induct[where P="P" and k="k" and i="i"] int_le_induct[where P="P" and k="k" and i="i"] by blast |
13876 | 227 |
qed |
228 |
||
229 |
lemma decr_mult_lemma: |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
230 |
assumes dpos: "(0::int) < d" and minus: "\<forall>x. P x \<longrightarrow> P(x - d)" and knneg: "0 <= k" |
13876 | 231 |
shows "ALL x. P x \<longrightarrow> P(x - k*d)" |
232 |
using knneg |
|
233 |
proof (induct rule:int_ge_induct) |
|
234 |
case base thus ?case by simp |
|
235 |
next |
|
236 |
case (step i) |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
237 |
{fix x |
13876 | 238 |
have "P x \<longrightarrow> P (x - i * d)" using step.hyps by blast |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
239 |
also have "\<dots> \<longrightarrow> P(x - (i + 1) * d)" using minus[THEN spec, of "x - i * d"] |
14738 | 240 |
by (simp add:int_distrib OrderedGroup.diff_diff_eq[symmetric]) |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
241 |
ultimately have "P x \<longrightarrow> P(x - (i + 1) * d)" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
242 |
thus ?case .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
243 |
qed |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
244 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
245 |
lemma minusinfinity: |
23389 | 246 |
assumes dpos: "0 < d" and |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
247 |
P1eqP1: "ALL x k. P1 x = P1(x - k*d)" and ePeqP1: "EX z::int. ALL x. x < z \<longrightarrow> (P x = P1 x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
248 |
shows "(EX x. P1 x) \<longrightarrow> (EX x. P x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
249 |
proof |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
250 |
assume eP1: "EX x. P1 x" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
251 |
then obtain x where P1: "P1 x" .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
252 |
from ePeqP1 obtain z where P1eqP: "ALL x. x < z \<longrightarrow> (P x = P1 x)" .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
253 |
let ?w = "x - (abs(x-z)+1) * d" |
23389 | 254 |
from dpos have w: "?w < z" by(rule decr_lemma) |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
255 |
have "P1 x = P1 ?w" using P1eqP1 by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
256 |
also have "\<dots> = P(?w)" using w P1eqP by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
257 |
finally have "P ?w" using P1 by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
258 |
thus "EX x. P x" .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
259 |
qed |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
260 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
261 |
lemma cpmi: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
262 |
assumes dp: "0 < D" and p1:"\<exists>z. \<forall> x< z. P x = P' x" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
263 |
and nb:"\<forall>x.(\<forall> j\<in> {1..D}. \<forall>(b::int) \<in> B. x \<noteq> b+j) --> P (x) --> P (x - D)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
264 |
and pd: "\<forall> x k. P' x = P' (x-k*D)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
265 |
shows "(\<exists>x. P x) = ((\<exists> j\<in> {1..D} . P' j) | (\<exists> j \<in> {1..D}.\<exists> b\<in> B. P (b+j)))" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
266 |
(is "?L = (?R1 \<or> ?R2)") |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
267 |
proof- |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
268 |
{assume "?R2" hence "?L" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
269 |
moreover |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
270 |
{assume H:"?R1" hence "?L" using minusinfinity[OF dp pd p1] periodic_finite_ex[OF dp pd] by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
271 |
moreover |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
272 |
{ fix x |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
273 |
assume P: "P x" and H: "\<not> ?R2" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
274 |
{fix y assume "\<not> (\<exists>j\<in>{1..D}. \<exists>b\<in>B. P (b + j))" and P: "P y" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
275 |
hence "~(EX (j::int) : {1..D}. EX (b::int) : B. y = b+j)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
276 |
with nb P have "P (y - D)" by auto } |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
277 |
hence "ALL x.~(EX (j::int) : {1..D}. EX (b::int) : B. P(b+j)) --> P (x) --> P (x - D)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
278 |
with H P have th: " \<forall>x. P x \<longrightarrow> P (x - D)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
279 |
from p1 obtain z where z: "ALL x. x < z --> (P x = P' x)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
280 |
let ?y = "x - (\<bar>x - z\<bar> + 1)*D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
281 |
have zp: "0 <= (\<bar>x - z\<bar> + 1)" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
282 |
from dp have yz: "?y < z" using decr_lemma[OF dp] by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
283 |
from z[rule_format, OF yz] decr_mult_lemma[OF dp th zp, rule_format, OF P] have th2: " P' ?y" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
284 |
with periodic_finite_ex[OF dp pd] |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
285 |
have "?R1" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
286 |
ultimately show ?thesis by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
287 |
qed |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
288 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
289 |
subsection {* The @{text "+\<infinity>"} Version*} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
290 |
|
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
291 |
lemma plusinfinity: |
23389 | 292 |
assumes dpos: "(0::int) < d" and |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
293 |
P1eqP1: "\<forall>x k. P' x = P'(x - k*d)" and ePeqP1: "\<exists> z. \<forall> x>z. P x = P' x" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
294 |
shows "(\<exists> x. P' x) \<longrightarrow> (\<exists> x. P x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
295 |
proof |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
296 |
assume eP1: "EX x. P' x" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
297 |
then obtain x where P1: "P' x" .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
298 |
from ePeqP1 obtain z where P1eqP: "\<forall>x>z. P x = P' x" .. |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
299 |
let ?w' = "x + (abs(x-z)+1) * d" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
300 |
let ?w = "x - (-(abs(x-z) + 1))*d" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
301 |
have ww'[simp]: "?w = ?w'" by (simp add: ring_eq_simps) |
23389 | 302 |
from dpos have w: "?w > z" by(simp only: ww' incr_lemma) |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
303 |
hence "P' x = P' ?w" using P1eqP1 by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
304 |
also have "\<dots> = P(?w)" using w P1eqP by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
305 |
finally have "P ?w" using P1 by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
306 |
thus "EX x. P x" .. |
13876 | 307 |
qed |
308 |
||
309 |
lemma incr_mult_lemma: |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
310 |
assumes dpos: "(0::int) < d" and plus: "ALL x::int. P x \<longrightarrow> P(x + d)" and knneg: "0 <= k" |
13876 | 311 |
shows "ALL x. P x \<longrightarrow> P(x + k*d)" |
312 |
using knneg |
|
313 |
proof (induct rule:int_ge_induct) |
|
314 |
case base thus ?case by simp |
|
315 |
next |
|
316 |
case (step i) |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
317 |
{fix x |
13876 | 318 |
have "P x \<longrightarrow> P (x + i * d)" using step.hyps by blast |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
319 |
also have "\<dots> \<longrightarrow> P(x + (i + 1) * d)" using plus[THEN spec, of "x + i * d"] |
13876 | 320 |
by (simp add:int_distrib zadd_ac) |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
321 |
ultimately have "P x \<longrightarrow> P(x + (i + 1) * d)" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
322 |
thus ?case .. |
13876 | 323 |
qed |
324 |
||
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
325 |
lemma cppi: |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
326 |
assumes dp: "0 < D" and p1:"\<exists>z. \<forall> x> z. P x = P' x" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
327 |
and nb:"\<forall>x.(\<forall> j\<in> {1..D}. \<forall>(b::int) \<in> A. x \<noteq> b - j) --> P (x) --> P (x + D)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
328 |
and pd: "\<forall> x k. P' x= P' (x-k*D)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
329 |
shows "(\<exists>x. P x) = ((\<exists> j\<in> {1..D} . P' j) | (\<exists> j \<in> {1..D}.\<exists> b\<in> A. P (b - j)))" (is "?L = (?R1 \<or> ?R2)") |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
330 |
proof- |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
331 |
{assume "?R2" hence "?L" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
332 |
moreover |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
333 |
{assume H:"?R1" hence "?L" using plusinfinity[OF dp pd p1] periodic_finite_ex[OF dp pd] by simp} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
334 |
moreover |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
335 |
{ fix x |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
336 |
assume P: "P x" and H: "\<not> ?R2" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
337 |
{fix y assume "\<not> (\<exists>j\<in>{1..D}. \<exists>b\<in>A. P (b - j))" and P: "P y" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
338 |
hence "~(EX (j::int) : {1..D}. EX (b::int) : A. y = b - j)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
339 |
with nb P have "P (y + D)" by auto } |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
340 |
hence "ALL x.~(EX (j::int) : {1..D}. EX (b::int) : A. P(b-j)) --> P (x) --> P (x + D)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
341 |
with H P have th: " \<forall>x. P x \<longrightarrow> P (x + D)" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
342 |
from p1 obtain z where z: "ALL x. x > z --> (P x = P' x)" by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
343 |
let ?y = "x + (\<bar>x - z\<bar> + 1)*D" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
344 |
have zp: "0 <= (\<bar>x - z\<bar> + 1)" by arith |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
345 |
from dp have yz: "?y > z" using incr_lemma[OF dp] by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
346 |
from z[rule_format, OF yz] incr_mult_lemma[OF dp th zp, rule_format, OF P] have th2: " P' ?y" by auto |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
347 |
with periodic_finite_ex[OF dp pd] |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
348 |
have "?R1" by blast} |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
349 |
ultimately show ?thesis by blast |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
350 |
qed |
13876 | 351 |
|
352 |
lemma simp_from_to: "{i..j::int} = (if j < i then {} else insert i {i+1..j})" |
|
353 |
apply(simp add:atLeastAtMost_def atLeast_def atMost_def) |
|
354 |
apply(fastsimp) |
|
355 |
done |
|
356 |
||
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
357 |
theorem unity_coeff_ex: "(\<exists>(x::'a::{semiring_0}). P (l * x)) \<equiv> (\<exists>x. l dvd (x + 0) \<and> P x)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
358 |
apply (rule eq_reflection[symmetric]) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
359 |
apply (rule iffI) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
360 |
defer |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
361 |
apply (erule exE) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
362 |
apply (rule_tac x = "l * x" in exI) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
363 |
apply (simp add: dvd_def) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
364 |
apply (rule_tac x="x" in exI, simp) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
365 |
apply (erule exE) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
366 |
apply (erule conjE) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
367 |
apply (erule dvdE) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
368 |
apply (rule_tac x = k in exI) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
369 |
apply simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
370 |
done |
13876 | 371 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
372 |
lemma zdvd_mono: assumes not0: "(k::int) \<noteq> 0" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
373 |
shows "((m::int) dvd t) \<equiv> (k*m dvd k*t)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
374 |
using not0 by (simp add: dvd_def) |
13876 | 375 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
376 |
lemma uminus_dvd_conv: "(d dvd (t::int)) \<equiv> (-d dvd t)" "(d dvd (t::int)) \<equiv> (d dvd -t)" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
377 |
by simp_all |
14577 | 378 |
text {* \bigskip Theorems for transforming predicates on nat to predicates on @{text int}*} |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
379 |
lemma all_nat: "(\<forall>x::nat. P x) = (\<forall>x::int. 0 <= x \<longrightarrow> P (nat x))" |
13876 | 380 |
by (simp split add: split_nat) |
381 |
||
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
382 |
lemma ex_nat: "(\<exists>x::nat. P x) = (\<exists>x::int. 0 <= x \<and> P (nat x))" |
23365 | 383 |
apply (auto split add: split_nat) |
384 |
apply (rule_tac x="int x" in exI, simp) |
|
385 |
apply (rule_tac x = "nat x" in exI,erule_tac x = "nat x" in allE, simp) |
|
386 |
done |
|
13876 | 387 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
388 |
lemma zdiff_int_split: "P (int (x - y)) = |
13876 | 389 |
((y \<le> x \<longrightarrow> P (int x - int y)) \<and> (x < y \<longrightarrow> P 0))" |
23365 | 390 |
by (case_tac "y \<le> x", simp_all) |
13876 | 391 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
392 |
lemma number_of1: "(0::int) <= number_of n \<Longrightarrow> (0::int) <= number_of (n BIT b)" by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
393 |
lemma number_of2: "(0::int) <= Numeral0" by simp |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
394 |
lemma Suc_plus1: "Suc n = n + 1" by simp |
13876 | 395 |
|
14577 | 396 |
text {* |
397 |
\medskip Specific instances of congruence rules, to prevent |
|
398 |
simplifier from looping. *} |
|
13876 | 399 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
400 |
theorem imp_le_cong: "(0 <= x \<Longrightarrow> P = P') \<Longrightarrow> (0 <= (x::int) \<longrightarrow> P) = (0 <= x \<longrightarrow> P')" by simp |
18202
46af82efd311
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents:
17589
diff
changeset
|
401 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
402 |
theorem conj_le_cong: "(0 <= x \<Longrightarrow> P = P') \<Longrightarrow> (0 <= (x::int) \<and> P) = (0 <= x \<and> P')" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
403 |
by (simp cong: conj_cong) |
20485 | 404 |
lemma int_eq_number_of_eq: |
405 |
"(((number_of v)::int) = (number_of w)) = iszero ((number_of (v + (uminus w)))::int)" |
|
18202
46af82efd311
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents:
17589
diff
changeset
|
406 |
by simp |
46af82efd311
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents:
17589
diff
changeset
|
407 |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
408 |
lemma mod_eq0_dvd_iff[presburger]: "(m::nat) mod n = 0 \<longleftrightarrow> n dvd m" |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
409 |
unfolding dvd_eq_mod_eq_0[symmetric] .. |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
410 |
|
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
411 |
lemma zmod_eq0_zdvd_iff[presburger]: "(m::int) mod n = 0 \<longleftrightarrow> n dvd m" |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
412 |
unfolding zdvd_iff_zmod_eq_0[symmetric] .. |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
413 |
declare mod_1[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
414 |
declare mod_0[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
415 |
declare zmod_1[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
416 |
declare zmod_zero[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
417 |
declare zmod_self[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
418 |
declare mod_self[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
419 |
declare DIVISION_BY_ZERO_MOD[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
420 |
declare nat_mod_div_trivial[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
421 |
declare div_mod_equality2[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
422 |
declare div_mod_equality[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
423 |
declare mod_div_equality2[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
424 |
declare mod_div_equality[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
425 |
declare mod_mult_self1[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
426 |
declare mod_mult_self2[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
427 |
declare zdiv_zmod_equality2[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
428 |
declare zdiv_zmod_equality[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
429 |
declare mod2_Suc_Suc[presburger] |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
430 |
lemma [presburger]: "(a::int) div 0 = 0" and [presburger]: "a mod 0 = a" |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
431 |
using IntDiv.DIVISION_BY_ZERO by blast+ |
18202
46af82efd311
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents:
17589
diff
changeset
|
432 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
433 |
use "Tools/Presburger/cooper.ML" |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
434 |
oracle linzqe_oracle ("term") = Coopereif.cooper_oracle |
18202
46af82efd311
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents:
17589
diff
changeset
|
435 |
|
23146 | 436 |
use "Tools/Presburger/presburger.ML" |
13876 | 437 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
438 |
setup {* |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
439 |
arith_tactic_add |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
440 |
(mk_arith_tactic "presburger" (fn i => fn st => |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
441 |
(warning "Trying Presburger arithmetic ..."; |
23333
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
442 |
Presburger.cooper_tac true [] [] ((ProofContext.init o theory_of_thm) st) i st))) |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
443 |
(* FIXME!!!!!!! get the right context!!*) |
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
444 |
*} |
23333
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
445 |
|
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
446 |
method_setup presburger = {* |
23333
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
447 |
let |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
448 |
fun keyword k = Scan.lift (Args.$$$ k -- Args.colon) >> K () |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
449 |
fun simple_keyword k = Scan.lift (Args.$$$ k) >> K () |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
450 |
val addN = "add" |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
451 |
val delN = "del" |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
452 |
val elimN = "elim" |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
453 |
val any_keyword = keyword addN || keyword delN || simple_keyword elimN |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
454 |
val thms = Scan.repeat (Scan.unless any_keyword Attrib.multi_thm) >> flat; |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
455 |
in |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
456 |
fn src => Method.syntax |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
457 |
((Scan.optional (simple_keyword elimN >> K false) true) -- |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
458 |
(Scan.optional (keyword addN |-- thms) []) -- |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
459 |
(Scan.optional (keyword delN |-- thms) [])) src |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
460 |
#> (fn (((elim, add_ths), del_ths),ctxt) => |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
461 |
Method.SIMPLE_METHOD' (Presburger.cooper_tac elim add_ths del_ths ctxt)) |
ec5b4ab52026
Method now takes theorems to be added or deleted from a simpset for simplificatio before the core method starts
chaieb
parents:
23314
diff
changeset
|
462 |
end |
23314
6894137e854a
A new and cleaned up Theory for QE. for Presburger arithmetic
chaieb
parents:
23253
diff
changeset
|
463 |
*} "" |
22801 | 464 |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
465 |
lemma [presburger]: "m mod 2 = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
466 |
lemma [presburger]: "m mod 2 = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
467 |
lemma [presburger]: "m mod (Suc (Suc 0)) = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
468 |
lemma [presburger]: "m mod (Suc (Suc 0)) = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
469 |
lemma [presburger]: "m mod 2 = (1::int) \<longleftrightarrow> \<not> 2 dvd m " by presburger |
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
470 |
|
22801 | 471 |
subsection {* Code generator setup *} |
20595 | 472 |
text {* |
22801 | 473 |
Presburger arithmetic is convenient to prove some |
474 |
of the following code lemmas on integer numerals: |
|
20595 | 475 |
*} |
476 |
||
477 |
lemma eq_Pls_Pls: |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
478 |
"Numeral.Pls = Numeral.Pls \<longleftrightarrow> True" by presburger |
20595 | 479 |
|
480 |
lemma eq_Pls_Min: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
481 |
"Numeral.Pls = Numeral.Min \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
482 |
unfolding Pls_def Min_def by presburger |
20595 | 483 |
|
484 |
lemma eq_Pls_Bit0: |
|
21454 | 485 |
"Numeral.Pls = Numeral.Bit k bit.B0 \<longleftrightarrow> Numeral.Pls = k" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
486 |
unfolding Pls_def Bit_def bit.cases by presburger |
20595 | 487 |
|
488 |
lemma eq_Pls_Bit1: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
489 |
"Numeral.Pls = Numeral.Bit k bit.B1 \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
490 |
unfolding Pls_def Bit_def bit.cases by presburger |
20595 | 491 |
|
492 |
lemma eq_Min_Pls: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
493 |
"Numeral.Min = Numeral.Pls \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
494 |
unfolding Pls_def Min_def by presburger |
20595 | 495 |
|
496 |
lemma eq_Min_Min: |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
497 |
"Numeral.Min = Numeral.Min \<longleftrightarrow> True" by presburger |
20595 | 498 |
|
499 |
lemma eq_Min_Bit0: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
500 |
"Numeral.Min = Numeral.Bit k bit.B0 \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
501 |
unfolding Min_def Bit_def bit.cases by presburger |
20595 | 502 |
|
503 |
lemma eq_Min_Bit1: |
|
21454 | 504 |
"Numeral.Min = Numeral.Bit k bit.B1 \<longleftrightarrow> Numeral.Min = k" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
505 |
unfolding Min_def Bit_def bit.cases by presburger |
20595 | 506 |
|
507 |
lemma eq_Bit0_Pls: |
|
21454 | 508 |
"Numeral.Bit k bit.B0 = Numeral.Pls \<longleftrightarrow> Numeral.Pls = k" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
509 |
unfolding Pls_def Bit_def bit.cases by presburger |
20595 | 510 |
|
511 |
lemma eq_Bit1_Pls: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
512 |
"Numeral.Bit k bit.B1 = Numeral.Pls \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
513 |
unfolding Pls_def Bit_def bit.cases by presburger |
20595 | 514 |
|
515 |
lemma eq_Bit0_Min: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
516 |
"Numeral.Bit k bit.B0 = Numeral.Min \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
517 |
unfolding Min_def Bit_def bit.cases by presburger |
20595 | 518 |
|
519 |
lemma eq_Bit1_Min: |
|
21454 | 520 |
"(Numeral.Bit k bit.B1) = Numeral.Min \<longleftrightarrow> Numeral.Min = k" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
521 |
unfolding Min_def Bit_def bit.cases by presburger |
20595 | 522 |
|
523 |
lemma eq_Bit_Bit: |
|
21454 | 524 |
"Numeral.Bit k1 v1 = Numeral.Bit k2 v2 \<longleftrightarrow> |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
525 |
v1 = v2 \<and> k1 = k2" |
21454 | 526 |
unfolding Bit_def |
20595 | 527 |
apply (cases v1) |
528 |
apply (cases v2) |
|
529 |
apply auto |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
530 |
apply presburger |
20595 | 531 |
apply (cases v2) |
532 |
apply auto |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
533 |
apply presburger |
20595 | 534 |
apply (cases v2) |
535 |
apply auto |
|
536 |
done |
|
537 |
||
22801 | 538 |
lemma eq_number_of: |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
539 |
"(number_of k \<Colon> int) = number_of l \<longleftrightarrow> k = l" |
22801 | 540 |
unfolding number_of_is_id .. |
20595 | 541 |
|
22394 | 542 |
|
20595 | 543 |
lemma less_eq_Pls_Pls: |
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
544 |
"Numeral.Pls \<le> Numeral.Pls \<longleftrightarrow> True" by rule+ |
20595 | 545 |
|
546 |
lemma less_eq_Pls_Min: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
547 |
"Numeral.Pls \<le> Numeral.Min \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
548 |
unfolding Pls_def Min_def by presburger |
20595 | 549 |
|
550 |
lemma less_eq_Pls_Bit: |
|
551 |
"Numeral.Pls \<le> Numeral.Bit k v \<longleftrightarrow> Numeral.Pls \<le> k" |
|
552 |
unfolding Pls_def Bit_def by (cases v) auto |
|
553 |
||
554 |
lemma less_eq_Min_Pls: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
555 |
"Numeral.Min \<le> Numeral.Pls \<longleftrightarrow> True" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
556 |
unfolding Pls_def Min_def by presburger |
20595 | 557 |
|
558 |
lemma less_eq_Min_Min: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
559 |
"Numeral.Min \<le> Numeral.Min \<longleftrightarrow> True" by rule+ |
20595 | 560 |
|
561 |
lemma less_eq_Min_Bit0: |
|
562 |
"Numeral.Min \<le> Numeral.Bit k bit.B0 \<longleftrightarrow> Numeral.Min < k" |
|
563 |
unfolding Min_def Bit_def by auto |
|
564 |
||
565 |
lemma less_eq_Min_Bit1: |
|
566 |
"Numeral.Min \<le> Numeral.Bit k bit.B1 \<longleftrightarrow> Numeral.Min \<le> k" |
|
567 |
unfolding Min_def Bit_def by auto |
|
568 |
||
569 |
lemma less_eq_Bit0_Pls: |
|
570 |
"Numeral.Bit k bit.B0 \<le> Numeral.Pls \<longleftrightarrow> k \<le> Numeral.Pls" |
|
571 |
unfolding Pls_def Bit_def by simp |
|
572 |
||
573 |
lemma less_eq_Bit1_Pls: |
|
574 |
"Numeral.Bit k bit.B1 \<le> Numeral.Pls \<longleftrightarrow> k < Numeral.Pls" |
|
575 |
unfolding Pls_def Bit_def by auto |
|
576 |
||
577 |
lemma less_eq_Bit_Min: |
|
578 |
"Numeral.Bit k v \<le> Numeral.Min \<longleftrightarrow> k \<le> Numeral.Min" |
|
579 |
unfolding Min_def Bit_def by (cases v) auto |
|
580 |
||
581 |
lemma less_eq_Bit0_Bit: |
|
582 |
"Numeral.Bit k1 bit.B0 \<le> Numeral.Bit k2 v \<longleftrightarrow> k1 \<le> k2" |
|
22394 | 583 |
unfolding Bit_def bit.cases by (cases v) auto |
20595 | 584 |
|
585 |
lemma less_eq_Bit_Bit1: |
|
586 |
"Numeral.Bit k1 v \<le> Numeral.Bit k2 bit.B1 \<longleftrightarrow> k1 \<le> k2" |
|
22394 | 587 |
unfolding Bit_def bit.cases by (cases v) auto |
588 |
||
589 |
lemma less_eq_Bit1_Bit0: |
|
590 |
"Numeral.Bit k1 bit.B1 \<le> Numeral.Bit k2 bit.B0 \<longleftrightarrow> k1 < k2" |
|
591 |
unfolding Bit_def by (auto split: bit.split) |
|
20595 | 592 |
|
22801 | 593 |
lemma less_eq_number_of: |
594 |
"(number_of k \<Colon> int) \<le> number_of l \<longleftrightarrow> k \<le> l" |
|
595 |
unfolding number_of_is_id .. |
|
22394 | 596 |
|
597 |
||
598 |
lemma less_Pls_Pls: |
|
23405 | 599 |
"Numeral.Pls < Numeral.Pls \<longleftrightarrow> False" by simp |
22394 | 600 |
|
601 |
lemma less_Pls_Min: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
602 |
"Numeral.Pls < Numeral.Min \<longleftrightarrow> False" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
603 |
unfolding Pls_def Min_def by presburger |
22394 | 604 |
|
605 |
lemma less_Pls_Bit0: |
|
606 |
"Numeral.Pls < Numeral.Bit k bit.B0 \<longleftrightarrow> Numeral.Pls < k" |
|
607 |
unfolding Pls_def Bit_def by auto |
|
608 |
||
609 |
lemma less_Pls_Bit1: |
|
610 |
"Numeral.Pls < Numeral.Bit k bit.B1 \<longleftrightarrow> Numeral.Pls \<le> k" |
|
611 |
unfolding Pls_def Bit_def by auto |
|
612 |
||
613 |
lemma less_Min_Pls: |
|
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22394
diff
changeset
|
614 |
"Numeral.Min < Numeral.Pls \<longleftrightarrow> True" |
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
615 |
unfolding Pls_def Min_def by presburger |
22394 | 616 |
|
617 |
lemma less_Min_Min: |
|
23405 | 618 |
"Numeral.Min < Numeral.Min \<longleftrightarrow> False" by simp |
22394 | 619 |
|
620 |
lemma less_Min_Bit: |
|
621 |
"Numeral.Min < Numeral.Bit k v \<longleftrightarrow> Numeral.Min < k" |
|
622 |
unfolding Min_def Bit_def by (auto split: bit.split) |
|
623 |
||
624 |
lemma less_Bit_Pls: |
|
625 |
"Numeral.Bit k v < Numeral.Pls \<longleftrightarrow> k < Numeral.Pls" |
|
626 |
unfolding Pls_def Bit_def by (auto split: bit.split) |
|
627 |
||
628 |
lemma less_Bit0_Min: |
|
629 |
"Numeral.Bit k bit.B0 < Numeral.Min \<longleftrightarrow> k \<le> Numeral.Min" |
|
630 |
unfolding Min_def Bit_def by auto |
|
631 |
||
632 |
lemma less_Bit1_Min: |
|
633 |
"Numeral.Bit k bit.B1 < Numeral.Min \<longleftrightarrow> k < Numeral.Min" |
|
634 |
unfolding Min_def Bit_def by auto |
|
635 |
||
636 |
lemma less_Bit_Bit0: |
|
637 |
"Numeral.Bit k1 v < Numeral.Bit k2 bit.B0 \<longleftrightarrow> k1 < k2" |
|
638 |
unfolding Bit_def by (auto split: bit.split) |
|
639 |
||
640 |
lemma less_Bit1_Bit: |
|
641 |
"Numeral.Bit k1 bit.B1 < Numeral.Bit k2 v \<longleftrightarrow> k1 < k2" |
|
642 |
unfolding Bit_def by (auto split: bit.split) |
|
643 |
||
644 |
lemma less_Bit0_Bit1: |
|
645 |
"Numeral.Bit k1 bit.B0 < Numeral.Bit k2 bit.B1 \<longleftrightarrow> k1 \<le> k2" |
|
23390
01ef1135de73
Added some lemmas to default presburger simpset; tuned proofs
chaieb
parents:
23389
diff
changeset
|
646 |
unfolding Bit_def bit.cases by arith |
22394 | 647 |
|
22801 | 648 |
lemma less_number_of: |
649 |
"(number_of k \<Colon> int) < number_of l \<longleftrightarrow> k < l" |
|
650 |
unfolding number_of_is_id .. |
|
651 |
||
652 |
lemmas pred_succ_numeral_code [code func] = |
|
653 |
arith_simps(5-12) |
|
654 |
||
655 |
lemmas plus_numeral_code [code func] = |
|
656 |
arith_simps(13-17) |
|
657 |
arith_simps(26-27) |
|
658 |
arith_extra_simps(1) [where 'a = int] |
|
659 |
||
660 |
lemmas minus_numeral_code [code func] = |
|
661 |
arith_simps(18-21) |
|
662 |
arith_extra_simps(2) [where 'a = int] |
|
663 |
arith_extra_simps(5) [where 'a = int] |
|
664 |
||
665 |
lemmas times_numeral_code [code func] = |
|
666 |
arith_simps(22-25) |
|
667 |
arith_extra_simps(4) [where 'a = int] |
|
668 |
||
669 |
lemmas eq_numeral_code [code func] = |
|
670 |
eq_Pls_Pls eq_Pls_Min eq_Pls_Bit0 eq_Pls_Bit1 |
|
671 |
eq_Min_Pls eq_Min_Min eq_Min_Bit0 eq_Min_Bit1 |
|
672 |
eq_Bit0_Pls eq_Bit1_Pls eq_Bit0_Min eq_Bit1_Min eq_Bit_Bit |
|
673 |
eq_number_of |
|
674 |
||
675 |
lemmas less_eq_numeral_code [code func] = less_eq_Pls_Pls less_eq_Pls_Min less_eq_Pls_Bit |
|
676 |
less_eq_Min_Pls less_eq_Min_Min less_eq_Min_Bit0 less_eq_Min_Bit1 |
|
677 |
less_eq_Bit0_Pls less_eq_Bit1_Pls less_eq_Bit_Min less_eq_Bit0_Bit less_eq_Bit_Bit1 less_eq_Bit1_Bit0 |
|
678 |
less_eq_number_of |
|
679 |
||
22394 | 680 |
lemmas less_numeral_code [code func] = less_Pls_Pls less_Pls_Min less_Pls_Bit0 |
681 |
less_Pls_Bit1 less_Min_Pls less_Min_Min less_Min_Bit less_Bit_Pls |
|
682 |
less_Bit0_Min less_Bit1_Min less_Bit_Bit0 less_Bit1_Bit less_Bit0_Bit1 |
|
22801 | 683 |
less_number_of |
20595 | 684 |
|
23365 | 685 |
end |