src/HOL/PReal.thy
author haftmann
Mon Dec 29 14:08:08 2008 +0100 (2008-12-29)
changeset 29197 6d4cb27ed19c
parent 28952 15a4b2cf8c34
child 29667 53103fc8ffa3
permissions -rw-r--r--
adapted HOL source structure to distribution layout
paulson@7219
     1
(*  Title       : PReal.thy
paulson@5078
     2
    Author      : Jacques D. Fleuriot
paulson@5078
     3
    Copyright   : 1998  University of Cambridge
paulson@5078
     4
    Description : The positive reals as Dedekind sections of positive
paulson@14335
     5
         rationals. Fundamentals of Abstract Analysis [Gleason- p. 121]
paulson@5078
     6
                  provides some of the definitions.
paulson@5078
     7
*)
paulson@5078
     8
huffman@17428
     9
header {* Positive real numbers *}
huffman@17428
    10
nipkow@15131
    11
theory PReal
haftmann@29197
    12
imports Rational Dense_Linear_Order
nipkow@15131
    13
begin
paulson@14365
    14
paulson@14365
    15
text{*Could be generalized and moved to @{text Ring_and_Field}*}
paulson@14365
    16
lemma add_eq_exists: "\<exists>x. a+x = (b::rat)"
paulson@14365
    17
by (rule_tac x="b-a" in exI, simp)
paulson@5078
    18
wenzelm@19765
    19
definition
wenzelm@21404
    20
  cut :: "rat set => bool" where
haftmann@28562
    21
  [code del]: "cut A = ({} \<subset> A &
wenzelm@19765
    22
            A < {r. 0 < r} &
wenzelm@19765
    23
            (\<forall>y \<in> A. ((\<forall>z. 0<z & z < y --> z \<in> A) & (\<exists>u \<in> A. y < u))))"
paulson@14365
    24
paulson@14365
    25
lemma cut_of_rat: 
huffman@20495
    26
  assumes q: "0 < q" shows "cut {r::rat. 0 < r & r < q}" (is "cut ?A")
paulson@14365
    27
proof -
paulson@14365
    28
  from q have pos: "?A < {r. 0 < r}" by force
paulson@14365
    29
  have nonempty: "{} \<subset> ?A"
paulson@14365
    30
  proof
paulson@14365
    31
    show "{} \<subseteq> ?A" by simp
paulson@14365
    32
    show "{} \<noteq> ?A"
paulson@14365
    33
      by (force simp only: q eq_commute [of "{}"] interval_empty_iff)
paulson@14365
    34
  qed
paulson@14365
    35
  show ?thesis
paulson@14365
    36
    by (simp add: cut_def pos nonempty,
paulson@14365
    37
        blast dest: dense intro: order_less_trans)
paulson@14365
    38
qed
paulson@14365
    39
paulson@14365
    40
paulson@14365
    41
typedef preal = "{A. cut A}"
paulson@14365
    42
  by (blast intro: cut_of_rat [OF zero_less_one])
paulson@14365
    43
wenzelm@19765
    44
definition
wenzelm@21404
    45
  preal_of_rat :: "rat => preal" where
huffman@20495
    46
  "preal_of_rat q = Abs_preal {x::rat. 0 < x & x < q}"
paulson@5078
    47
wenzelm@21404
    48
definition
wenzelm@21404
    49
  psup :: "preal set => preal" where
huffman@20495
    50
  "psup P = Abs_preal (\<Union>X \<in> P. Rep_preal X)"
paulson@14365
    51
wenzelm@21404
    52
definition
wenzelm@21404
    53
  add_set :: "[rat set,rat set] => rat set" where
wenzelm@19765
    54
  "add_set A B = {w. \<exists>x \<in> A. \<exists>y \<in> B. w = x + y}"
paulson@14365
    55
wenzelm@21404
    56
definition
wenzelm@21404
    57
  diff_set :: "[rat set,rat set] => rat set" where
haftmann@28562
    58
  [code del]: "diff_set A B = {w. \<exists>x. 0 < w & 0 < x & x \<notin> B & x + w \<in> A}"
paulson@14365
    59
wenzelm@21404
    60
definition
wenzelm@21404
    61
  mult_set :: "[rat set,rat set] => rat set" where
wenzelm@19765
    62
  "mult_set A B = {w. \<exists>x \<in> A. \<exists>y \<in> B. w = x * y}"
paulson@14365
    63
wenzelm@21404
    64
definition
wenzelm@21404
    65
  inverse_set :: "rat set => rat set" where
haftmann@28562
    66
  [code del]: "inverse_set A = {x. \<exists>y. 0 < x & x < y & inverse y \<notin> A}"
paulson@14365
    67
haftmann@26511
    68
instantiation preal :: "{ord, plus, minus, times, inverse, one}"
haftmann@26511
    69
begin
paulson@5078
    70
haftmann@26511
    71
definition
haftmann@28562
    72
  preal_less_def [code del]:
huffman@20495
    73
    "R < S == Rep_preal R < Rep_preal S"
paulson@14365
    74
haftmann@26511
    75
definition
haftmann@28562
    76
  preal_le_def [code del]:
huffman@20495
    77
    "R \<le> S == Rep_preal R \<subseteq> Rep_preal S"
paulson@14365
    78
haftmann@26511
    79
definition
paulson@14335
    80
  preal_add_def:
paulson@14365
    81
    "R + S == Abs_preal (add_set (Rep_preal R) (Rep_preal S))"
paulson@14365
    82
haftmann@26511
    83
definition
paulson@14365
    84
  preal_diff_def:
paulson@14365
    85
    "R - S == Abs_preal (diff_set (Rep_preal R) (Rep_preal S))"
paulson@5078
    86
haftmann@26511
    87
definition
paulson@14335
    88
  preal_mult_def:
huffman@20495
    89
    "R * S == Abs_preal (mult_set (Rep_preal R) (Rep_preal S))"
paulson@5078
    90
haftmann@26511
    91
definition
paulson@14365
    92
  preal_inverse_def:
huffman@20495
    93
    "inverse R == Abs_preal (inverse_set (Rep_preal R))"
paulson@14335
    94
haftmann@26564
    95
definition "R / S = R * inverse (S\<Colon>preal)"
haftmann@26564
    96
haftmann@26511
    97
definition
huffman@23287
    98
  preal_one_def:
huffman@23287
    99
    "1 == preal_of_rat 1"
huffman@23287
   100
haftmann@26511
   101
instance ..
haftmann@26511
   102
haftmann@26511
   103
end
haftmann@26511
   104
paulson@14335
   105
paulson@15413
   106
text{*Reduces equality on abstractions to equality on representatives*}
paulson@15413
   107
declare Abs_preal_inject [simp]
huffman@20495
   108
declare Abs_preal_inverse [simp]
huffman@20495
   109
huffman@20495
   110
lemma rat_mem_preal: "0 < q ==> {r::rat. 0 < r & r < q} \<in> preal"
huffman@20495
   111
by (simp add: preal_def cut_of_rat)
paulson@14335
   112
paulson@14365
   113
lemma preal_nonempty: "A \<in> preal ==> \<exists>x\<in>A. 0 < x"
paulson@14365
   114
by (unfold preal_def cut_def, blast)
paulson@14335
   115
huffman@20495
   116
lemma preal_Ex_mem: "A \<in> preal \<Longrightarrow> \<exists>x. x \<in> A"
huffman@20495
   117
by (drule preal_nonempty, fast)
huffman@20495
   118
paulson@14365
   119
lemma preal_imp_psubset_positives: "A \<in> preal ==> A < {r. 0 < r}"
paulson@14365
   120
by (force simp add: preal_def cut_def)
paulson@14335
   121
paulson@14365
   122
lemma preal_exists_bound: "A \<in> preal ==> \<exists>x. 0 < x & x \<notin> A"
paulson@14365
   123
by (drule preal_imp_psubset_positives, auto)
paulson@14335
   124
paulson@14365
   125
lemma preal_exists_greater: "[| A \<in> preal; y \<in> A |] ==> \<exists>u \<in> A. y < u"
paulson@14365
   126
by (unfold preal_def cut_def, blast)
paulson@14335
   127
paulson@14365
   128
lemma preal_downwards_closed: "[| A \<in> preal; y \<in> A; 0 < z; z < y |] ==> z \<in> A"
paulson@14365
   129
by (unfold preal_def cut_def, blast)
paulson@14335
   130
paulson@14365
   131
text{*Relaxing the final premise*}
paulson@14365
   132
lemma preal_downwards_closed':
paulson@14365
   133
     "[| A \<in> preal; y \<in> A; 0 < z; z \<le> y |] ==> z \<in> A"
paulson@14365
   134
apply (simp add: order_le_less)
paulson@14365
   135
apply (blast intro: preal_downwards_closed)
paulson@14365
   136
done
paulson@14335
   137
paulson@14335
   138
text{*A positive fraction not in a positive real is an upper bound.
paulson@14335
   139
 Gleason p. 122 - Remark (1)*}
paulson@14335
   140
paulson@14365
   141
lemma not_in_preal_ub:
wenzelm@19765
   142
  assumes A: "A \<in> preal"
wenzelm@19765
   143
    and notx: "x \<notin> A"
wenzelm@19765
   144
    and y: "y \<in> A"
wenzelm@19765
   145
    and pos: "0 < x"
wenzelm@19765
   146
  shows "y < x"
paulson@14365
   147
proof (cases rule: linorder_cases)
paulson@14365
   148
  assume "x<y"
paulson@14365
   149
  with notx show ?thesis
paulson@14365
   150
    by (simp add:  preal_downwards_closed [OF A y] pos)
paulson@14365
   151
next
paulson@14365
   152
  assume "x=y"
paulson@14365
   153
  with notx and y show ?thesis by simp
paulson@14365
   154
next
paulson@14365
   155
  assume "y<x"
huffman@20495
   156
  thus ?thesis .
paulson@14365
   157
qed
paulson@14365
   158
huffman@20495
   159
text {* preal lemmas instantiated to @{term "Rep_preal X"} *}
huffman@20495
   160
huffman@20495
   161
lemma mem_Rep_preal_Ex: "\<exists>x. x \<in> Rep_preal X"
huffman@20495
   162
by (rule preal_Ex_mem [OF Rep_preal])
huffman@20495
   163
huffman@20495
   164
lemma Rep_preal_exists_bound: "\<exists>x>0. x \<notin> Rep_preal X"
huffman@20495
   165
by (rule preal_exists_bound [OF Rep_preal])
huffman@20495
   166
paulson@14365
   167
lemmas not_in_Rep_preal_ub = not_in_preal_ub [OF Rep_preal]
paulson@14335
   168
paulson@14335
   169
huffman@20495
   170
huffman@20495
   171
subsection{*@{term preal_of_prat}: the Injection from prat to preal*}
huffman@20495
   172
huffman@20495
   173
lemma rat_less_set_mem_preal: "0 < y ==> {u::rat. 0 < u & u < y} \<in> preal"
huffman@20495
   174
by (simp add: preal_def cut_of_rat)
huffman@20495
   175
huffman@20495
   176
lemma rat_subset_imp_le:
huffman@20495
   177
     "[|{u::rat. 0 < u & u < x} \<subseteq> {u. 0 < u & u < y}; 0<x|] ==> x \<le> y"
huffman@20495
   178
apply (simp add: linorder_not_less [symmetric])
huffman@20495
   179
apply (blast dest: dense intro: order_less_trans)
huffman@20495
   180
done
huffman@20495
   181
huffman@20495
   182
