src/HOL/Decision_Procs/Dense_Linear_Order.thy
author wenzelm
Fri Mar 07 22:30:58 2014 +0100 (2014-03-07)
changeset 55990 41c6b99c5fb7
parent 55848 1bfe72d14630
child 58889 5b7a9633cfa8
permissions -rw-r--r--
more antiquotations;
hoelzl@30439
     1
(*  Title       : HOL/Decision_Procs/Dense_Linear_Order.thy
haftmann@29655
     2
    Author      : Amine Chaieb, TU Muenchen
haftmann@29655
     3
*)
chaieb@26161
     4
chaieb@26161
     5
header {* Dense linear order without endpoints
chaieb@26161
     6
  and a quantifier elimination procedure in Ferrante and Rackoff style *}
chaieb@26161
     7
chaieb@26161
     8
theory Dense_Linear_Order
haftmann@30738
     9
imports Main
chaieb@26161
    10
begin
chaieb@26161
    11
wenzelm@48891
    12
ML_file "langford_data.ML"
wenzelm@48891
    13
ML_file "ferrante_rackoff_data.ML"
wenzelm@48891
    14
chaieb@26161
    15
context linorder
chaieb@26161
    16
begin
chaieb@26161
    17
wenzelm@49519
    18
lemma less_not_permute[no_atp]: "\<not> (x < y \<and> y < x)"
wenzelm@49519
    19
  by (simp add: not_less linear)
chaieb@26161
    20
blanchet@35828
    21
lemma gather_simps[no_atp]: 
wenzelm@49519
    22
  "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> U. x < y) \<and> x < u \<and> P x) \<longleftrightarrow>
wenzelm@49519
    23
    (\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> (insert u U). x < y) \<and> P x)"
wenzelm@49519
    24
  "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> U. x < y) \<and> l < x \<and> P x) \<longleftrightarrow>
wenzelm@49519
    25
    (\<exists>x. (\<forall>y \<in> (insert l L). y < x) \<and> (\<forall>y \<in> U. x < y) \<and> P x)"
wenzelm@49519
    26
  "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> U. x < y) \<and> x < u) \<longleftrightarrow>
wenzelm@49519
    27
    (\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> (insert u U). x < y))"
wenzelm@49519
    28
  "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> U. x < y) \<and> l < x) \<longleftrightarrow>
wenzelm@49519
    29
    (\<exists>x. (\<forall>y \<in> (insert l L). y < x) \<and> (\<forall>y \<in> U. x < y))"
wenzelm@49519
    30
  by auto
chaieb@26161
    31
wenzelm@49519
    32
lemma gather_start [no_atp]: "(\<exists>x. P x) \<equiv> (\<exists>x. (\<forall>y \<in> {}. y < x) \<and> (\<forall>y\<in> {}. x < y) \<and> P x)" 
chaieb@26161
    33
  by simp
chaieb@26161
    34
wenzelm@53072
    35
text{* Theorems for @{text "\<exists>z. \<forall>x. x < z \<longrightarrow> (P x \<longleftrightarrow> P\<^sub>-\<^sub>\<infinity>)"}*}
blanchet@35828
    36
lemma minf_lt[no_atp]:  "\<exists>z . \<forall>x. x < z \<longrightarrow> (x < t \<longleftrightarrow> True)" by auto
blanchet@35828
    37
lemma minf_gt[no_atp]: "\<exists>z . \<forall>x. x < z \<longrightarrow>  (t < x \<longleftrightarrow>  False)"
chaieb@26161
    38
  by (simp add: not_less) (rule exI[where x="t"], auto simp add: less_le)
chaieb@26161
    39
blanchet@35828
    40
lemma minf_le[no_atp]: "\<exists>z. \<forall>x. x < z \<longrightarrow> (x \<le> t \<longleftrightarrow> True)" by (auto simp add: less_le)
blanchet@35828
    41
lemma minf_ge[no_atp]: "\<exists>z. \<forall>x. x < z \<longrightarrow> (t \<le> x \<longleftrightarrow> False)"
chaieb@26161
    42
  by (auto simp add: less_le not_less not_le)
blanchet@35828
    43
lemma minf_eq[no_atp]: "\<exists>z. \<forall>x. x < z \<longrightarrow> (x = t \<longleftrightarrow> False)" by auto
blanchet@35828
    44
lemma minf_neq[no_atp]: "\<exists>z. \<forall>x. x < z \<longrightarrow> (x \<noteq> t \<longleftrightarrow> True)" by auto
blanchet@35828
    45
lemma minf_P[no_atp]: "\<exists>z. \<forall>x. x < z \<longrightarrow> (P \<longleftrightarrow> P)" by blast
chaieb@26161
    46
wenzelm@53072
    47
text{* Theorems for @{text "\<exists>z. \<forall>x. x < z \<longrightarrow> (P x \<longleftrightarrow> P\<^sub>+\<^sub>\<infinity>)"}*}
wenzelm@49519
    48
lemma pinf_gt[no_atp]:  "\<exists>z. \<forall>x. z < x \<longrightarrow> (t < x \<longleftrightarrow> True)" by auto
wenzelm@49519
    49
