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