lemma rat_set_eq_imp_eq:
huffman@20495
   183
     "[|{u::rat. 0 < u & u < x} = {u. 0 < u & u < y};
huffman@20495
   184
        0 < x; 0 < y|] ==> x = y"
huffman@20495
   185
by (blast intro: rat_subset_imp_le order_antisym)
huffman@20495
   186
huffman@20495
   187
huffman@20495
   188
huffman@20495
   189
subsection{*Properties of Ordering*}
paulson@14365
   190
paulson@14365
   191
instance preal :: order
haftmann@27682
   192
proof
haftmann@27682
   193
  fix w :: preal
haftmann@27682
   194
  show "w \<le> w" by (simp add: preal_le_def)
haftmann@27682
   195
next
haftmann@27682
   196
  fix i j k :: preal
haftmann@27682
   197
  assume "i \<le> j" and "j \<le> k"
haftmann@27682
   198
  then show "i \<le> k" by (simp add: preal_le_def)
haftmann@27682
   199
next
haftmann@27682
   200
  fix z w :: preal
haftmann@27682
   201
  assume "z \<le> w" and "w \<le> z"
haftmann@27682
   202
  then show "z = w" by (simp add: preal_le_def Rep_preal_inject)
haftmann@27682
   203
next
haftmann@27682
   204
  fix z w :: preal
haftmann@27682
   205
  show "z < w \<longleftrightarrow> z \<le> w \<and> \<not> w \<le> z"
haftmann@27682
   206
  by (auto simp add: preal_le_def preal_less_def Rep_preal_inject)
haftmann@27682
   207
qed  
paulson@14335
   208
paulson@14365
   209
lemma preal_imp_pos: "[|A \<in> preal; r \<in> A|] ==> 0 < r"
paulson@14365
   210
by (insert preal_imp_psubset_positives, blast)
paulson@14335
   211
haftmann@27682
   212
instance preal :: linorder
haftmann@27682
   213
proof
haftmann@27682
   214
  fix x y :: preal
haftmann@27682
   215
  show "x <= y | y <= x"
haftmann@27682
   216
    apply (auto simp add: preal_le_def)
haftmann@27682
   217
    apply (rule ccontr)
haftmann@27682
   218
    apply (blast dest: not_in_Rep_preal_ub intro: preal_imp_pos [OF Rep_preal]
paulson@14365
   219
             elim: order_less_asym)
haftmann@27682
   220
    done
haftmann@27682
   221
qed
paulson@14335
   222
haftmann@25571
   223
instantiation preal :: distrib_lattice
haftmann@25571
   224
begin
haftmann@25571
   225
haftmann@25571
   226
definition
haftmann@25571
   227
  "(inf \<Colon> preal \<Rightarrow> preal \<Rightarrow> preal) = min"
haftmann@25571
   228
haftmann@25571
   229
definition
haftmann@25571
   230
  "(sup \<Colon> preal \<Rightarrow> preal \<Rightarrow> preal) = max"
haftmann@25571
   231
haftmann@25571
   232
instance
haftmann@22483
   233
  by intro_classes
haftmann@22483
   234
    (auto simp add: inf_preal_def sup_preal_def min_max.sup_inf_distrib1)
paulson@14335
   235
haftmann@25571
   236
end
paulson@14335
   237
paulson@14335
   238
subsection{*Properties of Addition*}
paulson@14335
   239
paulson@14335
   240
lemma preal_add_commute: "(x::preal) + y = y + x"
paulson@14365
   241
apply (unfold preal_add_def add_set_def)
paulson@14335
   242
apply (rule_tac f = Abs_preal in arg_cong)
paulson@14365
   243
apply (force simp add: add_commute)
paulson@14335
   244
done
paulson@14335
   245
paulson@14365
   246
text{*Lemmas for proving that addition of two positive reals gives
paulson@14365
   247
 a positive real*}
paulson@14365
   248
paulson@14365
   249
lemma empty_psubset_nonempty: "a \<in> A ==> {} \<subset> A"
paulson@14365
   250
by blast
paulson@14365
   251
paulson@14365
   252
text{*Part 1 of Dedekind sections definition*}
paulson@14365
   253
lemma add_set_not_empty:
paulson@14365
   254
     "[|A \<in> preal; B \<in> preal|] ==> {} \<subset> add_set A B"
huffman@20495
   255
apply (drule preal_nonempty)+
paulson@14365
   256
apply (auto simp add: add_set_def)
paulson@14335
   257
done
paulson@14335
   258
paulson@14365
   259
text{*Part 2 of Dedekind sections definition.  A structured version of
paulson@14365
   260
this proof is @{text preal_not_mem_mult_set_Ex} below.*}
paulson@14365
   261
lemma preal_not_mem_add_set_Ex:
huffman@20495
   262
     "[|A \<in> preal; B \<in> preal|] ==> \<exists>q>0. q \<notin> add_set A B"
paulson@14365
   263
apply (insert preal_exists_bound [of A] preal_exists_bound [of B], auto) 
paulson@14365
   264
apply (rule_tac x = "x+xa" in exI)
paulson@14365
   265
apply (simp add: add_set_def, clarify)
huffman@20495
   266
apply (drule (3) not_in_preal_ub)+
paulson@14365
   267
apply (force dest: add_strict_mono)
paulson@14335
   268
done
paulson@14335
   269
paulson@14365
   270
lemma add_set_not_rat_set:
paulson@14365
   271
   assumes A: "A \<in> preal" 
paulson@14365
   272
       and B: "B \<in> preal"
paulson@14365
   273
     shows "add_set A B < {r. 0 < r}"
paulson@14365
   274
proof
paulson@14365
   275
  from preal_imp_pos [OF A] preal_imp_pos [OF B]
paulson@14365
   276
  show "add_set A B \<subseteq> {r. 0 < r}" by (force simp add: add_set_def) 
paulson@14365
   277
next
paulson@14365
   278
  show "add_set A B \<noteq> {r. 0 < r}"
paulson@14365
   279
    by (insert preal_not_mem_add_set_Ex [OF A B], blast) 
paulson@14365
   280
qed
paulson@14365
   281
paulson@14335
   282
text{*Part 3 of Dedekind sections definition*}
paulson@14365
   283
lemma add_set_lemma3:
paulson@14365
   284
     "[|A \<in> preal; B \<in> preal; u \<in> add_set A B; 0 < z; z < u|] 
paulson@14365
   285
      ==> z \<in> add_set A B"
paulson@14365
   286
proof (unfold add_set_def, clarify)
paulson@14365
   287
  fix x::rat and y::rat
paulson@14365
   288
  assume A: "A \<in> preal" 
wenzelm@19765
   289
    and B: "B \<in> preal"
wenzelm@19765
   290
    and [simp]: "0 < z"
wenzelm@19765
   291
    and zless: "z < x + y"
wenzelm@19765
   292
    and x:  "x \<in> A"
wenzelm@19765
   293
    and y:  "y \<in> B"
paulson@14365
   294
  have xpos [simp]: "0<x" by (rule preal_imp_pos [OF A x])
paulson@14365
   295
  have ypos [simp]: "0<y" by (rule preal_imp_pos [OF B y])
paulson@14365
   296
  have xypos [simp]: "0 < x+y" by (simp add: pos_add_strict)
paulson@14365
   297
  let ?f = "z/(x+y)"
paulson@14365
   298
  have fless: "?f < 1" by (simp add: zless pos_divide_less_eq)
paulson@14365
   299
  show "\<exists>x' \<in> A. \<exists>y'\<in>B. z = x' + y'"
huffman@20495
   300
  proof (intro bexI)
huffman@20495
   301
    show "z = x*?f + y*?f"
huffman@20495
   302
      by (simp add: left_distrib [symmetric] divide_inverse mult_ac
huffman@20495
   303
          order_less_imp_not_eq2)
huffman@20495
   304
  next
huffman@20495
   305
    show "y * ?f \<in> B"
huffman@20495
   306
    proof (rule preal_downwards_closed [OF B y])
huffman@20495
   307
      show "0 < y * ?f"
huffman@20495
   308
        by (simp add: divide_inverse zero_less_mult_iff)
paulson@14365
   309
    next
huffman@20495
   310
      show "y * ?f < y"
huffman@20495
   311
        by (insert mult_strict_left_mono [OF fless ypos], simp)
paulson@14365
   312
    qed
paulson@14365
   313
  next
paulson@14365
   314
    show "x * ?f \<in> A"
paulson@14365
   315
    proof (rule preal_downwards_closed [OF A x])
paulson@14365
   316
      show "0 < x * ?f"
paulson@14430
   317
	by (simp add: divide_inverse zero_less_mult_iff)
paulson@14365
   318
    next
paulson@14365
   319
      show "x * ?f < x"
paulson@14365
   320
	by (insert mult_strict_left_mono [OF fless xpos], simp)
paulson@14365
   321
    qed
paulson@14365
   322
  qed
paulson@14365
   323
qed
paulson@14365
   324
paulson@14365
   325
text{*Part 4 of Dedekind sections definition*}
paulson@14365
   326
lemma add_set_lemma4:
paulson@14365
   327
     "[|A \<in> preal; B \<in> preal; y \<in> add_set A B|] ==> \<exists>u \<in> add_set A B. y < u"
paulson@14365
   328
apply (auto simp add: add_set_def)
paulson@14365
   329
apply (frule preal_exists_greater [of A], auto) 
paulson@14365
   330
apply (rule_tac x="u + y" in exI)
paulson@14365
   331
apply (auto intro: add_strict_left_mono)
paulson@14335
   332
done
paulson@14335
   333
paulson@14365
   334
lemma mem_add_set:
paulson@14365
   335
     "[|A \<in> preal; B \<in> preal|] ==> add_set A B \<in> preal"
paulson@14365
   336
apply (simp (no_asm_simp) add: preal_def cut_def)
paulson@14365
   337
apply (blast intro!: add_set_not_empty add_set_not_rat_set
paulson@14365
   338
                     add_set_lemma3 add_set_lemma4)
paulson@14335
   339
done
paulson@14335
   340
paulson@14335
   341
lemma preal_add_assoc: "((x::preal) + y) + z = x + (y + z)"
paulson@14365
   342
apply (simp add: preal_add_def mem_add_set Rep_preal)
paulson@14365
   343
apply (force simp add: add_set_def add_ac)
paulson@14335
   344
done
paulson@14335
   345
huffman@23287
   346
instance preal :: ab_semigroup_add
huffman@23287
   347
proof
huffman@23287
   348
  fix a b c :: preal
huffman@23287
   349
  show "(a + b) + c = a + (b + c)" by (rule preal_add_assoc)
huffman@23287
   350
  show "a + b = b + a" by (rule preal_add_commute)
huffman@23287
   351
qed
huffman@23287
   352
paulson@14335
   353
lemma preal_add_left_commute: "x + (y + z) = y + ((x + z)::preal)"
huffman@23287
   354
by (rule add_left_commute)
paulson@14335
   355
paulson@14365
   356
text{* Positive Real addition is an AC operator *}
paulson@14335
   357
lemmas preal_add_ac = preal_add_assoc preal_add_commute preal_add_left_commute
paulson@14335
   358
paulson@14335
   359
paulson@14335
   360
subsection{*Properties of Multiplication*}
paulson@14335
   361
paulson@14335
   362
text{*Proofs essentially same as for addition*}
paulson@14335
   363
paulson@14335
   364
lemma preal_mult_commute: "(x::preal) * y = y * x"
paulson@14365
   365
apply (unfold preal_mult_def mult_set_def)
paulson@14335
   366