lemma pinf_lt[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow>  (x < t \<longleftrightarrow>  False)"
chaieb@26161
    50
  by (simp add: not_less) (rule exI[where x="t"], auto simp add: less_le)
chaieb@26161
    51
blanchet@35828
    52
lemma pinf_ge[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow> (t \<le> x \<longleftrightarrow> True)" by (auto simp add: less_le)
blanchet@35828
    53
lemma pinf_le[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow> (x \<le> t \<longleftrightarrow> False)"
chaieb@26161
    54
  by (auto simp add: less_le not_less not_le)
blanchet@35828
    55
lemma pinf_eq[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow> (x = t \<longleftrightarrow> False)" by auto
blanchet@35828
    56
lemma pinf_neq[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow> (x \<noteq> t \<longleftrightarrow> True)" by auto
blanchet@35828
    57
lemma pinf_P[no_atp]: "\<exists>z. \<forall>x. z < x \<longrightarrow> (P \<longleftrightarrow> P)" by blast
chaieb@26161
    58
blanchet@35828
    59
lemma nmi_lt[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>True \<and> x < t \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    60
lemma nmi_gt[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and> t < x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)"
chaieb@26161
    61
  by (auto simp add: le_less)
blanchet@35828
    62
lemma  nmi_le[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>True \<and> x\<le> t \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    63
lemma  nmi_ge[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and> t\<le> x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    64
lemma  nmi_eq[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and>  x = t \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    65
lemma  nmi_neq[no_atp]: "t \<in> U \<Longrightarrow>\<forall>x. \<not>True \<and> x \<noteq> t \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    66
lemma  nmi_P[no_atp]: "\<forall> x. ~P \<and> P \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    67
lemma  nmi_conj[no_atp]: "\<lbrakk>\<forall>x. \<not>P1' \<and> P1 x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x) ;
chaieb@26161
    68
  \<forall>x. \<not>P2' \<and> P2 x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)\<rbrakk> \<Longrightarrow>
chaieb@26161
    69
  \<forall>x. \<not>(P1' \<and> P2') \<and> (P1 x \<and> P2 x) \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
blanchet@35828
    70
lemma  nmi_disj[no_atp]: "\<lbrakk>\<forall>x. \<not>P1' \<and> P1 x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x) ;
chaieb@26161
    71
  \<forall>x. \<not>P2' \<and> P2 x \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)\<rbrakk> \<Longrightarrow>
chaieb@26161
    72
  \<forall>x. \<not>(P1' \<or> P2') \<and> (P1 x \<or> P2 x) \<longrightarrow>  (\<exists> u\<in> U. u \<le> x)" by auto
chaieb@26161
    73
blanchet@35828
    74
lemma  npi_lt[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and>  x < t \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by (auto simp add: le_less)
blanchet@35828
    75
lemma  npi_gt[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>True \<and> t < x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    76
lemma  npi_le[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and>  x \<le> t \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    77
lemma  npi_ge[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>True \<and> t \<le> x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    78
lemma  npi_eq[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>False \<and>  x = t \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    79
lemma  npi_neq[no_atp]: "t \<in> U \<Longrightarrow> \<forall>x. \<not>True \<and> x \<noteq> t \<longrightarrow>  (\<exists> u\<in> U. x \<le> u )" by auto
blanchet@35828
    80
lemma  npi_P[no_atp]: "\<forall> x. ~P \<and> P \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    81
lemma  npi_conj[no_atp]: "\<lbrakk>\<forall>x. \<not>P1' \<and> P1 x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u) ;  \<forall>x. \<not>P2' \<and> P2 x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)\<rbrakk>
chaieb@26161
    82
  \<Longrightarrow>  \<forall>x. \<not>(P1' \<and> P2') \<and> (P1 x \<and> P2 x) \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
blanchet@35828
    83
lemma  npi_disj[no_atp]: "\<lbrakk>\<forall>x. \<not>P1' \<and> P1 x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u) ; \<forall>x. \<not>P2' \<and> P2 x \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)\<rbrakk>
chaieb@26161
    84
  \<Longrightarrow> \<forall>x. \<not>(P1' \<or> P2') \<and> (P1 x \<or> P2 x) \<longrightarrow>  (\<exists> u\<in> U. x \<le> u)" by auto
chaieb@26161
    85
wenzelm@49519
    86
lemma lin_dense_lt[no_atp]:
wenzelm@49519
    87
  "t \<in> U \<Longrightarrow>
wenzelm@49519
    88
    \<forall>x l u. (\<forall> t. l < t \<and> t < u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> x < t \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> y < t)"
chaieb@26161
    89
proof(clarsimp)
wenzelm@49519
    90
  fix x l u y
wenzelm@49519
    91
  assume tU: "t \<in> U" and noU: "\<forall>t. l < t \<and> t < u \<longrightarrow> t \<notin> U" and lx: "l < x"
chaieb@26161
    92
    and xu: "x<u"  and px: "x < t" and ly: "l<y" and yu:"y < u"
chaieb@26161
    93
  from tU noU ly yu have tny: "t\<noteq>y" by auto
wenzelm@49519
    94
  { assume H: "t < y"
chaieb@26161
    95
    from less_trans[OF lx px] less_trans[OF H yu]
wenzelm@49519
    96
    have "l < t \<and> t < u" by simp
wenzelm@49519
    97
    with tU noU have "False" by auto }
wenzelm@49519
    98
  then have "\<not> t < y" by auto
wenzelm@49519
    99
  then have "y \<le> t" by (simp add: not_less)
wenzelm@49519
   100
  then show "y < t" using tny by (simp add: less_le)
chaieb@26161
   101
qed
chaieb@26161
   102
wenzelm@49519
   103
lemma lin_dense_gt[no_atp]:
wenzelm@49519
   104
  "t \<in> U \<Longrightarrow>
wenzelm@49519
   105
    \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l < x \<and> x < u \<and> t < x \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> t < y)"
wenzelm@49519
   106
proof(clarsimp)
wenzelm@49519
   107
  fix x l u y
wenzelm@49519
   108
  assume tU: "t \<in> U" and noU: "\<forall>t. l < t \<and> t < u \<longrightarrow> t \<notin> U" and lx: "l < x" and xu: "x<u"
wenzelm@49519
   109
    and px: "t < x" and ly: "l<y" and yu:"y < u"
wenzelm@49519
   110
  from tU noU ly yu have tny: "t\<noteq>y" by auto
wenzelm@49519
   111
  { assume H: "y< t"
wenzelm@49519
   112
    from less_trans[OF ly H] less_trans[OF px xu] have "l < t \<and> t < u" by simp
wenzelm@49519
   113
    with tU noU have "False" by auto }
wenzelm@49519
   114
  then have "\<not> y<t" by auto
wenzelm@49519
   115
  then have "t \<le> y" by (auto simp add: not_less)
wenzelm@49519
   116
  then show "t < y" using tny by (simp add: less_le)
wenzelm@49519
   117
qed
wenzelm@49519
   118
wenzelm@49519
   119
lemma lin_dense_le[no_atp]:
wenzelm@49519
   120
  "t \<in> U \<Longrightarrow>
wenzelm@49519
   121
    \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> x \<le> t \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> y\<le> t)"
chaieb@26161
   122
proof(clarsimp)
chaieb@26161
   123
  fix x l u y
chaieb@26161
   124
  assume tU: "t \<in> U" and noU: "\<forall>t. l < t \<and> t < u \<longrightarrow> t \<notin> U" and lx: "l < x" and xu: "x<u"
wenzelm@49519
   125
    and px: "x \<le> t" and ly: "l<y" and yu:"y < u"
chaieb@26161
   126
  from tU noU ly yu have tny: "t\<noteq>y" by auto
wenzelm@49519
   127
  { assume H: "t < y"
wenzelm@49519
   128
    from less_le_trans[OF lx px] less_trans[OF H yu]
wenzelm@49519
   129
    have "l < t \<and> t < u" by simp
wenzelm@49519
   130
    with tU noU have "False" by auto }
wenzelm@49519
   131
  then have "\<not> t < y" by auto
wenzelm@49519
   132
  then show "y \<le> t" by (simp add: not_less)
chaieb@26161
   133
qed
chaieb@26161
   134
wenzelm@49519
   135
lemma lin_dense_ge[no_atp]:
wenzelm@49519
   136
  "t \<in> U \<Longrightarrow>
wenzelm@49519
   137
    \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> t \<le> x \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> t \<le> y)"
chaieb@26161
   138
proof(clarsimp)
chaieb@26161
   139
  fix x l u y
chaieb@26161
   140
  assume tU: "t \<in> U" and noU: "\<forall>t. l < t \<and> t < u \<longrightarrow> t \<notin> U" and lx: "l < x" and xu: "x<u"
wenzelm@49519
   141
    and px: "t \<le> x" and ly: "l<y" and yu:"y < u"
chaieb@26161
   142
  from tU noU ly yu have tny: "t\<noteq>y" by auto
wenzelm@49519
   143
  { assume H: "y< t"
wenzelm@49519
   144
    from less_trans[OF ly H] le_less_trans[OF px xu]
chaieb@26161
   145
    have "l < t \<and> t < u" by simp
wenzelm@49519
   146
    with tU noU have "False" by auto }
wenzelm@49519
   147
  then have "\<not> y<t" by auto
wenzelm@49519
   148
  then show "t \<le> y" by (simp add: not_less)
chaieb@26161
   149
qed
chaieb@26161
   150
wenzelm@49519
   151
lemma lin_dense_eq[no_atp]:
wenzelm@49519
   152
  "t \<in> U \<Longrightarrow>
wenzelm@49519
   153
    \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> x = t   \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> y= t)"
wenzelm@49519
   154
  by auto
wenzelm@49519
   155
wenzelm@49519
   156
lemma lin_dense_neq[no_atp]:
wenzelm@49519
   157
  "t \<in> U \<Longrightarrow>
wenzelm@49519
   158
    \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> x \<noteq> t   \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> y\<noteq> t)"
wenzelm@49519
   159
  by auto
wenzelm@49519
   160
wenzelm@49519
   161
lemma lin_dense_P[no_atp]:
wenzelm@49519
   162
  "\<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> P   \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> P)"
wenzelm@49519
   163
  by auto
chaieb@26161
   164
blanchet@35828
   165
lemma lin_dense_conj[no_atp]:
chaieb@26161
   166
  "\<lbrakk>\<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> P1 x
chaieb@26161
   167
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> P1 y) ;
chaieb@26161
   168
  \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> P2 x
chaieb@26161
   169
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> P2 y)\<rbrakk> \<Longrightarrow>
chaieb@26161
   170
  \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> (P1 x \<and> P2 x)
chaieb@26161
   171
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> (P1 y \<and> P2 y))"
chaieb@26161
   172
  by blast
blanchet@35828
   173
lemma lin_dense_disj[no_atp]:
chaieb@26161
   174
  "\<lbrakk>\<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> P1 x
chaieb@26161
   175
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> P1 y) ;
chaieb@26161
   176
  \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> P2 x
chaieb@26161
   177
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> P2 y)\<rbrakk> \<Longrightarrow>
chaieb@26161
   178
  \<forall>x l u. (\<forall> t. l < t \<and> t< u \<longrightarrow> t \<notin> U) \<and> l< x \<and> x < u \<and> (P1 x \<or> P2 x)
chaieb@26161
   179
  \<longrightarrow> (\<forall> y. l < y \<and> y < u \<longrightarrow> (P1 y \<or> P2 y))"
chaieb@26161
   180
  by blast
chaieb@26161
   181
blanchet@35828
   182
lemma npmibnd[no_atp]: "\<lbrakk>\<forall>x. \<not> MP \<and> P x \<longrightarrow> (\<exists> u\<in> U. u \<le> x); \<forall>x. \<not>PP \<and> P x \<longrightarrow> (\<exists> u\<in> U. x \<le> u)\<rbrakk>
chaieb@26161
   183
  \<Longrightarrow> \<forall>x. \<not> MP \<and> \<not>PP \<and> P x \<longrightarrow> (\<exists> u\<in> U. \<exists> u' \<in> U. u \<le> x \<and> x \<le> u')"
wenzelm@49519
   184
  by auto
chaieb@26161
   185
blanchet@35828
   186
lemma finite_set_intervals[no_atp]:
chaieb@26161
   187
  assumes px: "P x" and lx: "l \<le> x" and xu: "x \<le> u" and linS: "l\<in> S"
wenzelm@49519
   188
    and uinS: "u \<in> S" and fS:"finite S" and lS: "\<forall> x\<in> S. l \<le> x" and Su: "\<forall> x\<in> S. x \<le> u"
chaieb@26161
   189
  shows "\<exists> a \<in> S. \<exists> b \<in> S. (\<forall> y. a < y \<and> y < b \<longrightarrow> y \<notin> S) \<and> a \<le> x \<and> x \<le> b \<and> P x"
wenzelm@49519
   190
proof -
chaieb@26161
   191
  let ?Mx = "{y. y\<in> S \<and> y \<le> x}"
chaieb@26161
   192
  let ?xM = "{y. y\<in> S \<and> x \<le> y}"
chaieb@26161
   193
  let ?a = "Max ?Mx"
chaieb@26161
   194
  let ?b = "Min ?xM"
chaieb@26161
   195
  have MxS: "?Mx \<subseteq> S" by blast
chaieb@26161
   196
  hence fMx: "finite ?Mx" using fS finite_subset by auto
chaieb@26161
   197
  from lx linS have linMx: "l \<in> ?Mx" by blast
chaieb@26161
   198
  hence Mxne: "?Mx \<noteq> {}" by blast
chaieb@26161
   199
  have xMS: "?xM \<subseteq> S" by blast
chaieb@26161
   200
  hence fxM: "finite ?xM" using fS finite_subset by auto
chaieb@26161
   201
  from xu uinS have linxM: "u \<in> ?xM" by blast
chaieb@26161
   202
  hence xMne: "?xM \<noteq> {}" by blast
chaieb@26161
   203
  have ax:"?a \<le> x" using Mxne fMx by auto
chaieb@26161
   204
  have xb:"x \<le> ?b" using xMne fxM by auto
chaieb@26161
   205
  have "?a \<in> ?Mx" using Max_in[OF fMx Mxne] by simp hence ainS: "?a \<in> S" using MxS by blast
chaieb@26161
   206
  have "?b \<in> ?xM" using Min_in[OF fxM xMne] by simp hence binS: "?b \<in> S" using xMS by blast
chaieb@26161
   207
  have noy:"\<forall> y. ?a < y \<and> y < ?b \<longrightarrow> y \<notin> S"
chaieb@26161
   208
  proof(clarsimp)
wenzelm@49519
   209
    fix y
wenzelm@49519
   210
    assume ay: "?a < y" and yb: "y < ?b" and yS: "y \<in> S"
chaieb@26161
   211
    from yS have "y\<in> ?Mx \<or> y\<in> ?xM" by (auto simp add: linear)
wenzelm@49519
   212
    moreover {
wenzelm@49519
   213
      assume "y \<in> ?Mx"
wenzelm@49519
   214
      hence "y \<le> ?a" using Mxne fMx by auto
wenzelm@49519
   215
      with ay have "False" by (simp add: not_le[symmetric])
wenzelm@49519
   216
    }
wenzelm@49519
   217
    moreover {
wenzelm@49519
   218
      assume "y \<in> ?xM"
wenzelm@49519
   219
      hence "?b \<le> y" using xMne fxM by auto
wenzelm@49519
   220
      with yb have "False" by (simp add: not_le[symmetric])
wenzelm@49519
   221
    }
wenzelm@49519
   222
    ultimately show False by blast
chaieb@26161
   223
  qed
chaieb@26161
   224
  from ainS binS noy ax xb px show ?thesis by blast
chaieb@26161
   225
qed
chaieb@26161
   226
blanchet@35828
   227
lemma finite_set_intervals2[no_atp]:
chaieb@26161
   228
  assumes px: "P x" and lx: "l \<le> x" and xu: "x \<le> u" and linS: "l\<in> S"
wenzelm@49519
   229
    and uinS: "u \<in> S" and fS:"finite S" and lS: "\<forall> x\<in> S. l \<le> x" and Su: "\<forall> x\<in> S. x \<le> u"
chaieb@26161
   230
  shows "(\<exists> s\<in> S. P s) \<or> (\<exists> a \<in> S. \<exists> b \<in> S. (\<forall> y. a < y \<and> y < b \<longrightarrow> y \<notin> S) \<and> a < x \<and> x < b \<and> P x)"
chaieb@26161
   231
proof-
chaieb@26161
   232
  from finite_set_intervals[where P="P", OF px lx xu linS uinS fS lS Su]
wenzelm@49519
   233
  obtain a and b where as: "a\<in> S" and bs: "b\<in> S" and noS:"\<forall>y. a < y \<and> y < b \<longrightarrow> y \<notin> S"
wenzelm@49519
   234
    and axb: "a \<le> x \<and> x \<le> b \<and> P x" by auto
chaieb@26161
   235
  from axb have "x= a \<or> x= b \<or> (a < x \<and> x < b)" by (auto simp add: le_less)
chaieb@26161
   236
  thus ?thesis using px as bs noS by blast
chaieb@26161
   237
qed
chaieb@26161
   238
chaieb@26161
   239
end
chaieb@26161
   240
wenzelm@49519
   241
chaieb@26161
   242
section {* The classical QE after Langford for dense linear orders *}
chaieb@26161
   243
hoelzl@53215
   244
context unbounded_dense_linorder
chaieb@26161
   245
begin
chaieb@26161
   246
wenzelm@49519
   247
lemma interval_empty_iff: "{y. x < y \<and> y < z} = {} \<longleftrightarrow> \<not> x < z"
haftmann@27825
   248
  by (auto dest: dense)
haftmann@27825
   249
blanchet@35828
   250
lemma dlo_qe_bnds[no_atp]: 
chaieb@26161
   251
  assumes ne: "L \<noteq> {}" and neU: "U \<noteq> {}" and fL: "finite L" and fU: "finite U"
chaieb@26161
   252
  shows "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> U. x < y)) \<equiv> (\<forall> l \<in> L. \<forall>u \<in> U. l < u)"
chaieb@26161
   253
proof (simp only: atomize_eq, rule iffI)
chaieb@26161
   254
  assume H: "\<exists>x. (\<forall>y\<in>L. y < x) \<and> (\<forall>y\<in>U. x < y)"
chaieb@26161
   255
  then obtain x where xL: "\<forall>y\<in>L. y < x" and xU: "\<forall>y\<in>U. x < y" by blast
wenzelm@49519
   256
  { fix l u assume l: "l \<in> L" and u: "u \<in> U"
chaieb@26161
   257
    have "l < x" using xL l by blast
chaieb@26161
   258
    also have "x < u" using xU u by blast
wenzelm@49519
   259
    finally (less_trans) have "l < u" . }
wenzelm@49519
   260
  then show "\<forall>l\<in>L. \<forall>u\<in>U. l < u" by blast
chaieb@26161
   261
next
chaieb@26161
   262
  assume H: "\<forall>l\<in>L. \<forall>u\<in>U. l < u"
chaieb@26161
   263
  let ?ML = "Max L"
chaieb@26161
   264
  let ?MU = "Min U"  
chaieb@26161
   265
  from fL ne have th1: "?ML \<in> L" and th1': "\<forall>l\<in>L. l \<le> ?ML" by auto
chaieb@26161
   266
  from fU neU have th2: "?MU \<in> U" and th2': "\<forall>u\<in>U. ?MU \<le> u" by auto
chaieb@26161
   267
  from th1 th2 H have "?ML < ?MU" by auto
chaieb@26161
   268
  with dense obtain w where th3: "?ML < w" and th4: "w < ?MU" by blast
chaieb@26161
   269
  from th3 th1' have "\<forall>l \<in> L. l < w" by auto
chaieb@26161
   270
  moreover from th4 th2' have "\<forall>u \<in> U. w < u" by auto
chaieb@26161
   271
  ultimately show "\<exists>x. (\<forall>y\<in>L. y < x) \<and> (\<forall>y\<in>U. x < y)" by auto
chaieb@26161
   272
qed
chaieb@26161
   273
blanchet@35828
   274
lemma dlo_qe_noub[no_atp]: 
chaieb@26161
   275
  assumes ne: "L \<noteq> {}" and fL: "finite L"
chaieb@26161
   276
  shows "(\<exists>x. (\<forall>y \<in> L. y < x) \<and> (\<forall>y \<in> {}. x < y)) \<equiv> True"
chaieb@26161
   277
proof(simp add: atomize_eq)
chaieb@26161
   278
  from gt_ex[of "Max L"] obtain M where M: "Max L < M" by blast
chaieb@26161
   279
  from ne fL have "\<forall>x \<in> L. x \<le> Max L" by simp
chaieb@26161
   280
  with M have "\<forall>x\<in>L. x < M" by (auto intro: le_less_trans)
chaieb@26161
   281
  thus "\<exists>x. \<forall>y\<in>L. y < x" by blast
chaieb@26161
   282
qed
chaieb@26161
   283
blanchet@35828
   284
lemma dlo_qe_nolb[no_atp]: 
chaieb@26161
   285
  assumes ne: "U \<noteq> {}" and fU: "finite U"
chaieb@26161
   286
  shows "(\<exists>x. (\<forall>y \<in> {}. y < x) \<and> (\<forall>y \<in> U. x < y)) \<equiv> True"
chaieb@26161
   287
proof(simp add: atomize_eq)
chaieb@26161
   288
  from lt_ex[of "Min U"] obtain M where M: "M < Min U" by blast
chaieb@26161
   289
  from ne fU have "\<forall>x \<in> U. Min U \<le> x" by simp
chaieb@26161
   290
  with M have "\<forall>x\<in>U. M < x" by (auto intro: less_le_trans)
chaieb@26161
   291
  thus "\<exists>x. \<forall>y\<in>U. x < y" by blast
chaieb@26161
   292
qed
chaieb@26161
   293
blanchet@35828
   294
lemma exists_neq[no_atp]: "\<exists>(x::'a). x \<noteq> t" "\<exists>(x::'a). t \<noteq> x" 
chaieb@26161
   295
  using gt_ex[of t] by auto
chaieb@26161
   296
blanchet@35828
   297
lemmas dlo_simps[no_atp] = order_refl less_irrefl not_less not_le exists_neq 
chaieb@26161
   298
  le_less neq_iff linear less_not_permute
chaieb@26161
   299
hoelzl@53215
   300
lemma axiom[no_atp]: "class.unbounded_dense_linorder (op \<le>) (op <)"
hoelzl@53215
   301
  by (rule unbounded_dense_linorder_axioms)
blanchet@35828
   302
lemma atoms[no_atp]:
chaieb@26161
   303
  shows "TERM (less :: 'a \<Rightarrow> _)"
chaieb@26161
   304
    and "TERM (less_eq :: 'a \<Rightarrow> _)"
chaieb@26161
   305
    and "TERM (op = :: 'a \<Rightarrow> _)" .
chaieb@26161
   306
chaieb@26161
   307
declare axiom[langford qe: dlo_qe_bnds dlo_qe_nolb dlo_qe_noub gather: gather_start gather_simps atoms: atoms]
chaieb@26161
   308
declare dlo_simps[langfordsimp]
chaieb@26161
   309
chaieb@26161
   310
end
chaieb@26161
   311
chaieb@26161
   312
(* FIXME: Move to HOL -- together with the conj_aci_rule in langford.ML *)
nipkow@41849
   313
lemmas dnf[no_atp] = conj_disj_distribL conj_disj_distribR
chaieb@26161
   314
blanchet@35828
   315
lemmas weak_dnf_simps[no_atp] = simp_thms dnf
chaieb@26161
   316
blanchet@35828
   317
lemma nnf_simps[no_atp]:
chaieb@26161
   318
    "(\<not>(P \<and> Q)) = (\<not>P \<or> \<not>Q)" "(\<not>(P \<or> Q)) = (\<not>P \<and> \<not>Q)" "(P \<longrightarrow> Q) = (\<not>P \<or> Q)"
chaieb@26161
   319
    "(P = Q) = ((P \<and> Q) \<or> (\<not>P \<and> \<not> Q))" "(\<not> \<not>(P)) = P"
chaieb@26161
   320
  by blast+
chaieb@26161
   321
blanchet@35828
   322
lemma ex_distrib[no_atp]: "(\<exists>x. P x \<or> Q x) \<longleftrightarrow> ((\<exists>x. P x) \<or> (\<exists>x. Q x))" by blast
chaieb@26161
   323
blanchet@35828
   324
lemmas dnf_simps[no_atp] = weak_dnf_simps nnf_simps ex_distrib
chaieb@26161
   325
wenzelm@48891
   326
ML_file "langford.ML"
chaieb@26161
   327
method_setup dlo = {*
wenzelm@55848
   328
  Scan.succeed (SIMPLE_METHOD' o Langford.dlo_tac)
chaieb@26161
   329
*} "Langford's algorithm for quantifier elimination in dense linear orders"
chaieb@26161
   330
chaieb@26161
   331
haftmann@30652
   332
section {* Contructive dense linear orders yield QE for linear arithmetic over ordered Fields *}
chaieb@26161
   333
chaieb@26161
   334
text {* Linear order without upper bounds *}
chaieb@26161
   335
haftmann@29509
   336
locale linorder_stupid_syntax = linorder
chaieb@26161
   337
begin
wenzelm@49519
   338
chaieb@26161
   339
notation
chaieb@26161
   340
  less_eq  ("op \<sqsubseteq>") and
chaieb@26161
   341
  less_eq  ("(_/ \<sqsubseteq> _)" [51, 51] 50) and
chaieb@26161
   342
  less  ("op \<sqsubset>") and
chaieb@26161
   343
  less  ("(_/ \<sqsubset> _)"  [51, 51] 50)
chaieb@26161
   344
chaieb@26161
   345
end
chaieb@26161
   346
haftmann@29509
   347
locale linorder_no_ub = linorder_stupid_syntax +
chaieb@26161
   348
  assumes gt_ex: "\<exists>y. less x y"
chaieb@26161
   349
begin
wenzelm@49519
   350
blanchet@35828
   351
lemma ge_ex[no_atp]: "\<exists>y. x \<sqsubseteq> y" using gt_ex by auto
chaieb@26161
   352
wenzelm@53072
   353
text {* Theorems for @{text "\<exists>z. \<forall>x. z \<sqsubset> x \<longrightarrow> (P x \<longleftrightarrow> P\<^sub>+\<^sub>\<infinity>)"} *}
blanchet@35828
   354
lemma pinf_conj[no_atp]:
chaieb@26161
   355
  assumes ex1: "\<exists>z1. \<forall>x. z1 \<sqsubset> x \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
chaieb@26161
   356
  and ex2: "\<exists>z2. \<forall>x. z2 \<sqsubset> x \<longrightarrow> (P2 x \<longleftrightarrow> P2')"
chaieb@26161
   357
  shows "\<exists>z. \<forall>x. z \<sqsubset>  x \<longrightarrow> ((P1 x \<and> P2 x) \<longleftrightarrow> (P1' \<and> P2'))"
chaieb@26161
   358
proof-
chaieb@26161
   359
  from ex1 ex2 obtain z1 and z2 where z1: "\<forall>x. z1 \<sqsubset> x \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
chaieb@26161
   360
     and z2: "\<forall>x. z2 \<sqsubset> x \<longrightarrow> (P2 x \<longleftrightarrow> P2')" by blast
chaieb@26161
   361
  from gt_ex obtain z where z:"ord.max less_eq z1 z2 \<sqsubset> z" by blast
chaieb@26161
   362
  from z have zz1: "z1 \<sqsubset> z" and zz2: "z2 \<sqsubset> z" by simp_all
wenzelm@49519
   363
  { fix x assume H: "z \<sqsubset> x"
chaieb@26161
   364
    from less_trans[OF zz1 H] less_trans[OF zz2 H]
chaieb@26161
   365
    have "(P1 x \<and> P2 x) \<longleftrightarrow> (P1' \<and> P2')"  using z1 zz1 z2 zz2 by auto
chaieb@26161
   366
  }
chaieb@26161
   367
  thus ?thesis by blast
chaieb@26161
   368
qed
chaieb@26161
   369
blanchet@35828
   370
lemma pinf_disj[no_atp]:
chaieb@26161
   371
  assumes ex1: "\<exists>z1. \<forall>x. z1 \<sqsubset> x \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
wenzelm@49519
   372
    and ex2: "\<exists>z2. \<forall>x. z2 \<sqsubset> x \<longrightarrow> (P2 x \<longleftrightarrow> P2')"
chaieb@26161
   373
  shows "\<exists>z. \<forall>x. z \<sqsubset>  x \<longrightarrow> ((P1 x \<or> P2 x) \<longleftrightarrow> (P1' \<or> P2'))"
chaieb@26161
   374
proof-
chaieb@26161
   375
  from ex1 ex2 obtain z1 and z2 where z1: "\<forall>x. z1 \<sqsubset> x \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
chaieb@26161
   376
     and z2: "\<forall>x. z2 \<sqsubset> x \<longrightarrow> (P2 x \<longleftrightarrow> P2')" by blast
chaieb@26161
   377
  from gt_ex obtain z where z:"ord.max less_eq z1 z2 \<sqsubset> z" by blast
chaieb@26161
   378
  from z have zz1: "z1 \<sqsubset> z" and zz2: "z2 \<sqsubset> z" by simp_all
wenzelm@49519
   379
  { fix x assume H: "z \<sqsubset> x"
chaieb@26161
   380
    from less_trans[OF zz1 H] less_trans[OF zz2 H]
chaieb@26161
   381
    have "(P1 x \<or> P2 x) \<longleftrightarrow> (P1' \<or> P2')"  using z1 zz1 z2 zz2 by auto
chaieb@26161
   382
  }
chaieb@26161
   383
  thus ?thesis by blast
chaieb@26161
   384
qed
chaieb@26161
   385
blanchet@35828
   386
lemma pinf_ex[no_atp]: assumes ex:"\<exists>z. \<forall>x. z \<sqsubset> x \<longrightarrow> (P x \<longleftrightarrow> P1)" and p1: P1 shows "\<exists> x. P x"
wenzelm@49519
   387
proof -
chaieb@26161
   388
  from ex obtain z where z: "\<forall>x. z \<sqsubset> x \<longrightarrow> (P x \<longleftrightarrow> P1)" by blast
chaieb@26161
   389
  from gt_ex obtain x where x: "z \<sqsubset> x" by blast
chaieb@26161
   390
  from z x p1 show ?thesis by blast
chaieb@26161
   391
qed
chaieb@26161
   392
chaieb@26161
   393
end
chaieb@26161
   394
chaieb@26161
   395
text {* Linear order without upper bounds *}
chaieb@26161
   396
haftmann@29509
   397
locale linorder_no_lb = linorder_stupid_syntax +
chaieb@26161
   398
  assumes lt_ex: "\<exists>y. less y x"
chaieb@26161
   399
begin
wenzelm@49519
   400
blanchet@35828
   401
lemma le_ex[no_atp]: "\<exists>y. y \<sqsubseteq> x" using lt_ex by auto
chaieb@26161
   402
chaieb@26161
   403
wenzelm@53072
   404
text {* Theorems for @{text "\<exists>z. \<forall>x. x \<sqsubset> z \<longrightarrow> (P x \<longleftrightarrow> P\<^sub>-\<^sub>\<infinity>)"} *}
blanchet@35828
   405
lemma minf_conj[no_atp]:
chaieb@26161
   406
  assumes ex1: "\<exists>z1. \<forall>x. x \<sqsubset> z1 \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
wenzelm@49519
   407
    and ex2: "\<exists>z2. \<forall>x. x \<sqsubset> z2 \<longrightarrow> (P2 x \<longleftrightarrow> P2')"
chaieb@26161
   408
  shows "\<exists>z. \<forall>x. x \<sqsubset>  z \<longrightarrow> ((P1 x \<and> P2 x) \<longleftrightarrow> (P1' \<and> P2'))"
chaieb@26161
   409
proof-
chaieb@26161
   410
  from ex1 ex2 obtain z1 and z2 where z1: "\<forall>x. x \<sqsubset> z1 \<longrightarrow> (P1 x \<longleftrightarrow> P1')"and z2: "\<forall>x. x \<sqsubset> z2 \<longrightarrow> (P2 x \<longleftrightarrow> P2')" by blast
chaieb@26161
   411
  from lt_ex obtain z where z:"z \<sqsubset> ord.min less_eq z1 z2" by blast
chaieb@26161
   412
  from z have zz1: "z \<sqsubset> z1" and zz2: "z \<sqsubset> z2" by simp_all
wenzelm@49519
   413
  { fix x assume H: "x \<sqsubset> z"
chaieb@26161
   414
    from less_trans[OF H zz1] less_trans[OF H zz2]
chaieb@26161
   415
    have "(P1 x \<and> P2 x) \<longleftrightarrow> (P1' \<and> P2')"  using z1 zz1 z2 zz2 by auto
chaieb@26161
   416
  }
chaieb@26161
   417
  thus ?thesis by blast
chaieb@26161
   418
qed
chaieb@26161
   419
blanchet@35828
   420
lemma minf_disj[no_atp]:
chaieb@26161
   421
  assumes ex1: "\<exists>z1. \<forall>x. x \<sqsubset> z1 \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
wenzelm@49519
   422
    and ex2: "\<exists>z2. \<forall>x. x \<sqsubset> z2 \<longrightarrow> (P2 x \<longleftrightarrow> P2')"
chaieb@26161
   423
  shows "\<exists>z. \<forall>x. x \<sqsubset>  z \<longrightarrow> ((P1 x \<or> P2 x) \<longleftrightarrow> (P1' \<or> P2'))"
wenzelm@49519
   424
proof -
wenzelm@49519
   425
  from ex1 ex2 obtain z1 and z2 where z1: "\<forall>x. x \<sqsubset> z1 \<longrightarrow> (P1 x \<longleftrightarrow> P1')"
wenzelm@49519
   426
    and z2: "\<forall>x. x \<sqsubset> z2 \<longrightarrow> (P2 x \<longleftrightarrow> P2')" by blast
chaieb@26161
   427
  from lt_ex obtain z where z:"z \<sqsubset> ord.min less_eq z1 z2" by blast
chaieb@26161
   428
  from z have zz1: "z \<sqsubset> z1" and zz2: "z \<sqsubset> z2" by simp_all
wenzelm@49519
   429
  { fix x assume H: "x \<sqsubset> z"
chaieb@26161
   430
    from less_trans[OF H zz1] less_trans[OF H zz2]
chaieb@26161
   431
    have "(P1 x \<or> P2 x) \<longleftrightarrow> (P1' \<or> P2')"  using z1 zz1 z2 zz2 by auto
chaieb@26161
   432
  }
chaieb@26161
   433
  thus ?thesis by blast
chaieb@26161
   434
qed
chaieb@26161
   435
wenzelm@49519
   436
lemma minf_ex[no_atp]:
wenzelm@49519
   437
  assumes ex: "\<exists>z. \<forall>x. x \<sqsubset> z \<longrightarrow> (P x \<longleftrightarrow> P1)"
wenzelm@49519
   438
    and p1: P1
wenzelm@49519
   439
  shows "\<exists> x. P x"
wenzelm@49519
   440
proof -
chaieb@26161
   441
  from ex obtain z where z: "\<forall>x. x \<sqsubset> z \<longrightarrow> (P x \<longleftrightarrow> P1)" by blast
chaieb@26161
   442
  from lt_ex obtain x where x: "x \<sqsubset> z" by blast
chaieb@26161
   443
  from z x p1 show ?thesis by blast
chaieb@26161
   444
qed
chaieb@26161
   445
chaieb@26161
   446
end
chaieb@26161
   447
chaieb@26161
   448
haftmann@35028
   449
locale constr_dense_linorder = linorder_no_lb + linorder_no_ub +
chaieb@26161
   450
  fixes between
chaieb@26161
   451
  assumes between_less: "less x y \<Longrightarrow> less x (between x y) \<and> less (between x y) y"
wenzelm@49519
   452
    and between_same: "between x x = x"
haftmann@54868
   453
begin
chaieb@26161
   454
haftmann@54868
   455
sublocale dlo: unbounded_dense_linorder 
chaieb@26161
   456
  apply unfold_locales
chaieb@26161
   457
  using gt_ex lt_ex between_less
wenzelm@49519
   458
  apply auto
wenzelm@49519
   459
  apply (rule_tac x="between x y" in exI)
wenzelm@49519
   460
  apply simp
wenzelm@49519
   461
  done
chaieb@26161
   462
blanchet@35828
   463
lemma rinf_U[no_atp]:
chaieb@26161
   464
  assumes fU: "finite U"
wenzelm@49519
   465
    and lin_dense: "\<forall>x l u. (\<forall> t. l \<sqsubset> t \<and> t\<sqsubset> u \<longrightarrow> t \<notin> U) \<and> l\<sqsubset> x \<and> x \<sqsubset> u \<and> P x
wenzelm@49519
   466
      \<longrightarrow> (\<forall> y. l \<sqsubset> y \<and> y \<sqsubset> u \<longrightarrow> P y )"
wenzelm@49519
   467
    and nmpiU: "\<forall>x. \<not> MP \<and> \<not>PP \<and> P x \<longrightarrow> (\<exists> u\<in> U. \<exists> u' \<in> U. u \<sqsubseteq> x \<and> x \<sqsubseteq> u')"
wenzelm@49519
   468
    and nmi: "\<not> MP"  and npi: "\<not> PP"  and ex: "\<exists> x.  P x"
chaieb@26161
   469
  shows "\<exists> u\<in> U. \<exists> u' \<in> U. P (between u u')"
wenzelm@49519
   470
proof -
chaieb@26161
   471
  from ex obtain x where px: "P x" by blast
chaieb@26161
   472
  from px nmi npi nmpiU have "\<exists> u\<in> U. \<exists> u' \<in> U. u \<sqsubseteq> x \<and> x \<sqsubseteq> u'" by auto
chaieb@26161
   473
  then obtain u and u' where uU:"u\<in> U" and uU': "u' \<in> U" and ux:"u \<sqsubseteq> x" and xu':"x \<sqsubseteq> u'" by auto
chaieb@26161
   474
  from uU have Une: "U \<noteq> {}" by auto
chaieb@26161
   475
  let ?l = "linorder.Min less_eq U"
chaieb@26161
   476
  let ?u = "linorder.Max less_eq U"
chaieb@26161
   477
  have linM: "?l \<in> U" using fU Une by simp
chaieb@26161
   478
  have uinM: "?u \<in> U" using fU Une by simp
chaieb@26161
   479
  have lM: "\<forall> t\<in> U. ?l \<sqsubseteq> t" using Une fU by auto
chaieb@26161
   480
  have Mu: "\<forall> t\<in> U. t \<sqsubseteq> ?u" using Une fU by auto
chaieb@26161
   481
  have th:"?l \<sqsubseteq> u" using uU Une lM by auto
chaieb@26161
   482
  from order_trans[OF th ux] have lx: "?l \<sqsubseteq> x" .
chaieb@26161
   483
  have th: "u' \<sqsubseteq> ?u" using uU' Une Mu by simp
chaieb@26161
   484
  from order_trans[OF xu' th] have xu: "x \<sqsubseteq> ?u" .
chaieb@26161
   485
  from finite_set_intervals2[where P="P",OF px lx xu linM uinM fU lM Mu]
chaieb@26161
   486
  have "(\<exists> s\<in> U. P s) \<or>
chaieb@26161
   487
      (\<exists> t1\<in> U. \<exists> t2 \<in> U. (\<forall> y. t1 \<sqsubset> y \<and> y \<sqsubset> t2 \<longrightarrow> y \<notin> U) \<and> t1 \<sqsubset> x \<and> x \<sqsubset> t2 \<and> P x)" .
wenzelm@49519
   488
  moreover {
wenzelm@49519
   489
    fix u assume um: "u\<in>U" and pu: "P u"
chaieb@26161
   490
    have "between u u = u" by (simp add: between_same)
chaieb@26161
   491
    with um pu have "P (between u u)" by simp
wenzelm@49519
   492
    with um have ?thesis by blast }
wenzelm@49519
   493
  moreover {
chaieb@26161
   494
    assume "\<exists> t1\<in> U. \<exists> t2 \<in> U. (\<forall> y. t1 \<sqsubset> y \<and> y \<sqsubset> t2 \<longrightarrow> y \<notin> U) \<and> t1 \<sqsubset> x \<and> x \<sqsubset> t2 \<and> P x"
wenzelm@49519
   495
    then obtain t1 and t2 where t1M: "t1 \<in> U" and t2M: "t2\<in> U"
wenzelm@49519
   496
      and noM: "\<forall> y. t1 \<sqsubset> y \<and> y \<sqsubset> t2 \<longrightarrow> y \<notin> U"
wenzelm@49519
   497
      and t1x: "t1 \<sqsubset> x" and xt2: "x \<sqsubset> t2" and px: "P x" by blast
wenzelm@49519
   498
    from less_trans[OF t1x xt2] have t1t2: "t1 \<sqsubset> t2" .
wenzelm@49519
   499
    let ?u = "between t1 t2"
wenzelm@49519
   500
    from between_less t1t2 have t1lu: "t1 \<sqsubset> ?u" and ut2: "?u \<sqsubset> t2" by auto
wenzelm@49519
   501
    from lin_dense noM t1x xt2 px t1lu ut2 have "P ?u" by blast
wenzelm@49519
   502
    with t1M t2M have ?thesis by blast
wenzelm@49519
   503
  }
wenzelm@49519
   504
  ultimately show ?thesis by blast
wenzelm@49519
   505
qed
chaieb@26161
   506
blanchet@35828
   507
theorem fr_eq[no_atp]:
chaieb@26161
   508
  assumes fU: "finite U"
wenzelm@49519
   509
    and lin_dense: "\<forall>x l u. (\<forall> t. l \<sqsubset> t \<and> t\<sqsubset> u \<longrightarrow> t \<notin> U) \<and> l\<sqsubset> x \<and> x \<sqsubset> u \<and> P x
wenzelm@49519
   510
     \<longrightarrow> (\<forall> y. l \<sqsubset> y \<and> y \<sqsubset> u \<longrightarrow> P y )"
wenzelm@49519
   511
    and nmibnd: "\<forall>x. \<not> MP \<and> P x \<longrightarrow> (\<exists> u\<in> U. u \<sqsubseteq> x)"
wenzelm@49519
   512
    and npibnd: "\<forall>x. \<not>PP \<and> P x \<longrightarrow> (\<exists> u\<in> U. x \<sqsubseteq> u)"
wenzelm@49519
   513
    and mi: "\<exists>z. \<forall>x. x \<sqsubset> z \<longrightarrow> (P x = MP)"  and pi: "\<exists>z. \<forall>x. z \<sqsubset> x \<longrightarrow> (P x = PP)"
chaieb@26161
   514
  shows "(\<exists> x. P x) \<equiv> (MP \<or> PP \<or> (\<exists> u \<in> U. \<exists> u'\<in> U. P (between u u')))"
chaieb@26161
   515
  (is "_ \<equiv> (_ \<or> _ \<or> ?F)" is "?E \<equiv> ?D")
wenzelm@49519
   516
proof -
wenzelm@49519
   517
  { assume px: "\<exists> x. P x"
wenzelm@49519
   518
    have "MP \<or> PP \<or> (\<not> MP \<and> \<not> PP)" by blast
wenzelm@49519
   519
    moreover { assume "MP \<or> PP" hence "?D" by blast }
wenzelm@49519
   520
    moreover {
wenzelm@49519
   521
      assume nmi: "\<not> MP" and npi: "\<not> PP"
wenzelm@49519
   522
      from npmibnd[OF nmibnd npibnd]
wenzelm@49519
   523
      have nmpiU: "\<forall>x. \<not> MP \<and> \<not>PP \<and> P x \<longrightarrow> (\<exists> u\<in> U. \<exists> u' \<in> U. u \<sqsubseteq> x \<and> x \<sqsubseteq> u')" .
wenzelm@49519
   524
      from rinf_U[OF fU lin_dense nmpiU nmi npi px] have "?D" by blast }
wenzelm@49519
   525
    ultimately have "?D" by blast }
wenzelm@49519
   526
  moreover
wenzelm@49519
   527
  { assume "?D"
wenzelm@49519
   528
    moreover { assume m:"MP" from minf_ex[OF mi m] have "?E" . }
wenzelm@49519
   529
    moreover { assume p: "PP" from pinf_ex[OF pi p] have "?E" . }
wenzelm@49519
   530
    moreover { assume f:"?F" hence "?E" by blast }
wenzelm@49519
   531
    ultimately have "?E" by blast }
wenzelm@49519
   532
  ultimately have "?E = ?D" by blast thus "?E \<equiv> ?D" by simp
chaieb@26161
   533
qed
chaieb@26161
   534
blanchet@35828
   535
lemmas minf_thms[no_atp] = minf_conj minf_disj minf_eq minf_neq minf_lt minf_le minf_gt minf_ge minf_P
blanchet@35828
   536
lemmas pinf_thms[no_atp] = pinf_conj pinf_disj pinf_eq pinf_neq pinf_lt pinf_le pinf_gt pinf_ge pinf_P
chaieb@26161
   537
blanchet@35828
   538
lemmas nmi_thms[no_atp] = nmi_conj nmi_disj nmi_eq nmi_neq nmi_lt nmi_le nmi_gt nmi_ge nmi_P
blanchet@35828
   539
lemmas npi_thms[no_atp] = npi_conj npi_disj npi_eq npi_neq npi_lt npi_le npi_gt npi_ge npi_P
blanchet@35828
   540
lemmas lin_dense_thms[no_atp] = lin_dense_conj lin_dense_disj lin_dense_eq lin_dense_neq lin_dense_lt lin_dense_le lin_dense_gt lin_dense_ge lin_dense_P
chaieb@26161
   541
blanchet@35828
   542
lemma ferrack_axiom[no_atp]: "constr_dense_linorder less_eq less between"
haftmann@35028
   543
  by (rule constr_dense_linorder_axioms)
wenzelm@49519
   544
blanchet@35828
   545
lemma atoms[no_atp]:
chaieb@26161
   546
  shows "TERM (less :: 'a \<Rightarrow> _)"
chaieb@26161
   547
    and "TERM (less_eq :: 'a \<Rightarrow> _)"
chaieb@26161
   548
    and "TERM (op = :: 'a \<Rightarrow> _)" .
chaieb@26161
   549
chaieb@26161
   550
declare ferrack_axiom [ferrack minf: minf_thms pinf: pinf_thms
chaieb@26161
   551
    nmi: nmi_thms npi: npi_thms lindense:
chaieb@26161
   552
    lin_dense_thms qe: fr_eq atoms: atoms]
chaieb@26161
   553
chaieb@26161
   554
declaration {*
chaieb@26161
   555
let
wenzelm@49519
   556
  fun simps phi = map (Morphism.thm phi) [@{thm "not_less"}, @{thm "not_le"}]
wenzelm@49519
   557
  fun generic_whatis phi =
wenzelm@49519
   558
    let
wenzelm@49519
   559
      val [lt, le] = map (Morphism.term phi) [@{term "op \<sqsubset>"}, @{term "op \<sqsubseteq>"}]
wenzelm@49519
   560
      fun h x t =
wenzelm@49519
   561
        case term_of t of
wenzelm@49519
   562
          Const(@{const_name HOL.eq}, _)$y$z =>
wenzelm@49519
   563
            if term_of x aconv y then Ferrante_Rackoff_Data.Eq
wenzelm@49519
   564
            else Ferrante_Rackoff_Data.Nox
wenzelm@49519
   565
       | @{term "Not"}$(Const(@{const_name HOL.eq}, _)$y$z) =>
wenzelm@49519
   566
            if term_of x aconv y then Ferrante_Rackoff_Data.NEq
wenzelm@49519
   567
            else Ferrante_Rackoff_Data.Nox
wenzelm@49519
   568
       | b$y$z => if Term.could_unify (b, lt) then
wenzelm@49519
   569
                     if term_of x aconv y then Ferrante_Rackoff_Data.Lt
wenzelm@49519
   570
                     else if term_of x aconv z then Ferrante_Rackoff_Data.Gt
wenzelm@49519
   571
                     else Ferrante_Rackoff_Data.Nox
wenzelm@49519
   572
                 else if Term.could_unify (b, le) then
wenzelm@49519
   573
                     if term_of x aconv y then Ferrante_Rackoff_Data.Le
wenzelm@49519
   574
                     else if term_of x aconv z then Ferrante_Rackoff_Data.Ge
wenzelm@49519
   575
                     else Ferrante_Rackoff_Data.Nox
chaieb@26161
   576
                 else Ferrante_Rackoff_Data.Nox
wenzelm@49519
   577
       | _ => Ferrante_Rackoff_Data.Nox
wenzelm@49519
   578
  in h end
wenzelm@51717
   579
  fun ss phi =
wenzelm@51717
   580
    simpset_of (put_simpset HOL_ss @{context} addsimps (simps phi))
chaieb@26161
   581
in
wenzelm@49519
   582
  Ferrante_Rackoff_Data.funs  @{thm "ferrack_axiom"}
wenzelm@49519
   583
    {isolate_conv = K (K (K Thm.reflexive)), whatis = generic_whatis, simpset = ss}
chaieb@26161
   584
end
chaieb@26161
   585
*}
chaieb@26161
   586
chaieb@26161
   587
end
chaieb@26161
   588
wenzelm@48891
   589
ML_file "ferrante_rackoff.ML"
chaieb@26161
   590
chaieb@26161
   591
method_setup ferrack = {*
wenzelm@30549
   592
  Scan.succeed (SIMPLE_METHOD' o FerranteRackoff.dlo_tac)
chaieb@26161
   593
*} "Ferrante and Rackoff's algorithm for quantifier elimination in dense linear orders"
chaieb@26161
   594
wenzelm@49519
   595
chaieb@26161
   596
subsection {* Ferrante and Rackoff algorithm over ordered fields *}
chaieb@26161
   597
haftmann@35028
   598
lemma neg_prod_lt:"(c\<Colon>'a\<Colon>linordered_field) < 0 \<Longrightarrow> ((c*x < 0) == (x > 0))"
wenzelm@49519
   599
proof -
chaieb@26161
   600
  assume H: "c < 0"
wenzelm@49519
   601
  have "c*x < 0 = (0/c < x)"
wenzelm@49519
   602
    by (simp only: neg_divide_less_eq[OF H] algebra_simps)
chaieb@26161
   603
  also have "\<dots> = (0 < x)" by simp
chaieb@26161
   604
  finally show  "(c*x < 0) == (x > 0)" by simp
chaieb@26161
   605
qed
chaieb@26161
   606
haftmann@35028
   607
lemma pos_prod_lt:"(c\<Colon>'a\<Colon>linordered_field) > 0 \<Longrightarrow> ((c*x < 0) == (x < 0))"
wenzelm@49519
   608
proof -
chaieb@26161
   609
  assume H: "c > 0"
wenzelm@49519
   610
  then have "c*x < 0 = (0/c > x)"
wenzelm@49519
   611
    by (simp only: pos_less_divide_eq[OF H] algebra_simps)
chaieb@26161
   612
  also have "\<dots> = (0 > x)" by simp
chaieb@26161
   613
  finally show  "(c*x < 0) == (x < 0)" by simp
chaieb@26161
   614
qed
chaieb@26161
   615
haftmann@35028
   616
lemma neg_prod_sum_lt: "(c\<Colon>'a\<Colon>linordered_field) < 0 \<Longrightarrow> ((c*x + t< 0) == (x > (- 1/c)*t))"
wenzelm@49519
   617
proof -
chaieb@26161
   618
  assume H: "c < 0"
wenzelm@49519
   619
  have "c*x + t< 0 = (c*x < -t)"
wenzelm@49519
   620
    by (subst less_iff_diff_less_0 [of "c*x" "-t"], simp)
wenzelm@49519
   621
  also have "\<dots> = (-t/c < x)"
wenzelm@49519
   622
    by (simp only: neg_divide_less_eq[OF H] algebra_simps)
chaieb@26161
   623
  also have "\<dots> = ((- 1/c)*t < x)" by simp
wenzelm@49519
   624
  finally show "(c*x + t < 0) == (x > (- 1/c)*t)" by simp
chaieb@26161
   625
qed
chaieb@26161
   626
haftmann@35028
   627
lemma pos_prod_sum_lt:"(c\<Colon>'a\<Colon>linordered_field) > 0 \<Longrightarrow> ((c*x + t < 0) == (x < (- 1/c)*t))"
wenzelm@49519
   628
proof -
chaieb@26161
   629
  assume H: "c > 0"
wenzelm@49519
   630
  have "c*x + t< 0 = (c*x < -t)"
wenzelm@49519
   631
    by (subst less_iff_diff_less_0 [of "c*x" "-t"], simp)
wenzelm@49519
   632
  also have "\<dots> = (-t/c > x)"
wenzelm@49519
   633
    by (simp only: pos_less_divide_eq[OF H] algebra_simps)
chaieb@26161
   634
  also have "\<dots> = ((- 1/c)*t > x)" by simp
chaieb@26161
   635
  finally show  "(c*x + t < 0) == (x < (- 1/c)*t)" by simp
chaieb@26161
   636
qed
chaieb@26161
   637
haftmann@35028
   638
lemma sum_lt:"((x::'a::ordered_ab_group_add) + t < 0) == (x < - t)"
chaieb@26161
   639
  using less_diff_eq[where a= x and b=t and c=0] by simp
chaieb@26161
   640
haftmann@35028
   641
lemma neg_prod_le:"(c\<Colon>'a\<Colon>linordered_field) < 0 \<Longrightarrow> ((c*x <= 0) == (x >= 0))"
wenzelm@49519
   642
proof -
chaieb@26161
   643
  assume H: "c < 0"
wenzelm@49519
   644
  have "c*x <= 0 = (0/c <= x)"
wenzelm@49519
   645
    by (simp only: neg_divide_le_eq[OF H] algebra_simps)
chaieb@26161
   646
  also have "\<dots> = (0 <= x)" by simp
chaieb@26161
   647
  finally show  "(c*x <= 0) == (x >= 0)" by simp
chaieb@26161
   648
qed
chaieb@26161
   649
haftmann@35028
   650
lemma pos_prod_le:"(c\<Colon>'a\<Colon>linordered_field) > 0 \<Longrightarrow> ((c*x <= 0) == (x <= 0))"
wenzelm@49519
   651
proof -
chaieb@26161
   652
  assume H: "c > 0"
wenzelm@49519
   653
  hence "c*x <= 0 = (0/c >= x)"
wenzelm@49519
   654
    by (simp only: pos_le_divide_eq[OF H] algebra_simps)
chaieb@26161
   655
  also have "\<dots> = (0 >= x)" by simp
chaieb@26161
   656
  finally show  "(c*x <= 0) == (x <= 0)" by simp
chaieb@26161
   657
qed
chaieb@26161
   658
haftmann@35028
   659
lemma neg_prod_sum_le: "(c\<Colon>'a\<Colon>linordered_field) < 0 \<Longrightarrow> ((c*x + t <= 0) == (x >= (- 1/c)*t))"
wenzelm@49519
   660
proof -
chaieb@26161
   661
  assume H: "c < 0"
wenzelm@49519
   662
  have "c*x + t <= 0 = (c*x <= -t)"
wenzelm@49519
   663
    by (subst le_iff_diff_le_0 [of "c*x" "-t"], simp)
wenzelm@49519
   664
  also have "\<dots> = (-t/c <= x)"
wenzelm@49519
   665
    by (simp only: neg_divide_le_eq[OF H] algebra_simps)
chaieb@26161
   666
  also have "\<dots> = ((- 1/c)*t <= x)" by simp
wenzelm@49519
   667
  finally show "(c*x + t <= 0) == (x >= (- 1/c)*t)" by simp
chaieb@26161
   668
qed
chaieb@26161
   669
haftmann@35028
   670
lemma pos_prod_sum_le:"(c\<Colon>'a\<Colon>linordered_field) > 0 \<Longrightarrow> ((c*x + t <= 0) == (x <= (- 1/c)*t))"
wenzelm@49519
   671
proof -
chaieb@26161
   672
  assume H: "c > 0"
wenzelm@49519
   673
  have "c*x + t <= 0 = (c*x <= -t)"
wenzelm@49519
   674
    by (subst le_iff_diff_le_0 [of "c*x" "-t"], simp)
wenzelm@49519
   675
  also have "\<dots> = (-t/c >= x)"
wenzelm@49519
   676
    by (simp only: pos_le_divide_eq[OF H] algebra_simps)
chaieb@26161
   677
  also have "\<dots> = ((- 1/c)*t >= x)" by simp
wenzelm@49519
   678
  finally show "(c*x + t <= 0) == (x <= (- 1/c)*t)" by simp
chaieb@26161
   679
qed
chaieb@26161
   680
haftmann@35028
   681
lemma sum_le:"((x::'a::ordered_ab_group_add) + t <= 0) == (x <= - t)"
chaieb@26161
   682
  using le_diff_eq[where a= x and b=t and c=0] by simp
chaieb@26161
   683
haftmann@35028
   684
lemma nz_prod_eq:"(c\<Colon>'a\<Colon>linordered_field) \<noteq> 0 \<Longrightarrow> ((c*x = 0) == (x = 0))" by simp
wenzelm@49519
   685
haftmann@35028
   686
lemma nz_prod_sum_eq: "(c\<Colon>'a\<Colon>linordered_field) \<noteq> 0 \<Longrightarrow> ((c*x + t = 0) == (x = (- 1/c)*t))"
wenzelm@49519
   687
proof -
chaieb@26161
   688
  assume H: "c \<noteq> 0"
wenzelm@49519
   689
  have "c*x + t = 0 = (c*x = -t)"
wenzelm@49519
   690
    by (subst eq_iff_diff_eq_0 [of "c*x" "-t"], simp)
wenzelm@49519
   691
  also have "\<dots> = (x = -t/c)"
wenzelm@49519
   692
    by (simp only: nonzero_eq_divide_eq[OF H] algebra_simps)
chaieb@26161
   693
  finally show  "(c*x + t = 0) == (x = (- 1/c)*t)" by simp
chaieb@26161
   694
qed
wenzelm@49519
   695
haftmann@35028
   696
lemma sum_eq:"((x::'a::ordered_ab_group_add) + t = 0) == (x = - t)"
chaieb@26161
   697
  using eq_diff_eq[where a= x and b=t and c=0] by simp
chaieb@26161
   698
chaieb@26161
   699
haftmann@35043
   700
interpretation class_dense_linordered_field: constr_dense_linorder
haftmann@29509
   701
 "op <=" "op <"
huffman@47108
   702
   "\<lambda> x y. 1/2 * ((x::'a::{linordered_field}) + y)"
wenzelm@49519
   703
  by unfold_locales (dlo, dlo, auto)
chaieb@26161
   704
chaieb@26161
   705
declaration{*
chaieb@26161
   706
let
wenzelm@49519
   707
  fun earlier [] x y = false
wenzelm@49519
   708
    | earlier (h::t) x y =
wenzelm@49519
   709
        if h aconvc y then false else if h aconvc x then true else earlier t x y;
chaieb@26161
   710
wenzelm@49519
   711
fun dest_frac ct =
wenzelm@49519
   712
  case term_of ct of
wenzelm@49519
   713
    Const (@{const_name Fields.divide},_) $ a $ b=>
wenzelm@49519
   714
      Rat.rat_of_quotient (snd (HOLogic.dest_number a), snd (HOLogic.dest_number b))
wenzelm@49519
   715
  | Const(@{const_name inverse}, _)$a => Rat.rat_of_quotient(1, HOLogic.dest_number a |> snd)
wenzelm@49519
   716
  | t => Rat.rat_of_int (snd (HOLogic.dest_number t))
chaieb@26161
   717
chaieb@26161
   718
fun mk_frac phi cT x =
wenzelm@49519
   719
  let val (a, b) = Rat.quotient_of_rat x
wenzelm@49519
   720
  in if b = 1 then Numeral.mk_cnumber cT a
wenzelm@46497
   721
    else Thm.apply
wenzelm@46497
   722
         (Thm.apply (Drule.cterm_rule (instantiate' [SOME cT] []) @{cpat "op /"})
chaieb@26161
   723
                     (Numeral.mk_cnumber cT a))
chaieb@26161
   724
         (Numeral.mk_cnumber cT b)
chaieb@26161
   725
 end
chaieb@26161
   726
chaieb@26161
   727
fun whatis x ct = case term_of ct of
haftmann@35267
   728
  Const(@{const_name Groups.plus}, _)$(Const(@{const_name Groups.times},_)$_$y)$_ =>
chaieb@26161
   729
     if y aconv term_of x then ("c*x+t",[(funpow 2 Thm.dest_arg1) ct, Thm.dest_arg ct])
chaieb@26161
   730
     else ("Nox",[])
haftmann@35267
   731
| Const(@{const_name Groups.plus}, _)$y$_ =>
chaieb@26161
   732
     if y aconv term_of x then ("x+t",[Thm.dest_arg ct])
chaieb@26161
   733
     else ("Nox",[])
haftmann@35267
   734
| Const(@{const_name Groups.times}, _)$_$y =>
chaieb@26161
   735
     if y aconv term_of x then ("c*x",[Thm.dest_arg1 ct])
chaieb@26161
   736
     else ("Nox",[])
chaieb@26161
   737
| t => if t aconv term_of x then ("x",[]) else ("Nox",[]);
chaieb@26161
   738
wenzelm@36945
   739
fun xnormalize_conv ctxt [] ct = Thm.reflexive ct
chaieb@26161
   740
| xnormalize_conv ctxt (vs as (x::_)) ct =
chaieb@26161
   741
   case term_of ct of
haftmann@35267
   742
   Const(@{const_name Orderings.less},_)$_$Const(@{const_name Groups.zero},_) =>
chaieb@26161
   743
    (case whatis x (Thm.dest_arg1 ct) of
chaieb@26161
   744
    ("c*x+t",[c,t]) =>
chaieb@26161
   745
       let
chaieb@26161
   746
        val cr = dest_frac c
chaieb@26161
   747
        val clt = Thm.dest_fun2 ct
chaieb@26161
   748
        val cz = Thm.dest_arg ct
chaieb@26161
   749
        val neg = cr </ Rat.zero
wenzelm@51717
   750
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   751
               (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   752
                  (if neg then Thm.apply (Thm.apply clt c) cz
wenzelm@46497
   753
                    else Thm.apply (Thm.apply clt cz) c))
wenzelm@36945
   754
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   755
        val th = Thm.implies_elim (instantiate' [SOME (ctyp_of_term x)] (map SOME [c,x,t])
chaieb@26161
   756
             (if neg then @{thm neg_prod_sum_lt} else @{thm pos_prod_sum_lt})) cth
chaieb@26161
   757
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   758
                   (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   759
      in rth end
chaieb@26161
   760
    | ("x+t",[t]) =>
chaieb@26161
   761
       let
chaieb@26161
   762
        val T = ctyp_of_term x
chaieb@26161
   763
        val th = instantiate' [SOME T] [SOME x, SOME t] @{thm "sum_lt"}
chaieb@26161
   764
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   765
              (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   766
       in  rth end
chaieb@26161
   767
    | ("c*x",[c]) =>
chaieb@26161
   768
       let
chaieb@26161
   769
        val cr = dest_frac c
chaieb@26161
   770
        val clt = Thm.dest_fun2 ct
chaieb@26161
   771
        val cz = Thm.dest_arg ct
chaieb@26161
   772
        val neg = cr </ Rat.zero
wenzelm@51717
   773
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   774
               (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   775
                  (if neg then Thm.apply (Thm.apply clt c) cz
wenzelm@46497
   776
                    else Thm.apply (Thm.apply clt cz) c))
wenzelm@36945
   777
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   778
        val th = Thm.implies_elim (instantiate' [SOME (ctyp_of_term x)] (map SOME [c,x])
chaieb@26161
   779
             (if neg then @{thm neg_prod_lt} else @{thm pos_prod_lt})) cth
chaieb@26161
   780
        val rth = th
chaieb@26161
   781
      in rth end
wenzelm@36945
   782
    | _ => Thm.reflexive ct)
chaieb@26161
   783
chaieb@26161
   784
haftmann@35267
   785
|  Const(@{const_name Orderings.less_eq},_)$_$Const(@{const_name Groups.zero},_) =>
chaieb@26161
   786
   (case whatis x (Thm.dest_arg1 ct) of
chaieb@26161
   787
    ("c*x+t",[c,t]) =>
chaieb@26161
   788
       let
chaieb@26161
   789
        val T = ctyp_of_term x
chaieb@26161
   790
        val cr = dest_frac c
chaieb@26161
   791
        val clt = Drule.cterm_rule (instantiate' [SOME T] []) @{cpat "op <"}
chaieb@26161
   792
        val cz = Thm.dest_arg ct
chaieb@26161
   793
        val neg = cr </ Rat.zero
wenzelm@51717
   794
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   795
               (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   796
                  (if neg then Thm.apply (Thm.apply clt c) cz
wenzelm@46497
   797
                    else Thm.apply (Thm.apply clt cz) c))
wenzelm@36945
   798
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   799
        val th = Thm.implies_elim (instantiate' [SOME T] (map SOME [c,x,t])
chaieb@26161
   800
             (if neg then @{thm neg_prod_sum_le} else @{thm pos_prod_sum_le})) cth
chaieb@26161
   801
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   802
                   (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   803
      in rth end
chaieb@26161
   804
    | ("x+t",[t]) =>
chaieb@26161
   805
       let
chaieb@26161
   806
        val T = ctyp_of_term x
chaieb@26161
   807
        val th = instantiate' [SOME T] [SOME x, SOME t] @{thm "sum_le"}
chaieb@26161
   808
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   809
              (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   810
       in  rth end
chaieb@26161
   811
    | ("c*x",[c]) =>
chaieb@26161
   812
       let
chaieb@26161
   813
        val T = ctyp_of_term x
chaieb@26161
   814
        val cr = dest_frac c
chaieb@26161
   815
        val clt = Drule.cterm_rule (instantiate' [SOME T] []) @{cpat "op <"}
chaieb@26161
   816
        val cz = Thm.dest_arg ct
chaieb@26161
   817
        val neg = cr </ Rat.zero
wenzelm@51717
   818
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   819
               (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   820
                  (if neg then Thm.apply (Thm.apply clt c) cz
wenzelm@46497
   821
                    else Thm.apply (Thm.apply clt cz) c))
wenzelm@36945
   822
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   823
        val th = Thm.implies_elim (instantiate' [SOME (ctyp_of_term x)] (map SOME [c,x])
chaieb@26161
   824
             (if neg then @{thm neg_prod_le} else @{thm pos_prod_le})) cth
chaieb@26161
   825
        val rth = th
chaieb@26161
   826
      in rth end
wenzelm@36945
   827
    | _ => Thm.reflexive ct)
chaieb@26161
   828
haftmann@38864
   829
|  Const(@{const_name HOL.eq},_)$_$Const(@{const_name Groups.zero},_) =>
chaieb@26161
   830
   (case whatis x (Thm.dest_arg1 ct) of
chaieb@26161
   831
    ("c*x+t",[c,t]) =>
chaieb@26161
   832
       let
chaieb@26161
   833
        val T = ctyp_of_term x
chaieb@26161
   834
        val cr = dest_frac c
chaieb@26161
   835
        val ceq = Thm.dest_fun2 ct
chaieb@26161
   836
        val cz = Thm.dest_arg ct
wenzelm@51717
   837
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   838
            (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   839
             (Thm.apply @{cterm "Not"} (Thm.apply (Thm.apply ceq c) cz)))
wenzelm@36945
   840
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   841
        val th = Thm.implies_elim
chaieb@26161
   842
                 (instantiate' [SOME T] (map SOME [c,x,t]) @{thm nz_prod_sum_eq}) cth
chaieb@26161
   843
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   844
                   (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   845
      in rth end
chaieb@26161
   846
    | ("x+t",[t]) =>
chaieb@26161
   847
       let
chaieb@26161
   848
        val T = ctyp_of_term x
chaieb@26161
   849
        val th = instantiate' [SOME T] [SOME x, SOME t] @{thm "sum_eq"}
chaieb@26161
   850
        val rth = Conv.fconv_rule (Conv.arg_conv (Conv.binop_conv
haftmann@36753
   851
              (Semiring_Normalizer.semiring_normalize_ord_conv ctxt (earlier vs)))) th
chaieb@26161
   852
       in  rth end
chaieb@26161
   853
    | ("c*x",[c]) =>
chaieb@26161
   854
       let
chaieb@26161
   855
        val T = ctyp_of_term x
chaieb@26161
   856
        val cr = dest_frac c
chaieb@26161
   857
        val ceq = Thm.dest_fun2 ct
chaieb@26161
   858
        val cz = Thm.dest_arg ct
wenzelm@51717
   859
        val cthp = Simplifier.rewrite ctxt
wenzelm@46497
   860
            (Thm.apply @{cterm "Trueprop"}
wenzelm@46497
   861
             (Thm.apply @{cterm "Not"} (Thm.apply (Thm.apply ceq c) cz)))
wenzelm@36945
   862
        val cth = Thm.equal_elim (Thm.symmetric cthp) TrueI
wenzelm@36945
   863
        val rth = Thm.implies_elim
chaieb@26161
   864
                 (instantiate' [SOME T] (map SOME [c,x]) @{thm nz_prod_eq}) cth
chaieb@26161
   865
      in rth end
wenzelm@36945
   866
    | _ => Thm.reflexive ct);
chaieb@26161
   867
chaieb@26161
   868
local
chaieb@26161
   869
  val less_iff_diff_less_0 = mk_meta_eq @{thm "less_iff_diff_less_0"}
chaieb@26161
   870
  val le_iff_diff_le_0 = mk_meta_eq @{thm "le_iff_diff_le_0"}
chaieb@26161
   871
  val eq_iff_diff_eq_0 = mk_meta_eq @{thm "eq_iff_diff_eq_0"}
wenzelm@52090
   872
  val ss = simpset_of @{context}
chaieb@26161
   873
in
chaieb@26161
   874
fun field_isolate_conv phi ctxt vs ct = case term_of ct of
haftmann@35092
   875
  Const(@{const_name Orderings.less},_)$a$b =>
chaieb@26161
   876
   let val (ca,cb) = Thm.dest_binop ct
chaieb@26161
   877
       val T = ctyp_of_term ca
chaieb@26161
   878
       val th = instantiate' [SOME T] [SOME ca, SOME cb] less_iff_diff_less_0
chaieb@26161
   879
       val nth = Conv.fconv_rule
chaieb@26161
   880
         (Conv.arg_conv (Conv.arg1_conv
wenzelm@52090
   881
              (Semiring_Normalizer.semiring_normalize_ord_conv (put_simpset ss ctxt) (earlier vs)))) th
wenzelm@36945
   882
       val rth = Thm.transitive nth (xnormalize_conv ctxt vs (Thm.rhs_of nth))
chaieb@26161
   883
   in rth end
haftmann@35092
   884
| Const(@{const_name Orderings.less_eq},_)$a$b =>
chaieb@26161
   885
   let val (ca,cb) = Thm.dest_binop ct
chaieb@26161
   886
       val T = ctyp_of_term ca
chaieb@26161
   887
       val th = instantiate' [SOME T] [SOME ca, SOME cb] le_iff_diff_le_0
chaieb@26161
   888
       val nth = Conv.fconv_rule
chaieb@26161
   889
         (Conv.arg_conv (Conv.arg1_conv
wenzelm@52090
   890
              (Semiring_Normalizer.semiring_normalize_ord_conv (put_simpset ss ctxt) (earlier vs)))) th
wenzelm@36945
   891
       val rth = Thm.transitive nth (xnormalize_conv ctxt vs (Thm.rhs_of nth))
chaieb@26161
   892
   in rth end
chaieb@26161
   893
haftmann@38864
   894
| Const(@{const_name HOL.eq},_)$a$b =>
chaieb@26161
   895
   let val (ca,cb) = Thm.dest_binop ct
chaieb@26161
   896
       val T = ctyp_of_term ca
chaieb@26161
   897
       val th = instantiate' [SOME T] [SOME ca, SOME cb] eq_iff_diff_eq_0
chaieb@26161
   898
       val nth = Conv.fconv_rule
chaieb@26161
   899
         (Conv.arg_conv (Conv.arg1_conv
wenzelm@52090
   900
              (Semiring_Normalizer.semiring_normalize_ord_conv (put_simpset ss ctxt) (earlier vs)))) th
wenzelm@36945
   901
       val rth = Thm.transitive nth (xnormalize_conv ctxt vs (Thm.rhs_of nth))
chaieb@26161
   902
   in rth end
haftmann@38864
   903
| @{term "Not"} $(Const(@{const_name HOL.eq},_)$a$b) => Conv.arg_conv (field_isolate_conv phi ctxt vs) ct
wenzelm@36945
   904
| _ => Thm.reflexive ct
chaieb@26161
   905
end;
chaieb@26161
   906
chaieb@26161
   907
fun classfield_whatis phi =
chaieb@26161
   908
 let
chaieb@26161
   909
  fun h x t =
chaieb@26161
   910
   case term_of t of
haftmann@38864
   911
     Const(@{const_name HOL.eq}, _)$y$z => if term_of x aconv y then Ferrante_Rackoff_Data.Eq
chaieb@26161
   912
                            else Ferrante_Rackoff_Data.Nox
haftmann@38864
   913
   | @{term "Not"}$(Const(@{const_name HOL.eq}, _)$y$z) => if term_of x aconv y then Ferrante_Rackoff_Data.NEq
chaieb@26161
   914
                            else Ferrante_Rackoff_Data.Nox
haftmann@35092
   915
   | Const(@{const_name Orderings.less},_)$y$z =>
chaieb@26161
   916
       if term_of x aconv y then Ferrante_Rackoff_Data.Lt
chaieb@26161
   917
        else if term_of x aconv z then Ferrante_Rackoff_Data.Gt
chaieb@26161
   918
        else Ferrante_Rackoff_Data.Nox
haftmann@35092
   919
   | Const (@{const_name Orderings.less_eq},_)$y$z =>
chaieb@26161
   920
         if term_of x aconv y then Ferrante_Rackoff_Data.Le
chaieb@26161
   921
         else if term_of x aconv z then Ferrante_Rackoff_Data.Ge
chaieb@26161
   922
         else Ferrante_Rackoff_Data.Nox
chaieb@26161
   923
   | _ => Ferrante_Rackoff_Data.Nox
chaieb@26161
   924
 in h end;
chaieb@26161
   925
fun class_field_ss phi =
wenzelm@51717
   926
  simpset_of (put_simpset HOL_basic_ss @{context}
wenzelm@51717
   927
    addsimps ([@{thm "linorder_not_less"}, @{thm "linorder_not_le"}])
wenzelm@51717
   928
    |> fold Splitter.add_split [@{thm "abs_split"}, @{thm "split_max"}, @{thm "split_min"}])
chaieb@26161
   929
chaieb@26161
   930
in
haftmann@35043
   931
Ferrante_Rackoff_Data.funs @{thm "class_dense_linordered_field.ferrack_axiom"}
chaieb@26161
   932
  {isolate_conv = field_isolate_conv, whatis = classfield_whatis, simpset = class_field_ss}
chaieb@26161
   933
end
chaieb@26161
   934
*}
nipkow@41849
   935
(*
chaieb@29841
   936
lemma upper_bound_finite_set:
chaieb@29841
   937
  assumes fS: "finite S"
chaieb@29841
   938
  shows "\<exists>(a::'a::linorder). \<forall>x \<in> S. f x \<le> a"
chaieb@29841
   939
proof(induct rule: finite_induct[OF fS])
chaieb@29841
   940
  case 1 thus ?case by simp
chaieb@29841
   941
next
chaieb@29841
   942
  case (2 x F)
chaieb@29841
   943
  from "2.hyps" obtain a where a:"\<forall>x \<in>F. f x \<le> a" by blast
chaieb@29841
   944
  let ?a = "max a (f x)"
chaieb@29841
   945
  have m: "a \<le> ?a" "f x \<le> ?a" by simp_all
chaieb@29841
   946
  {fix y assume y: "y \<in> insert x F"
chaieb@29841
   947
    {assume "y = x" hence "f y \<le> ?a" using m by simp}
chaieb@29841
   948
    moreover
chaieb@29841
   949
    {assume yF: "y\<in> F" from a[rule_format, OF yF] m have "f y \<le> ?a" by (simp add: max_def)}
chaieb@29841
   950
    ultimately have "f y \<le> ?a" using y by blast}
chaieb@29841
   951
  then show ?case by blast
chaieb@29841
   952
qed
chaieb@29841
   953
chaieb@29841
   954
lemma lower_bound_finite_set:
chaieb@29841
   955
  assumes fS: "finite S"
chaieb@29841
   956
  shows "\<exists>(a::'a::linorder). \<forall>x \<in> S. f x \<ge> a"
chaieb@29841
   957
proof(induct rule: finite_induct[OF fS])
chaieb@29841
   958
  case 1 thus ?case by simp
chaieb@29841
   959
next
chaieb@29841
   960
  case (2 x F)
chaieb@29841
   961
  from "2.hyps" obtain a where a:"\<forall>x \<in>F. f x \<ge> a" by blast
chaieb@29841
   962
  let ?a = "min a (f x)"
chaieb@29841
   963
  have m: "a \<ge> ?a" "f x \<ge> ?a" by simp_all
chaieb@29841
   964
  {fix y assume y: "y \<in> insert x F"
chaieb@29841
   965
    {assume "y = x" hence "f y \<ge> ?a" using m by simp}
chaieb@29841
   966
    moreover
chaieb@29841
   967
    {assume yF: "y\<in> F" from a[rule_format, OF yF] m have "f y \<ge> ?a" by (simp add: min_def)}
chaieb@29841
   968
    ultimately have "f y \<ge> ?a" using y by blast}
chaieb@29841
   969
  then show ?case by blast
chaieb@29841
   970
qed
chaieb@29841
   971
chaieb@29841
   972
lemma bound_finite_set: assumes f: "finite S"
chaieb@29841
   973
  shows "\<exists>a. \<forall>x \<in>S. (f x:: 'a::linorder) \<le> a"
chaieb@29841
   974
proof-
chaieb@29841
   975
  let ?F = "f ` S"
chaieb@29841
   976
  from f have fF: "finite ?F" by simp
chaieb@29841
   977
  let ?a = "Max ?F"
chaieb@29841
   978
  {assume "S = {}" hence ?thesis by blast}
chaieb@29841
   979
  moreover
chaieb@29841
   980
  {assume Se: "S \<noteq> {}" hence Fe: "?F \<noteq> {}" by simp
chaieb@29841
   981
  {fix x assume x: "x \<in> S"
chaieb@29841
   982
    hence th0: "f x \<in> ?F" by simp
chaieb@29841
   983
    hence "f x \<le> ?a" using Max_ge[OF fF th0] ..}
chaieb@29841
   984
  hence ?thesis by blast}
chaieb@29841
   985
ultimately show ?thesis by blast
chaieb@29841
   986
qed
nipkow@41849
   987
*)
chaieb@26161
   988
chaieb@26161
   989
end