apply (rule_tac f = Abs_preal in arg_cong)
paulson@14365
   367
apply (force simp add: mult_commute)
paulson@14335
   368
done
paulson@14335
   369
nipkow@15055
   370
text{*Multiplication of two positive reals gives a positive real.*}
paulson@14335
   371
paulson@14335
   372
text{*Lemmas for proving positive reals multiplication set in @{typ preal}*}
paulson@14335
   373
paulson@14335
   374
text{*Part 1 of Dedekind sections definition*}
paulson@14365
   375
lemma mult_set_not_empty:
paulson@14365
   376
     "[|A \<in> preal; B \<in> preal|] ==> {} \<subset> mult_set A B"
paulson@14365
   377
apply (insert preal_nonempty [of A] preal_nonempty [of B]) 
paulson@14365
   378
apply (auto simp add: mult_set_def)
paulson@14335
   379
done
paulson@14335
   380
paulson@14335
   381
text{*Part 2 of Dedekind sections definition*}
paulson@14335
   382
lemma preal_not_mem_mult_set_Ex:
paulson@14365
   383
   assumes A: "A \<in> preal" 
paulson@14365
   384
       and B: "B \<in> preal"
paulson@14365
   385
     shows "\<exists>q. 0 < q & q \<notin> mult_set A B"
paulson@14365
   386
proof -
paulson@14365
   387
  from preal_exists_bound [OF A]
paulson@14365
   388
  obtain x where [simp]: "0 < x" "x \<notin> A" by blast
paulson@14365
   389
  from preal_exists_bound [OF B]
paulson@14365
   390
  obtain y where [simp]: "0 < y" "y \<notin> B" by blast
paulson@14365
   391
  show ?thesis
paulson@14365
   392
  proof (intro exI conjI)
avigad@16775
   393
    show "0 < x*y" by (simp add: mult_pos_pos)
paulson@14365
   394
    show "x * y \<notin> mult_set A B"
paulson@14377
   395
    proof -
paulson@14377
   396
      { fix u::rat and v::rat
kleing@14550
   397
	      assume "u \<in> A" and "v \<in> B" and "x*y = u*v"
kleing@14550
   398
	      moreover
kleing@14550
   399
	      with prems have "u<x" and "v<y" by (blast dest: not_in_preal_ub)+
kleing@14550
   400
	      moreover
kleing@14550
   401
	      with prems have "0\<le>v"
kleing@14550
   402
	        by (blast intro: preal_imp_pos [OF B]  order_less_imp_le prems)
kleing@14550
   403
	      moreover
kleing@14550
   404
        from calculation
kleing@14550
   405
	      have "u*v < x*y" by (blast intro: mult_strict_mono prems)
kleing@14550
   406
	      ultimately have False by force }
paulson@14377
   407
      thus ?thesis by (auto simp add: mult_set_def)
paulson@14365
   408
    qed
paulson@14365
   409
  qed
paulson@14365
   410
qed
paulson@14335
   411
paulson@14365
   412
lemma mult_set_not_rat_set:
wenzelm@19765
   413
  assumes A: "A \<in> preal" 
wenzelm@19765
   414
    and B: "B \<in> preal"
wenzelm@19765
   415
  shows "mult_set A B < {r. 0 < r}"
paulson@14365
   416
proof
paulson@14365
   417
  show "mult_set A B \<subseteq> {r. 0 < r}"
paulson@14365
   418
    by (force simp add: mult_set_def
wenzelm@19765
   419
      intro: preal_imp_pos [OF A] preal_imp_pos [OF B] mult_pos_pos)
paulson@14365
   420
  show "mult_set A B \<noteq> {r. 0 < r}"
wenzelm@19765
   421
    using preal_not_mem_mult_set_Ex [OF A B] by blast
paulson@14365
   422
qed
paulson@14365
   423
paulson@14365
   424
paulson@14335
   425
paulson@14335
   426
text{*Part 3 of Dedekind sections definition*}
paulson@14365
   427
lemma mult_set_lemma3:
paulson@14365
   428
     "[|A \<in> preal; B \<in> preal; u \<in> mult_set A B; 0 < z; z < u|] 
paulson@14365
   429
      ==> z \<in> mult_set A B"
paulson@14365
   430
proof (unfold mult_set_def, clarify)
paulson@14365
   431
  fix x::rat and y::rat
paulson@14365
   432
  assume A: "A \<in> preal" 
wenzelm@19765
   433
    and B: "B \<in> preal"
wenzelm@19765
   434
    and [simp]: "0 < z"
wenzelm@19765
   435
    and zless: "z < x * y"
wenzelm@19765
   436
    and x:  "x \<in> A"
wenzelm@19765
   437
    and y:  "y \<in> B"
paulson@14365
   438
  have [simp]: "0<y" by (rule preal_imp_pos [OF B y])
paulson@14365
   439
  show "\<exists>x' \<in> A. \<exists>y' \<in> B. z = x' * y'"
paulson@14365
   440
  proof
paulson@14365
   441
    show "\<exists>y'\<in>B. z = (z/y) * y'"
paulson@14365
   442
    proof
paulson@14365
   443
      show "z = (z/y)*y"
paulson@14430
   444
	by (simp add: divide_inverse mult_commute [of y] mult_assoc
paulson@14365
   445
		      order_less_imp_not_eq2)
wenzelm@23389
   446
      show "y \<in> B" by fact
paulson@14365
   447
    qed
paulson@14365
   448
  next
paulson@14365
   449
    show "z/y \<in> A"
paulson@14365
   450
    proof (rule preal_downwards_closed [OF A x])
paulson@14365
   451
      show "0 < z/y"
paulson@14365
   452
	by (simp add: zero_less_divide_iff)
paulson@14365
   453
      show "z/y < x" by (simp add: pos_divide_less_eq zless)
paulson@14365
   454
    qed
paulson@14365
   455
  qed
paulson@14365
   456
qed
paulson@14365
   457
paulson@14365
   458
text{*Part 4 of Dedekind sections definition*}
paulson@14365
   459
lemma mult_set_lemma4:
paulson@14365
   460
     "[|A \<in> preal; B \<in> preal; y \<in> mult_set A B|] ==> \<exists>u \<in> mult_set A B. y < u"
paulson@14365
   461
apply (auto simp add: mult_set_def)
paulson@14365
   462
apply (frule preal_exists_greater [of A], auto) 
paulson@14365
   463
apply (rule_tac x="u * y" in exI)
paulson@14365
   464
apply (auto intro: preal_imp_pos [of A] preal_imp_pos [of B] 
paulson@14365
   465
                   mult_strict_right_mono)
paulson@14335
   466
done
paulson@14335
   467
paulson@14335
   468
paulson@14365
   469
lemma mem_mult_set:
paulson@14365
   470
     "[|A \<in> preal; B \<in> preal|] ==> mult_set A B \<in> preal"
paulson@14365
   471
apply (simp (no_asm_simp) add: preal_def cut_def)
paulson@14365
   472
apply (blast intro!: mult_set_not_empty mult_set_not_rat_set
paulson@14365
   473
                     mult_set_lemma3 mult_set_lemma4)
paulson@14335
   474
done
paulson@14335
   475
paulson@14335
   476
lemma preal_mult_assoc: "((x::preal) * y) * z = x * (y * z)"
paulson@14365
   477
apply (simp add: preal_mult_def mem_mult_set Rep_preal)
paulson@14365
   478
apply (force simp add: mult_set_def mult_ac)
paulson@14335
   479
done
paulson@14335
   480
huffman@23287
   481
instance preal :: ab_semigroup_mult
huffman@23287
   482
proof
huffman@23287
   483
  fix a b c :: preal
huffman@23287
   484
  show "(a * b) * c = a * (b * c)" by (rule preal_mult_assoc)
huffman@23287
   485
  show "a * b = b * a" by (rule preal_mult_commute)
huffman@23287
   486
qed
huffman@23287
   487
paulson@14335
   488
lemma preal_mult_left_commute: "x * (y * z) = y * ((x * z)::preal)"
huffman@23287
   489
by (rule mult_left_commute)
paulson@14335
   490
paulson@14365
   491
paulson@14365
   492
text{* Positive Real multiplication is an AC operator *}
paulson@14335
   493
lemmas preal_mult_ac =
paulson@14335
   494
       preal_mult_assoc preal_mult_commute preal_mult_left_commute
paulson@14335
   495
paulson@14365
   496
paulson@14365
   497
text{* Positive real 1 is the multiplicative identity element *}
paulson@14365
   498
huffman@23287
   499
lemma preal_mult_1: "(1::preal) * z = z"
huffman@23287
   500
unfolding preal_one_def
paulson@14365
   501
proof (induct z)
paulson@14365
   502
  fix A :: "rat set"
paulson@14365
   503
  assume A: "A \<in> preal"
paulson@14365
   504
  have "{w. \<exists>u. 0 < u \<and> u < 1 & (\<exists>v \<in> A. w = u * v)} = A" (is "?lhs = A")
paulson@14365
   505
  proof
paulson@14365
   506
    show "?lhs \<subseteq> A"
paulson@14365
   507
    proof clarify
paulson@14365
   508
      fix x::rat and u::rat and v::rat
paulson@14365
   509
      assume upos: "0<u" and "u<1" and v: "v \<in> A"
paulson@14365
   510
      have vpos: "0<v" by (rule preal_imp_pos [OF A v])
paulson@14365
   511
      hence "u*v < 1*v" by (simp only: mult_strict_right_mono prems)
paulson@14365
   512
      thus "u * v \<in> A"
avigad@16775
   513
        by (force intro: preal_downwards_closed [OF A v] mult_pos_pos 
avigad@16775
   514
          upos vpos)
paulson@14365
   515
    qed
paulson@14365
   516
  next
paulson@14365
   517
    show "A \<subseteq> ?lhs"
paulson@14365
   518
    proof clarify
paulson@14365
   519
      fix x::rat
paulson@14365
   520
      assume x: "x \<in> A"
paulson@14365
   521
      have xpos: "0<x" by (rule preal_imp_pos [OF A x])
paulson@14365
   522
      from preal_exists_greater [OF A x]
paulson@14365
   523
      obtain v where v: "v \<in> A" and xlessv: "x < v" ..
paulson@14365
   524
      have vpos: "0<v" by (rule preal_imp_pos [OF A v])
paulson@14365
   525
      show "\<exists>u. 0 < u \<and> u < 1 \<and> (\<exists>v\<in>A. x = u * v)"
paulson@14365
   526
      proof (intro exI conjI)
paulson@14365
   527
        show "0 < x/v"
paulson@14365
   528
          by (simp add: zero_less_divide_iff xpos vpos)
paulson@14365
   529
	show "x / v < 1"
paulson@14365
   530
          by (simp add: pos_divide_less_eq vpos xlessv)
paulson@14365
   531
        show "\<exists>v'\<in>A. x = (x / v) * v'"
paulson@14365
   532
        proof
paulson@14365
   533
          show "x = (x/v)*v"
paulson@14430
   534
	    by (simp add: divide_inverse mult_assoc vpos
paulson@14365
   535
                          order_less_imp_not_eq2)
wenzelm@23389
   536
          show "v \<in> A" by fact
paulson@14365
   537
        qed
paulson@14365
   538
      qed
paulson@14365
   539
    qed
paulson@14365
   540
  qed
paulson@14365
   541
  thus "preal_of_rat 1 * Abs_preal A = Abs_preal A"
paulson@14365
   542
    by (simp add: preal_of_rat_def preal_mult_def mult_set_def 
paulson@14365
   543
                  rat_mem_preal A)
paulson@14365
   544
qed
paulson@14365
   545
huffman@23287
   546
instance preal :: comm_monoid_mult
huffman@23287
   547
by intro_classes (rule preal_mult_1)
paulson@14365
   548
huffman@23287
   549
lemma preal_mult_1_right: "z * (1::preal) = z"
huffman@23287
   550
by (rule mult_1_right)
paulson@14335
   551
paulson@14335
   552
paulson@14335
   553
subsection{*Distribution of Multiplication across Addition*}
paulson@14335
   554
paulson@14335
   555
lemma mem_Rep_preal_add_iff:
paulson@14365
   556
      "(z \<in> Rep_preal(R+S)) = (\<exists>x \<in> Rep_preal R. \<exists>y \<in> Rep_preal S. z = x + y)"
paulson@14365
   557
apply (simp add: preal_add_def mem_add_set Rep_preal)
paulson@14365
   558
apply (simp add: add_set_def) 
paulson@14335
   559
done
paulson@14335
   560
paulson@14335
   561
lemma mem_Rep_preal_mult_iff:
paulson@14365
   562
      "(z \<in> Rep_preal(R*S)) = (\<exists>x \<in> Rep_preal R. \<exists>y \<in> Rep_preal S. z = x * y)"
paulson@14365
   563
apply (simp add: preal_mult_def mem_mult_set Rep_preal)
paulson@14365
   564
apply (simp add: mult_set_def) 
paulson@14365
   565
done
paulson@14335
   566
paulson@14365
   567
lemma distrib_subset1:
paulson@14365
   568
     "Rep_preal (w * (x + y)) \<subseteq> Rep_preal (w * x + w * y)"
paulson@14365
   569
apply (auto simp add: Bex_def mem_Rep_preal_add_iff mem_Rep_preal_mult_iff)
paulson@14365
   570
apply (force simp add: right_distrib)
paulson@14335
   571
done
paulson@14335
   572
paulson@14365
   573
lemma preal_add_mult_distrib_mean:
paulson@14365
   574
  assumes a: "a \<in> Rep_preal w"
wenzelm@19765
   575
    and b: "b \<in> Rep_preal w"
wenzelm@19765
   576
    and d: "d \<in> Rep_preal x"
wenzelm@19765
   577
    and e: "e \<in> Rep_preal y"
wenzelm@19765
   578
  shows "\<exists>c \<in> Rep_preal w. a * d + b * e = c * (d + e)"
paulson@14365
   579
proof
paulson@14365
   580
  let ?c = "(a*d + b*e)/(d+e)"
paulson@14365
   581
  have [simp]: "0<a" "0<b" "0<d" "0<e" "0<d+e"
paulson@14365
   582
    by (blast intro: preal_imp_pos [OF Rep_preal] a b d e pos_add_strict)+
paulson@14365
   583
  have cpos: "0 < ?c"
paulson@14365
   584
    by (simp add: zero_less_divide_iff zero_less_mult_iff pos_add_strict)
paulson@14365
   585
  show "a * d + b * e = ?c * (d + e)"
paulson@14430
   586
    by (simp add: divide_inverse mult_assoc order_less_imp_not_eq2)
paulson@14365
   587
  show "?c \<in> Rep_preal w"
huffman@20495
   588
  proof (cases rule: linorder_le_cases)
huffman@20495
   589
    assume "a \<le> b"
huffman@20495
   590
    hence "?c \<le> b"
huffman@20495
   591
      by (simp add: pos_divide_le_eq right_distrib mult_right_mono
huffman@20495
   592
                    order_less_imp_le)
huffman@20495
   593
    thus ?thesis by (rule preal_downwards_closed' [OF Rep_preal b cpos])
huffman@20495
   594
  next
huffman@20495
   595
    assume "b \<le> a"
huffman@20495
   596
    hence "?c \<le> a"
huffman@20495
   597
      by (simp add: pos_divide_le_eq right_distrib mult_right_mono
huffman@20495
   598
                    order_less_imp_le)
huffman@20495
   599
    thus ?thesis by (rule preal_downwards_closed' [OF Rep_preal a cpos])
paulson@14365
   600
  qed
huffman@20495
   601
qed
paulson@14365
   602
paulson@14365
   603
lemma distrib_subset2:
paulson@14365
   604
     "Rep_preal (w * x + w * y) \<subseteq> Rep_preal (w * (x + y))"
paulson@14365
   605
apply (auto simp add: Bex_def mem_Rep_preal_add_iff mem_Rep_preal_mult_iff)
paulson@14365
   606
apply (drule_tac w=w and x=x and y=y in preal_add_mult_distrib_mean, auto)
paulson@14335
   607
done
paulson@14335
   608
paulson@14365
   609
lemma preal_add_mult_distrib2: "(w * ((x::preal) + y)) = (w * x) + (w * y)"
paulson@15413
   610
apply (rule Rep_preal_inject [THEN iffD1])
paulson@14365
   611
apply (rule equalityI [OF distrib_subset1 distrib_subset2])
paulson@14335
   612
done
paulson@14335
   613
paulson@14365
   614
lemma preal_add_mult_distrib: "(((x::preal) + y) * w) = (x * w) + (y * w)"
paulson@14365
   615
by (simp add: preal_mult_commute preal_add_mult_distrib2)
paulson@14365
   616
huffman@23287
   617
instance preal :: comm_semiring
huffman@23287
   618
by intro_classes (rule preal_add_mult_distrib)
huffman@23287
   619
paulson@14335
   620
paulson@14335
   621
subsection{*Existence of Inverse, a Positive Real*}
paulson@14335
   622
paulson@14365
   623
lemma mem_inv_set_ex:
paulson@14365
   624
  assumes A: "A \<in> preal" shows "\<exists>x y. 0 < x & x < y & inverse y \<notin> A"
paulson@14365
   625
proof -
paulson@14365
   626
  from preal_exists_bound [OF A]
paulson@14365
   627
  obtain x where [simp]: "0<x" "x \<notin> A" by blast
paulson@14365
   628
  show ?thesis
paulson@14365
   629
  proof (intro exI conjI)
paulson@14365
   630
    show "0 < inverse (x+1)"
paulson@14365
   631
      by (simp add: order_less_trans [OF _ less_add_one]) 
paulson@14365
   632
    show "inverse(x+1) < inverse x"
paulson@14365
   633
      by (simp add: less_imp_inverse_less less_add_one)
paulson@14365
   634
    show "inverse (inverse x) \<notin> A"
paulson@14365
   635
      by (simp add: order_less_imp_not_eq2)
paulson@14365
   636
  qed
paulson@14365
   637
qed
paulson@14335
   638
paulson@14335
   639
text{*Part 1 of Dedekind sections definition*}
paulson@14365
   640
lemma inverse_set_not_empty:
paulson@14365
   641
     "A \<in> preal ==> {} \<subset> inverse_set A"
paulson@14365
   642
apply (insert mem_inv_set_ex [of A])
paulson@14365
   643
apply (auto simp add: inverse_set_def)
paulson@14335
   644
done
paulson@14335
   645
paulson@14335
   646
text{*Part 2 of Dedekind sections definition*}
paulson@14335
   647
paulson@14365
   648
lemma preal_not_mem_inverse_set_Ex:
paulson@14365
   649
   assumes A: "A \<in> preal"  shows "\<exists>q. 0 < q & q \<notin> inverse_set A"
paulson@14365
   650
proof -
paulson@14365
   651
  from preal_nonempty [OF A]
paulson@14365
   652
  obtain x where x: "x \<in> A" and  xpos [simp]: "0<x" ..
paulson@14365
   653
  show ?thesis
paulson@14365
   654
  proof (intro exI conjI)
paulson@14365
   655
    show "0 < inverse x" by simp
paulson@14365
   656
    show "inverse x \<notin> inverse_set A"
paulson@14377
   657
    proof -
paulson@14377
   658
      { fix y::rat 
paulson@14377
   659
	assume ygt: "inverse x < y"
paulson@14377
   660
	have [simp]: "0 < y" by (simp add: order_less_trans [OF _ ygt])
paulson@14377
   661
	have iyless: "inverse y < x" 
paulson@14377
   662
	  by (simp add: inverse_less_imp_less [of x] ygt)
paulson@14377
   663
	have "inverse y \<in> A"
paulson@14377
   664
	  by (simp add: preal_downwards_closed [OF A x] iyless)}
paulson@14377
   665
     thus ?thesis by (auto simp add: inverse_set_def)
paulson@14365
   666
    qed
paulson@14365
   667
  qed
paulson@14365
   668
qed
paulson@14335
   669
paulson@14365
   670
lemma inverse_set_not_rat_set:
paulson@14365
   671
   assumes A: "A \<in> preal"  shows "inverse_set A < {r. 0 < r}"
paulson@14365
   672
proof
paulson@14365
   673
  show "inverse_set A \<subseteq> {r. 0 < r}"  by (force simp add: inverse_set_def)
paulson@14365
   674
next
paulson@14365
   675
  show "inverse_set A \<noteq> {r. 0 < r}"
paulson@14365
   676
    by (insert preal_not_mem_inverse_set_Ex [OF A], blast)
paulson@14365
   677
qed
paulson@14335
   678
paulson@14335
   679
text{*Part 3 of Dedekind sections definition*}
paulson@14365
   680
lemma inverse_set_lemma3:
paulson@14365
   681
     "[|A \<in> preal; u \<in> inverse_set A; 0 < z; z < u|] 
paulson@14365
   682
      ==> z \<in> inverse_set A"
paulson@14365
   683
apply (auto simp add: inverse_set_def)
paulson@14365
   684
apply (auto intro: order_less_trans)
paulson@14335
   685
done
paulson@14335
   686
paulson@14365
   687
text{*Part 4 of Dedekind sections definition*}
paulson@14365
   688
lemma inverse_set_lemma4:
paulson@14365
   689
     "[|A \<in> preal; y \<in> inverse_set A|] ==> \<exists>u \<in> inverse_set A. y < u"
paulson@14365
   690
apply (auto simp add: inverse_set_def)
paulson@14365
   691
apply (drule dense [of y]) 
paulson@14365
   692
apply (blast intro: order_less_trans)
paulson@14335
   693
done
paulson@14335
   694
paulson@14365
   695
paulson@14365
   696
lemma mem_inverse_set:
paulson@14365
   697
     "A \<in> preal ==> inverse_set A \<in> preal"
paulson@14365
   698
apply (simp (no_asm_simp) add: preal_def cut_def)
paulson@14365
   699
apply (blast intro!: inverse_set_not_empty inverse_set_not_rat_set
paulson@14365
   700
                     inverse_set_lemma3 inverse_set_lemma4)
paulson@14335
   701
done
paulson@14335
   702
paulson@14365
   703
paulson@14335
   704
subsection{*Gleason's Lemma 9-3.4, page 122*}
paulson@14335
   705
paulson@14365
   706
lemma Gleason9_34_exists:
paulson@14365
   707
  assumes A: "A \<in> preal"
wenzelm@19765
   708
    and "\<forall>x\<in>A. x + u \<in> A"
wenzelm@19765
   709
    and "0 \<le> z"
wenzelm@19765
   710
  shows "\<exists>b\<in>A. b + (of_int z) * u \<in> A"
paulson@14369
   711
proof (cases z rule: int_cases)
paulson@14369
   712
  case (nonneg n)
paulson@14365
   713
  show ?thesis
paulson@14365
   714
  proof (simp add: prems, induct n)
paulson@14365
   715
    case 0
paulson@14365
   716
      from preal_nonempty [OF A]
paulson@14365
   717
      show ?case  by force 
paulson@14365
   718
    case (Suc k)
paulson@15013
   719
      from this obtain b where "b \<in> A" "b + of_nat k * u \<in> A" ..
paulson@14378
   720
      hence "b + of_int (int k)*u + u \<in> A" by (simp add: prems)
paulson@14365
   721
      thus ?case by (force simp add: left_distrib add_ac prems) 
paulson@14365
   722
  qed
paulson@14365
   723
next
paulson@14369
   724
  case (neg n)
paulson@14369
   725
  with prems show ?thesis by simp
paulson@14365
   726
qed
paulson@14365
   727
paulson@14365
   728
lemma Gleason9_34_contra:
paulson@14365
   729
  assumes A: "A \<in> preal"
paulson@14365
   730
    shows "[|\<forall>x\<in>A. x + u \<in> A; 0 < u; 0 < y; y \<notin> A|] ==> False"
paulson@14365
   731
proof (induct u, induct y)
paulson@14365
   732
  fix a::int and b::int
paulson@14365
   733
  fix c::int and d::int
paulson@14365
   734
  assume bpos [simp]: "0 < b"
wenzelm@19765
   735
    and dpos [simp]: "0 < d"
wenzelm@19765
   736
    and closed: "\<forall>x\<in>A. x + (Fract c d) \<in> A"
wenzelm@19765
   737
    and upos: "0 < Fract c d"
wenzelm@19765
   738
    and ypos: "0 < Fract a b"
wenzelm@19765
   739
    and notin: "Fract a b \<notin> A"
paulson@14365
   740
  have cpos [simp]: "0 < c" 
paulson@14365
   741
    by (simp add: zero_less_Fract_iff [OF dpos, symmetric] upos) 
paulson@14365
   742
  have apos [simp]: "0 < a" 
paulson@14365
   743
    by (simp add: zero_less_Fract_iff [OF bpos, symmetric] ypos) 
paulson@14365
   744
  let ?k = "a*d"
paulson@14378
   745
  have frle: "Fract a b \<le> Fract ?k 1 * (Fract c d)" 
paulson@14365
   746
  proof -
paulson@14365
   747
    have "?thesis = ((a * d * b * d) \<le> c * b * (a * d * b * d))"
paulson@14378
   748
      by (simp add: mult_rat le_rat order_less_imp_not_eq2 mult_ac) 
paulson@14365
   749
    moreover
paulson@14365
   750
    have "(1 * (a * d * b * d)) \<le> c * b * (a * d * b * d)"
paulson@14365
   751
      by (rule mult_mono, 
paulson@14365
   752
          simp_all add: int_one_le_iff_zero_less zero_less_mult_iff 
paulson@14365
   753
                        order_less_imp_le)
paulson@14365
   754
    ultimately
paulson@14365
   755
    show ?thesis by simp
paulson@14365
   756
  qed
paulson@14365
   757
  have k: "0 \<le> ?k" by (simp add: order_less_imp_le zero_less_mult_iff)  
paulson@14365
   758
  from Gleason9_34_exists [OF A closed k]
paulson@14365
   759
  obtain z where z: "z \<in> A" 
paulson@14378
   760
             and mem: "z + of_int ?k * Fract c d \<in> A" ..
paulson@14378
   761
  have less: "z + of_int ?k * Fract c d < Fract a b"
paulson@14365
   762
    by (rule not_in_preal_ub [OF A notin mem ypos])
paulson@14365
   763
  have "0<z" by (rule preal_imp_pos [OF A z])
paulson@14378
   764
  with frle and less show False by (simp add: Fract_of_int_eq) 
paulson@14365
   765
qed
paulson@14335
   766
paulson@14335
   767
paulson@14365
   768
lemma Gleason9_34:
paulson@14365
   769
  assumes A: "A \<in> preal"
wenzelm@19765
   770
    and upos: "0 < u"
wenzelm@19765
   771
  shows "\<exists>r \<in> A. r + u \<notin> A"
paulson@14365
   772
proof (rule ccontr, simp)
paulson@14365
   773
  assume closed: "\<forall>r\<in>A. r + u \<in> A"
paulson@14365
   774
  from preal_exists_bound [OF A]
paulson@14365
   775
  obtain y where y: "y \<notin> A" and ypos: "0 < y" by blast
paulson@14365
   776
  show False
paulson@14365
   777
    by (rule Gleason9_34_contra [OF A closed upos ypos y])
paulson@14365
   778
qed
paulson@14365
   779
paulson@14335
   780
paulson@14335
   781
paulson@14335
   782
subsection{*Gleason's Lemma 9-3.6*}
paulson@14335
   783
paulson@14365
   784
lemma lemma_gleason9_36:
paulson@14365
   785
  assumes A: "A \<in> preal"
wenzelm@19765
   786
    and x: "1 < x"
wenzelm@19765
   787
  shows "\<exists>r \<in> A. r*x \<notin> A"
paulson@14365
   788
proof -
paulson@14365
   789
  from preal_nonempty [OF A]
paulson@14365
   790
  obtain y where y: "y \<in> A" and  ypos: "0<y" ..
paulson@14365
   791
  show ?thesis 
paulson@14365
   792
  proof (rule classical)
paulson@14365
   793
    assume "~(\<exists>r\<in>A. r * x \<notin> A)"
paulson@14365
   794
    with y have ymem: "y * x \<in> A" by blast 
paulson@14365
   795
    from ypos mult_strict_left_mono [OF x]
paulson@14365
   796
    have yless: "y < y*x" by simp 
paulson@14365
   797
    let ?d = "y*x - y"
paulson@14365
   798
    from yless have dpos: "0 < ?d" and eq: "y + ?d = y*x" by auto
paulson@14365
   799
    from Gleason9_34 [OF A dpos]
paulson@14365
   800
    obtain r where r: "r\<in>A" and notin: "r + ?d \<notin> A" ..
paulson@14365
   801
    have rpos: "0<r" by (rule preal_imp_pos [OF A r])
paulson@14365
   802
    with dpos have rdpos: "0 < r + ?d" by arith
paulson@14365
   803
    have "~ (r + ?d \<le> y + ?d)"
paulson@14365
   804
    proof
paulson@14365
   805
      assume le: "r + ?d \<le> y + ?d" 
paulson@14365
   806
      from ymem have yd: "y + ?d \<in> A" by (simp add: eq)
paulson@14365
   807
      have "r + ?d \<in> A" by (rule preal_downwards_closed' [OF A yd rdpos le])
paulson@14365
   808
      with notin show False by simp
paulson@14365
   809
    qed
paulson@14365
   810
    hence "y < r" by simp
paulson@14365
   811
    with ypos have  dless: "?d < (r * ?d)/y"
paulson@14365
   812
      by (simp add: pos_less_divide_eq mult_commute [of ?d]
paulson@14365
   813
                    mult_strict_right_mono dpos)
paulson@14365
   814
    have "r + ?d < r*x"
paulson@14365
   815
    proof -
paulson@14365
   816
      have "r + ?d < r + (r * ?d)/y" by (simp add: dless)
paulson@14365
   817
      also with ypos have "... = (r/y) * (y + ?d)"
paulson@14430
   818
	by (simp only: right_distrib divide_inverse mult_ac, simp)
paulson@14365
   819
      also have "... = r*x" using ypos
paulson@15234
   820
	by (simp add: times_divide_eq_left) 
paulson@14365
   821
      finally show "r + ?d < r*x" .
paulson@14365
   822
    qed
paulson@14365
   823
    with r notin rdpos
paulson@14365
   824
    show "\<exists>r\<in>A. r * x \<notin> A" by (blast dest:  preal_downwards_closed [OF A])
paulson@14365
   825
  qed  
paulson@14365
   826
qed
paulson@14335
   827
paulson@14365
   828
subsection{*Existence of Inverse: Part 2*}
paulson@14365
   829
paulson@14365
   830
lemma mem_Rep_preal_inverse_iff:
paulson@14365
   831
      "(z \<in> Rep_preal(inverse R)) = 
paulson@14365
   832
       (0 < z \<and> (\<exists>y. z < y \<and> inverse y \<notin> Rep_preal R))"
paulson@14365
   833
apply (simp add: preal_inverse_def mem_inverse_set Rep_preal)
paulson@14365
   834
apply (simp add: inverse_set_def) 
paulson@14335
   835
done
paulson@14335
   836
paulson@14365
   837
lemma Rep_preal_of_rat:
paulson@14365
   838
     "0 < q ==> Rep_preal (preal_of_rat q) = {x. 0 < x \<and> x < q}"
paulson@14365
   839
by (simp add: preal_of_rat_def rat_mem_preal) 
paulson@14365
   840
paulson@14365
   841
lemma subset_inverse_mult_lemma:
wenzelm@19765
   842
  assumes xpos: "0 < x" and xless: "x < 1"
wenzelm@19765
   843
  shows "\<exists>r u y. 0 < r & r < y & inverse y \<notin> Rep_preal R & 
wenzelm@19765
   844
    u \<in> Rep_preal R & x = r * u"
paulson@14365
   845
proof -
paulson@14365
   846
  from xpos and xless have "1 < inverse x" by (simp add: one_less_inverse_iff)
paulson@14365
   847
  from lemma_gleason9_36 [OF Rep_preal this]
paulson@14365
   848
  obtain r where r: "r \<in> Rep_preal R" 
paulson@14365
   849
             and notin: "r * (inverse x) \<notin> Rep_preal R" ..
paulson@14365
   850
  have rpos: "0<r" by (rule preal_imp_pos [OF Rep_preal r])
paulson@14365
   851
  from preal_exists_greater [OF Rep_preal r]
paulson@14365
   852
  obtain u where u: "u \<in> Rep_preal R" and rless: "r < u" ..
paulson@14365
   853
  have upos: "0<u" by (rule preal_imp_pos [OF Rep_preal u])
paulson@14365
   854
  show ?thesis
paulson@14365
   855
  proof (intro exI conjI)
paulson@14365
   856
    show "0 < x/u" using xpos upos
paulson@14365
   857
      by (simp add: zero_less_divide_iff)  
paulson@14365
   858
    show "x/u < x/r" using xpos upos rpos
paulson@14430
   859
      by (simp add: divide_inverse mult_less_cancel_left rless) 
paulson@14365
   860
    show "inverse (x / r) \<notin> Rep_preal R" using notin
paulson@14430
   861
      by (simp add: divide_inverse mult_commute) 
paulson@14365
   862
    show "u \<in> Rep_preal R" by (rule u) 
paulson@14365
   863
    show "x = x / u * u" using upos 
paulson@14430
   864
      by (simp add: divide_inverse mult_commute) 
paulson@14365
   865
  qed
paulson@14365
   866
qed
paulson@14365
   867
paulson@14365
   868
lemma subset_inverse_mult: 
paulson@14365
   869
     "Rep_preal(preal_of_rat 1) \<subseteq> Rep_preal(inverse R * R)"
paulson@14365
   870
apply (auto simp add: Bex_def Rep_preal_of_rat mem_Rep_preal_inverse_iff 
paulson@14365
   871
                      mem_Rep_preal_mult_iff)
paulson@14365
   872
apply (blast dest: subset_inverse_mult_lemma) 
paulson@14335
   873
done
paulson@14335
   874
paulson@14365
   875
lemma inverse_mult_subset_lemma:
wenzelm@19765
   876
  assumes rpos: "0 < r" 
wenzelm@19765
   877
    and rless: "r < y"
wenzelm@19765
   878
    and notin: "inverse y \<notin> Rep_preal R"
wenzelm@19765
   879
    and q: "q \<in> Rep_preal R"
wenzelm@19765
   880
  shows "r*q < 1"
paulson@14365
   881
proof -
paulson@14365
   882
  have "q < inverse y" using rpos rless
paulson@14365
   883
    by (simp add: not_in_preal_ub [OF Rep_preal notin] q)
paulson@14365
   884
  hence "r * q < r/y" using rpos
paulson@14430
   885
    by (simp add: divide_inverse mult_less_cancel_left)
paulson@14365
   886
  also have "... \<le> 1" using rpos rless
paulson@14365
   887
    by (simp add: pos_divide_le_eq)
paulson@14365
   888
  finally show ?thesis .
paulson@14365
   889
qed
paulson@14365
   890
paulson@14365
   891
lemma inverse_mult_subset:
paulson@14365
   892
     "Rep_preal(inverse R * R) \<subseteq> Rep_preal(preal_of_rat 1)"
paulson@14365
   893
apply (auto simp add: Bex_def Rep_preal_of_rat mem_Rep_preal_inverse_iff 
paulson@14365
   894
                      mem_Rep_preal_mult_iff)
paulson@14365
   895
apply (simp add: zero_less_mult_iff preal_imp_pos [OF Rep_preal]) 
paulson@14365
   896
apply (blast intro: inverse_mult_subset_lemma) 
paulson@14365
   897
done
paulson@14365
   898
huffman@23287
   899
lemma preal_mult_inverse: "inverse R * R = (1::preal)"
huffman@23287
   900
unfolding preal_one_def
paulson@15413
   901
apply (rule Rep_preal_inject [THEN iffD1])
paulson@14365
   902
apply (rule equalityI [OF inverse_mult_subset subset_inverse_mult]) 
paulson@14365
   903
done
paulson@14365
   904
huffman@23287
   905
lemma preal_mult_inverse_right: "R * inverse R = (1::preal)"
paulson@14365
   906
apply (rule preal_mult_commute [THEN subst])
paulson@14365
   907
apply (rule preal_mult_inverse)
paulson@14335
   908
done
paulson@14335
   909
paulson@14335
   910
paulson@14365
   911
text{*Theorems needing @{text Gleason9_34}*}
paulson@14335
   912
paulson@14365
   913
lemma Rep_preal_self_subset: "Rep_preal (R) \<subseteq> Rep_preal(R + S)"
paulson@14365
   914
proof 
paulson@14365
   915
  fix r
paulson@14365
   916
  assume r: "r \<in> Rep_preal R"
paulson@14365
   917
  have rpos: "0<r" by (rule preal_imp_pos [OF Rep_preal r])
paulson@14365
   918
  from mem_Rep_preal_Ex 
paulson@14365
   919
  obtain y where y: "y \<in> Rep_preal S" ..
paulson@14365
   920
  have ypos: "0<y" by (rule preal_imp_pos [OF Rep_preal y])
paulson@14365
   921
  have ry: "r+y \<in> Rep_preal(R + S)" using r y
paulson@14365
   922
    by (auto simp add: mem_Rep_preal_add_iff)
paulson@14365
   923
  show "r \<in> Rep_preal(R + S)" using r ypos rpos 
paulson@14365
   924
    by (simp add:  preal_downwards_closed [OF Rep_preal ry]) 
paulson@14365
   925
qed
paulson@14335
   926
paulson@14365
   927
lemma Rep_preal_sum_not_subset: "~ Rep_preal (R + S) \<subseteq> Rep_preal(R)"
paulson@14365
   928
proof -
paulson@14365
   929
  from mem_Rep_preal_Ex 
paulson@14365
   930
  obtain y where y: "y \<in> Rep_preal S" ..
paulson@14365
   931
  have ypos: "0<y" by (rule preal_imp_pos [OF Rep_preal y])
paulson@14365
   932
  from  Gleason9_34 [OF Rep_preal ypos]
paulson@14365
   933
  obtain r where r: "r \<in> Rep_preal R" and notin: "r + y \<notin> Rep_preal R" ..
paulson@14365
   934
  have "r + y \<in> Rep_preal (R + S)" using r y
paulson@14365
   935
    by (auto simp add: mem_Rep_preal_add_iff)
paulson@14365
   936
  thus ?thesis using notin by blast
paulson@14365
   937
qed
paulson@14335
   938
paulson@14365
   939
lemma Rep_preal_sum_not_eq: "Rep_preal (R + S) \<noteq> Rep_preal(R)"
paulson@14365
   940
by (insert Rep_preal_sum_not_subset, blast)
paulson@14335
   941
paulson@14335
   942
text{*at last, Gleason prop. 9-3.5(iii) page 123*}
paulson@14365
   943
lemma preal_self_less_add_left: "(R::preal) < R + S"
berghofe@26806
   944
apply (unfold preal_less_def less_le)
paulson@14335
   945
apply (simp add: Rep_preal_self_subset Rep_preal_sum_not_eq [THEN not_sym])
paulson@14335
   946
done
paulson@14335
   947
paulson@14365
   948
lemma preal_self_less_add_right: "(R::preal) < S + R"
paulson@14365
   949
by (simp add: preal_add_commute preal_self_less_add_left)
paulson@14365
   950
paulson@14365
   951
lemma preal_not_eq_self: "x \<noteq> x + (y::preal)"
paulson@14365
   952
by (insert preal_self_less_add_left [of x y], auto)
paulson@14335
   953
paulson@14335
   954
paulson@14365
   955
subsection{*Subtraction for Positive Reals*}
paulson@14335
   956
wenzelm@22710
   957
text{*Gleason prop. 9-3.5(iv), page 123: proving @{prop "A < B ==> \<exists>D. A + D =
paulson@14365
   958
B"}. We define the claimed @{term D} and show that it is a positive real*}
paulson@14335
   959
paulson@14335
   960
text{*Part 1 of Dedekind sections definition*}
paulson@14365
   961
lemma diff_set_not_empty:
paulson@14365
   962
     "R < S ==> {} \<subset> diff_set (Rep_preal S) (Rep_preal R)"
paulson@14365
   963
apply (auto simp add: preal_less_def diff_set_def elim!: equalityE) 
paulson@14365
   964
apply (frule_tac x1 = S in Rep_preal [THEN preal_exists_greater])
paulson@14365
   965
apply (drule preal_imp_pos [OF Rep_preal], clarify)
paulson@14365
   966
apply (cut_tac a=x and b=u in add_eq_exists, force) 
paulson@14335
   967
done
paulson@14335
   968
paulson@14335
   969
text{*Part 2 of Dedekind sections definition*}
paulson@14365
   970
lemma diff_set_nonempty:
paulson@14365
   971
     "\<exists>q. 0 < q & q \<notin> diff_set (Rep_preal S) (Rep_preal R)"
paulson@14365
   972
apply (cut_tac X = S in Rep_preal_exists_bound)
paulson@14335
   973
apply (erule exE)
paulson@14335
   974
apply (rule_tac x = x in exI, auto)
paulson@14365
   975
apply (simp add: diff_set_def) 
paulson@14365
   976
apply (auto dest: Rep_preal [THEN preal_downwards_closed])
paulson@14335
   977
done
paulson@14335
   978
paulson@14365
   979
lemma diff_set_not_rat_set:
wenzelm@19765
   980
  "diff_set (Rep_preal S) (Rep_preal R) < {r. 0 < r}" (is "?lhs < ?rhs")
paulson@14365
   981
proof
paulson@14365
   982
  show "?lhs \<subseteq> ?rhs" by (auto simp add: diff_set_def) 
paulson@14365
   983
  show "?lhs \<noteq> ?rhs" using diff_set_nonempty by blast
paulson@14365
   984
qed
paulson@14335
   985
paulson@14335
   986
text{*Part 3 of Dedekind sections definition*}
paulson@14365
   987
lemma diff_set_lemma3:
paulson@14365
   988
     "[|R < S; u \<in> diff_set (Rep_preal S) (Rep_preal R); 0 < z; z < u|] 
paulson@14365
   989
      ==> z \<in> diff_set (Rep_preal S) (Rep_preal R)"
paulson@14365
   990
apply (auto simp add: diff_set_def) 
paulson@14365
   991
apply (rule_tac x=x in exI) 
paulson@14365
   992
apply (drule Rep_preal [THEN preal_downwards_closed], auto)
paulson@14335
   993
done
paulson@14335
   994
paulson@14365
   995
text{*Part 4 of Dedekind sections definition*}
paulson@14365
   996
lemma diff_set_lemma4:
paulson@14365
   997
     "[|R < S; y \<in> diff_set (Rep_preal S) (Rep_preal R)|] 
paulson@14365
   998
      ==> \<exists>u \<in> diff_set (Rep_preal S) (Rep_preal R). y < u"
paulson@14365
   999
apply (auto simp add: diff_set_def) 
paulson@14365
  1000
apply (drule Rep_preal [THEN preal_exists_greater], clarify) 
paulson@14365
  1001
apply (cut_tac a="x+y" and b=u in add_eq_exists, clarify)  
paulson@14365
  1002
apply (rule_tac x="y+xa" in exI) 
paulson@14365
  1003
apply (auto simp add: add_ac)
paulson@14335
  1004
done
paulson@14335
  1005
paulson@14365
  1006
lemma mem_diff_set:
paulson@14365
  1007
     "R < S ==> diff_set (Rep_preal S) (Rep_preal R) \<in> preal"
paulson@14365
  1008
apply (unfold preal_def cut_def)
paulson@14365
  1009
apply (blast intro!: diff_set_not_empty diff_set_not_rat_set
paulson@14365
  1010
                     diff_set_lemma3 diff_set_lemma4)
paulson@14365
  1011
done
paulson@14365
  1012
paulson@14365
  1013
lemma mem_Rep_preal_diff_iff:
paulson@14365
  1014
      "R < S ==>
paulson@14365
  1015
       (z \<in> Rep_preal(S-R)) = 
paulson@14365
  1016
       (\<exists>x. 0 < x & 0 < z & x \<notin> Rep_preal R & x + z \<in> Rep_preal S)"
paulson@14365
  1017
apply (simp add: preal_diff_def mem_diff_set Rep_preal)
paulson@14365
  1018
apply (force simp add: diff_set_def) 
paulson@14335
  1019
done
paulson@14335
  1020
paulson@14365
  1021
paulson@14365
  1022
text{*proving that @{term "R + D \<le> S"}*}
paulson@14365
  1023
paulson@14365
  1024
lemma less_add_left_lemma:
paulson@14365
  1025
  assumes Rless: "R < S"
wenzelm@19765
  1026
    and a: "a \<in> Rep_preal R"
wenzelm@19765
  1027
    and cb: "c + b \<in> Rep_preal S"
wenzelm@19765
  1028
    and "c \<notin> Rep_preal R"
wenzelm@19765
  1029
    and "0 < b"
wenzelm@19765
  1030
    and "0 < c"
paulson@14365
  1031
  shows "a + b \<in> Rep_preal S"
paulson@14365
  1032
proof -
paulson@14365
  1033
  have "0<a" by (rule preal_imp_pos [OF Rep_preal a])
paulson@14365
  1034
  moreover
paulson@14365
  1035
  have "a < c" using prems
paulson@14365
  1036
    by (blast intro: not_in_Rep_preal_ub ) 
paulson@14365
  1037
  ultimately show ?thesis using prems
paulson@14365
  1038
    by (simp add: preal_downwards_closed [OF Rep_preal cb]) 
paulson@14365
  1039
qed
paulson@14365
  1040
paulson@14365
  1041
lemma less_add_left_le1:
paulson@14365
  1042
       "R < (S::preal) ==> R + (S-R) \<le> S"
paulson@14365
  1043
apply (auto simp add: Bex_def preal_le_def mem_Rep_preal_add_iff 
paulson@14365
  1044
                      mem_Rep_preal_diff_iff)
paulson@14365
  1045
apply (blast intro: less_add_left_lemma) 
paulson@14335
  1046
done
paulson@14335
  1047
paulson@14365
  1048
subsection{*proving that @{term "S \<le> R + D"} --- trickier*}
paulson@14335
  1049
paulson@14335
  1050
lemma lemma_sum_mem_Rep_preal_ex:
paulson@14365
  1051
     "x \<in> Rep_preal S ==> \<exists>e. 0 < e & x + e \<in> Rep_preal S"
paulson@14365
  1052
apply (drule Rep_preal [THEN preal_exists_greater], clarify) 
paulson@14365
  1053
apply (cut_tac a=x and b=u in add_eq_exists, auto) 
paulson@14335
  1054
done
paulson@14335
  1055
paulson@14365
  1056
lemma less_add_left_lemma2:
paulson@14365
  1057
  assumes Rless: "R < S"
wenzelm@19765
  1058
    and x:     "x \<in> Rep_preal S"
wenzelm@19765
  1059
    and xnot: "x \<notin>  Rep_preal R"
paulson@14365
  1060
  shows "\<exists>u v z. 0 < v & 0 < z & u \<in> Rep_preal R & z \<notin> Rep_preal R & 
paulson@14365
  1061
                     z + v \<in> Rep_preal S & x = u + v"
paulson@14365
  1062
proof -
paulson@14365
  1063
  have xpos: "0<x" by (rule preal_imp_pos [OF Rep_preal x])
paulson@14365
  1064
  from lemma_sum_mem_Rep_preal_ex [OF x]
paulson@14365
  1065
  obtain e where epos: "0 < e" and xe: "x + e \<in> Rep_preal S" by blast
paulson@14365
  1066
  from  Gleason9_34 [OF Rep_preal epos]
paulson@14365
  1067
  obtain r where r: "r \<in> Rep_preal R" and notin: "r + e \<notin> Rep_preal R" ..
paulson@14365
  1068
  with x xnot xpos have rless: "r < x" by (blast intro: not_in_Rep_preal_ub)
paulson@14365
  1069
  from add_eq_exists [of r x]
paulson@14365
  1070
  obtain y where eq: "x = r+y" by auto
paulson@14365
  1071
  show ?thesis 
paulson@14365
  1072
  proof (intro exI conjI)
paulson@14365
  1073
    show "r \<in> Rep_preal R" by (rule r)
paulson@14365
  1074
    show "r + e \<notin> Rep_preal R" by (rule notin)
paulson@14365
  1075
    show "r + e + y \<in> Rep_preal S" using xe eq by (simp add: add_ac)
paulson@14365
  1076
    show "x = r + y" by (simp add: eq)
paulson@14365
  1077
    show "0 < r + e" using epos preal_imp_pos [OF Rep_preal r]
paulson@14365
  1078
      by simp
paulson@14365
  1079
    show "0 < y" using rless eq by arith
paulson@14365
  1080
  qed
paulson@14365
  1081
qed
paulson@14365
  1082
paulson@14365
  1083
lemma less_add_left_le2: "R < (S::preal) ==> S \<le> R + (S-R)"
paulson@14365
  1084
apply (auto simp add: preal_le_def)
paulson@14365
  1085
apply (case_tac "x \<in> Rep_preal R")
paulson@14365
  1086
apply (cut_tac Rep_preal_self_subset [of R], force)
paulson@14365
  1087
apply (auto simp add: Bex_def mem_Rep_preal_add_iff mem_Rep_preal_diff_iff)
paulson@14365
  1088
apply (blast dest: less_add_left_lemma2)
paulson@14335
  1089
done
paulson@14335
  1090
paulson@14365
  1091
lemma less_add_left: "R < (S::preal) ==> R + (S-R) = S"
haftmann@27682
  1092
by (blast intro: antisym [OF less_add_left_le1 less_add_left_le2])
paulson@14335
  1093
paulson@14365
  1094
lemma less_add_left_Ex: "R < (S::preal) ==> \<exists>D. R + D = S"
paulson@14365
  1095
by (fast dest: less_add_left)
paulson@14335
  1096
paulson@14365
  1097
lemma preal_add_less2_mono1: "R < (S::preal) ==> R + T < S + T"
paulson@14365
  1098
apply (auto dest!: less_add_left_Ex simp add: preal_add_assoc)
paulson@14335
  1099
apply (rule_tac y1 = D in preal_add_commute [THEN subst])
paulson@14335
  1100
apply (auto intro: preal_self_less_add_left simp add: preal_add_assoc [symmetric])
paulson@14335
  1101
done
paulson@14335
  1102
paulson@14365
  1103
lemma preal_add_less2_mono2: "R < (S::preal) ==> T + R < T + S"
paulson@14365
  1104
by (auto intro: preal_add_less2_mono1 simp add: preal_add_commute [of T])
paulson@14335
  1105
paulson@14365
  1106
lemma preal_add_right_less_cancel: "R + T < S + T ==> R < (S::preal)"
paulson@14365
  1107
apply (insert linorder_less_linear [of R S], auto)
paulson@14365
  1108
apply (drule_tac R = S and T = T in preal_add_less2_mono1)
paulson@14365
  1109
apply (blast dest: order_less_trans) 
paulson@14335
  1110
done
paulson@14335
  1111
paulson@14365
  1112
lemma preal_add_left_less_cancel: "T + R < T + S ==> R <  (S::preal)"
paulson@14365
  1113
by (auto elim: preal_add_right_less_cancel simp add: preal_add_commute [of T])
paulson@14335
  1114
paulson@14365
  1115
lemma preal_add_less_cancel_right: "((R::preal) + T < S + T) = (R < S)"
paulson@14335
  1116
by (blast intro: preal_add_less2_mono1 preal_add_right_less_cancel)
paulson@14335
  1117
paulson@14365
  1118
lemma preal_add_less_cancel_left: "(T + (R::preal) < T + S) = (R < S)"
paulson@14335
  1119
by (blast intro: preal_add_less2_mono2 preal_add_left_less_cancel)
paulson@14335
  1120
paulson@14365
  1121
lemma preal_add_le_cancel_right: "((R::preal) + T \<le> S + T) = (R \<le> S)"
paulson@14365
  1122
by (simp add: linorder_not_less [symmetric] preal_add_less_cancel_right) 
paulson@14365
  1123
paulson@14365
  1124
lemma preal_add_le_cancel_left: "(T + (R::preal) \<le> T + S) = (R \<le> S)"
paulson@14365
  1125
by (simp add: linorder_not_less [symmetric] preal_add_less_cancel_left) 
paulson@14365
  1126
paulson@14335
  1127
lemma preal_add_less_mono:
paulson@14335
  1128
     "[| x1 < y1; x2 < y2 |] ==> x1 + x2 < y1 + (y2::preal)"
paulson@14365
  1129
apply (auto dest!: less_add_left_Ex simp add: preal_add_ac)
paulson@14335
  1130
apply (rule preal_add_assoc [THEN subst])
paulson@14335
  1131
apply (rule preal_self_less_add_right)
paulson@14335
  1132
done
paulson@14335
  1133
paulson@14365
  1134
lemma preal_add_right_cancel: "(R::preal) + T = S + T ==> R = S"
paulson@14365
  1135
apply (insert linorder_less_linear [of R S], safe)
paulson@14365
  1136
apply (drule_tac [!] T = T in preal_add_less2_mono1, auto)
paulson@14335
  1137
done
paulson@14335
  1138
paulson@14365
  1139
lemma preal_add_left_cancel: "C + A = C + B ==> A = (B::preal)"
paulson@14335
  1140
by (auto intro: preal_add_right_cancel simp add: preal_add_commute)
paulson@14335
  1141
paulson@14365
  1142
lemma preal_add_left_cancel_iff: "(C + A = C + B) = ((A::preal) = B)"
paulson@14335
  1143
by (fast intro: preal_add_left_cancel)
paulson@14335
  1144
paulson@14365
  1145
lemma preal_add_right_cancel_iff: "(A + C = B + C) = ((A::preal) = B)"
paulson@14335
  1146
by (fast intro: preal_add_right_cancel)
paulson@14335
  1147
paulson@14365
  1148
lemmas preal_cancels =
paulson@14365
  1149
    preal_add_less_cancel_right preal_add_less_cancel_left
paulson@14365
  1150
    preal_add_le_cancel_right preal_add_le_cancel_left
paulson@14365
  1151
    preal_add_left_cancel_iff preal_add_right_cancel_iff
paulson@14335
  1152
huffman@23285
  1153
instance preal :: ordered_cancel_ab_semigroup_add
huffman@23285
  1154
proof
huffman@23285
  1155
  fix a b c :: preal
huffman@23285
  1156
  show "a + b = a + c \<Longrightarrow> b = c" by (rule preal_add_left_cancel)
huffman@23287
  1157
  show "a \<le> b \<Longrightarrow> c + a \<le> c + b" by (simp only: preal_add_le_cancel_left)
huffman@23285
  1158
qed
huffman@23285
  1159
paulson@14335
  1160
paulson@14335
  1161
subsection{*Completeness of type @{typ preal}*}
paulson@14335
  1162
paulson@14335
  1163
text{*Prove that supremum is a cut*}
paulson@14335
  1164
paulson@14365
  1165
text{*Part 1 of Dedekind sections definition*}
paulson@14365
  1166
paulson@14365
  1167
lemma preal_sup_set_not_empty:
paulson@14365
  1168
     "P \<noteq> {} ==> {} \<subset> (\<Union>X \<in> P. Rep_preal(X))"
paulson@14365
  1169
apply auto
paulson@14365
  1170
apply (cut_tac X = x in mem_Rep_preal_Ex, auto)
paulson@14335
  1171
done
paulson@14335
  1172
paulson@14335
  1173
paulson@14335
  1174
text{*Part 2 of Dedekind sections definition*}
paulson@14365
  1175
paulson@14365
  1176
lemma preal_sup_not_exists:
paulson@14365
  1177
     "\<forall>X \<in> P. X \<le> Y ==> \<exists>q. 0 < q & q \<notin> (\<Union>X \<in> P. Rep_preal(X))"
paulson@14365
  1178
apply (cut_tac X = Y in Rep_preal_exists_bound)
paulson@14365
  1179
apply (auto simp add: preal_le_def)
paulson@14335
  1180
done
paulson@14335
  1181
paulson@14365
  1182
lemma preal_sup_set_not_rat_set:
paulson@14365
  1183
     "\<forall>X \<in> P. X \<le> Y ==> (\<Union>X \<in> P. Rep_preal(X)) < {r. 0 < r}"
paulson@14365
  1184
apply (drule preal_sup_not_exists)
paulson@14365
  1185
apply (blast intro: preal_imp_pos [OF Rep_preal])  
paulson@14335
  1186
done
paulson@14335
  1187
paulson@14335
  1188
text{*Part 3 of Dedekind sections definition*}
paulson@14335
  1189
lemma preal_sup_set_lemma3:
paulson@14365
  1190
     "[|P \<noteq> {}; \<forall>X \<in> P. X \<le> Y; u \<in> (\<Union>X \<in> P. Rep_preal(X)); 0 < z; z < u|]
paulson@14365
  1191
      ==> z \<in> (\<Union>X \<in> P. Rep_preal(X))"
paulson@14365
  1192
by (auto elim: Rep_preal [THEN preal_downwards_closed])
paulson@14335
  1193
paulson@14365
  1194
text{*Part 4 of Dedekind sections definition*}
paulson@14335
  1195
lemma preal_sup_set_lemma4:
paulson@14365
  1196
     "[|P \<noteq> {}; \<forall>X \<in> P. X \<le> Y; y \<in> (\<Union>X \<in> P. Rep_preal(X)) |]
paulson@14365
  1197
          ==> \<exists>u \<in> (\<Union>X \<in> P. Rep_preal(X)). y < u"
paulson@14365
  1198
by (blast dest: Rep_preal [THEN preal_exists_greater])
paulson@14335
  1199
paulson@14335
  1200
lemma preal_sup:
paulson@14365
  1201
     "[|P \<noteq> {}; \<forall>X \<in> P. X \<le> Y|] ==> (\<Union>X \<in> P. Rep_preal(X)) \<in> preal"
paulson@14365
  1202
apply (unfold preal_def cut_def)
paulson@14365
  1203
apply (blast intro!: preal_sup_set_not_empty preal_sup_set_not_rat_set
paulson@14365
  1204
                     preal_sup_set_lemma3 preal_sup_set_lemma4)
paulson@14335
  1205
done
paulson@14335
  1206
paulson@14365
  1207
lemma preal_psup_le:
paulson@14365
  1208
     "[| \<forall>X \<in> P. X \<le> Y;  x \<in> P |] ==> x \<le> psup P"
paulson@14365
  1209
apply (simp (no_asm_simp) add: preal_le_def) 
paulson@14365
  1210
apply (subgoal_tac "P \<noteq> {}") 
paulson@14365
  1211
apply (auto simp add: psup_def preal_sup) 
paulson@14335
  1212
done
paulson@14335
  1213
paulson@14365
  1214
lemma psup_le_ub: "[| P \<noteq> {}; \<forall>X \<in> P. X \<le> Y |] ==> psup P \<le> Y"
paulson@14365
  1215
apply (simp (no_asm_simp) add: preal_le_def)
paulson@14365
  1216
apply (simp add: psup_def preal_sup) 
paulson@14335
  1217
apply (auto simp add: preal_le_def)
paulson@14335
  1218
done
paulson@14335
  1219
paulson@14335
  1220
text{*Supremum property*}
paulson@14335
  1221
lemma preal_complete:
paulson@14365
  1222
     "[| P \<noteq> {}; \<forall>X \<in> P. X \<le> Y |] ==> (\<exists>X \<in> P. Z < X) = (Z < psup P)"
paulson@14365
  1223
apply (simp add: preal_less_def psup_def preal_sup)
paulson@14365
  1224
apply (auto simp add: preal_le_def)
paulson@14365
  1225
apply (rename_tac U) 
paulson@14365
  1226
apply (cut_tac x = U and y = Z in linorder_less_linear)
paulson@14365
  1227
apply (auto simp add: preal_less_def)
paulson@14335
  1228
done
paulson@14335
  1229
paulson@14335
  1230
huffman@20495
  1231
subsection{*The Embedding from @{typ rat} into @{typ preal}*}
paulson@14335
  1232
paulson@14365
  1233
lemma preal_of_rat_add_lemma1:
paulson@14365
  1234
     "[|x < y + z; 0 < x; 0 < y|] ==> x * y * inverse (y + z) < (y::rat)"
paulson@14365
  1235
apply (frule_tac c = "y * inverse (y + z) " in mult_strict_right_mono)
paulson@14365
  1236
apply (simp add: zero_less_mult_iff) 
paulson@14365
  1237
apply (simp add: mult_ac)
paulson@14335
  1238
done
paulson@14335
  1239
paulson@14365
  1240
lemma preal_of_rat_add_lemma2:
paulson@14365
  1241
  assumes "u < x + y"
wenzelm@19765
  1242
    and "0 < x"
wenzelm@19765
  1243
    and "0 < y"
wenzelm@19765
  1244
    and "0 < u"
paulson@14365
  1245
  shows "\<exists>v w::rat. w < y & 0 < v & v < x & 0 < w & u = v + w"
paulson@14365
  1246
proof (intro exI conjI)
paulson@14365
  1247
  show "u * x * inverse(x+y) < x" using prems 
paulson@14365
  1248
    by (simp add: preal_of_rat_add_lemma1) 
paulson@14365
  1249
  show "u * y * inverse(x+y) < y" using prems 
paulson@14365
  1250
    by (simp add: preal_of_rat_add_lemma1 add_commute [of x]) 
paulson@14365
  1251
  show "0 < u * x * inverse (x + y)" using prems
paulson@14365
  1252
    by (simp add: zero_less_mult_iff) 
paulson@14365
  1253
  show "0 < u * y * inverse (x + y)" using prems
paulson@14365
  1254
    by (simp add: zero_less_mult_iff) 
paulson@14365
  1255
  show "u = u * x * inverse (x + y) + u * y * inverse (x + y)" using prems
paulson@14365
  1256
    by (simp add: left_distrib [symmetric] right_distrib [symmetric] mult_ac)
paulson@14365
  1257
qed
paulson@14365
  1258
paulson@14365
  1259
lemma preal_of_rat_add:
paulson@14365
  1260
     "[| 0 < x; 0 < y|] 
paulson@14365
  1261
      ==> preal_of_rat ((x::rat) + y) = preal_of_rat x + preal_of_rat y"
paulson@14365
  1262
apply (unfold preal_of_rat_def preal_add_def)
paulson@14365
  1263
apply (simp add: rat_mem_preal) 
paulson@14335
  1264
apply (rule_tac f = Abs_preal in arg_cong)
paulson@14365
  1265
apply (auto simp add: add_set_def) 
paulson@14365
  1266
apply (blast dest: preal_of_rat_add_lemma2) 
paulson@14365
  1267
done
paulson@14365
  1268
paulson@14365
  1269
lemma preal_of_rat_mult_lemma1:
paulson@14365
  1270
     "[|x < y; 0 < x; 0 < z|] ==> x * z * inverse y < (z::rat)"
paulson@14365
  1271
apply (frule_tac c = "z * inverse y" in mult_strict_right_mono)
paulson@14365
  1272
apply (simp add: zero_less_mult_iff)
paulson@14365
  1273
apply (subgoal_tac "y * (z * inverse y) = z * (y * inverse y)")
paulson@14365
  1274
apply (simp_all add: mult_ac)
paulson@14335
  1275
done
paulson@14335
  1276
paulson@14365
  1277
lemma preal_of_rat_mult_lemma2: 
paulson@14365
  1278
  assumes xless: "x < y * z"
wenzelm@19765
  1279
    and xpos: "0 < x"
wenzelm@19765
  1280
    and ypos: "0 < y"
paulson@14365
  1281
  shows "x * z * inverse y * inverse z < (z::rat)"
paulson@14365
  1282
proof -
paulson@14365
  1283
  have "0 < y * z" using prems by simp
paulson@14365
  1284
  hence zpos:  "0 < z" using prems by (simp add: zero_less_mult_iff)
paulson@14365
  1285
  have "x * z * inverse y * inverse z = x * inverse y * (z * inverse z)"
paulson@14365
  1286
    by (simp add: mult_ac)
paulson@14365
  1287
  also have "... = x/y" using zpos
paulson@14430
  1288
    by (simp add: divide_inverse)
wenzelm@23389
  1289
  also from xless have "... < z"
wenzelm@23389
  1290
    by (simp add: pos_divide_less_eq [OF ypos] mult_commute)
paulson@14365
  1291
  finally show ?thesis .
paulson@14365
  1292
qed
paulson@14335
  1293
paulson@14365
  1294
lemma preal_of_rat_mult_lemma3:
paulson@14365
  1295
  assumes uless: "u < x * y"
wenzelm@19765
  1296
    and "0 < x"
wenzelm@19765
  1297
    and "0 < y"
wenzelm@19765
  1298
    and "0 < u"
paulson@14365
  1299
  shows "\<exists>v w::rat. v < x & w < y & 0 < v & 0 < w & u = v * w"
paulson@14365
  1300
proof -
paulson@14365
  1301
  from dense [OF uless] 
paulson@14365
  1302
  obtain r where "u < r" "r < x * y" by blast
paulson@14365
  1303
  thus ?thesis
paulson@14365
  1304
  proof (intro exI conjI)
paulson@14365
  1305
  show "u * x * inverse r < x" using prems 
paulson@14365
  1306
    by (simp add: preal_of_rat_mult_lemma1) 
paulson@14365
  1307
  show "r * y * inverse x * inverse y < y" using prems
paulson@14365
  1308
    by (simp add: preal_of_rat_mult_lemma2)
paulson@14365
  1309
  show "0 < u * x * inverse r" using prems
paulson@14365
  1310
    by (simp add: zero_less_mult_iff) 
paulson@14365
  1311
  show "0 < r * y * inverse x * inverse y" using prems
paulson@14365
  1312
    by (simp add: zero_less_mult_iff) 
paulson@14365
  1313
  have "u * x * inverse r * (r * y * inverse x * inverse y) =
paulson@14365
  1314
        u * (r * inverse r) * (x * inverse x) * (y * inverse y)"
paulson@14365
  1315
    by (simp only: mult_ac)
paulson@14365
  1316
  thus "u = u * x * inverse r * (r * y * inverse x * inverse y)" using prems
paulson@14365
  1317
    by simp
paulson@14365
  1318
  qed
paulson@14365
  1319
qed
paulson@14365
  1320
paulson@14365
  1321
lemma preal_of_rat_mult:
paulson@14365
  1322
     "[| 0 < x; 0 < y|] 
paulson@14365
  1323
      ==> preal_of_rat ((x::rat) * y) = preal_of_rat x * preal_of_rat y"
paulson@14365
  1324
apply (unfold preal_of_rat_def preal_mult_def)
paulson@14365
  1325
apply (simp add: rat_mem_preal) 
paulson@14365
  1326
apply (rule_tac f = Abs_preal in arg_cong)
paulson@14365
  1327
apply (auto simp add: zero_less_mult_iff mult_strict_mono mult_set_def) 
paulson@14365
  1328
apply (blast dest: preal_of_rat_mult_lemma3) 
paulson@14335
  1329
done
paulson@14335
  1330
paulson@14365
  1331
lemma preal_of_rat_less_iff:
paulson@14365
  1332
      "[| 0 < x; 0 < y|] ==> (preal_of_rat x < preal_of_rat y) = (x < y)"
paulson@14365
  1333
by (force simp add: preal_of_rat_def preal_less_def rat_mem_preal) 
paulson@14335
  1334
paulson@14365
  1335
lemma preal_of_rat_le_iff:
paulson@14365
  1336
      "[| 0 < x; 0 < y|] ==> (preal_of_rat x \<le> preal_of_rat y) = (x \<le> y)"
paulson@14365
  1337
by (simp add: preal_of_rat_less_iff linorder_not_less [symmetric]) 
paulson@14365
  1338
paulson@14365
  1339
lemma preal_of_rat_eq_iff:
paulson@14365
  1340
      "[| 0 < x; 0 < y|] ==> (preal_of_rat x = preal_of_rat y) = (x = y)"
paulson@14365
  1341
by (simp add: preal_of_rat_le_iff order_eq_iff) 
paulson@14335
  1342
paulson@5078
  1343
end